Deterministic one-counter automata. - Leslie G. Valiant; Mike Paterson (Automatentheorie und Formale Sprachen, 1973)

Decision procedures for families of deterministic pushdown automata. - Leslie G. Valiant (1973)

The Decidability of Equivalence for Deterministic Finite-Turn Pushdown Automata - Leslie G. Valiant (STOC, 1974)

The Equivalence Problem for Deterministic Finite-Turn Pushdown Automata - Leslie G. Valiant (Inf. Control., 1974)

On Time versus Space and Related Problems - John E. Hopcroft; Wolfgang J. Paul; Leslie G. Valiant (FOCS, 1975)

On Non-linear Lower Bounds in Computational Complexity - Leslie G. Valiant (STOC, 1975)

Regularity and Related Problems for Deterministic Pushdown Automata. - Leslie G. Valiant (J. ACM, 1975)

General Context-Free Recognition in Less than Cubic Time. - Leslie G. Valiant (J. Comput. Syst. Sci., 1975)

Parallelism in Comparison Problems. - Leslie G. Valiant (SIAM J. Comput., 1975)

The Equivalence Problem for D0L Systems and its Decidability for Binary Alphabets. - Leslie G. Valiant (ICALP, 1976)

Universal Circuits (Preliminary Report) - Leslie G. Valiant (STOC, 1976)

Relative Complexity of Checking and Evaluating. - Leslie G. Valiant (Inf. Process. Lett., 1976)

Shifting Graphs and Their Applications. - Nicholas Pippenger; Leslie G. Valiant (J. ACM, 1976)

Graph-Theoretic Properties in computational Complexity. - Leslie G. Valiant (J. Comput. Syst. Sci., 1976)

Circuit Size is Nonlinear in Depth. - Mike Paterson; Leslie G. Valiant (Theor. Comput. Sci., 1976)

A Note on the Succinctness of Descriptions of Deterministic Languages - Leslie G. Valiant (Inf. Control., 1976)

Graph-Theoretic Arguments in Low-Level Complexity. - Leslie G. Valiant (MFCS, 1977)

Fast Probabilistic Algorithms for Hamiltonian Circuits and Matchings - Dana Angluin; Leslie G. Valiant (STOC, 1977)

On Time Versus Space. - John E. Hopcroft; Wolfgang J. Paul; Leslie G. Valiant (J. ACM, 1977)

The Complexity of Combinatorial Computations: An Introduction. - Leslie G. Valiant (GI Jahrestagung, 1978)

Negation Can Be Exponentially Powerful - Leslie G. Valiant (STOC, 1979)

Completeness Classes in Algebra - Leslie G. Valiant (STOC, 1979)

Negative Results on Counting. - Leslie G. Valiant (Theoretical Computer Science, 1979)

The Complexity of Enumeration and Reliability Problems. - Leslie G. Valiant (SIAM J. Comput., 1979)

The Complexity of Computing the Permanent. - Leslie G. Valiant (Theor. Comput. Sci., 1979)

Computing Multivariate Polynomials in Parallel. - Leslie G. Valiant (Inf. Process. Lett., 1980)

A Complexity Theory Based on Boolean Algebra - Sven Skyum; Leslie G. Valiant (FOCS, 1981)

Fast Parallel Computation of Polynomials Using Few Processes. - Leslie G. Valiant; Sven Skyum (MFCS, 1981)

Universal Schemes for Parallel Communication - Leslie G. Valiant; Gordon J. Brebner (STOC, 1981)

Addendum: Computing Multivariate Polynomials in Parallel. - Leslie G. Valiant (Inf. Process. Lett., 1981)

A Fast Parallel Algorithm for Routing in Permutation Networks. - Gavriela Freund Lev; Nicholas Pippenger; Leslie G. Valiant (IEEE Trans. Computers, 1981)

Universality Considerations in VLSI Circuits. - Leslie G. Valiant (IEEE Trans. Computers, 1981)

