Debarati Das

Orcid: 0000-0003-2232-4279

Affiliations:
  • Pennsylvania State University, University Park, PA, USA
  • University of Copenhagen, Denmark
  • Charles University, Prague, Czech Republic (former)


According to our database1, Debarati Das authored at least 26 papers between 2014 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Fitting Distances by Tree Metrics Minimizing the Total Error within a Constant Factor.
J. ACM, April, 2024

Brief Announcement: Upper and Lower Bounds for Edit Distance in Space-Efficient MPC.
Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures, 2024

2023
A Linear-Time <i>n</i><sup>0.4</sup>-Approximation for Longest Common Subsequence.
ACM Trans. Algorithms, January, 2023

Weighted Edit Distance Computation: Strings, Trees, and Dyck.
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023

Clustering Permutations: New Techniques with Streaming Applications.
Proceedings of the 14th Innovations in Theoretical Computer Science Conference, 2023

2022
No Repetition: Fast and Reliable Sampling with Highly Concentrated Hashing.
Proc. VLDB Endow., 2022

A Simple Algorithm for Multiple-Source Shortest Paths in Planar Digraphs.
Proceedings of the 5th Symposium on Simplicity in Algorithms, 2022

A Near-Optimal Offline Algorithm for Dynamic All-Pairs Shortest Paths in Planar Digraphs.
Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

Improved Approximation Algorithms for Dyck Edit Distance and RNA Folding.
Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

Õ(n+poly(k))-time Algorithm for Bounded Tree Edit Distance.
Proceedings of the 63rd IEEE Annual Symposium on Foundations of Computer Science, 2022

Approximating LCS and Alignment Distance over Multiple Sequences.
Proceedings of the Approximation, 2022

2021
A Linear-Time n<sup>0.4</sup>-Approximation for Longest Common Subsequence.
CoRR, 2021

Approximating the Median under the Ulam Metric.
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

A Linear-Time n<sup>0.4</sup>-Approximation for Longest Common Subsequence.
Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

Approximate Trace Reconstruction via Median String (In Average-Case).
Proceedings of the 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2021

2020
Approximating Edit Distance Within Constant Factor in Truly Sub-quadratic Time.
J. ACM, 2020

No Repetition: Fast Streaming with Highly Concentrated Hashing.
CoRR, 2020

2019
Approximate Online Pattern Matching in Sublinear Time.
Proceedings of the 39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2019

2018
Approximate Online Pattern Matching in Sub-linear Time.
CoRR, 2018

Sparse Weight Tolerant Subgraph for Single Source Shortest Path.
Proceedings of the 16th Scandinavian Symposium and Workshops on Algorithm Theory, 2018

Lower Bounds for Combinatorial Algorithms for Boolean Matrix Multiplication.
Proceedings of the 35th Symposium on Theoretical Aspects of Computer Science, 2018

Space-Optimal Quasi-Gray Codes with Logarithmic Read Complexity.
Proceedings of the 26th Annual European Symposium on Algorithms, 2018

2017
Optimal Quasi-Gray Codes: Does the Alphabet Matter?
CoRR, 2017

Near Optimal Sized Weight Tolerant Subgraph for Single Source Shortest Path.
CoRR, 2017

Dimension, pseudorandomness and extraction of pseudorandomness.
Comput., 2017

2014
Measure of Non-pseudorandomness and Deterministic Extraction of Pseudorandomness.
Electron. Colloquium Comput. Complex., 2014


  Loading...