| Publication | Date of Publication | Type |
|---|
| On computing a center persistence diagram | 2024-05-29 | Paper |
Parallel repetition of two-prover one-round games: an exposition
Interdisciplinary Information Sciences | 2020-11-19 | Paper |
An improved fixed-parameter algorithm for max-cut parameterized by crossing number
(available as arXiv preprint) | 2020-02-25 | Paper |
Bounded depth circuits with weighted symmetric gates: satisfiability, lower bounds and compression
Journal of Computer and System Sciences | 2019-08-07 | Paper |
Approximation guarantees for the minimum linear arrangement problem by higher eigenvalues
ACM Transactions on Algorithms | 2019-03-28 | Paper |
Beating brute force for systems of polynomial equations over finite fields
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
| Circuit size lower bounds and \#SAT upper bounds through a general framework | 2018-03-21 | Paper |
| Bounded depth circuits with weighted symmetric gates: satisfiability, lower bounds and compression | 2018-03-21 | Paper |
Gate elimination: circuit size lower bounds and \#SAT upper bounds
Theoretical Computer Science | 2018-03-12 | Paper |
| Quantum query complexity of unitary operator discrimination | 2017-10-23 | Paper |
| Improved exact algorithms for mildly sparse instances of MAX SAT | 2017-09-29 | Paper |
Improved exact algorithms for mildly sparse instances of MAX SAT
Theoretical Computer Science | 2017-09-28 | Paper |
Local restrictions from the Furst-Saxe-Sipser paper
Theory of Computing Systems | 2017-03-31 | Paper |
| Robust Approximation of Temporal CSP | 2017-03-22 | Paper |
Linear programming, width-1 CSPs, and robust satisfaction
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference | 2016-10-07 | Paper |
Solving sparse instances of Max SAT via width reduction and greedy restriction
Theory of Computing Systems | 2016-01-28 | Paper |
A query efficient non-adaptive long code test with perfect completeness
Random Structures & Algorithms | 2015-10-12 | Paper |
| scientific article; zbMATH DE number 6469161 (Why is no real title available?) | 2015-08-03 | Paper |
Solving sparse instances of Max SAT via width reduction and greedy restriction
Lecture Notes in Computer Science | 2014-09-26 | Paper |
Derandomizing the HSSW algorithm for 3-SAT
Algorithmica | 2013-11-11 | Paper |
A satisfiability algorithm and average-case hardness for formulas over the full binary basis
Computational Complexity | 2013-07-19 | Paper |
Approximation Guarantees for the Minimum Linear Arrangement Problem by Higher Eigenvalues
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2012-11-02 | Paper |
An exact algorithm for the Boolean connectivity problem for \(k\)-CNF
Theoretical Computer Science | 2011-09-12 | Paper |
Derandomizing HSSW algorithm for 3-SAT
Lecture Notes in Computer Science | 2011-08-17 | Paper |
Improved randomized algorithms for 3-SAT
Algorithms and Computation | 2010-12-09 | Paper |
On the Boolean connectivity problem for Horn relations
Discrete Applied Mathematics | 2010-11-25 | Paper |
An exact algorithm for the Boolean connectivity problem for \(k\)-CNF
Theory and Applications of Satisfiability Testing – SAT 2010 | 2010-09-29 | Paper |
A query efficient non-adaptive long code test with perfect completeness
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2010-09-10 | Paper |
The complexity of the Hajós calculus for planar graphs
Theoretical Computer Science | 2010-03-09 | Paper |
On the Boolean Connectivity Problem for Horn Relations
Theory and Applications of Satisfiability Testing – SAT 2007 | 2009-03-10 | Paper |
Exploiting partial knowledge of satisfying assignments
Discrete Applied Mathematics | 2007-08-23 | Paper |
| scientific article; zbMATH DE number 1848397 (Why is no real title available?) | 2003-01-05 | Paper |
