| Publication | Date of Publication | Type |
|---|
| Planar Maximum Matching: Towards a Parallel Algorithm | 2022-07-21 | Paper |
scientific article; zbMATH DE number 7561324 (Why is no real title available?)
(available as arXiv preprint) | 2022-07-21 | Paper |
| CrystalBall: gazing in the black box of SAT solving | 2020-05-20 | Paper |
Reachability is in DynFO
Journal of the ACM | 2019-02-25 | Paper |
| Space complexity: what makes planar graphs special? | 2018-09-04 | Paper |
| Space-efficient approximation scheme for maximum matching in sparse graphs | 2018-03-21 | Paper |
Graph properties in node-query setting: effect of breaking symmetry
(available as arXiv preprint) | 2018-03-21 | Paper |
Quantum query complexity of subgraph isomorphism and homomorphism
(available as arXiv preprint) | 2018-01-24 | Paper |
On the complexity of trial and error for constraint satisfaction problems
Journal of Computer and System Sciences | 2017-11-14 | Paper |
On the complexity of trial and error for constraint satisfaction problems
Journal of Computer and System Sciences | 2017-11-14 | Paper |
Evasiveness through a circuit lens (extended abstract)
Proceedings of the 4th conference on Innovations in Theoretical Computer Science | 2017-05-16 | Paper |
| On the Spectral Properties of Symmetric Functions | 2017-04-11 | Paper |
Upper bounds on Fourier entropy
Theoretical Computer Science | 2016-11-24 | Paper |
On fractional block sensitivity
Chicago Journal of Theoretical Computer Science | 2016-08-16 | Paper |
Reachability is in DynFO
Automata, Languages, and Programming | 2015-11-04 | Paper |
Upper bounds on Fourier entropy
Lecture Notes in Computer Science | 2015-10-29 | Paper |
On the power of parity queries in Boolean decision trees
Lecture Notes in Computer Science | 2015-09-30 | Paper |
Planarity, determinants, permanents, and (unique) matchings
ACM Transactions on Computation Theory | 2015-09-24 | Paper |
On the power of isolation in planar graphs
ACM Transactions on Computation Theory | 2015-09-24 | Paper |
Any monotone property of 3-uniform hypergraphs is weakly evasive
Theoretical Computer Science | 2015-06-11 | Paper |
An efficient quantum algorithm for finding hidden parabolic subgroups in the general linear group
Mathematical Foundations of Computer Science 2014 | 2014-10-14 | Paper |
An efficient quantum algorithm for finding hidden parabolic subgroups in the general linear group
Mathematical Foundations of Computer Science 2014 | 2014-10-14 | Paper |
On the complexity of trial and error for constraint satisfaction problems
Automata, Languages, and Programming | 2014-07-01 | Paper |
Dynamic complexity of directed reachability and other problems
Automata, Languages, and Programming | 2014-07-01 | Paper |
Property testing bounds for linear and quadratic functions via parity decision trees
Computer Science - Theory and Applications | 2014-06-24 | Paper |
Some perfect matchings and perfect half-integral matchings in NC
Chicago Journal of Theoretical Computer Science | 2014-05-06 | Paper |
Space complexity of optimization problems in planar graphs
Lecture Notes in Computer Science | 2014-04-16 | Paper |
Query complexity of matroids
Lecture Notes in Computer Science | 2013-06-07 | Paper |
Any Monotone Property of 3-Uniform Hypergraphs Is Weakly Evasive
Lecture Notes in Computer Science | 2013-05-28 | Paper |
| Deterministically isolating a perfect matching in bipartite planar graphs | 2013-03-19 | Paper |
| Improved bounds for bipartite matching on surfaces | 2012-08-23 | Paper |
Space complexity of perfect matching in bounded genus bipartite graphs
Journal of Computer and System Sciences | 2012-08-17 | Paper |
| Evasiveness and the distribution of prime numbers | 2012-01-23 | Paper |
| Space complexity of perfect matching in bounded genus bipartite graphs | 2012-01-23 | Paper |
Space-efficient counting in graphs on surfaces
Computational Complexity | 2011-02-18 | Paper |
Deterministically isolating a perfect matching in bipartite planar graphs
Theory of Computing Systems | 2010-10-06 | Paper |
Planarity, Determinants, Permanents, and (Unique) Matchings
Computer Science – Theory and Applications | 2008-06-03 | Paper |
A New NC-Algorithm for Finding a Perfect Matching in d-Regular Bipartite Graphs When d Is Small
Lecture Notes in Computer Science | 2007-05-02 | Paper |
Algorithms – ESA 2004
Lecture Notes in Computer Science | 2005-08-18 | Paper |
