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

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)

Lower Bounds for Combinatorial Algorithms for Boolean Matrix Multiplication. - Debarati Das 001; Michal Koucký 001; Michael E. Saks (STACS, 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)

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

No Repetition: Fast Streaming with Highly Concentrated Hashing. - Anders Aamand; Debarati Das 001; Evangelos Kipouridis; Jakob Bæk Tejs Knudsen; Peter M. R. Rasmussen; Mikkel Thorup (CoRR, 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)

A Linear-Time n0.4-Approximation for Longest Common Subsequence. - Karl Bringmann; Debarati Das 001 (ICALP, 2021)

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

A Linear-Time n0.4-Approximation for Longest Common Subsequence. - Karl Bringmann; Vincent Cohen-Addad; Debarati Das 001 (CoRR, 2021)

Approximating LCS and Alignment Distance over Multiple Sequences. - Debarati Das 001; Barna Saha (APPROX/RANDOM, 2022)

Õ(n+poly(k))-time Algorithm for Bounded Tree Edit Distance. - Debarati Das 001; Jacob Gilbert; MohammadTaghi Hajiaghayi; Tomasz Kociumaka; Barna Saha; Hamed Saleh (FOCS, 2022)

Improved Approximation Algorithms for Dyck Edit Distance and RNA Folding. - Debarati Das 001; Tomasz Kociumaka; Barna Saha (ICALP, 2022)

A Near-Optimal Offline Algorithm for Dynamic All-Pairs Shortest Paths in Planar Digraphs. - Debarati Das 001; Maximilian Probst Gutenberg; Christian Wulff-Nilsen (SODA, 2022)

A Simple Algorithm for Multiple-Source Shortest Paths in Planar Digraphs. - Debarati Das 001; Evangelos Kipouridis; Maximilian Probst Gutenberg; Christian Wulff-Nilsen (SOSA, 2022)

No Repetition: Fast and Reliable Sampling with Highly Concentrated Hashing. - Anders Aamand; Debarati Das 001; Evangelos Kipouridis; Jakob Bæk Tejs Knudsen; Peter M. R. Rasmussen; Mikkel Thorup (Proc. VLDB Endow., 2022)

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

Weighted Edit Distance Computation: Strings, Trees, and Dyck. - Debarati Das 001; Jacob Gilbert; MohammadTaghi Hajiaghayi; Tomasz Kociumaka; Barna Saha (STOC, 2023)

A Linear-Time n0.4-Approximation for Longest Common Subsequence. - Karl Bringmann; Vincent Cohen-Addad; Debarati Das 001 (ACM Trans. Algorithms, 2023)

Brief Announcement: Upper and Lower Bounds for Edit Distance in Space-Efficient MPC. - Debarati Das 001; Jacob Gilbert; MohammadTaghi Hajiaghayi; Tomasz Kociumaka; Barna Saha (SPAA, 2024)

Fitting Distances by Tree Metrics Minimizing the Total Error within a Constant Factor. - Vincent Cohen-Addad; Debarati Das 001; Evangelos Kipouridis; Nikos Parotsidis; Mikkel Thorup (J. ACM, 2024)

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

Fitting Tree Metrics and Ultrametrics in Data Streams. - Amir Carmel; Debarati Das 001; Evangelos Kipouridis; Evangelos Pipis (ICALP, 2025)

Breaking the Two Approximation Barrier for Various Consensus Clustering Problems. - Debarati Das 001; Amit Kumar (SODA, 2025)