| Publication | Date of Publication | Type |
|---|
scientific article; zbMATH DE number 7204473 (Why is no real title available?)
(available as arXiv preprint) | 2020-05-27 | Paper |
Subquadratic algorithms for succinct stable matching
Algorithmica | 2019-05-21 | Paper |
A satisfiability algorithm for \(\mathrm{AC}^0\)
(available as arXiv preprint) | 2019-05-10 | Paper |
| A satisfiability algorithm for \(\mathrm{AC}^0\) | 2019-05-10 | Paper |
On problems as hard as CNF-SAT
ACM Transactions on Algorithms | 2018-11-05 | Paper |
On problems as hard as CNF-SAT
ACM Transactions on Algorithms | 2018-11-05 | 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 |
| Beating brute force for (quantified) satisfiability of circuits of bounded treewidth | 2018-03-15 | Paper |
Subquadratic algorithms for succinct stable matching
Lecture Notes in Computer Science | 2016-07-25 | Paper |
Nondeterministic extensions of the strong exponential time hypothesis and consequences for non-reducibility
Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science | 2016-04-15 | Paper |
Size-depth trade-offs for threshold circuits
Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93 | 2015-05-07 | Paper |
Jealousy graphs: structure and complexity of decentralized stable matching
Web and Internet Economics | 2015-01-12 | Paper |
On the complexity of circuit satisfiability
Proceedings of the forty-second ACM symposium on Theory of computing | 2014-08-13 | Paper |
Finding heavy hitters from lossy or noisy data
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2013-10-04 | Paper |
On the exact complexity of evaluating quantified \(k\)-\textsc{cnf}
Algorithmica | 2013-05-16 | Paper |
Common Knowledge and State-Dependent Equilibria
Algorithmic Game Theory | 2013-03-13 | Paper |
On the exact complexity of evaluating quantified \(k\)-CNF
Parameterized and Exact Computation | 2010-12-07 | Paper |
Uniquely satisfiable \(k\)-SAT instances with almost minimal occurrences of each variable
Theory and Applications of Satisfiability Testing – SAT 2010 | 2010-09-29 | Paper |
The complexity of satisfiability of small depth circuits
Parameterized and Exact Computation | 2010-01-14 | Paper |
k-SAT Is No Harder Than Decision-Unique-k-SAT
Computer Science - Theory and Applications | 2009-08-18 | Paper |
An improved exponential-time algorithm for k -SAT
Journal of the ACM | 2008-12-21 | Paper |
The complexity of Unique \(k\)-SAT: An isolation lemma for \(k\)-CNFs
Journal of Computer and System Sciences | 2008-03-11 | Paper |
| scientific article; zbMATH DE number 2187726 (Why is no real title available?) | 2005-07-20 | Paper |
On the complexity of \(k\)-SAT
Journal of Computer and System Sciences | 2002-08-14 | Paper |
Which problems have strongly exponential complexity?
Journal of Computer and System Sciences | 2002-07-04 | Paper |
Scalable network architectures using the optical transpose interconnection system (OTIS)
Journal of Parallel and Distributed Computing | 2001-10-01 | Paper |
| scientific article; zbMATH DE number 1559525 (Why is no real title available?) | 2001-02-28 | Paper |
Exponential lower bounds for depth three Boolean circuits
Computational Complexity | 2000-12-19 | Paper |
scientific article; zbMATH DE number 1452705 (Why is no real title available?)
Chicago Journal of Theoretical Computer Science | 2000-05-29 | Paper |
Dimension of Projections in Boolean Functions
SIAM Journal on Discrete Mathematics | 1998-09-21 | Paper |
Size--Depth Tradeoffs for Threshold Circuits
SIAM Journal on Computing | 1997-05-26 | Paper |
Approximating threshold circuits by rational functions
Information and Computation | 1995-08-27 | Paper |
The light bulb problem
Information and Computation | 1995-07-06 | Paper |
Effect of connectivity in an associative memory model
Journal of Computer and System Sciences | 1994-01-06 | Paper |
| scientific article; zbMATH DE number 67624 (Why is no real title available?) | 1992-09-27 | Paper |
Milking the Aanderaa argument
Information and Computation | 1990-01-01 | Paper |
There are no p-complete families of symmetric Boolean functions
Information Processing Letters | 1989-01-01 | Paper |
Universal traversal sequences of length \(n^{0(\log \,n)}\) for cliques
Information Processing Letters | 1988-01-01 | Paper |
Probabilistic communication complexity
Journal of Computer and System Sciences | 1986-01-01 | Paper |
