| Publication | Date of Publication | Type |
|---|
| Edge Estimation with Independent Set Oracles | 2023-04-26 | Paper |
| Separating the power of EREW and CREW PRAMs with small communication width | 2023-01-18 | Paper |
| Distributed computing on transitive networks: The torus | 2022-08-16 | Paper |
| Towards verifying nonlinear integer arithmetic | 2022-08-12 | Paper |
| Exact Model Counting of Query Expressions | 2021-11-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4993273 | 2021-06-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4993304 | 2021-06-15 | Paper |
| On the Bias of Reed--Muller Codes over Odd Prime Fields | 2020-06-09 | Paper |
| Towards verifying nonlinear integer arithmetic | 2020-02-11 | Paper |
| Nondeterminism and An Abstract Formulation of Nečiporuk’s Lower Bound Method | 2019-12-06 | Paper |
| Massively-Parallel Similarity Join, Edge-Isoperimetry, and Distance Correlations on the Hypercube | 2018-07-16 | Paper |
| Communication Steps for Parallel Query Processing | 2018-05-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5276187 | 2017-07-14 | Paper |
| Optimal bounds for the predecessor problem | 2016-09-29 | Paper |
| Time-Space Trade-offs in Resolution: Superpolynomial Lower Bounds for Superlinear Space | 2016-09-02 | Paper |
| Time-space trade-off lower bounds for randomized computation of decision problems | 2015-12-07 | Paper |
| Finding the Median (Obliviously) with Bounded Space | 2015-10-27 | Paper |
| Formula Caching in DPLL | 2015-09-24 | Paper |
| The Value of Multiple Read/Write Streams for Approximating Frequency Moments | 2015-09-24 | Paper |
| Hardness amplification in proof complexity | 2014-08-13 | Paper |
| Multiparty Communication Complexity and Threshold Circuit Size of AC^0 | 2014-07-25 | Paper |
| Time-space tradeoffs in resolution | 2014-05-13 | Paper |
| Multiparty Communication Complexity and Threshold Circuit Size of $\ensuremath{\sfAC}^0$ | 2012-09-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2906797 | 2012-09-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3002822 | 2011-05-24 | Paper |
| Time-space tradeoffs, multiparty communication complexity, and nearest-neighbor problems | 2010-08-05 | Paper |
| Theory and Applications of Satisfiability Testing | 2009-07-24 | Paper |
| Longest Common Subsequences in Sets of Permutations | 2009-04-09 | Paper |
| Lower Bounds for Lovász–Schrijver Systems and Beyond Follow from Multiparty Communication Complexity | 2008-06-19 | Paper |
| The resolution complexity of independent sets and vertex covers in random graphs | 2008-03-05 | Paper |
| Separating Deterministic from Nondeterministic NOF Multiparty Communication Complexity | 2007-11-28 | Paper |
| A strong direct product theorem for corruption and the multiparty communication complexity of disjointness | 2007-11-14 | Paper |
| Automata, Languages and Programming | 2006-01-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5715680 | 2006-01-04 | Paper |
| Theory and Applications of Satisfiability Testing | 2005-12-15 | Paper |
| Bounded-Depth Frege Lower Bounds for Weaker Pigeonhole Principles | 2005-02-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4650571 | 2005-02-18 | Paper |
| Optimal bounds for the predecessor problem and related problems | 2003-05-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4542576 | 2002-08-01 | Paper |
| Time-space tradeoffs for branching programs | 2002-07-04 | Paper |
| The Efficiency of Resolution and Davis--Putnam Procedures | 2002-04-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4234077 | 2002-01-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4790380 | 2001-01-01 | Paper |
| Improved depth lower bounds for small distance connectivity | 2000-10-17 | Paper |
| The relative complexity of NP search problems | 1999-09-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252755 | 1999-08-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4399249 | 1999-03-14 | Paper |
| A Time-Space Tradeoff for Undirected Graph Traversal by Walking Automata | 1999-02-22 | Paper |
| Separating the power of EREW and CREW PRAMs with small communication width | 1998-06-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4375784 | 1998-02-08 | Paper |
| Time-space tradeoffs for undirected graph traversal by graph automata | 1997-10-13 | Paper |
| Lower Bounds on Hilbert's Nullstellensatz and Propositional Proofs | 1996-12-05 | Paper |
| An exponential separation between the parity principle and the pigeonhole principle | 1996-11-25 | Paper |
| Parallel algorithms for arrangements | 1996-02-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3138895 | 1994-09-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4302459 | 1994-09-13 | Paper |
| Communication-Space Tradeoffs for Unrestricted Protocols | 1994-08-14 | Paper |
| Exponential lower bounds for the pigeonhole principle | 1993-10-18 | Paper |
| The complexity of computing symmetric functions using threshold circuits | 1992-09-27 | Paper |
| Optimal bounds for decision problems on the CRCW PRAM | 1992-06-25 | Paper |
| A general Sequential Time-Space Tradeoff for Finding Unique Elements | 1991-01-01 | Paper |
| Lower bounds for recognizing small cliques on CRCW PRAM's | 1990-01-01 | Paper |
| A note on error expressions for reflected and averaged implicit Runge- Kutta methods | 1989-01-01 | Paper |
| Limits on the power of concurrent-write parallel machines | 1988-01-01 | Paper |
| Log Depth Circuits for Division and Related Problems | 1986-01-01 | Paper |
