| 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 | 103* | 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 | 67 | 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 | 54* | 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 | 34 | 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 | 30 | 2014 |
| New extremal bounds for reachability and strong-connectivity preservers under failures D Chakraborty, K Choudhary arXiv preprint arXiv:2004.12890, 2020 | 17 | 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 | 16 | 2017 |
| Streaming algorithms for computing edit distance without exploiting suffix trees D Chakraborty, E Goldenberg, M Koucký arXiv preprint arXiv:1607.03718, 2016 | 13 | 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 | 10 | 2021 |
| Approximate trace reconstruction via median string (in average-case) D Chakraborty, D Das, R Krauthgamer arXiv preprint arXiv:2107.09497, 2021 | 9 | 2021 |
| Approximate online pattern matching in sub-linear time D Chakraborty, D Das, M Koucky arXiv preprint arXiv:1810.03551, 2018 | 9 | 2018 |
| Fair rank aggregation D Chakraborty, S Das, A Khan, A Subramanian Advances in Neural Information Processing Systems 35, 23965-23978, 2022 | 8 | 2022 |
| 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 | 7* | 2015 |
| Clustering Permutations: New Techniques with Streaming Applications D Chakraborty, D Das, R Krauthgamer arXiv preprint arXiv:2212.01821, 2022 | 5 | 2022 |
| Pairwise Reachability Oracles and Preservers Under Failures D Chakraborty, K Chatterjee, K Choudhary arXiv preprint arXiv:2110.11613, 2021 | 5 | 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 | 5* | 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 | 5 | 2017 |
| Approximating the center ranking under ulam D Chakraborty, K Gajjar, AV Jha 41st IARCS Annual Conference on Foundations of Software Technology and …, 2021 | 4 | 2021 |
| Approximate Maximum Rank Aggregation: Beyond the Worst-Case YHY Alvin, D Chakraborty 43rd IARCS Annual Conference on Foundations of Software Technology and …, 2023 | 3 | 2023 |
| Support size estimation: The power of conditioning D Chakraborty, G Kumar, KS Meel arXiv preprint arXiv:2211.11967, 2022 | 2 | 2022 |
Michal KouckyCharles University, PragueVerified email at iuuk.mff.cuni.cz
