| Publication | Date of Publication | Type |
|---|
| https://portal.mardi4nfdi.de/entity/Q5111351 | 2020-05-27 | Paper |
| Subquadratic algorithms for succinct stable matching | 2019-05-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5743451 | 2019-05-10 | Paper |
| On Problems as Hard as CNF-SAT | 2018-11-05 | Paper |
| Beating Brute Force for Systems of Polynomial Equations over Finite Fields | 2018-07-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4607895 | 2018-03-15 | Paper |
| Subquadratic algorithms for succinct stable matching | 2016-07-25 | Paper |
| Nondeterministic Extensions of the Strong Exponential Time Hypothesis and Consequences for Non-reducibility | 2016-04-15 | Paper |
| Size-depth trade-offs for threshold circuits | 2015-05-07 | Paper |
| Jealousy Graphs: Structure and Complexity of Decentralized Stable Matching | 2015-01-12 | Paper |
| On the complexity of circuit satisfiability | 2014-08-13 | Paper |
| Finding Heavy Hitters from Lossy or Noisy Data | 2013-10-04 | Paper |
| On the exact complexity of evaluating quantified \(k\)-\textsc{cnf} | 2013-05-16 | Paper |
| Common Knowledge and State-Dependent Equilibria | 2013-03-13 | Paper |
| On the Exact Complexity of Evaluating Quantified k-CNF | 2010-12-07 | Paper |
| Uniquely Satisfiable k-SAT Instances with Almost Minimal Occurrences of Each Variable | 2010-09-29 | Paper |
| The Complexity of Satisfiability of Small Depth Circuits | 2010-01-14 | Paper |
| k-SAT Is No Harder Than Decision-Unique-k-SAT | 2009-08-18 | Paper |
| An improved exponential-time algorithm for k -SAT | 2008-12-21 | Paper |
| The complexity of Unique \(k\)-SAT: An isolation lemma for \(k\)-CNFs | 2008-03-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5460925 | 2005-07-20 | Paper |
| On the complexity of \(k\)-SAT | 2002-08-14 | Paper |
| Which problems have strongly exponential complexity? | 2002-07-04 | Paper |
| Scalable network architectures using the optical transpose interconnection system (OTIS) | 2001-10-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4526973 | 2001-02-28 | Paper |
| Exponential lower bounds for depth three Boolean circuits | 2000-12-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4484662 | 2000-05-29 | Paper |
| Dimension of Projections in Boolean Functions | 1998-09-21 | Paper |
| Size--Depth Tradeoffs for Threshold Circuits | 1997-05-26 | Paper |
| Approximating threshold circuits by rational functions | 1995-08-27 | Paper |
| The light bulb problem | 1995-07-06 | Paper |
| Effect of connectivity in an associative memory model | 1994-01-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4013544 | 1992-09-27 | Paper |
| Milking the Aanderaa argument | 1990-01-01 | Paper |
| There are no p-complete families of symmetric Boolean functions | 1989-01-01 | Paper |
| Universal traversal sequences of length \(n^{0(\log \,n)}\) for cliques | 1988-01-01 | Paper |
| Probabilistic communication complexity | 1986-01-01 | Paper |
