| Publication | Date of Publication | Type |
|---|
| https://portal.mardi4nfdi.de/entity/Q5075308 | 2022-05-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5857675 | 2021-04-02 | Paper |
| How to store a triangular matrix | 2018-09-14 | Paper |
| DNA2DNA computations: A potential “killer app”? | 2018-07-04 | Paper |
| Provably Secure Virus Detection: Using The Observer Effect Against Malware. | 2017-12-19 | Paper |
| Provably-Secure Remote Memory Attestation for Heap Overflow Protection | 2016-10-21 | Paper |
| Simple strategies for large zero-sum games with applications to complexity theory | 2016-09-01 | Paper |
| Polynomial-time algorithm for the orbit problem | 2016-01-04 | Paper |
| Time-space lower bounds for satisfiability | 2015-12-04 | Paper |
| Algorithms for Black-Box Fields and their Application to Cryptography | 2015-11-11 | Paper |
| A \(p\)-adic approach to the Jacobian conjecture | 2015-02-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2922358 | 2014-10-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5414632 | 2014-05-07 | Paper |
| People, Problems, and Proofs | 2013-12-06 | Paper |
| An Approximate Restatement of the Four-Color Theorem | 2013-10-29 | Paper |
| Amplifying circuit lower bounds against polynomial time, with applications | 2013-07-19 | Paper |
| Algorithms for Message Ferrying on Mobile ad hoc Networks | 2012-10-24 | Paper |
| Improved simulation of nondeterministic Turing machines | 2012-03-13 | Paper |
| Symmetric Functions Capture General Functions | 2011-08-17 | Paper |
| Best-order streaming model | 2011-05-18 | Paper |
| On Tractable Exponential Sums | 2010-09-07 | Paper |
| Improved Simulation of Nondeterministic Turing Machines | 2010-09-03 | Paper |
| On the Fourier spectrum of symmetric Boolean functions | 2010-08-13 | Paper |
| The P=NP Question and Gödel’s Lost Letter | 2010-08-03 | Paper |
| Deterministically testing sparse polynomial identities of unbounded degree | 2010-06-16 | Paper |
| Fundamentals of Computation Theory | 2010-04-20 | Paper |
| FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science | 2009-08-06 | Paper |
| Polynomials that sign represent parity and Descartes' rule of signs | 2009-06-17 | Paper |
| Best-Order Streaming Model | 2009-06-03 | Paper |
| Stochastic Algorithms: Foundations and Applications | 2009-05-26 | Paper |
| LATIN 2004: Theoretical Informatics | 2009-05-07 | Paper |
| Algorithms for Modular Counting of Roots of Multivariate Polynomials | 2008-09-18 | Paper |
| Inapproximability results for combinatorial auctions with submodular utility functions | 2008-09-12 | Paper |
| Algorithms for modular counting of roots of multivariate polynomials | 2008-04-23 | Paper |
| Intrusion-Resilient Key Exchange in the Bounded Retrieval Model | 2007-08-30 | Paper |
| Theory of Cryptography | 2007-02-12 | Paper |
| Symmetric polynomials over \(\mathbb Z_{m}\) and simultaneous communication protocols | 2006-04-28 | Paper |
| Financial Cryptography and Data Security | 2005-12-22 | Paper |
| FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science | 2005-08-12 | Paper |
| Some Remarks on the Jacobian Conjecture and Connections with Hilbert's Irreducibility Theorem | 2005-07-26 | Paper |
| Estimating the maximum | 2005-02-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4471369 | 2004-07-28 | Paper |
| On the importance of eliminating errors in cryptographic computations | 2003-08-26 | Paper |
| A note on square rooting of time functions of Turing machines | 2003-08-26 | Paper |
| On the complexity of intersecting finite state automata and \(\mathcal{NL}\) versus \(\mathcal{NP}\) | 2003-08-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4762310 | 2001-02-22 | Paper |
| The Complexity of theA B CProblem | 2000-10-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4224916 | 2000-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4942658 | 2000-03-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4263678 | 1999-11-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4230375 | 1999-11-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4224901 | 1999-01-17 | Paper |
| Reconstructing Algebraic Functions from Mixed Data | 1998-09-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3128889 | 1997-10-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4341754 | 1997-09-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4343414 | 1997-07-06 | Paper |
| On the computational power of DNA | 1997-04-21 | Paper |
| On proving that a graph has no large clique: A connection with Ramsey theory | 1997-02-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4847917 | 1996-07-28 | Paper |
| Query size estimation by adaptive sampling | 1996-02-13 | Paper |
| Subquadratic Simulations of Balanced Formulae by Branching Programs | 1994-08-14 | Paper |
| PSPACE is provable by two provers in one round | 1994-04-27 | Paper |
| A Monte-Carlo Algorithm for Estimating the Permanent | 1993-05-17 | Paper |
| Clocked adversaries for hashing | 1993-05-16 | Paper |
| On games of incomplete information | 1993-01-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3975930 | 1992-06-26 | Paper |
| Set systems with no union of cardinality 0 modulo \(m\) | 1992-06-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3210157 | 1991-01-01 | Paper |
| The processor identity problem | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3355236 | 1990-01-01 | Paper |
| Unbounded fan-in circuits and associative functions | 1985-01-01 | Paper |
| Pseudorandom number generation and space complexity | 1985-01-01 | Paper |
| Alternating Pushdown and Stack Automata | 1984-01-01 | Paper |
| Alternation bounded auxiliary pushdown automata | 1984-01-01 | Paper |
| VLSI Layout as Programming | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3321475 | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3341893 | 1983-01-01 | Paper |
| Turing machines that take advice | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3957950 | 1982-01-01 | Paper |
| Computing extremal and approximate distances in graphs having unit cost edges | 1981-01-01 | Paper |
| On the structure of sets in NP and other complexity classes | 1981-01-01 | Paper |
| Covering Graphs by Simple Circuits | 1981-01-01 | Paper |
| Social processes and proofs of theorems and programs | 1980-01-01 | Paper |
| Space-Time Trade-Offs in Structured Programming | 1980-01-01 | Paper |
| External Hashing Schemes for Collections of Data Structures | 1980-01-01 | Paper |
| Addition Chain Methods for the Evaluation of Specific Polynomials | 1980-01-01 | Paper |
| Applications of a Planar Separator Theorem | 1980-01-01 | Paper |
| Linear programming is log-space hard for P | 1979-01-01 | Paper |
| On the complexity of computations under varying sets of primitives | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3852167 | 1979-01-01 | Paper |
| A Separator Theorem for Planar Graphs | 1979-01-01 | Paper |
| A constructive generalization of the borel-cantelli lemma with application to the complexity of infinite strings | 1979-01-01 | Paper |
| Generalized Nested Dissection | 1979-01-01 | Paper |
| Evaluation of polynomials with super-preconditioning | 1978-01-01 | Paper |
| The enforcement of security policies for computation | 1978-01-01 | Paper |
| A batching method for coloring planar graphs | 1978-01-01 | Paper |
| A probabilistic remark on algebraic program testing | 1978-01-01 | Paper |
| A lower bound of \({1\over 2}n^2\) on linear search programs for the knapsack problem | 1978-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4151711 | 1978-01-01 | Paper |
| Polynomials with 0-1 Coefficients That are Hard to Evaluate | 1978-01-01 | Paper |
| Preserving average proximity in arrays | 1978-01-01 | Paper |
| Complexity measures and hierarchies for the evaluation of integers and polynomials | 1977-01-01 | Paper |
| Synchronization and computing capabilities of linear asynchronous structures | 1977-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3206972 | 1977-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3906497 | 1977-01-01 | Paper |
| A Linear Time Algorithm for Deciding Subject Security | 1977-01-01 | Paper |
| Word Problems Solvable in Logspace | 1977-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4195944 | 1977-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4195948 | 1977-01-01 | Paper |
| Space and Time Hierarchies for Classes of Control Structures and Data Structures | 1976-01-01 | Paper |
| Multidimensional Searching Problems | 1976-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4136563 | 1976-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4152749 | 1976-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4158480 | 1976-01-01 | Paper |
| Reduction | 1975-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4080721 | 1975-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4134929 | 1975-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4195939 | 1975-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4068103 | 1974-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4134963 | 1974-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4134996 | 1974-01-01 | Paper |
