Measure of Non-pseudorandomness and Deterministic Extraction of Pseudorandomness. - Manindra Agrawal; Diptarka Chakraborty; Debarati Das 001; Satyadev Nandakumar (Electron. Colloquium Comput. Complex., 2014)

Information Complexity for Multiparty Communication. - Diptarka Chakraborty; Elazar Goldenberg; Michal Koucký 001 (Electron. Colloquium Comput. Complex., 2014)

New Time-Space Upperbounds for Directed Reachability in High-genus and H-minor-free Graphs. - Diptarka Chakraborty; Aduri Pavan; Raghunath Tewari; N. Variyam Vinodchandran; Lin F. Yang (Electron. Colloquium Comput. Complex., 2014)

An O(n^ε ) Space and Polynomial Time Algorithm for Reachability in Directed Layered Planar Graphs. - Diptarka Chakraborty; Raghunath Tewari (ISAAC, 2015)

Simultaneous Time-Space Upper Bounds for Red-Blue Path Problem in Planar DAGs. - Diptarka Chakraborty; Raghunath Tewari (WALCOM, 2015)

Simultaneous Time-Space Upper Bounds for Certain Problems in Planar Graphs. - Diptarka Chakraborty; Raghunath Tewari (CoRR, 2015)

Low Distortion Embedding from Edit to Hamming Distance using Coupling. - Diptarka Chakraborty; Elazar Goldenberg; Michal Koucký 001 (Electron. Colloquium Comput. Complex., 2015)

An O(nε) Space and Polynomial Time Algorithm for Reachability in Directed Layered Planar Graphs. - Diptarka Chakraborty; Raghunath Tewari (Electron. Colloquium Comput. Complex., 2015)

Streaming algorithms for embedding and computing edit distance in the low distance regime. - Diptarka Chakraborty; Elazar Goldenberg; Michal Koucký 001 (STOC, 2016)

Streaming Algorithms For Computing Edit Distance Without Exploiting Suffix Trees. - Diptarka Chakraborty; Elazar Goldenberg; Michal Koucký 001 (CoRR, 2016)

On Resource-Bounded Versions of the van Lambalgen Theorem. - Diptarka Chakraborty; Satyadev Nandakumar; Himanshu Shukla (TAMC, 2017)

Dimension, pseudorandomness and extraction of pseudorandomness. - Manindra Agrawal; Diptarka Chakraborty; Debarati Das 001; Satyadev Nandakumar (Comput., 2017)

Near Optimal Sized Weight Tolerant Subgraph for Single Source Shortest Path. - Diptarka Chakraborty; Debarati Das 001 (CoRR, 2017)

Optimal Quasi-Gray Codes: Does the Alphabet Matter? - Diptarka Chakraborty; Debarati Das 001; Michal Koucký 001; Nitin Saurabh (CoRR, 2017)

Space-Optimal Quasi-Gray Codes with Logarithmic Read Complexity. - Diptarka Chakraborty; Debarati Das 001; Michal Koucký 001; Nitin Saurabh (ESA, 2018)

Tight cell probe bounds for succinct Boolean matrix-vector multiplication. - Diptarka Chakraborty; Lior Kamma; Kasper Green Larsen (STOC, 2018)

Sparse Weight Tolerant Subgraph for Single Source Shortest Path. - Diptarka Chakraborty; Debarati Das 001 (SWAT, 2018)

Approximate Online Pattern Matching in Sub-linear Time. - Diptarka Chakraborty; Debarati Das 001; Michal Koucký 001 (CoRR, 2018)

An O(nε) Space and Polynomial Time Algorithm for Reachability in Directed Layered Planar Graphs. - Diptarka Chakraborty; Raghunath Tewari (ACM Trans. Comput. Theory, 2018)

Approximate Online Pattern Matching in Sublinear Time. - Diptarka Chakraborty; Debarati Das 001; Michal Koucký 001 (FSTTCS, 2019)

Hardness of Approximation of (Multi-)LCS over Small Alphabet. - Amey Bhangale; Diptarka Chakraborty; Rajendra Kumar 002 (APPROX-RANDOM, 2020)

Approximating Edit Distance Within Constant Factor in Truly Sub-quadratic Time. - Diptarka Chakraborty; Debarati Das 001; Elazar Goldenberg; Michal Koucký 001; Michael E. Saks (J. ACM, 2020)

Approximate Trace Reconstruction via Median String (In Average-Case). - Diptarka Chakraborty; Debarati Das 001; Robert Krauthgamer (FSTTCS, 2021)

Approximating the Center Ranking Under Ulam. - Diptarka Chakraborty; Kshitij Gajjar; Agastya Vibhuti Jha (FSTTCS, 2021)

Approximating the Median under the Ulam Metric. - Diptarka Chakraborty; Debarati Das 001; Robert Krauthgamer (SODA, 2021)

Pairwise Reachability Oracles and Preservers Under Failures. - Diptarka Chakraborty; Kushagra Chatterjee; Keerti Choudhary (ICALP, 2022)

Fair Rank Aggregation. - Diptarka Chakraborty; Syamantak Das; Arindam Khan 001; Aditya Subramanian 001 (NeurIPS, 2022)

Approximate Maximum Rank Aggregation: Beyond the Worst-Case. - Alvin Yan Hong Yao; Diptarka Chakraborty (FSTTCS, 2023)

Approximate Model Counting: Is SAT Oracle More Powerful Than NP Oracle? - Diptarka Chakraborty; Sourav Chakraborty 001; Gunjan Kumar; Kuldeep S. Meel (ICALP, 2023)

Clustering Permutations: New Techniques with Streaming Applications. - Diptarka Chakraborty; Debarati Das 001; Robert Krauthgamer (ITCS, 2023)

Matrix Completion: Approximating the Minimum Diameter. - Diptarka Chakraborty; Sanjana Dey (ISAAC, 2023)

Support Size Estimation: The Power of Conditioning. - Diptarka Chakraborty; Gunjan Kumar; Kuldeep S. Meel (MFCS, 2023)

Equivalence Testing: The Power of Bounded Adaptivity. - Diptarka Chakraborty; Sourav Chakraborty 001; Gunjan Kumar; Kuldeep S. Meel (AISTATS, 2024)

Tight Lower Bound on Equivalence Testing in Conditional Sampling Model. - Diptarka Chakraborty; Sourav Chakraborty 001; Gunjan Kumar (SODA, 2024)

Bi-Criteria Metric Distortion. - Kiarash Banihashem; Diptarka Chakraborty; Shayan Chashm Jahan; Iman Gholami; MohammadTaghi Hajiaghayi; Mohammad Mahdavi; Max Springer (CoRR, 2024)

Towards Fair Representation: Clustering and Consensus. - Diptarka Chakraborty; Kushagra Chatterjee; Debarati Das 001; Tien Long Nguyen; Romina Nobahari (COLT, 2025)

New Extremal Bounds for Reachability and Strong-Connectivity Preservers under Failures. - Diptarka Chakraborty; Keerti Choudhary (ACM Trans. Algorithms, 2025)

Improved Rank Aggregation under Fairness Constraint. - Diptarka Chakraborty; Himika Das; Sanjana Dey; Alvin Yan Hong Yao (CoRR, 2025)