| No. |
Title |
Author |
Year |
| 1 |
Approximate Model Counting: Is SAT Oracle More Powerful Than NP Oracle? |
Chakraborty, Diptarka et al. |
2023 |
| 2 |
Clustering Permutations: New Techniques with Streaming Applications |
Chakraborty, Diptarka et al. |
2023 |
| 3 |
Support Size Estimation: The Power of Conditioning |
Chakraborty, Diptarka et al. |
2023 |
| 4 |
Pairwise Reachability Oracles and Preservers Under Failures |
Chakraborty, Diptarka et al. |
2022 |
| 5 |
Approximate Trace Reconstruction via Median String (In Average-Case) |
Chakraborty, Diptarka et al. |
2021 |
| 6 |
Approximating the Center Ranking Under Ulam |
Chakraborty, Diptarka et al. |
2021 |
| 7 |
Hardness of Approximation of (Multi-)LCS over Small Alphabet |
Bhangale, Amey et al. |
2020 |
| 8 |
New Extremal Bounds for Reachability and Strong-Connectivity Preservers Under Failures |
Chakraborty, Diptarka et al. |
2020 |
| 9 |
Approximate Online Pattern Matching in Sublinear Time |
Chakraborty, Diptarka et al. |
2019 |
| 10 |
Space-Optimal Quasi-Gray Codes with Logarithmic Read Complexity |
Chakraborty, Diptarka et al. |
2018 |
| 11 |
Sparse Weight Tolerant Subgraph for Single Source Shortest Path |
Chakraborty, Diptarka et al. |
2018 |
| 12 |
Dimension, Pseudorandomness and Extraction of Pseudorandomness |
Agrawal, Manindra et al. |
2015 |
| 13 |
New Time-Space Upperbounds for Directed Reachability in High-genus and H-minor-free Graphs |
Chakraborty, Diptarka et al. |
2014 |
