Seuraa
Debarati Das
Debarati Das
Assistant Professor, Penn State
Vahvistettu sähköpostiosoite verkkotunnuksessa psu.edu - Kotisivu
Nimike
Viittaukset
Viittaukset
Vuosi
Debarati Das, Elazar Goldenberg, Michal Koucký, and Michael E. Saks. Approximating edit distance within constant factor in truly sub-quadratic time
D Chakraborty, D Das, E Goldenberg, M Koucky, M Saks
59th IEEE Annual Symposium on Foundations of Computer Science, FOCS, 979--990, 2018
692018
Approximating edit distance within constant factor in truly sub-quadratic time
D Chakraborty, D Das, E Goldenberg, M Koucký, M Saks
Journal of the ACM (JACM) 67 (6), 1-22, 2020
482020
Approximating the median under the ulam metric
D Chakraborty, D Das, R Krauthgamer
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA …, 2021
122021
Improved approximation algorithms for Dyck edit distance and RNA folding
D Das, T Kociumaka, B Saha
arXiv preprint arXiv:2112.05866, 2021
112021
A Linear-Time n0.4-Approximation for Longest Common Subsequence
K Bringmann, V Cohen-Addad, D Das
ACM Transactions on Algorithms 19 (1), 1-24, 2023
92023
A near-optimal offline algorithm for dynamic all-pairs shortest paths in planar digraphs
D Das, MP Gutenberg, C Wulff-Nilsen
Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2022
92022
Approximate trace reconstruction via median string (in average-case)
D Chakraborty, D Das, R Krauthgamer
arXiv preprint arXiv:2107.09497, 2021
92021
Approximate online pattern matching in sub-linear time
D Chakraborty, D Das, M Koucky
arXiv preprint arXiv:1810.03551, 2018
82018
Weighted edit distance computation: Strings, trees, and Dyck
D Das, J Gilbert, MT Hajiaghayi, T Kociumaka, B Saha
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 377-390, 2023
62023
Clustering Permutations: New Techniques with Streaming Applications
D Chakraborty, D Das, R Krauthgamer
arXiv preprint arXiv:2212.01821, 2022
62022
Fitting distances by tree metrics minimizing the total error within a constant factor
V Cohen-Addad, D Das, E Kipouridis, N Parotsidis, M Thorup
Journal of the ACM, 2021
62021
O (n+ poly (k))-time algorithm for bounded tree edit distance
D Das, J Gilbert, MT Hajiaghayi, T Kociumaka, B Saha, H Saleh
2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS …, 2022
52022
Approximating lcs and alignment distance over multiple sequences
D Das, B Saha
arXiv preprint arXiv:2110.12402, 2021
52021
Lower bounds for combinatorial algorithms for boolean matrix multiplication
D Das, M Koucký, M Saks
arXiv preprint arXiv:1801.05202, 2018
52018
Lower Bounds for Combinatorial Algorithms for Boolean Matrix Multiplication
D Das, M Koucky, M Saks
35th Symposium on Theoretical Aspects of Computer Science (STACS 2018) 96 …, 2018
52018
A Simple Algorithm for Multiple-Source Shortest Paths in Planar Digraphs∗
D Das, E Kipouridis, MP Gutenberg, C Wulff-Nilsen
Symposium on Simplicity in Algorithms (SOSA), 1-11, 2022
42022
Sparse weight tolerant subgraph for single source shortest path
D Chakraborty, D Das
16th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2018), 2018
42018
A Linear-Time 𝑛 {0.4}-Approximation for Longest Common Subsequence
K Bringmann, D Das
48th International Colloquium on Automata, Languages, and Programming (ICALP …, 2021
2*2021
No repetition: Fast and reliable sampling with highly concentrated hashing
A Aamand, D Das, E Kipouridis, JBT Knudsen, PMR Rasmussen, ...
Proceedings of the VLDB Endowment 15 (13), 3989-4001, 2022
12022
No Repetition: Fast Streaming with Highly Concentrated Hashing
A Aamand, D Das, E Kipouridis, JBT Knudsen, PMR Rasmussen, ...
arXiv preprint arXiv:2004.01156, 2020
12020
Järjestelmä ei voi suorittaa toimenpidettä nyt. Yritä myöhemmin uudelleen.
Artikkelit 1–20