Debarati Das

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Fitting tree metrics and ultrametrics in data streams	2026-09-10	Paper
A linear-time \(n^{0.4}\)-approximation for longest common subsequence	2026-05-12	Paper
\(\widetilde{O}(n + \operatorname{poly}(k))\)-time algorithm for bounded tree edit distance	2025-08-15	Paper
Fitting distances by tree metrics minimizing the total error within a constant factor	2025-08-13	Paper
Approximating edit distance within constant factor in truly sub-quadratic time	2025-08-12	Paper
Fitting distances by tree metrics minimizing the total error within a constant factor Journal of the ACM	2025-02-06	Paper
Clustering permutations: new techniques with streaming applications	2024-09-25	Paper
Approximating LCS and alignment distance over multiple sequences	2024-08-22	Paper
A near-optimal offline algorithm for dynamic all-pairs shortest paths in planar digraphs	2024-07-19	Paper
Improved approximation algorithms for Dyck edit distance and RNA folding	2024-06-24	Paper
A simple algorithm for multiple-source shortest paths in planar digraphs	2024-05-14	Paper
Weighted edit distance computation: strings, trees, and Dyck	2024-05-08	Paper
scientific article; zbMATH DE number 7799589 (Why is no real title available?) (available as arXiv preprint)	2024-02-05	Paper
scientific article; zbMATH DE number 7788386 (Why is no real title available?) (available as arXiv preprint)	2024-01-15	Paper
A Linear-Time <i>n</i> <sup>0.4</sup> -Approximation for Longest Common Subsequence ACM Transactions on Algorithms	2023-10-23	Paper
scientific article; zbMATH DE number 7650307 (Why is no real title available?) (available as arXiv preprint)	2023-02-03	Paper
Approximating Edit Distance Within Constant Factor in Truly Sub-quadratic Time Journal of the ACM	2022-12-08	Paper
Space-optimal quasi-Gray codes with logarithmic read complexity	2021-08-04	Paper
Sparse weight tolerant subgraph for single source shortest path (available as arXiv preprint)	2020-08-25	Paper
Lower bounds for combinatorial algorithms for Boolean matrix multiplication (available as arXiv preprint)	2020-08-05	Paper
Dimension, pseudorandomness and extraction of pseudorandomness Computability	2017-11-22	Paper
Dimension, Pseudorandomness and Extraction of Pseudorandomness	2017-07-13	Paper

Research outcomes over time

This page was built for person: Debarati Das