| 2017 | FOCS | Capacity of Neural Networks for Lifelong Learning of Composable Tasks. | Leslie G. Valiant |
| 2011 | ICALP | The Complexity of Symmetric Boolean Parity Holant Problems - (Extended Abstract). | Heng Guo, Pinyan Lu, Leslie G. Valiant |
| 2010 | COLT | Evolution with Drifting Targets. | Varun Kanade, Leslie G. Valiant, Jennifer Wortman Vaughan |
| 2010 | LATIN | Some Observations on Holographic Algorithms. | Leslie G. Valiant |
| 2009 | TAMC | Neural Computations That Support Long Mixed Sequences of Knowledge Acquisition Tasks. | Leslie G. Valiant |
| 2008 | COLT | The Learning Power of Evolution. | Vitaly Feldman, Leslie G. Valiant |
| 2008 | ESA | A Bridging Model for Multi-core Computing. | Leslie G. Valiant |
| 2008 | KR | A First Experimental Demonstration of Massive Knowledge Infusion. | Loizos Michael, Leslie G. Valiant |
| 2007 | MFCS | Evolvability. | Leslie G. Valiant |
| 2006 | AAAI | Knowledge Infusion. | Leslie G. Valiant |
| 2006 | FOCS | Accidental Algorithms. | Leslie G. Valiant |
| 2005 | COCOON | Completeness for Parity Problems. | Leslie G. Valiant |
| 2005 | ICALP | Holographic Circuits. | Leslie G. Valiant |
| 2004 | FOCS | Holographic Algorithms (Extended Abstract). | Leslie G. Valiant |
| 2001 | STOC | Quantum computers that can be simulated classically in polynomial time. | Leslie G. Valiant |
| 1999 | IJCAI | Relational Learning for NLP using Linear Threshold Elements. | Roni Khardon, Dan Roth, Leslie G. Valiant |
| 1999 | STOC | Robust Logics. | Leslie G. Valiant |
| 1998 | COLT | Projection Learning. | Leslie G. Valiant |
| 1998 | ICALP | A Neuroidal Architecture for Cognitive Computation. | Leslie G. Valiant |
| 1996 | ALT | Managing Complexity in Neurodial Circuits. | Leslie G. Valiant |
| 1995 | COLT | Rationality. | Leslie G. Valiant |
| 1995 | FOCS | Cognitive Computation (Extended Abstract). | Leslie G. Valiant |
| 1989 | STOC | Cryptographic Limitations on Learning Boolean Formulae and Finite Automata | Michael J. Kearns, Leslie G. Valiant |
| 1988 | AAAI | Functionality in Neural Nets. | Leslie G. Valiant |
| 1988 | COLT | A General Lower Bound on the Number of Examples Needed for Learning. | Andrzej Ehrenfeucht, David Haussler, Michael J. Kearns, Leslie G. Valiant |
| 1988 | COLT | Functionality in Neural Nets. | Leslie G. Valiant |
| 1987 | ICALP | Recent Developments in the Theory of Learning (Abstract). | Leslie G. Valiant |
| 1987 | STOC | On the Learnability of Boolean Formulae | Michael J. Kearns, Ming Li, Leonard Pitt, Leslie G. Valiant |
| 1985 | IJCAI | Learning Disjunction of Conjunctions. | Leslie G. Valiant |
| 1985 | STOC | NP Is as Easy as Detecting Unique Solutions | Leslie G. Valiant, Vijay V. Vazirani |
| 1984 | STOC | A Theory of the Learnable | Leslie G. Valiant |
| 1983 | STOC | A Logarithmic Time Sort for Linear Size Networks | John H. Reif, Leslie G. Valiant |
| 1983 | STOC | Exponential Lower Bounds for Restricted Monotone Circuits | Leslie G. Valiant |
| 1981 | FOCS | A Complexity Theory Based on Boolean Algebra | Sven Skyum, Leslie G. Valiant |
| 1981 | MFCS | Fast Parallel Computation of Polynomials Using Few Processes. | Leslie G. Valiant, Sven Skyum |
| 1981 | STOC | Universal Schemes for Parallel Communication | Leslie G. Valiant, Gordon J. Brebner |
| 1979 | STOC | Negation Can Be Exponentially Powerful | Leslie G. Valiant |
| 1979 | STOC | Completeness Classes in Algebra | Leslie G. Valiant |
| 1978 | GI | The Complexity of Combinatorial Computations: An Introduction. | Leslie G. Valiant |
| 1977 | MFCS | Graph-Theoretic Arguments in Low-Level Complexity. | Leslie G. Valiant |
| 1977 | STOC | Fast Probabilistic Algorithms for Hamiltonian Circuits and Matchings | Dana Angluin, Leslie G. Valiant |
| 1976 | ICALP | The Equivalence Problem for D0L Systems and its Decidability for Binary Alphabets. | Leslie G. Valiant |
| 1976 | STOC | Universal Circuits (Preliminary Report) | Leslie G. Valiant |
| 1975 | FOCS | On Time versus Space and Related Problems | John E. Hopcroft, Wolfgang J. Paul, Leslie G. Valiant |
| 1975 | STOC | On Non-linear Lower Bounds in Computational Complexity | Leslie G. Valiant |
| 1974 | STOC | The Decidability of Equivalence for Deterministic Finite-Turn Pushdown Automata | Leslie G. Valiant |