| Publication | Date of Publication | Type |
|---|
| Generalization of binary search: searching in trees and forest-like partial orders | 2026-05-29 | Paper |
| Dynamic pagerank: algorithms and lower bounds | 2026-01-14 | Paper |
| Polylogarithmic approximation for edit distance and the asymmetric query complexity | 2025-04-29 | Paper |
| Adversarially robust streaming via dense-sparse trade-offs | 2024-05-14 | Paper |
scientific article; zbMATH DE number 7788513 (Why is no real title available?)
(available as arXiv preprint) | 2024-01-15 | Paper |
Fully dynamic MIS in uniformly sparse graphs
(available as arXiv preprint) | 2021-07-28 | Paper |
Fully dynamic MIS in uniformly sparse graphs
ACM Transactions on Algorithms | 2021-05-03 | Paper |
Walking randomly, massively, and efficiently
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing | 2021-01-19 | Paper |
Round compression for parallel matching algorithms
SIAM Journal on Computing | 2020-10-29 | Paper |
Planar graphs: random walks and bipartiteness testing
Random Structures & Algorithms | 2019-10-16 | Paper |
Fully Dynamic Maximal Independent Set with Sublinear in <i>n</i> Update Time
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
The query complexity of graph isomorphism: bypassing distribution testing lower bounds
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing | 2019-08-22 | Paper |
Round compression for parallel matching algorithms
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing | 2019-08-22 | Paper |
Round compression for parallel matching algorithms
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing | 2019-08-22 | Paper |
Fully dynamic maximal independent set with sublinear update time
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing | 2019-08-22 | Paper |
A near-optimal sublinear-time algorithm for approximating the minimum vertex cover size
(available as arXiv preprint) | 2019-05-10 | Paper |
| A near-optimal sublinear-time algorithm for approximating the minimum vertex cover size | 2019-05-10 | Paper |
Streaming algorithms for estimating the matching size in planar graphs and beyond
ACM Transactions on Algorithms | 2019-03-28 | Paper |
Streaming Algorithms for Estimating the Matching Size in Planar Graphs and Beyond
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms | 2017-10-05 | Paper |
Fat polygonal partitions with applications to visualization and embeddings
(available as arXiv preprint) | 2017-03-09 | Paper |
Superlinear lower bounds for multipass graph processing
Algorithmica | 2016-11-29 | Paper |
Parallel algorithms for geometric graph problems
Proceedings of the forty-sixth annual ACM symposium on Theory of computing | 2015-06-26 | Paper |
Approximating edit distance in near-linear time
Proceedings of the forty-first annual ACM symposium on Theory of computing | 2015-02-04 | Paper |
| Polynomial approximation schemes for smoothed and random instances of multidimensional packing problems | 2014-12-18 | Paper |
Maintaining a large matching and a small vertex cover
Proceedings of the forty-second ACM symposium on Theory of computing | 2014-08-13 | Paper |
Streaming algorithms via precision sampling
2011 IEEE 52nd Annual Symposium on Foundations of Computer Science | 2014-07-30 | Paper |
Planar Graphs: Random Walks and Bipartiteness Testing
2011 IEEE 52nd Annual Symposium on Foundations of Computer Science | 2014-07-30 | Paper |
Local Graph Partitions for Approximation and Testing
2009 50th Annual IEEE Symposium on Foundations of Computer Science | 2014-07-25 | Paper |
Approximating edit distance in near-linear time
SIAM Journal on Computing | 2013-03-19 | Paper |
An efficient partitioning oracle for bounded-treewidth graphs
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2011-08-17 | Paper |
Sublinear graph approximation algorithms
Property Testing | 2010-10-12 | Paper |
Sublinear algorithms in the external memory model
Property Testing | 2010-10-12 | Paper |
Polylogarithmic approximation for edit distance and the asymmetric query complexity
Property Testing | 2010-10-12 | Paper |
Dynamic approximate vertex cover and maximum matching
Property Testing | 2010-10-12 | Paper |
| scientific article; zbMATH DE number 5764837 (Why is no real title available?) | 2010-08-06 | Paper |
The Oil Searching Problem
Lecture Notes in Computer Science | 2009-10-29 | Paper |
External Sampling
Automata, Languages and Programming | 2009-07-14 | Paper |
| Circular partitions with applications to visualization and embeddings | 2009-02-12 | Paper |
Testing Properties of Sets of Points in Metric Spaces
Automata, Languages and Programming | 2008-08-28 | Paper |
