| Publication | Date of Publication | Type |
|---|
| Uniform, Integral, and Feasible Proofs for the Determinant Identities | 2022-12-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5075294 | 2022-05-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5144645 | 2021-01-19 | Paper |
| The optimal location of replicas in a network using a READ-ONE-WRITE-ALL policy | 2020-12-03 | Paper |
| Lower Bounds for Nondeterministic Semantic Read-Once Branching Programs | 2017-12-19 | Paper |
| The strength of replacement in weak arithmetic | 2017-07-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2958529 | 2017-02-02 | Paper |
| The complexity of the comparator circuit value problem | 2016-10-24 | Paper |
| The importance of the P versus NP question | 2015-12-07 | Paper |
| Pebbles and Branching Programs for Tree Evaluation | 2015-09-24 | Paper |
| Complexity Theory for Operators in Analysis | 2015-09-24 | Paper |
| The Hardness of Being Private | 2015-09-07 | Paper |
| Complexity theory for operators in analysis | 2014-08-13 | Paper |
| Variations on pushdown machines (Detailed Abstract) | 2014-03-14 | Paper |
| Connecting Complexity Classes, Weak Formal Theories, and Propositional Proof Systems (Invited Talk) | 2012-11-22 | Paper |
| Fractional pebbling and thrifty branching programs | 2012-10-24 | Paper |
| A Formal Theory for the Complexity Class Associated with the Stable Marriage Problem | 2012-09-18 | Paper |
| Formalizing Randomized Matching Algorithms | 2012-08-15 | Paper |
| Formal Theories for Linear Algebra | 2012-04-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3589189 | 2010-09-20 | Paper |
| Formal Theories for Linear Algebra | 2010-09-03 | Paper |
| Branching Programs for Tree Evaluation | 2009-10-16 | Paper |
| Consequences of the provability of NP ⊆ P/poly | 2008-02-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3373046 | 2006-03-13 | Paper |
| Quantified propositional calculus and a second-order theory for NC\(^{\text \textbf{1}}\) | 2005-09-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5465359 | 2005-08-22 | Paper |
| The proof complexity of linear algebra | 2004-11-18 | Paper |
| A second-order system for polytime reasoning based on Grädel's theorem. | 2003-11-25 | Paper |
| A Complete Axiomatization for Blocks World | 2003-11-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4234077 | 2002-01-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4489064 | 2000-07-09 | Paper |
| The relative complexity of NP search problems | 1999-09-13 | Paper |
| An exponential lower bound for the size of monotone real circuits | 1999-05-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4375787 | 1998-06-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4375756 | 1998-06-02 | Paper |
| A tight relationship between generic oracles and type-2 complexity theory | 1997-10-07 | Paper |
| A new Characterization of Type-2 Feasibility | 1996-06-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4302459 | 1994-09-13 | Paper |
| Parallel pointer machines | 1994-02-09 | Paper |
| Functional interpretations of feasibly constructive arithmetic | 1993-10-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4035304 | 1993-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4035305 | 1993-05-18 | Paper |
| A new recursion-theoretic characterization of the polytime functions | 1993-04-01 | Paper |
| An Optimal Parallel Algorithm for Formula Evaluation | 1993-01-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4010352 | 1992-09-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4011103 | 1992-09-27 | Paper |
| A feasibly constructive lower bound for resolution proofs | 1990-01-01 | Paper |
| Complexity theory of parallel time and hardware | 1989-01-01 | Paper |
| Two Applications of Inductive Counting for Complementation Problems | 1989-01-01 | Paper |
| Short propositional formulas represent nondeterministic computations | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3759939 | 1987-01-01 | Paper |
| Problems complete for deterministic logarithmic space | 1987-01-01 | Paper |
| The Parallel Complexity of Abelian Permutation Group Problems | 1987-01-01 | Paper |
| Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes | 1986-01-01 | Paper |
| Log Depth Circuits for Division and Related Problems | 1986-01-01 | Paper |
| A Depth-Universal Circuit | 1985-01-01 | Paper |
| A taxonomy of problems with fast parallel algorithms | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3311653 | 1983-01-01 | Paper |
| The recognition of deterministic CFLs in small time and space | 1983-01-01 | Paper |
| Parallel computation for well-endowed rings and space-bounded probabilistic machines | 1983-01-01 | Paper |
| An overview of computational complexity | 1983-01-01 | Paper |
| A Time-Space Tradeoff for Sorting on a General Sequential Model of Computation | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3944008 | 1982-01-01 | Paper |
| Towards a complexity theory of synchronous parallel computation | 1981-01-01 | Paper |
| Corrigendum: Soundness and Completeness of an Axiom System for Program Verification | 1981-01-01 | Paper |
| Space Lower Bounds for Maze Threadability on Restricted Machines | 1980-01-01 | Paper |
| The relative efficiency of propositional proof systems | 1979-01-01 | Paper |
| Soundness and Completeness of an Axiom System for Program Verification | 1978-01-01 | Paper |
| Storage requirements for deterministic polynomial time recognizable languages | 1976-01-01 | Paper |
| On the Number of Additions to Compute Specific Polynomials | 1976-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4131610 | 1975-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4133141 | 1975-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4138187 | 1975-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4160375 | 1975-01-01 | Paper |
| An observation on time-storage trade off | 1974-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4152212 | 1974-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4164258 | 1974-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4199563 | 1974-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4777267 | 1974-01-01 | Paper |
| A hierarchy for nondeterministic time complexity | 1973-01-01 | Paper |
| Time bounded random access machines | 1973-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4061993 | 1973-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4133134 | 1972-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4134974 | 1972-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5670175 | 1972-01-01 | Paper |
| Characterizations of Pushdown Machines in Terms of Time-Bounded Computers | 1971-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5638290 | 1971-01-01 | Paper |
| The complexity of theorem-proving procedures | 1971-01-01 | Paper |
| On the Minimum Computation Time of Functions | 1969-01-01 | Paper |
| Characterizations of ordinal numbers in set theory | 1966-01-01 | Paper |
| The Solvability of the Derivability Problem for One-Normal Systems | 1966-01-01 | Paper |
