| Publication | Date of Publication | Type |
|---|
| Pinpointing computation with modular queries in the Boolean hierarchy | 2024-07-05 | Paper |
| Sorting n objects with a k-sorter | 2018-09-14 | Paper |
| Molecular computing, bounded nondeterminism, and efficient recursion | 2018-07-04 | Paper |
| On the sizes of DPDAs, PDAs, LBAs | 2016-06-16 | Paper |
| A NOTE ON THE POLYNOMIAL REPRESENTATION OF BOOLEAN FUNCTIONS OVER GF(2) | 2015-04-29 | Paper |
| A Dense Hierarchy of Sublinear Time Approximation Schemes for Bin Packing | 2012-07-16 | Paper |
| Algorithms and Computation | 2009-08-07 | Paper |
| Square-Difference-Free Sets of Size Omega(n^{0.7334...}) | 2008-04-30 | Paper |
| The Multiparty Communication Complexity of Exact-T: Improved Bounds and New Problems | 2007-09-05 | Paper |
| Infinitely‐Often Autoreducible Sets | 2007-06-26 | Paper |
| A tight lower bound for restricted PIR protocols | 2006-09-28 | Paper |
| Enumerations of the Kolmogorov function | 2006-08-03 | Paper |
| Algorithms and Computation | 2005-12-22 | Paper |
| 3-coloring in time | 2005-02-22 | Paper |
| Learning a Hidden Matching | 2005-02-21 | Paper |
| Algorithms for four variants of the exact satisfiability problem | 2004-08-10 | Paper |
| Some connections between bounded query classes and non-uniform complexity. | 2004-03-14 | Paper |
| Commutative queries | 2003-01-14 | Paper |
| Optimal series-parallel trade-offs for reducing a function to its own graph | 2003-01-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4542529 | 2002-08-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4542538 | 2002-08-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2757846 | 2001-12-04 | Paper |
| The complexity of modular graph automorphism | 2001-03-19 | Paper |
| Circuits over PP and PL | 2001-03-12 | Paper |
| The complexity of ODDnA | 2000-06-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252742 | 2000-06-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252729 | 2000-04-26 | Paper |
| A comparison of resource-bounded molecular computation models | 2000-04-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4263688 | 1999-09-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4258581 | 1999-09-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252376 | 1999-06-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4246733 | 1999-06-15 | Paper |
| Molecular computing, bounded nondeterminism, and efficient recursion | 1999-01-01 | Paper |
| Addition in \(\log_{2} n+O(1)\) steps on average. A simple analysis | 1998-08-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4381387 | 1998-07-16 | Paper |
| Upper and lower bounds for some depth-3 circuit classes | 1998-07-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4375806 | 1998-05-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3128933 | 1997-04-23 | Paper |
| Frequency computation and bounded queries | 1997-02-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4715507 | 1996-11-17 | Paper |
| Approximable sets | 1996-04-16 | Paper |
| PP is closed under intersection | 1995-06-08 | Paper |
| Quantifying the amount of verboseness | 1995-05-28 | Paper |
| Representing Boolean functions as polynomials modulo composite numbers | 1995-04-06 | Paper |
| On ACC | 1995-04-06 | Paper |
| Perceptrons, PP, and the polynomial hierarchy | 1995-04-06 | Paper |
| When do extra majority gates help? Polylog\((N)\) majority gates are equivalent to one | 1995-04-06 | Paper |
| The expressive power of voting polynomials | 1994-08-11 | Paper |
| Almost-everywhere complexity hierarchies for nondeterministic time | 1993-09-16 | Paper |
| A relationship between difference hierarchies and relativized polynomial hierarchies | 1993-08-22 | Paper |
| Terse, superterse, and verbose sets | 1993-06-29 | Paper |
| Counting classes: Thresholds, parity, mods, and fewness | 1993-01-16 | Paper |
| On being incoherent without being very hard | 1993-01-16 | Paper |
| The Mapmaker's dilemma | 1992-06-28 | Paper |
| Irrationality Without Number Theory | 1992-06-27 | Paper |
| Bounded queries to SAT and the Boolean hierarchy | 1992-06-26 | Paper |
| Probabilistic polynomial time is closed under parity reductions | 1991-01-01 | Paper |
| Relativized counting classes: Relations among thresholds, parity, and mods | 1991-01-01 | Paper |
| Counting classes: Thresholds, parity, mods, and fewness | 1990-01-01 | Paper |
| Unbounded Searching Algorithms | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3355230 | 1990-01-01 | Paper |
| Bi-immunity results for cheatable sets | 1990-01-01 | Paper |
| Bounded query classes and the difference hierarchy | 1989-01-01 | Paper |
| On the complexity of finding the chromatic number of a recursive graph. II: The unbounded case | 1989-01-01 | Paper |
| On the complexity of finding the chromatic number of a recursive graph. I: The bounded case | 1989-01-01 | Paper |
| Nondeterministic bounded query reducibilities | 1989-01-01 | Paper |
| Rearranging Terms in Alternating Series | 1981-01-01 | Paper |
