default search action
Diptarka Chakraborty
Person information
- affiliation: National University of Singapore, School of Computing, Singapore
- affiliation (PhD): Indian Institute of Technology, Kanpur, India
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c25]Diptarka Chakraborty, Sourav Chakraborty, Gunjan Kumar, Kuldeep S. Meel:
Equivalence Testing: The Power of Bounded Adaptivity. AISTATS 2024: 3592-3600 - [c24]Diptarka Chakraborty, Sourav Chakraborty, Gunjan Kumar:
Tight Lower Bound on Equivalence Testing in Conditional Sampling Model. SODA 2024: 4371-4394 - [i25]Diptarka Chakraborty, Sourav Chakraborty, Gunjan Kumar, Kuldeep S. Meel:
Equivalence Testing: The Power of Bounded Adaptivity. CoRR abs/2403.04230 (2024) - 2023
- [c23]Alvin Yan Hong Yao, Diptarka Chakraborty:
Approximate Maximum Rank Aggregation: Beyond the Worst-Case. FSTTCS 2023: 12:1-12:21 - [c22]Diptarka Chakraborty, Sourav Chakraborty, Gunjan Kumar, Kuldeep S. Meel:
Approximate Model Counting: Is SAT Oracle More Powerful Than NP Oracle? ICALP 2023: 123:1-123:17 - [c21]Diptarka Chakraborty, Debarati Das, Robert Krauthgamer:
Clustering Permutations: New Techniques with Streaming Applications. ITCS 2023: 31:1-31:24 - [c20]Diptarka Chakraborty, Sanjana Dey:
Matrix Completion: Approximating the Minimum Diameter. ISAAC 2023: 17:1-17:19 - [c19]Diptarka Chakraborty, Gunjan Kumar, Kuldeep S. Meel:
Support Size Estimation: The Power of Conditioning. MFCS 2023: 33:1-33:13 - [i24]Diptarka Chakraborty, Sourav Chakraborty, Gunjan Kumar, Kuldeep S. Meel:
Approximate Model Counting: Is SAT Oracle More Powerful than NP Oracle? CoRR abs/2306.10281 (2023) - [i23]Diptarka Chakraborty, Syamantak Das, Arindam Khan, Aditya Subramanian:
Fair Rank Aggregation. CoRR abs/2308.10499 (2023) - [i22]Diptarka Chakraborty, Sourav Chakraborty, Gunjan Kumar:
Tight Lower Bound on Equivalence Testing in Conditional Sampling Model. CoRR abs/2308.11558 (2023) - 2022
- [c18]Diptarka Chakraborty, Kushagra Chatterjee, Keerti Choudhary:
Pairwise Reachability Oracles and Preservers Under Failures. ICALP 2022: 35:1-35:16 - [c17]Diptarka Chakraborty, Syamantak Das, Arindam Khan, Aditya Subramanian:
Fair Rank Aggregation. NeurIPS 2022 - [i21]Diptarka Chakraborty, Gunjan Kumar, Kuldeep S. Meel:
Support Size Estimation: The Power of Conditioning. CoRR abs/2211.11967 (2022) - [i20]Diptarka Chakraborty, Debarati Das, Robert Krauthgamer:
Clustering Permutations: New Techniques with Streaming Applications. CoRR abs/2212.01821 (2022) - 2021
- [c16]Diptarka Chakraborty, Debarati Das, Robert Krauthgamer:
Approximate Trace Reconstruction via Median String (In Average-Case). FSTTCS 2021: 11:1-11:23 - [c15]Diptarka Chakraborty, Kshitij Gajjar
, Agastya Vibhuti Jha:
Approximating the Center Ranking Under Ulam. FSTTCS 2021: 12:1-12:21 - [c14]Diptarka Chakraborty, Debarati Das, Robert Krauthgamer:
Approximating the Median under the Ulam Metric. SODA 2021: 761-775 - [i19]Diptarka Chakraborty, Debarati Das, Robert Krauthgamer:
Approximate Trace Reconstruction via Median String (in Average-Case). CoRR abs/2107.09497 (2021) - [i18]Diptarka Chakraborty, Kushagra Chatterjee, Keerti Choudhary:
Pairwise Reachability Oracles and Preservers under Failures. CoRR abs/2110.11613 (2021) - 2020
- [j3]Diptarka Chakraborty
Approximating Edit Distance Within Constant Factor in Truly Sub-quadratic Time. J. ACM 67(6): 36:1-36:22 (2020) - [c13]Amey Bhangale, Diptarka Chakraborty, Rajendra Kumar:
Hardness of Approximation of (Multi-)LCS over Small Alphabet. APPROX-RANDOM 2020: 38:1-38:16 - [c12]Diptarka Chakraborty, Keerti Choudhary
New Extremal Bounds for Reachability and Strong-Connectivity Preservers Under Failures. ICALP 2020: 25:1-25:20 - [i17]Diptarka Chakraborty, Keerti Choudhary:
New Extremal bounds for Reachability and Strong-Connectivity Preservers under failures. CoRR abs/2004.12890 (2020) - [i16]Amey Bhangale, Diptarka Chakraborty, Rajendra Kumar
Hardness of Approximation of (Multi-)LCS over Small Alphabet. CoRR abs/2006.13449 (2020) - [i15]Diptarka Chakraborty, Debarati Das, Robert Krauthgamer:
Approximating the Median under the Ulam Metric. CoRR abs/2011.00868 (2020)
2010 – 2019
- 2019
- [c11]Diptarka Chakraborty, Debarati Das, Michal Koucký
Approximate Online Pattern Matching in Sublinear Time. FSTTCS 2019: 10:1-10:15 - 2018
- [j2]Diptarka Chakraborty, Raghunath Tewari:
An O(nε) Space and Polynomial Time Algorithm for Reachability in Directed Layered Planar Graphs. ACM Trans. Comput. Theory 9(4): 19:1-19:11 (2018) - [c10]Diptarka Chakraborty, Debarati Das, Michal Koucký
Space-Optimal Quasi-Gray Codes with Logarithmic Read Complexity. ESA 2018: 12:1-12:15 - [c9]Diptarka Chakraborty, Debarati Das, Elazar Goldenberg, Michal Koucký
Approximating Edit Distance within Constant Factor in Truly Sub-Quadratic Time. FOCS 2018: 979-990 - [c8]Diptarka Chakraborty, Lior Kamma, Kasper Green Larsen:
Tight cell probe bounds for succinct Boolean matrix-vector multiplication. STOC 2018: 1297-1306 - [c7]Diptarka Chakraborty, Debarati Das:
Sparse Weight Tolerant Subgraph for Single Source Shortest Path. SWAT 2018: 15:1-15:15 - [i14]Diptarka Chakraborty, Debarati Das, Michal Koucký:
Approximate Online Pattern Matching in Sub-linear Time. CoRR abs/1810.03551 (2018) - [i13]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) - [c6]Diptarka Chakraborty, Satyadev Nandakumar
On Resource-Bounded Versions of the van Lambalgen Theorem. TAMC 2017: 129-143 - [i12]Diptarka Chakraborty, Satyadev Nandakumar, Himanshu Shukla:
On Resource-bounded versions of the van Lambalgen theorem. CoRR abs/1704.01101 (2017) - [i11]Diptarka Chakraborty
Near Optimal Sized Weight Tolerant Subgraph for Single Source Shortest Path. CoRR abs/1707.04867 (2017) - [i10]Diptarka Chakraborty
Tight Cell Probe Bounds for Succinct Boolean Matrix-Vector Multiplication. CoRR abs/1711.04467 (2017) - [i9]Diptarka Chakraborty, Debarati Das, Michal Koucký, Nitin Saurabh:
Optimal Quasi-Gray Codes: Does the Alphabet Matter? CoRR abs/1712.01834 (2017) - 2016
- [c5]Diptarka Chakraborty, Elazar Goldenberg, Michal Koucký
Streaming algorithms for embedding and computing edit distance in the low distance regime. STOC 2016: 712-725 - [i8]Diptarka Chakraborty
Streaming Algorithms For Computing Edit Distance Without Exploiting Suffix Trees. CoRR abs/1607.03718 (2016) - 2015
- [c4]Manindra Agrawal, Diptarka Chakraborty, Debarati Das, Satyadev Nandakumar
Dimension, Pseudorandomness and Extraction of Pseudorandomness. FSTTCS 2015: 221-235 - [c3]Diptarka Chakraborty, Raghunath Tewari:
An O(n^ε ) Space and Polynomial Time Algorithm for Reachability in Directed Layered Planar Graphs. ISAAC 2015: 614-624 - [c2]Diptarka Chakraborty, Raghunath Tewari:
Simultaneous Time-Space Upper Bounds for Red-Blue Path Problem in Planar DAGs. WALCOM 2015: 258-269 - [i7]Diptarka Chakraborty, Raghunath Tewari:
An $O(n^ε)$ Space and Polynomial Time Algorithm for Reachability in Directed Layered Planar Graphs. CoRR abs/1501.05828 (2015) - [i6]Diptarka Chakraborty
Simultaneous Time-Space Upper Bounds for Certain Problems in Planar Graphs. CoRR abs/1502.02135 (2015) - [i5]Diptarka Chakraborty, Elazar Goldenberg, Michal Koucký:
Low Distortion Embedding from Edit to Hamming Distance using Coupling. Electron. Colloquium Comput. Complex. TR15 (2015) - [i4]Diptarka Chakraborty, Raghunath Tewari:
An O(nε) Space and Polynomial Time Algorithm for Reachability in Directed Layered Planar Graphs. Electron. Colloquium Comput. Complex. TR15 (2015) - 2014
- [c1]Diptarka Chakraborty, Aduri Pavan, Raghunath Tewari, N. V. Vinodchandran, Lin F. Yang
New Time-Space Upperbounds for Directed Reachability in High-genus and H-minor-free Graphs. FSTTCS 2014: 585-595 - [i3]Manindra Agrawal, Diptarka Chakraborty, Debarati Das, Satyadev Nandakumar:
Measure of Non-pseudorandomness and Deterministic Extraction of Pseudorandomness. Electron. Colloquium Comput. Complex. TR14 (2014) - [i2]Diptarka Chakraborty, Elazar Goldenberg, Michal Koucký:
Information Complexity for Multiparty Communication. Electron. Colloquium Comput. Complex. TR14 (2014) - [i1]Diptarka Chakraborty, Aduri Pavan, Raghunath Tewari, N. Variyam Vinodchandran, Lin F. Yang
New Time-Space Upperbounds for Directed Reachability in High-genus and H-minor-free Graphs. 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-11-19 21:42 CET 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: