Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDebarati Das 0001
Person information
- affiliation: Pennsylvania State University, University Park, PA, USA
- affiliation: University of Copenhagen, Denmark
- affiliation (former): Charles University, Prague, Czech Republic
Other persons with the same name
- Debarati Das 0002 — PES Institute of Technology, Bangalore, India
- Debarati Das 0003 — Bengal College of Engineering and Technology, West Bengal, India
- Debarati Das 0004 — University of Minnesota, Department of Computer Science, Twin Cities, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j5]Vincent Cohen-Addad
, Debarati Das, Evangelos Kipouridis, Nikos Parotsidis, Mikkel Thorup:
Fitting Distances by Tree Metrics Minimizing the Total Error within a Constant Factor. J. ACM 71(2): 10:1-10:41 (2024)- [c18]Debarati Das, Jacob Gilbert, MohammadTaghi Hajiaghayi, Tomasz Kociumaka, Barna Saha:
Brief Announcement: Upper and Lower Bounds for Edit Distance in Space-Efficient MPC. SPAA 2024: 293-295 - 2023
- [j4]Karl Bringmann, Vincent Cohen-Addad, Debarati Das:
A Linear-Time n0.4-Approximation for Longest Common Subsequence. ACM Trans. Algorithms 19(1): 9:1-9:24 (2023) - [c17]Diptarka Chakraborty, Debarati Das, Robert Krauthgamer:
Clustering Permutations: New Techniques with Streaming Applications. ITCS 2023: 31:1-31:24 - [c16]Debarati Das, Jacob Gilbert, MohammadTaghi Hajiaghayi, Tomasz Kociumaka, Barna Saha:
Weighted Edit Distance Computation: Strings, Trees, and Dyck. STOC 2023: 377-390 - [i17]Debarati Das, Jacob Gilbert, MohammadTaghi Hajiaghayi, Tomasz Kociumaka, Barna Saha:
Weighted Edit Distance Computation: Strings, Trees and Dyck. CoRR abs/2302.04229 (2023) - 2022
- [j3]Anders Aamand, Debarati Das, Evangelos Kipouridis, Jakob Bæk Tejs Knudsen, Peter M. R. Rasmussen, Mikkel Thorup:
No Repetition: Fast and Reliable Sampling with Highly Concentrated Hashing. Proc. VLDB Endow. 15(13): 3989-4001 (2022) - [c15]Debarati Das, Barna Saha:
Approximating LCS and Alignment Distance over Multiple Sequences. APPROX/RANDOM 2022: 54:1-54:21 - [c14]Debarati Das, Jacob Gilbert, MohammadTaghi Hajiaghayi, Tomasz Kociumaka, Barna Saha, Hamed Saleh:
Õ(n+poly(k))-time Algorithm for Bounded Tree Edit Distance. FOCS 2022: 686-697 - [c13]Debarati Das, Tomasz Kociumaka, Barna Saha:
Improved Approximation Algorithms for Dyck Edit Distance and RNA Folding. ICALP 2022: 49:1-49:20 - [c12]Debarati Das, Maximilian Probst Gutenberg, Christian Wulff-Nilsen:
A Near-Optimal Offline Algorithm for Dynamic All-Pairs Shortest Paths in Planar Digraphs. SODA 2022: 3482-3495 - [c11]Debarati Das, Evangelos Kipouridis, Maximilian Probst Gutenberg, Christian Wulff-Nilsen:
A Simple Algorithm for Multiple-Source Shortest Paths in Planar Digraphs. SOSA 2022: 1-11 - [i16]Debarati Das, Jacob Gilbert, MohammadTaghi Hajiaghayi, Tomasz Kociumaka, Barna Saha, Hamed Saleh:
Õ(n+poly(k))-time Algorithm for Bounded Tree Edit Distance. CoRR abs/2209.07524 (2022) - [i15]Diptarka Chakraborty, Debarati Das, Robert Krauthgamer:
Clustering Permutations: New Techniques with Streaming Applications. CoRR abs/2212.01821 (2022) - 2021
- [c10]Vincent Cohen-Addad, Debarati Das, Evangelos Kipouridis, Nikos Parotsidis, Mikkel Thorup:
Fitting Distances by Tree Metrics Minimizing the Total Error within a Constant Factor. FOCS 2021: 468-479 - [c9]Diptarka Chakraborty, Debarati Das, Robert Krauthgamer:
Approximate Trace Reconstruction via Median String (In Average-Case). FSTTCS 2021: 11:1-11:23 - [c8]Karl Bringmann, Debarati Das:
A Linear-Time n0.4-Approximation for Longest Common Subsequence. ICALP 2021: 39:1-39:20 - [c7]Diptarka Chakraborty, Debarati Das, Robert Krauthgamer:
Approximating the Median under the Ulam Metric. SODA 2021: 761-775 - [i14]Karl Bringmann, Vincent Cohen-Addad, Debarati Das:
A Linear-Time n0.4-Approximation for Longest Common Subsequence. CoRR abs/2106.08195 (2021) - [i13]Diptarka Chakraborty, Debarati Das, Robert Krauthgamer:
Approximate Trace Reconstruction via Median String (in Average-Case). CoRR abs/2107.09497 (2021) - [i12]Vincent Cohen-Addad, Debarati Das, Evangelos Kipouridis, Nikos Parotsidis, Mikkel Thorup:
Fitting Distances by Tree Metrics Minimizing the Total Error within a Constant Factor. CoRR abs/2110.02807 (2021) - [i11]Debarati Das, Barna Saha:
Approximating LCS and Alignment Distance over Multiple Sequences. CoRR abs/2110.12402 (2021) - [i10]Debarati Das, Evangelos Kipouridis, Maximilian Probst Gutenberg, Christian Wulff-Nilsen:
A Simple Algorithm for Multiple-Source Shortest Paths in Planar Digraphs. CoRR abs/2111.07360 (2021) - [i9]Debarati Das, Tomasz Kociumaka, Barna Saha:
Improved Approximation Algorithms for Dyck Edit Distance and RNA Folding. CoRR abs/2112.05866 (2021) - 2020
- [j2]Diptarka Chakraborty, Debarati Das, Elazar Goldenberg, Michal Koucký, Michael E. Saks:
Approximating Edit Distance Within Constant Factor in Truly Sub-quadratic Time. J. ACM 67(6): 36:1-36:22 (2020) - [i8]Anders Aamand, Debarati Das, Evangelos Kipouridis, Jakob Bæk Tejs Knudsen, Peter M. R. Rasmussen, Mikkel Thorup:
No Repetition: Fast Streaming with Highly Concentrated Hashing. CoRR abs/2004.01156 (2020) - [i7]Diptarka Chakraborty, Debarati Das, Robert Krauthgamer:
Approximating the Median under the Ulam Metric. CoRR abs/2011.00868 (2020)
2010 – 2019
- 2019
- [c6]Diptarka Chakraborty, Debarati Das, Michal Koucký:
Approximate Online Pattern Matching in Sublinear Time. FSTTCS 2019: 10:1-10:15 - 2018
- [c5]Diptarka Chakraborty, Debarati Das, Michal Koucký, Nitin Saurabh:
Space-Optimal Quasi-Gray Codes with Logarithmic Read Complexity. ESA 2018: 12:1-12:15 - [c4]Diptarka Chakraborty, Debarati Das, Elazar Goldenberg, Michal Koucký, Michael E. Saks:
Approximating Edit Distance within Constant Factor in Truly Sub-Quadratic Time. FOCS 2018: 979-990 - [c3]Debarati Das, Michal Koucký, Michael E. Saks:
Lower Bounds for Combinatorial Algorithms for Boolean Matrix Multiplication. STACS 2018: 23:1-23:14 - [c2]Diptarka Chakraborty, Debarati Das:
Sparse Weight Tolerant Subgraph for Single Source Shortest Path. SWAT 2018: 15:1-15:15 - [i6]Debarati Das, Michal Koucký, Michael E. Saks:
Lower bounds for Combinatorial Algorithms for Boolean Matrix Multiplication. CoRR abs/1801.05202 (2018) - [i5]Diptarka Chakraborty, Debarati Das, Michal Koucký:
Approximate Online Pattern Matching in Sub-linear Time. CoRR abs/1810.03551 (2018) - [i4]Diptarka Chakraborty, Debarati Das, Elazar Goldenberg, Michal Koucký, Michael E. Saks:
Approximating Edit Distance Within Constant Factor in Truly Sub-Quadratic Time. CoRR abs/1810.03664 (2018) - 2017
- [j1]Manindra Agrawal, Diptarka Chakraborty, Debarati Das, Satyadev Nandakumar:
Dimension, pseudorandomness and extraction of pseudorandomness. Comput. 6(3): 277-305 (2017) - [i3]Diptarka Chakraborty, Debarati Das:
Near Optimal Sized Weight Tolerant Subgraph for Single Source Shortest Path. CoRR abs/1707.04867 (2017) - [i2]Diptarka Chakraborty, Debarati Das, Michal Koucký, Nitin Saurabh:
Optimal Quasi-Gray Codes: Does the Alphabet Matter? CoRR abs/1712.01834 (2017) - 2015
- [c1]Manindra Agrawal, Diptarka Chakraborty, Debarati Das, Satyadev Nandakumar:
Dimension, Pseudorandomness and Extraction of Pseudorandomness. FSTTCS 2015: 221-235 - 2014
- [i1]Manindra Agrawal, Diptarka Chakraborty, Debarati Das, Satyadev Nandakumar:
Measure of Non-pseudorandomness and Deterministic Extraction of Pseudorandomness. Electron. Colloquium Comput. Complex. TR14 (2014)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-20 00:08 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