A Scheme for Fast Parallel Communication. - Leslie G. Valiant (SIAM J. Comput., 1982)

A Logarithmic Time Sort for Linear Size Networks - John H. Reif; Leslie G. Valiant (STOC, 1983)

Exponential Lower Bounds for Restricted Monotone Circuits - Leslie G. Valiant (STOC, 1983)

Fast Parallel Computation of Polynomials Using Few Processors. - Leslie G. Valiant; Sven Skyum; S. Berkowitz; Charles Rackoff (SIAM J. Comput., 1983)

Optimality of a Two-Phase Strategy for Routing in Interconnection Networks. - Leslie G. Valiant (IEEE Trans. Computers, 1983)

Size Bounds for Superconcentrators. - G. Lev; Leslie G. Valiant (Theor. Comput. Sci., 1983)

A Theory of the Learnable - Leslie G. Valiant (STOC, 1984)

Short Monotone Formulae for the Majority Function. - Leslie G. Valiant (J. Algorithms, 1984)

Learning Disjunction of Conjunctions. - Leslie G. Valiant (IJCAI, 1985)

NP Is as Easy as Detecting Unique Solutions - Leslie G. Valiant; Vijay V. Vazirani (STOC, 1985)

Pragmatic Aspects of Complexity Theory (Panel). - Leslie G. Valiant (IFIP Congress, 1986)

Negation is Powerless for Boolean Slice Functions. - Leslie G. Valiant (SIAM J. Comput., 1986)

Random Generation of Combinatorial Structures from a Uniform Distribution. - Mark Jerrum; Leslie G. Valiant; Vijay V. Vazirani (Theor. Comput. Sci., 1986)

Recent Developments in the Theory of Learning (Abstract). - Leslie G. Valiant (ICALP, 1987)

On the Learnability of Boolean Formulae - Michael J. Kearns; Ming Li 001; Leonard Pitt; Leslie G. Valiant (STOC, 1987)

A General Lower Bound on the Number of Examples Needed for Learning. - Andrzej Ehrenfeucht; David Haussler; Michael J. Kearns; Leslie G. Valiant (COLT, 1988)

Functionality in Neural Nets. - Leslie G. Valiant (COLT, 1988)

Computational limitations on learning from examples. - Leonard Pitt; Leslie G. Valiant (J. ACM, 1988)

General Purpose Parallel Architectures. - Leslie G. Valiant (Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity (A), 1990)

A Bridging Model for Parallel Computation. - Leslie G. Valiant (Commun. ACM, 1990)

A Combining Mechanism for Parallel Computers. - Leslie G. Valiant (Heinz Nixdorf Symposium, 1992)

Direct Bulk-Synchronous Parallel Algorithms. - Alexandros V. Gerbessiotis; Leslie G. Valiant (SWAT, 1992)

A neuroidal model for cognitive functions. - Leslie G. Valiant (EuroCOLT, 1993)

Why BSP Computers? - Leslie G. Valiant (IPPS, 1993)

Cryptographic Limitations on Learning Boolean Formulae and Finite Automata. - Michael J. Kearns; Leslie G. Valiant (Machine Learning: From Theory to Applications, 1993)

A Computational Model for Cognition (Abstract). - Leslie G. Valiant (IFIP Congress (1), 1994)

Learning Boolean Formulas. - Michael J. Kearns; Ming Li 001; Leslie G. Valiant (J. ACM, 1994)

Circuits of the mind. - Leslie G. Valiant (Oxford University Press, 1995)

Rationality. - Leslie G. Valiant (COLT, 1995)

Cognitive Computation (Extended Abstract). - Leslie G. Valiant (FOCS, 1995)

Bulk synchronous parallel computing-a paradigm for transportable software. - Thomas E. Cheatham; Amr F. Fahmy; Dan C. Stefanescu; Leslie G. Valiant (HICSS (2), 1995)

