| Publication | Date of Publication | Type |
|---|
| Direct bulk-synchronous parallel algorithms | 2022-12-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5069420 | 2022-04-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4631547 | 2019-04-08 | Paper |
| Some observations on holographic algorithms | 2018-11-07 | Paper |
| Robust logics | 2016-09-29 | Paper |
| Evolvability | 2015-11-11 | Paper |
| A neuroidal architecture for cognitive computation | 2015-09-19 | Paper |
| Quantum computers that can be simulated classically in polynomial time | 2015-02-27 | Paper |
| The Hippocampus as a Stable Memory Allocator for Cortex | 2013-07-23 | Paper |
| The Complexity of Symmetric Boolean Parity Holant Problems | 2013-07-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3165977 | 2012-10-19 | Paper |
| The Complexity of Symmetric Boolean Parity Holant Problems | 2011-07-06 | Paper |
| A bridging model for multi-core computing | 2011-01-18 | Paper |
| Some Observations on Holographic Algorithms | 2010-04-27 | Paper |
| Experience-Induced Neural Circuits That Achieve High Capacity | 2009-10-12 | Paper |
| A Bridging Model for Multi-core Computing | 2008-11-25 | Paper |
| Holographic Algorithms | 2008-10-28 | Paper |
| Evolvability | 2008-09-17 | Paper |
| A quantitative theory of neural computation | 2007-07-17 | Paper |
| Computing and Combinatorics | 2006-01-11 | Paper |
| Automata, Languages and Programming | 2006-01-10 | Paper |
| Memorization and Association on a Realistic Neural Model | 2005-04-29 | Paper |
| Corrigendum to ``Expressiveness of matchgates | 2003-05-25 | Paper |
| Expressiveness of matchgates. | 2003-01-21 | Paper |
| Quantum Circuits That Can Be Simulated Classically in Polynomial Time | 2002-09-29 | Paper |
| Robust logics | 2000-06-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4231905 | 2000-04-26 | Paper |
| Projection learning | 2000-02-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4385523 | 1998-05-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4858551 | 1995-12-14 | Paper |
| Learning Boolean formulas | 1995-04-10 | Paper |
| Cryptographic limitations on learning Boolean formulae and finite automata | 1995-03-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4302466 | 1994-09-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4036702 | 1993-05-18 | Paper |
| A general lower bound on the number of examples needed for learning | 1989-01-01 | Paper |
| Optimally universal parallel computers | 1988-01-01 | Paper |
| Computational limitations on learning from examples | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3777952 | 1987-01-01 | Paper |
| Random generation of combinatorial structures from a uniform distribution | 1986-01-01 | Paper |
| NP is as easy as detecting unique solutions | 1986-01-01 | Paper |
| Negation is Powerless for Boolean Slice Functions | 1986-01-01 | Paper |
| Short monotone formulae for the majority function | 1984-01-01 | Paper |
| Deductive learning | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3707409 | 1984-01-01 | Paper |
| A theory of the learnable | 1984-01-01 | Paper |
| Size bounds for superconcentrators | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3662623 | 1983-01-01 | Paper |
| Optimality of a Two-Phase Strategy for Routing in Interconnection Networks | 1983-01-01 | Paper |
| Reducibility by algebraic projections | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3929052 | 1982-01-01 | Paper |
| A Scheme for Fast Parallel Communication | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3343438 | 1981-01-01 | Paper |
| Universality considerations in VLSI circuits | 1981-01-01 | Paper |
| A fast parallel algorithm for routing in permutation networks | 1981-01-01 | Paper |
| Negation can be exponentially powerful | 1980-01-01 | Paper |
| Computing multivariate polynomials in parallel | 1980-01-01 | Paper |
| The complexity of computing the permanent | 1979-01-01 | Paper |
| Fast probabilistic algorithms for Hamiltonian circuits and matchings | 1979-01-01 | Paper |
| The Complexity of Enumeration and Reliability Problems | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3861406 | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4184337 | 1978-01-01 | Paper |
| On Time Versus Space | 1977-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4164821 | 1977-01-01 | Paper |
| Relative complexity of checking and evaluating | 1976-01-01 | Paper |
| Circuit size is nonlinear in depth | 1976-01-01 | Paper |
| Graph-theoretic properties in computational complexity | 1976-01-01 | Paper |
| Shifting Graphs and Their Applications | 1976-01-01 | Paper |
| A note on the succinctness of descriptions of deterministic languages | 1976-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4131650 | 1976-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4136591 | 1976-01-01 | Paper |
| Universal circuits (Preliminary Report) | 1976-01-01 | Paper |
| Deterministic one-counter automata | 1975-01-01 | Paper |
| General context-free recognition in less than cubic time | 1975-01-01 | Paper |
| Regularity and Related Problems for Deterministic Pushdown Automata | 1975-01-01 | Paper |
| Parallelism in Comparison Problems | 1975-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4138137 | 1975-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4131027 | 1974-01-01 | Paper |
| The equivalence problem for deterministic finite-turn pushdown automata | 1974-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4109594 | 1973-01-01 | Paper |
