| Publication | Date of Publication | Type |
|---|
Direct bulk-synchronous parallel algorithms
Algorithm Theory — SWAT '92 | 2022-12-09 | Paper |
| Probably approximately correct. Nature's algorithms for learning and prospering in a complex world | 2022-04-15 | Paper |
| Probably approximately correct. Nature's algorithms for learning and thriving in a complex world. Translated by Ivan Lavallée. With a preface by Cédric Villani | 2019-04-08 | Paper |
Some observations on holographic algorithms
Computational Complexity | 2018-11-07 | Paper |
Robust logics
Proceedings of the thirty-first annual ACM symposium on Theory of Computing | 2016-09-29 | Paper |
Evolvability
Journal of the ACM | 2015-11-11 | Paper |
A neuroidal architecture for cognitive computation
Journal of the ACM | 2015-09-19 | Paper |
Quantum computers that can be simulated classically in polynomial time
Proceedings of the thirty-third annual ACM symposium on Theory of computing | 2015-02-27 | Paper |
The hippocampus as a stable memory allocator for cortex
Neural Computation | 2013-07-23 | Paper |
The complexity of symmetric Boolean parity Holant problems
SIAM Journal on Computing | 2013-07-04 | Paper |
| Knowledge infusion: in pursuit of robustness in artificial intelligence | 2012-10-19 | Paper |
The complexity of symmetric Boolean parity Holant problems (extended abstract)
Automata, Languages and Programming | 2011-07-06 | Paper |
A bridging model for multi-core computing
Journal of Computer and System Sciences | 2011-01-18 | Paper |
Some observations on holographic algorithms
LATIN 2010: Theoretical Informatics | 2010-04-27 | Paper |
Experience-Induced Neural Circuits That Achieve High Capacity
Neural Computation | 2009-10-12 | Paper |
A Bridging Model for Multi-core Computing
Algorithms - ESA 2008 | 2008-11-25 | Paper |
Holographic Algorithms
SIAM Journal on Computing | 2008-10-28 | Paper |
Evolvability
Mathematical Foundations of Computer Science 2007 | 2008-09-17 | Paper |
A quantitative theory of neural computation
Biological Cybernetics | 2007-07-17 | Paper |
Computing and Combinatorics
Lecture Notes in Computer Science | 2006-01-11 | Paper |
Automata, Languages and Programming
Lecture Notes in Computer Science | 2006-01-10 | Paper |
Memorization and Association on a Realistic Neural Model
Neural Computation | 2005-04-29 | Paper |
Corrigendum to ``Expressiveness of matchgates
Theoretical Computer Science | 2003-05-25 | Paper |
Expressiveness of matchgates.
Theoretical Computer Science | 2003-01-21 | Paper |
Quantum Circuits That Can Be Simulated Classically in Polynomial Time
SIAM Journal on Computing | 2002-09-29 | Paper |
Robust logics
Artificial Intelligence | 2000-06-04 | Paper |
| scientific article; zbMATH DE number 1261802 (Why is no real title available?) | 2000-04-26 | Paper |
Projection learning
Machine Learning | 2000-02-23 | Paper |
| scientific article; zbMATH DE number 1142307 (Why is no real title available?) | 1998-05-04 | Paper |
| scientific article; zbMATH DE number 826255 (Why is no real title available?) | 1995-12-14 | Paper |
Learning Boolean formulas
Journal of the ACM | 1995-04-10 | Paper |
Cryptographic limitations on learning Boolean formulae and finite automata
Journal of the ACM | 1995-03-01 | Paper |
| scientific article; zbMATH DE number 619547 (Why is no real title available?) | 1994-09-13 | Paper |
| scientific article; zbMATH DE number 176871 (Why is no real title available?) | 1993-05-18 | Paper |
A general lower bound on the number of examples needed for learning
Information and Computation | 1989-01-01 | Paper |
Optimally universal parallel computers
Philosophical Transactions of the Royal Society of London. Series A, Mathematical and Physical Sciences | 1988-01-01 | Paper |
Computational limitations on learning from examples
Journal of the ACM | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4037775 (Why is no real title available?) | 1987-01-01 | Paper |
Random generation of combinatorial structures from a uniform distribution
Theoretical Computer Science | 1986-01-01 | Paper |
NP is as easy as detecting unique solutions
Theoretical Computer Science | 1986-01-01 | Paper |
Negation is Powerless for Boolean Slice Functions
SIAM Journal on Computing | 1986-01-01 | Paper |
Deductive learning
Philosophical Transactions of the Royal Society of London. Series A, Mathematical and Physical Sciences | 1984-01-01 | Paper |
A theory of the learnable
Communications of the ACM | 1984-01-01 | Paper |
Short monotone formulae for the majority function
Journal of Algorithms | 1984-01-01 | Paper |
| scientific article; zbMATH DE number 3936520 (Why is no real title available?) | 1984-01-01 | Paper |
Optimality of a Two-Phase Strategy for Routing in Interconnection Networks
IEEE Transactions on Computers | 1983-01-01 | Paper |
| scientific article; zbMATH DE number 3814981 (Why is no real title available?) | 1983-01-01 | Paper |
Size bounds for superconcentrators
Theoretical Computer Science | 1983-01-01 | Paper |
| scientific article; zbMATH DE number 3744549 (Why is no real title available?) | 1982-01-01 | Paper |
A Scheme for Fast Parallel Communication
SIAM Journal on Computing | 1982-01-01 | Paper |
Reducibility by algebraic projections
L'Enseignement Mathématique. 2e Série | 1982-01-01 | Paper |
Universality considerations in VLSI circuits
IEEE Transactions on Computers | 1981-01-01 | Paper |
A fast parallel algorithm for routing in permutation networks
IEEE Transactions on Computers | 1981-01-01 | Paper |
| scientific article; zbMATH DE number 3878359 (Why is no real title available?) | 1981-01-01 | Paper |
Negation can be exponentially powerful
Theoretical Computer Science | 1980-01-01 | Paper |
Computing multivariate polynomials in parallel
Information Processing Letters | 1980-01-01 | Paper |
The complexity of computing the permanent
Theoretical Computer Science | 1979-01-01 | Paper |
The Complexity of Enumeration and Reliability Problems
SIAM Journal on Computing | 1979-01-01 | Paper |
Fast probabilistic algorithms for Hamiltonian circuits and matchings
Journal of Computer and System Sciences | 1979-01-01 | Paper |
| scientific article; zbMATH DE number 3663146 (Why is no real title available?) | 1979-01-01 | Paper |
| scientific article; zbMATH DE number 3621134 (Why is no real title available?) | 1978-01-01 | Paper |
| scientific article; zbMATH DE number 3597878 (Why is no real title available?) | 1977-01-01 | Paper |
On Time Versus Space
Journal of the ACM | 1977-01-01 | Paper |
A note on the succinctness of descriptions of deterministic languages
Information and Control | 1976-01-01 | Paper |
Circuit size is nonlinear in depth
Theoretical Computer Science | 1976-01-01 | Paper |
Relative complexity of checking and evaluating
Information Processing Letters | 1976-01-01 | Paper |
Graph-theoretic properties in computational complexity
Journal of Computer and System Sciences | 1976-01-01 | Paper |
Shifting Graphs and Their Applications
Journal of the ACM | 1976-01-01 | Paper |
Universal circuits (Preliminary Report)
Proceedings of the eighth annual ACM symposium on Theory of computing - STOC '76 | 1976-01-01 | Paper |
| scientific article; zbMATH DE number 3564360 (Why is no real title available?) | 1976-01-01 | Paper |
| scientific article; zbMATH DE number 3560739 (Why is no real title available?) | 1976-01-01 | Paper |
Parallelism in Comparison Problems
SIAM Journal on Computing | 1975-01-01 | Paper |
General context-free recognition in less than cubic time
Journal of Computer and System Sciences | 1975-01-01 | Paper |
Regularity and Related Problems for Deterministic Pushdown Automata
Journal of the ACM | 1975-01-01 | Paper |
Deterministic one-counter automata
Journal of Computer and System Sciences | 1975-01-01 | Paper |
| scientific article; zbMATH DE number 3566171 (Why is no real title available?) | 1975-01-01 | Paper |
The equivalence problem for deterministic finite-turn pushdown automata
Information and Control | 1974-01-01 | Paper |
| scientific article; zbMATH DE number 3558993 (Why is no real title available?) | 1974-01-01 | Paper |
| scientific article; zbMATH DE number 3532861 (Why is no real title available?) | 1973-01-01 | Paper |
