Projects per year
Fingerprint
Dive into the research topics where Debarati Das is active. These topic labels come from the works of this person. Together they form a unique fingerprint.
- 1 Similar Profiles
Collaborations and top research areas from the last five years
Recent external collaboration on country/territory level. Dive into details by clicking on the dots or
Projects
- 2 Active
-
CAREER: A Theoretical Exploration of Efficient and Accurate Clustering Algorithms
Das, D. (PI)
5/1/24 → 4/30/29
Project: Research project
-
Travel: NSF Student Travel Grant for TCS for All Meeting at STOC 2023 and Professional Mentoring Panel at FOCS 2023
Das, D. (PI)
6/1/23 → 5/31/25
Project: Research project
-
Fitting Distances by Tree Metrics Minimizing the Total Error within a Constant Factor
Cohen-Addad, V., Das, D., Kipouridis, E., Parotsidis, N. & Thorup, M., Apr 10 2024, In: Journal of the ACM. 71, 2, 10.Research output: Contribution to journal › Article › peer-review
Open Access -
A Linear-Time n0.4-Approximation for Longest Common Subsequence
Bringmann, K., Cohen-Addad, V. & Das, D., Feb 20 2023, In: ACM Transactions on Algorithms. 19, 1, 3568398.Research output: Contribution to journal › Article › peer-review
Open Access -
Clustering Permutations: New Techniques with Streaming Applications
Chakraborty, D., Das, D. & Krauthgamer, R., Jan 1 2023, 14th Innovations in Theoretical Computer Science Conference, ITCS 2023. Kalai, Y. T. (ed.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 31. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 251).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
2 Scopus citations -
Weighted Edit Distance Computation: Strings, Trees, and Dyck
Das, D., Gilbert, J., Hajiaghayi, M. T., Kociumaka, T. & Saha, B., Jun 2 2023, STOC 2023 - Proceedings of the 55th Annual ACM Symposium on Theory of Computing. Saha, B. & Servedio, R. A. (eds.). Association for Computing Machinery, p. 377-390 14 p. (Proceedings of the Annual ACM Symposium on Theory of Computing).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
Open Access3 Scopus citations -
A Near-Optimal Offline Algorithm for Dynamic All-Pairs Shortest Paths in Planar Digraphs
Das, D., Gutenberg, M. P. & Wulff-Nilsen, C., 2022, ACM-SIAM Symposium on Discrete Algorithms, SODA 2022. Association for Computing Machinery, p. 3482-3495 14 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms; vol. 2022-January).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
6 Scopus citations