No. Title Author Year
1 Hardness of Approximation of (Multi-)LCS over Small Alphabet Bhangale, Amey et al. 2020
2 New Extremal Bounds for Reachability and Strong-Connectivity Preservers Under Failures Chakraborty, Diptarka et al. 2020
3 Approximate Online Pattern Matching in Sublinear Time Chakraborty, Diptarka et al. 2019
4 Space-Optimal Quasi-Gray Codes with Logarithmic Read Complexity Chakraborty, Diptarka et al. 2018
5 Sparse Weight Tolerant Subgraph for Single Source Shortest Path Chakraborty, Diptarka et al. 2018
6 Dimension, Pseudorandomness and Extraction of Pseudorandomness Agrawal, Manindra et al. 2015
7 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: 7


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