| Publication | Date of Publication | Type |
|---|
| On efficient range-summability of IID random variables in two or higher dimensions | 2024-10-08 | Paper |
| A dyadic simulation approach to efficient range-summability | 2024-04-25 | Paper |
| A dyadic simulation approach to efficient range-summability | 2024-04-23 | Paper |
| Synchronous Boolean finite dynamical systems on directed graphs over XOR functions | 2023-07-26 | Paper |
| In memoriam: Alan L. Selman (1941--2021) | 2023-07-26 | Paper |
| Properties of probabilistic pushdown automata | 2022-12-09 | Paper |
| Synchronous Boolean Finite Dynamical Systems on Directed Graphs over XOR Functions | 2022-07-18 | Paper |
| Generalized Predecessor Existence Problems for Boolean Finite Dynamical Systems | 2020-05-26 | Paper |
| Generalized predecessor existence problems for Boolean finite dynamical systems on directed graphs | 2019-02-28 | Paper |
| Computational complexity studies of synchronous Boolean finite dynamical systems on directed graphs | 2017-09-28 | Paper |
| A hierarchical model of data locality | 2017-08-21 | Paper |
| Computational Complexity Studies of Synchronous Boolean Finite Dynamical Systems | 2015-09-30 | Paper |
| Time and space complexity for splicing systems | 2010-10-06 | Paper |
| On the autoreducibility of functions | 2010-05-10 | Paper |
| LATIN 2004: Theoretical Informatics | 2009-05-07 | Paper |
| Complexity Theory for Splicing Systems | 2007-11-28 | Paper |
| Complexity theory for splicing systems | 2007-10-25 | Paper |
| Very Sparse Leaf Languages | 2007-09-05 | Paper |
| Autoreducibility, mitoticity, and immunity | 2007-05-30 | Paper |
| Mathematical Foundations of Computer Science 2005 | 2006-10-20 | Paper |
| Mathematical Foundations of Computer Science 2005 | 2006-10-20 | Paper |
| The complexity of finding top-Toda-equivalence-class members | 2006-10-16 | Paper |
| The enumerability of P collapses P to NC | 2005-12-06 | Paper |
| Mathematical Foundations of Computer Science 2004 | 2005-08-22 | Paper |
| Competing provers yield improved Karp-Lipton collapse results | 2005-05-04 | Paper |
| On the reducibility of sets inside NP to sets with low information content | 2005-02-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4823533 | 2004-10-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4437082 | 2003-12-07 | Paper |
| The (Non)enumerability of the determinant and the rank | 2003-08-26 | Paper |
| A note on square rooting of time functions of Turing machines | 2003-08-26 | Paper |
| The complexity of counting self-avoiding walks in subgraphs of two-dimensional grids and hypercubes. | 2003-08-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4418679 | 2003-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4410523 | 2003-07-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4410519 | 2003-07-03 | Paper |
| Tally NP sets and easy census functions. | 2003-01-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4779175 | 2002-11-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4536375 | 2002-11-04 | Paper |
| Reducing the number of solutions of NP functions | 2002-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4530863 | 2002-06-09 | Paper |
| PlanMine: Prediction plan failures using sequence mining | 2002-05-02 | Paper |
| The complexity theory companion | 2001-02-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4525684 | 2001-01-24 | Paper |
| The complexity of matrix rank and feasible systems of linear equations | 2000-12-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252720 | 2000-04-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4263690 | 1999-11-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4228457 | 1999-10-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4259984 | 1999-09-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4218122 | 1999-06-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4228466 | 1999-05-18 | Paper |
| Properties of probabilistic pushdown automata | 1999-01-12 | Paper |
| The PL Hierarchy Collapses | 1998-09-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3838833 | 1998-08-13 | Paper |
| Universally serializable computation | 1998-08-04 | Paper |
| Oracles That Compute Values | 1998-02-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4359456 | 1997-10-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4336273 | 1997-08-11 | Paper |
| On closure properties of \(\#\text{P}\) in the context of \(\text{PF} \circ \#\text{P}\) | 1997-03-31 | Paper |
| \(p\)-Selective sets and reducing search to decision vs. self-reducibility | 1997-03-31 | Paper |
| Functions computable with limited access to NP | 1997-02-27 | Paper |
| Reducibility classes of P-selective sets | 1997-02-27 | Paper |
| On helping by parity-like languages | 1997-02-27 | Paper |
| Relationships among $PL$, $\#L$, and the determinant | 1996-11-10 | Paper |
| Computing Solutions Uniquely Collapses the Polynomial Hierarchy | 1996-10-16 | Paper |
| Equivalence of NC\(^ k\) and AC\(^{k-1}\) closures of NP and other classes | 1996-09-15 | Paper |
| NONDETERMINISTICALLY SELECTIVE SETS | 1996-08-13 | Paper |
| ON SERIALIZABLE LANGUAGES | 1996-01-28 | Paper |
| Polynomial-Time Membership Comparable Sets | 1995-11-29 | Paper |
| Space-efficient recognition of sparse self-reducible languages | 1995-05-14 | Paper |
