No. Title Author Year
1 Pairwise Reachability Oracles and Preservers Under Failures Chakraborty, Diptarka et al. 2022
2 Approximate Trace Reconstruction via Median String (In Average-Case) Chakraborty, Diptarka et al. 2021
3 Approximating the Center Ranking Under Ulam Chakraborty, Diptarka et al. 2021
4 Hardness of Approximation of (Multi-)LCS over Small Alphabet Bhangale, Amey et al. 2020
5 New Extremal Bounds for Reachability and Strong-Connectivity Preservers Under Failures Chakraborty, Diptarka et al. 2020
6 Approximate Online Pattern Matching in Sublinear Time Chakraborty, Diptarka et al. 2019
7 Space-Optimal Quasi-Gray Codes with Logarithmic Read Complexity Chakraborty, Diptarka et al. 2018
8 Sparse Weight Tolerant Subgraph for Single Source Shortest Path Chakraborty, Diptarka et al. 2018
9 Dimension, Pseudorandomness and Extraction of Pseudorandomness Agrawal, Manindra et al. 2015
10 New Time-Space Upperbounds for Directed Reachability in High-genus and H-minor-free Graphs Chakraborty, Diptarka et al. 2014
Current Page :
Number of result pages: 1
Number of documents: 10


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI