| Publication | Date of Publication | Type |
|---|
| On Fourier analysis of sparse Boolean functions over certain abelian groups | 2026-05-12 | Paper |
Colorful two-piercing theorem for boxes
Discrete Applied Mathematics | 2026-02-11 | Paper |
Separations between combinatorial measures for transitive functions
Discrete Mathematics and Theoretical Computer Science. DMTCS | 2026-01-13 | Paper |
| Approximate degree composition for recursive functions | 2025-10-06 | Paper |
| Improved streaming algorithm for the Klee's measure problem and generalizations | 2025-10-06 | Paper |
| Distinct elements in streams: an algorithm for the (text) book | 2025-06-19 | Paper |
Exploring the gap between tolerant and non-tolerant distribution testing
IEEE Transactions on Information Theory | 2025-02-27 | Paper |
| On the composition of randomized query complexity and approximate degree | 2025-01-14 | 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 |
| Certificate games | 2024-09-25 | Paper |
| Exploring the gap between tolerant and non-tolerant distribution testing | 2024-08-22 | Paper |
| Separations between combinatorial measures for transitive functions | 2024-06-24 | Paper |
| Symmetry and quantum query-to-communication simulation | 2024-04-23 | Paper |
scientific article; zbMATH DE number 7799588 (Why is no real title available?)
(available as arXiv preprint) | 2024-02-05 | Paper |
| Interplay Between Graph Isomorphism and Earth Mover’s Distance in the Query and Communication Worlds | 2023-11-20 | Paper |
| Disjointness through the Lens of Vapnik-Chervonenkis Dimension: Sparsity and Beyond | 2023-10-31 | Paper |
| Improved Bounds on Fourier Entropy and Min-Entropy | 2023-02-07 | Paper |
The balanced connected subgraph problem
Discrete Applied Mathematics | 2022-08-04 | Paper |
Disjointness through the lens of Vapnik-Chervonenkis dimension: sparsity and beyond
Computational Complexity | 2022-08-01 | Paper |
| Colorful Helly Theorem for Piercing Boxes with Multiple Points | 2022-07-28 | Paper |
scientific article; zbMATH DE number 7561509 (Why is no real title available?)
(available as arXiv preprint) | 2022-07-21 | Paper |
scientific article; zbMATH DE number 7561760 (Why is no real title available?)
(available as arXiv preprint) | 2022-07-21 | Paper |
Improved bounds on Fourier entropy and min-entropy
ACM Transactions on Computation Theory | 2022-03-29 | Paper |
Improved bounds on Fourier entropy and min-entropy
ACM Transactions on Computation Theory | 2022-03-29 | Paper |
Fourier entropy influence conjecture for random linear threshold functions
(available as arXiv preprint) | 2020-02-12 | Paper |
Property testing of joint distributions using conditional samples
ACM Transactions on Computation Theory | 2019-12-16 | Paper |
The balanced connected subgraph problem
Lecture Notes in Computer Science | 2019-10-10 | Paper |
| Improved competitive ratio for the matroid secretary problem | 2019-05-10 | Paper |
Helly-type theorems in property testing
International Journal of Computational Geometry & Applications | 2019-04-24 | Paper |
| Nearly tight bounds for testing function isomorphism | 2017-09-29 | Paper |
On the power of conditional samples in distribution testing
Proceedings of the 4th conference on Innovations in Theoretical Computer Science | 2017-05-16 | Paper |
Upper bounds on Fourier entropy
Theoretical Computer Science | 2016-11-24 | Paper |
On the power of conditional samples in distribution testing
SIAM Journal on Computing | 2016-08-16 | Paper |
| Characterization and recognition of proper tagged probe interval graphs | 2016-07-11 | Paper |
Maximal and maximum transitive relation contained in a given binary relation
Lecture Notes in Computer Science | 2015-10-29 | Paper |
Upper bounds on Fourier entropy
Lecture Notes in Computer Science | 2015-10-29 | Paper |
Hardness and algorithms for rainbow connection
Journal of Combinatorial Optimization | 2015-08-24 | Paper |
Query complexity lower bounds for reconstruction of codes
Theory of Computing | 2015-02-03 | Paper |
Property testing bounds for linear and quadratic functions via parity decision trees
Computer Science - Theory and Applications | 2014-06-24 | Paper |
Counting popular matchings in house allocation problems
Computer Science - Theory and Applications | 2014-06-24 | Paper |
| Testing uniformity of stationary distribution | 2014-06-11 | Paper |
| On the sensitivity of cyclically-invariant Boolean functions | 2014-05-06 | Paper |
Helly-type theorems in property testing
LATIN 2014: Theoretical Informatics | 2014-03-31 | Paper |
Nearly tight bounds for testing function isomorphism
SIAM Journal on Computing | 2013-07-24 | Paper |
Monotonicity testing and shortest-path routing on the cube
Combinatorica | 2012-09-18 | Paper |
| New results on quantum property testing | 2012-08-29 | Paper |
| Hardness and Algorithms for Rainbow Connectivity | 2012-04-24 | Paper |
| Two-phase algorithms for the parametric shortest path problem | 2012-01-23 | Paper |
Efficient sample extractors for juntas with applications
Automata, Languages and Programming | 2011-07-06 | Paper |
Monotonicity testing and shortest-path routing on the cube
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2010-09-10 | Paper |
Testing st-Connectivity
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2009-02-17 | Paper |
Zero Error List-Decoding Capacity of the q/(q–1) Channel
FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science | 2008-04-17 | Paper |
Prediction problems related to a first-order autoregressive process in the presence of outliers
Applicationes Mathematicae | 2007-02-06 | Paper |
Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
Lecture Notes in Computer Science | 2006-07-07 | Paper |
