| Publication | Date of Publication | Type |
|---|
On approximability of propositional model counting
Theoretical Computer Science | 2026-05-11 | Paper |
| New extremal bounds for reachability and strong-connectivity preservers under failures | 2026-03-18 | Paper |
| Approximating edit distance within constant factor in truly sub-quadratic time | 2025-08-12 | Paper |
| Approximate maximum rank aggregation: beyond the worst-case | 2025-07-28 | Paper |
| Matrix completion: approximating the minimum diameter | 2025-07-24 | Paper |
New extremal bounds for reachability and strong-connectivity preservers under failures
ACM Transactions on Algorithms | 2025-07-22 | Paper |
| Support size estimation: the power of conditioning | 2024-12-03 | Paper |
| Tight lower bound on equivalence testing in conditional sampling model | 2024-11-28 | Paper |
| Approximate model counting: is SAT oracle more powerful than NP oracle? | 2024-11-14 | Paper |
| Clustering permutations: new techniques with streaming applications | 2024-09-25 | Paper |
| Pairwise reachability oracles and preservers under failures | 2024-06-24 | Paper |
| scientific article; zbMATH DE number 7799590 (Why is no real title available?) | 2024-02-05 | Paper |
scientific article; zbMATH DE number 7799589 (Why is no real title available?)
(available as arXiv preprint) | 2024-02-05 | Paper |
scientific article; zbMATH DE number 7788386 (Why is no real title available?)
(available as arXiv preprint) | 2024-01-15 | Paper |
scientific article; zbMATH DE number 7758340 (Why is no real title available?)
(available as arXiv preprint) | 2023-10-31 | Paper |
scientific article; zbMATH DE number 7650307 (Why is no real title available?)
(available as arXiv preprint) | 2023-02-03 | Paper |
Approximating Edit Distance Within Constant Factor in Truly Sub-quadratic Time
Journal of the ACM | 2022-12-08 | Paper |
| Space-optimal quasi-Gray codes with logarithmic read complexity | 2021-08-04 | Paper |
Sparse weight tolerant subgraph for single source shortest path
(available as arXiv preprint) | 2020-08-25 | Paper |
An <i>O</i> ( <i>n</i> <sup>ϵ</sup> ) Space and Polynomial Time Algorithm for Reachability in Directed Layered Planar Graphs
ACM Transactions on Computation Theory | 2019-12-06 | Paper |
Tight cell probe bounds for succinct Boolean matrix-vector multiplication
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing | 2019-08-22 | Paper |
Dimension, pseudorandomness and extraction of pseudorandomness
Computability | 2017-11-22 | Paper |
Streaming algorithms for embedding and computing edit distance in the low distance regime
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2017-09-29 | Paper |
| Dimension, Pseudorandomness and Extraction of Pseudorandomness | 2017-07-13 | Paper |
On Resource-Bounded Versions of the van Lambalgen Theorem
Lecture Notes in Computer Science | 2017-05-19 | Paper |
| New time-space upperbounds for directed reachability in high-genus and H-minor-free graphs | 2017-04-25 | Paper |
An $$O(n^{\epsilon })$$ Space and Polynomial Time Algorithm for Reachability in Directed Layered Planar Graphs
Algorithms and Computation | 2016-01-11 | Paper |
Simultaneous time-space upper bounds for red-blue path problem in planar DAGs
WALCOM: Algorithms and Computation | 2015-02-27 | Paper |