Managing Complexity in Neurodial Circuits. - Leslie G. Valiant (ALT, 1996)

Projection Learning. - Leslie G. Valiant (COLT, 1998)

A Neuroidal Architecture for Cognitive Computation. - Leslie G. Valiant (ICALP, 1998)

Relational Learning for NLP using Linear Threshold Elements. - Roni Khardon; Dan Roth 001; Leslie G. Valiant (IJCAI, 1999)

Robust Logics. - Leslie G. Valiant (STOC, 1999)

Quantum computers that can be simulated classically in polynomial time. - Leslie G. Valiant (STOC, 2001)

Quantum Circuits That Can Be Simulated Classically in Polynomial Time. - Leslie G. Valiant (SIAM J. Comput., 2002)

Expressiveness of matchgates. - Leslie G. Valiant (Theor. Comput. Sci., 2002)

Three problems in computer science. - Leslie G. Valiant (J. ACM, 2003)

Holographic Algorithms (Extended Abstract). - Leslie G. Valiant (FOCS, 2004)

Completeness for Parity Problems. - Leslie G. Valiant (COCOON, 2005)

Holographic Circuits. - Leslie G. Valiant (ICALP, 2005)

Holographic Algorithms - Leslie G. Valiant (Electron. Colloquium Comput. Complex., 2005)

Memorization and Association on a Realistic Neural Model. - Leslie G. Valiant (Neural Comput., 2005)

Knowledge Infusion. - Leslie G. Valiant (AAAI, 2006)

Accidental Algorithms. - Leslie G. Valiant (FOCS, 2006)

A Quantitative Theory of Neural Computation. - Leslie G. Valiant (Biol. Cybern., 2006)

Evolvability. - Leslie G. Valiant (MFCS, 2007)

The Learning Power of Evolution. - Vitaly Feldman; Leslie G. Valiant (COLT, 2008)

A Bridging Model for Multi-core Computing. - Leslie G. Valiant (ESA, 2008)

Knowledge Infusion: In Pursuit of Robustness in Artificial Intelligence. - Leslie G. Valiant (FSTTCS, 2008)

A First Experimental Demonstration of Massive Knowledge Infusion. - Loizos Michael; Leslie G. Valiant (KR, 2008)

Neural Computations That Support Long Mixed Sequences of Knowledge Acquisition Tasks. - Leslie G. Valiant (TAMC, 2009)

Experience-Induced Neural Circuits That Achieve High Capacity. - Vitaly Feldman; Leslie G. Valiant (Neural Comput., 2009)

Evolution with Drifting Targets. - Varun Kanade; Leslie G. Valiant; Jennifer Wortman Vaughan (COLT, 2010)

Some Observations on Holographic Algorithms. - Leslie G. Valiant (LATIN, 2010)

The Complexity of Symmetric Boolean Parity Holant Problems - (Extended Abstract). - Heng Guo 001; Pinyan Lu; Leslie G. Valiant (ICALP (1), 2011)

An Algorithmic View of the Universe. - Christos H. Papadimitriou; Leonard M. Adleman; Richard M. Karp; Donald E. Knuth; Robert E. Tarjan; Leslie G. Valiant (ACM-TURING, 2012)

The Hippocampus as a Stable Memory Allocator for Cortex. - Leslie G. Valiant (Neural Comput., 2012)

The Complexity of Symmetric Boolean Parity Holant Problems. - Heng Guo 001; Pinyan Lu; Leslie G. Valiant (SIAM J. Comput., 2013)

Capacity of Neural Networks for Lifelong Learning of Composable Tasks. - Leslie G. Valiant (FOCS, 2017)

What needs to be added to machine learning? - Leslie G. Valiant (TURC, 2018)

How to Augment Learning with Reasoning? - Leslie G. Valiant (WI/IAT, 2021)

The Parameters of Educability. - Leslie G. Valiant (CoRR, 2024)