| Publication | Date of Publication | Type |
|---|
| When you come at the king you best not miss | 2024-09-12 | Paper |
| scientific article; zbMATH DE number 7788438 (Why is no real title available?) | 2024-01-15 | Paper |
A Structural Theorem for Local Algorithms with Applications to Coding, Testing, and Verification
SIAM Journal on Computing | 2023-12-19 | Paper |
| When you come at the kings you best not miss | 2022-09-24 | Paper |
On the power of relaxed local decoding algorithms
SIAM Journal on Computing | 2021-05-27 | Paper |
On the power of relaxed local decoding algorithms
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
Testing Read-Once Formula Satisfaction
ACM Transactions on Computation Theory | 2019-12-06 | Paper |
Testing Read-Once Formula Satisfaction
ACM Transactions on Computation Theory | 2019-12-06 | Paper |
Improving and extending the testing of distributions for shape-restricted properties
Algorithmica | 2019-08-20 | Paper |
| Improved competitive ratio for the matroid secretary problem | 2019-05-10 | Paper |
| A Lower Bound for Relaxed Locally Decodable Codes | 2019-04-17 | Paper |
| Longest paths in 2-edge-connected cubic graphs | 2019-03-06 | Paper |
Improving and extending the testing of distributions for shape-restricted properties
(available as arXiv preprint) | 2018-04-19 | Paper |
Partial tests, universal tests and decomposability
Proceedings of the 5th conference on Innovations in theoretical computer science | 2017-05-19 | Paper |
Min-sum 2-paths problems
Theory of Computing Systems | 2016-03-21 | Paper |
Sound 3-query PCPPs are long
ACM Transactions on Computation Theory | 2015-09-24 | Paper |
Explicit lower bound of 4.5n - o(n) for boolena circuits
Proceedings of the thirty-third annual ACM symposium on Theory of computing | 2015-02-27 | Paper |
On the query complexity of testing orientations for being Eulerian
ACM Transactions on Algorithms | 2014-09-09 | Paper |
Min-sum 2-paths problems
Approximation and Online Algorithms | 2014-09-02 | Paper |
The covering and boundedness problems for branching vector addition systems
Journal of Computer and System Sciences | 2013-02-21 | Paper |
| The covering and boundedness problems for branching vector addition systems | 2012-10-24 | Paper |
Testing formula satisfaction
Algorithm Theory – SWAT 2012 | 2012-08-14 | Paper |
| Two-phase algorithms for the parametric shortest path problem | 2012-01-23 | Paper |
Parity Games on Graphs with Medium Tree-Width
Mathematical Foundations of Computer Science 2011 | 2011-08-17 | Paper |
Testing periodicity
Algorithmica | 2011-05-10 | Paper |
Lower bounds for testing Euclidean minimum spanning trees
Information Processing Letters | 2010-01-29 | Paper |
Hilbert's thirteenth problem and circuit complexity
Algorithms and Computation | 2009-12-17 | Paper |
Power Indices in Spanning Connectivity Games
Algorithmic Aspects in Information and Management | 2009-07-02 | Paper |
Testing st-Connectivity
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2009-02-17 | Paper |
On the Query Complexity of Testing Orientations for Being Eulerian
Lecture Notes in Computer Science | 2008-11-27 | Paper |
Sound 3-Query PCPPs Are Long
Automata, Languages and Programming | 2008-08-28 | Paper |
Space complexity vs. query complexity
Computational Complexity | 2008-08-20 | Paper |
Space Complexity vs. Query Complexity
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2007-08-28 | Paper |
Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
Lecture Notes in Computer Science | 2006-07-07 | Paper |
