Diptarka Chakraborty
Diptarka Chakraborty
E-mailová adresa ověřena na: - Domovská stránka
Streaming algorithms for embedding and computing edit distance in the low distance regime
D Chakraborty, E Goldenberg, M Koucký
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing …, 2016
Debarati Das, Elazar Goldenberg, Michal Koucký, and Michael E. Saks. Approximating edit distance within constant factor in truly sub-quadratic time
D Chakraborty
59th IEEE Annual Symposium on Foundations of Computer Science, FOCS, 7-9, 2018
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
Tight cell probe bounds for succinct boolean matrix-vector multiplication
D Chakraborty, L Kamma, KG Larsen
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing …, 2018
New time-space upperbounds for directed reachability in high-genus and h-minor-free graphs
D Chakraborty, A Pavan, R Tewari, NV Vinodchandran, LF Yang
34th International Conference on Foundation of Software Technology and …, 2014
New extremal bounds for reachability and strong-connectivity preservers under failures
D Chakraborty, K Choudhary
arXiv preprint arXiv:2004.12890, 2020
An O(nε) Space and Polynomial Time Algorithm for Reachability in Directed Layered Planar Graphs
D Chakraborty, R Tewari
ACM Transactions on Computation Theory (TOCT) 9 (4), 1-11, 2017
Streaming algorithms for computing edit distance without exploiting suffix trees
D Chakraborty, E Goldenberg, M Koucký
arXiv preprint arXiv:1607.03718, 2016
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
Approximate online pattern matching in sub-linear time
D Chakraborty, D Das, M Koucky
arXiv preprint arXiv:1810.03551, 2018
Simultaneous time-space upper bounds for red-blue path problem in planar DAGs
D Chakraborty, R Tewari
International Workshop on Algorithms and Computation, 258-269, 2015
Approximate trace reconstruction via median string (in average-case)
D Chakraborty, D Das, R Krauthgamer
arXiv preprint arXiv:2107.09497, 2021
Sparse weight tolerant subgraph for single source shortest path
D Chakraborty, D Das
16th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2018), 2018
On Resource-bounded versions of the van Lambalgen theorem
D Chakraborty, S Nandakumar, H Shukla
International Conference on Theory and Applications of Models of Computation …, 2017
Fair rank aggregation
D Chakraborty, S Das, A Khan, A Subramanian
Advances in Neural Information Processing Systems 35, 23965-23978, 2022
Clustering Permutations: New Techniques with Streaming Applications
D Chakraborty, D Das, R Krauthgamer
arXiv preprint arXiv:2212.01821, 2022
Pairwise Reachability Oracles and Preservers Under Failures
D Chakraborty, K Chatterjee, K Choudhary
arXiv preprint arXiv:2110.11613, 2021
Approximating the center ranking under ulam
D Chakraborty, K Gajjar, AV Jha
41st IARCS Annual Conference on Foundations of Software Technology and …, 2021
Support size estimation: The power of conditioning
D Chakraborty, G Kumar, KS Meel
arXiv preprint arXiv:2211.11967, 2022
Space-Optimal Quasi-Gray Codes with Logarithmic Read Complexity
D Chakraborty, D Das, M Koucký, N Saurabh
26th Annual European Symposium on Algorithms (ESA 2018), 2018
Systém momentálně nemůže danou operaci provést. Zkuste to znovu později.
Články 1–20