Debarati Das - RankMe

51 papers A* 13A 4B 1Journal 27Unranked 6

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	A Generic Framework for Fair Consensus Clustering in Streams. CoRR Diptarka Chakraborty, Kushagra Chatterjee, Debarati Das, Tien Long Nguyen
2026	A*	`conf`	Generalizing Fair Clustering to Multiple Groups: Algorithms and Applications. AAAI Diptarka Chakraborty, Kushagra Chatterjee, Debarati Das, Tien Long Nguyen
2026	—	`conf`	Tree Violation Distance under Constraints. SOSA Debarati Das, Evangelos Kipouridis, Joachim Spoerhase
2025	A*	`conf`	Breaking the Two Approximation Barrier for Various Consensus Clustering Problems. SODA Debarati Das, Amit Kumar
2025	A*	`conf`	Dynamic Dyck and Tree Edit Distance: Decompositions and Reductions to String Edit Distance. FOCS Debarati Das, Jacob Gilbert, MohammadTaghi Hajiaghayi, Tomasz Kociumaka, Barna Saha
2025	J	`jnl`	Dynamic Dyck and Tree Edit Distance: Decompositions and Reductions to String Edit Distance. CoRR Debarati Das, Jacob Gilbert, MohammadTaghi Hajiaghayi, Tomasz Kociumaka, Barna Saha
2025	A*	`conf`	Fitting Tree Metrics and Ultrametrics in Data Streams. ICALP Amir Carmel, Debarati Das, Evangelos Kipouridis, Evangelos Pipis
2025	J	`jnl`	Fitting Tree Metrics and Ultrametrics in Data Streams. CoRR Amir Carmel, Debarati Das, Evangelos Kipouridis, Evangelos Pipis
2025	J	`jnl`	Generalizing Fair Clustering to Multiple Groups: Algorithms and Applications. CoRR Diptarka Chakraborty, Kushagra Chatterjee, Debarati Das, Tien Long Nguyen
2025	A*	`conf`	Towards Fair Representation: Clustering and Consensus. COLT Diptarka Chakraborty, Kushagra Chatterjee, Debarati Das, Tien Long Nguyen, Romina Nobahari
2025	J	`jnl`	Towards Fair Representation: Clustering and Consensus. CoRR Diptarka Chakraborty, Kushagra Chatterjee, Debarati Das, Tien Long Nguyen, Romina Nobahari
2024	B	`conf`	Brief Announcement: Upper and Lower Bounds for Edit Distance in Space-Efficient MPC. SPAA Debarati Das, Jacob Gilbert, MohammadTaghi Hajiaghayi, Tomasz Kociumaka, Barna Saha
2024	J	`jnl`	Fitting Distances by Tree Metrics Minimizing the Total Error within a Constant Factor. J. ACM Vincent Cohen-Addad, Debarati Das, Evangelos Kipouridis, Nikos Parotsidis, Mikkel Thorup
2023	J	`jnl`	A Linear-Time ACM Trans. Algorithms Karl Bringmann, Vincent Cohen-Addad, Debarati Das
2023	A	`conf`	Clustering Permutations: New Techniques with Streaming Applications. ITCS Diptarka Chakraborty, Debarati Das, Robert Krauthgamer
2023	J	`jnl`	Weighted Edit Distance Computation: Strings, Trees and Dyck. CoRR Debarati Das, Jacob Gilbert, MohammadTaghi Hajiaghayi, Tomasz Kociumaka, Barna Saha
2023	A*	`conf`	Weighted Edit Distance Computation: Strings, Trees, and Dyck. STOC Debarati Das, Jacob Gilbert, MohammadTaghi Hajiaghayi, Tomasz Kociumaka, Barna Saha
2022	A*	`conf`	A Near-Optimal Offline Algorithm for Dynamic All-Pairs Shortest Paths in Planar Digraphs. SODA Debarati Das, Maximilian Probst Gutenberg, Christian Wulff-Nilsen
2022	—	`conf`	A Simple Algorithm for Multiple-Source Shortest Paths in Planar Digraphs. SOSA Debarati Das, Evangelos Kipouridis, Maximilian Probst Gutenberg, Christian Wulff-Nilsen
2022	A	`conf`	Approximating LCS and Alignment Distance over Multiple Sequences. APPROX/RANDOM Debarati Das, Barna Saha
2022	J	`jnl`	Clustering Permutations: New Techniques with Streaming Applications. CoRR Diptarka Chakraborty, Debarati Das, Robert Krauthgamer
2022	A*	`conf`	Improved Approximation Algorithms for Dyck Edit Distance and RNA Folding. ICALP Debarati Das, Tomasz Kociumaka, Barna Saha
2022	J	`jnl`	No Repetition: Fast and Reliable Sampling with Highly Concentrated Hashing. Proc. VLDB Endow. Anders Aamand, Debarati Das, Evangelos Kipouridis, Jakob Bæk Tejs Knudsen, Peter M. R. Rasmussen, Mikkel Thorup
2022	J	`jnl`	Õ(n+poly(k))-time Algorithm for Bounded Tree Edit Distance. CoRR Debarati Das, Jacob Gilbert, MohammadTaghi Hajiaghayi, Tomasz Kociumaka, Barna Saha, Hamed Saleh
2022	A*	`conf`	Õ(n+poly(k))-time Algorithm for Bounded Tree Edit Distance. FOCS Debarati Das, Jacob Gilbert, MohammadTaghi Hajiaghayi, Tomasz Kociumaka, Barna Saha, Hamed Saleh
2021	A*	`conf`	A Linear-Time n ICALP Karl Bringmann, Debarati Das
2021	J	`jnl`	A Linear-Time n CoRR Karl Bringmann, Vincent Cohen-Addad, Debarati Das
2021	J	`jnl`	A Simple Algorithm for Multiple-Source Shortest Paths in Planar Digraphs. CoRR Debarati Das, Evangelos Kipouridis, Maximilian Probst Gutenberg, Christian Wulff-Nilsen
2021	—	`conf`	Approximate Trace Reconstruction via Median String (In Average-Case). FSTTCS Diptarka Chakraborty, Debarati Das, Robert Krauthgamer
2021	J	`jnl`	Approximate Trace Reconstruction via Median String (in Average-Case). CoRR Diptarka Chakraborty, Debarati Das, Robert Krauthgamer
2021	J	`jnl`	Approximating LCS and Alignment Distance over Multiple Sequences. CoRR Debarati Das, Barna Saha
2021	A*	`conf`	Approximating the Median under the Ulam Metric. SODA Diptarka Chakraborty, Debarati Das, Robert Krauthgamer
2021	A*	`conf`	Fitting Distances by Tree Metrics Minimizing the Total Error within a Constant Factor. FOCS Vincent Cohen-Addad, Debarati Das, Evangelos Kipouridis, Nikos Parotsidis, Mikkel Thorup
2021	J	`jnl`	Fitting Distances by Tree Metrics Minimizing the Total Error within a Constant Factor. CoRR Vincent Cohen-Addad, Debarati Das, Evangelos Kipouridis, Nikos Parotsidis, Mikkel Thorup
2021	J	`jnl`	Improved Approximation Algorithms for Dyck Edit Distance and RNA Folding. CoRR Debarati Das, Tomasz Kociumaka, Barna Saha
2020	J	`jnl`	Approximating Edit Distance Within Constant Factor in Truly Sub-quadratic Time. J. ACM Diptarka Chakraborty, Debarati Das, Elazar Goldenberg, Michal Koucký, Michael E. Saks
2020	J	`jnl`	Approximating the Median under the Ulam Metric. CoRR Diptarka Chakraborty, Debarati Das, Robert Krauthgamer
2020	J	`jnl`	No Repetition: Fast Streaming with Highly Concentrated Hashing. CoRR Anders Aamand, Debarati Das, Evangelos Kipouridis, Jakob Bæk Tejs Knudsen, Peter M. R. Rasmussen, Mikkel Thorup
2019	—	`conf`	Approximate Online Pattern Matching in Sublinear Time. FSTTCS Diptarka Chakraborty, Debarati Das, Michal Koucký
2018	J	`jnl`	Approximate Online Pattern Matching in Sub-linear Time. CoRR Diptarka Chakraborty, Debarati Das, Michal Koucký
2018	J	`jnl`	Approximating Edit Distance Within Constant Factor in Truly Sub-Quadratic Time. CoRR Diptarka Chakraborty, Debarati Das, Elazar Goldenberg, Michal Koucký, Michael E. Saks
2018	A*	`conf`	Approximating Edit Distance within Constant Factor in Truly Sub-Quadratic Time. FOCS Diptarka Chakraborty, Debarati Das, Elazar Goldenberg, Michal Koucký, Michael E. Saks
2018	A	`conf`	Lower Bounds for Combinatorial Algorithms for Boolean Matrix Multiplication. STACS Debarati Das, Michal Koucký, Michael E. Saks
2018	J	`jnl`	Lower bounds for Combinatorial Algorithms for Boolean Matrix Multiplication. CoRR Debarati Das, Michal Koucký, Michael E. Saks
2018	A	`conf`	Space-Optimal Quasi-Gray Codes with Logarithmic Read Complexity. ESA Diptarka Chakraborty, Debarati Das, Michal Koucký, Nitin Saurabh
2018	—	`conf`	Sparse Weight Tolerant Subgraph for Single Source Shortest Path. SWAT Diptarka Chakraborty, Debarati Das
2017	J	`jnl`	Dimension, pseudorandomness and extraction of pseudorandomness. Comput. Manindra Agrawal, Diptarka Chakraborty, Debarati Das, Satyadev Nandakumar
2017	J	`jnl`	Near Optimal Sized Weight Tolerant Subgraph for Single Source Shortest Path. CoRR Diptarka Chakraborty, Debarati Das
2017	J	`jnl`	Optimal Quasi-Gray Codes: Does the Alphabet Matter? CoRR Diptarka Chakraborty, Debarati Das, Michal Koucký, Nitin Saurabh
2015	—	`conf`	Dimension, Pseudorandomness and Extraction of Pseudorandomness. FSTTCS Manindra Agrawal, Diptarka Chakraborty, Debarati Das, Satyadev Nandakumar
2014	J	`jnl`	Measure of Non-pseudorandomness and Deterministic Extraction of Pseudorandomness. Electron. Colloquium Comput. Complex. Manindra Agrawal, Diptarka Chakraborty, Debarati Das, Satyadev Nandakumar