default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLeslie G. Valiant
Person information
- award (2010): Turing Award
- award (1997): Knuth Prize
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2021
[c60]Leslie G. Valiant:
How to Augment Learning with Reasoning? WI/IAT 2021: 1
2010 – 2019
- 2018
- [j51]Leslie G. Valiant:
Some observations on holographic algorithms. Comput. Complex. 27(3): 351-374 (2018) - [c59]Leslie G. Valiant:
What needs to be added to machine learning? TURC 2018: 6 - 2017
- [c58]Leslie G. Valiant:
Capacity of Neural Networks for Lifelong Learning of Composable Tasks. FOCS 2017: 367-378 - 2013
- [j50]Heng Guo, Pinyan Lu
, Leslie G. Valiant:
The Complexity of Symmetric Boolean Parity Holant Problems. SIAM J. Comput. 42(1): 324-356 (2013) - 2012
- [j49]Leslie G. Valiant:
The Hippocampus as a Stable Memory Allocator for Cortex. Neural Comput. 24(11): 2873-2899 (2012) - [c57]Christos H. Papadimitriou, Leonard M. Adleman, Richard M. Karp, Donald E. Knuth, Robert E. Tarjan, Leslie G. Valiant:
An Algorithmic View of the Universe. ACM-TURING 2012: 13:1 - 2011
- [j48]Leslie G. Valiant:
A bridging model for multi-core computing. J. Comput. Syst. Sci. 77(1): 154-166 (2011) - [c56]Heng Guo, Pinyan Lu, Leslie G. Valiant:
The Complexity of Symmetric Boolean Parity Holant Problems - (Extended Abstract). ICALP (1) 2011: 712-723 - 2010
- [c55]Varun Kanade, Leslie G. Valiant, Jennifer Wortman Vaughan:
Evolution with Drifting Targets. COLT 2010: 155-167 - [c54]Leslie G. Valiant:
Some Observations on Holographic Algorithms. LATIN 2010: 577-590 - [i4]Varun Kanade, Leslie G. Valiant, Jennifer Wortman Vaughan:
Evolution with Drifting Targets. CoRR abs/1005.3566 (2010)
2000 – 2009
- 2009
- [j47]Leslie G. Valiant:
Evolvability. J. ACM 56(1): 3:1-3:21 (2009) - [j46]Vitaly Feldman, Leslie G. Valiant:
Experience-Induced Neural Circuits That Achieve High Capacity. Neural Comput. 21(10): 2715-2754 (2009) - [c53]Leslie G. Valiant:
Neural Computations That Support Long Mixed Sequences of Knowledge Acquisition Tasks. TAMC 2009: 1-2 - 2008
- [j45]Leslie G. Valiant:
Holographic Algorithms. SIAM J. Comput. 37(5): 1565-1594 (2008) - [c52]Vitaly Feldman, Leslie G. Valiant:
The Learning Power of Evolution. COLT 2008: 513-514 - [c51]Leslie G. Valiant:
A Bridging Model for Multi-core Computing. ESA 2008: 13-28 - [c50]Leslie G. Valiant:
Knowledge Infusion: In Pursuit of Robustness in Artificial Intelligence. FSTTCS 2008: 415-422 - [c49]Loizos Michael, Leslie G. Valiant:
A First Experimental Demonstration of Massive Knowledge Infusion. KR 2008: 378-389 - 2007
- [c48]Leslie G. Valiant:
Evolvability. MFCS 2007: 22-43 - 2006
- [j44]Leslie G. Valiant:
A Quantitative Theory of Neural Computation. Biol. Cybern. 95(3): 205-211 (2006) - [c47]Leslie G. Valiant:
Knowledge Infusion. AAAI 2006: 1546-1551 - [c46]Leslie G. Valiant:
Accidental Algorithms. FOCS 2006: 509-517 - [i3]Leslie G. Valiant:
Evolvability. Electron. Colloquium Comput. Complex. TR06 (2006) - 2005
- [j43]Leslie G. Valiant:
Memorization and Association on a Realistic Neural Model. Neural Comput. 17(3): 527-555 (2005) - [c45]Leslie G. Valiant:
Completeness for Parity Problems. COCOON 2005: 1-8 - [c44]Leslie G. Valiant:
Holographic Circuits. ICALP 2005: 1-15 - [i2]Leslie G. Valiant:
Memorization and Association on a Realistic Neural Model. Electron. Colloquium Comput. Complex. TR05 (2005) - [i1]Leslie G. Valiant:
Holographic Algorithms. Electron. Colloquium Comput. Complex. TR05 (2005) - 2004
- [c43]Leslie G. Valiant:
Holographic Algorithms (Extended Abstract). FOCS 2004: 306-315 - 2003
- [j42]Leslie G. Valiant:
Three problems in computer science. J. ACM 50(1): 96-99 (2003) - 2002
- [j41]Leslie G. Valiant:
Quantum Circuits That Can Be Simulated Classically in Polynomial Time. SIAM J. Comput. 31(4): 1229-1254 (2002) - [j40]Leslie G. Valiant:
Expressiveness of matchgates. Theor. Comput. Sci. 289(1): 457-471 (2002) - 2001
- [c42]Leslie G. Valiant:
Quantum computers that can be simulated classically in polynomial time. STOC 2001: 114-123 - 2000
- [j39]Leslie G. Valiant:
Robust logics. Artif. Intell. 117(2): 231-253 (2000) - [j38]Leslie G. Valiant:
A neuroidal architecture for cognitive computation. J. ACM 47(5): 854-882 (2000)
1990 – 1999
- 1999
- [j37]Leslie G. Valiant:
Projection Learning. Mach. Learn. 37(2): 115-130 (1999) - [c41]Roni Khardon, Dan Roth, Leslie G. Valiant:
Relational Learning for NLP using Linear Threshold Elements. IJCAI 1999: 911-919 - [c40]Leslie G. Valiant:
Robust Logics. STOC 1999: 642-651 - 1998
- [c39]Leslie G. Valiant:
Projection Learning. COLT 1998: 287-293 - [c38]Leslie G. Valiant:
A Neuroidal Architecture for Cognitive Computation. ICALP 1998: 642-669 - 1996
- [c37]Leslie G. Valiant:
Managing Complexity in Neurodial Circuits. ALT 1996: 1-11 - 1995
- [b2]Leslie G. Valiant:
Circuits of the mind. Oxford University Press 1995, ISBN 978-0-19-508926-4, pp. I-XIII, 1-237 - [c36]Leslie G. Valiant:
Rationality. COLT 1995: 3-14 - [c35]Leslie G. Valiant:
Cognitive Computation (Extended Abstract). FOCS 1995: 2-3 - [c34]Thomas E. Cheatham, Amr F. Fahmy, Dan C. Stefanescu, Leslie G. Valiant:
Bulk synchronous parallel computing-a paradigm for transportable software. HICSS (2) 1995: 268-275 - 1994
- [j36]Michael J. Kearns, Leslie G. Valiant:
Cryptographic Limitations on Learning Boolean Formulae and Finite Automata. J. ACM 41(1): 67-95 (1994) - [j35]Michael J. Kearns, Ming Li, Leslie G. Valiant:
Learning Boolean Formulas. J. ACM 41(6): 1298-1328 (1994) - [j34]Alexandros V. Gerbessiotis, Leslie G. Valiant:
Direct Bulk-Synchronous Parallel Algorithms. J. Parallel Distributed Comput. 22(2): 251-267 (1994) - [c33]Leslie G. Valiant:
A Computational Model for Cognition (Abstract). IFIP Congress (1) 1994: 234 - 1993
- [c32]Leslie G. Valiant:
A neuroidal model for cognitive functions. EuroCOLT 1993: 33-34 - [c31]Leslie G. Valiant:
Why BSP Computers? IPPS 1993: 2-5 - [c30]Michael J. Kearns, Leslie G. Valiant:
Cryptographic Limitations on Learning Boolean Formulae and Finite Automata. Machine Learning: From Theory to Applications 1993: 29-49 - 1992
- [c29]Leslie G. Valiant:
A Combining Mechanism for Parallel Computers. Heinz Nixdorf Symposium 1992: 1-10 - [c28]Alexandros V. Gerbessiotis, Leslie G. Valiant:
Direct Bulk-Synchronous Parallel Algorithms. SWAT 1992: 1-18 - 1991
- [e1]Manfred K. Warmuth, Leslie G. Valiant:
Proceedings of the Fourth Annual Workshop on Computational Learning Theory, COLT 1991, Santa Cruz, California, USA, August 5-7, 1991. Morgan Kaufmann 1991, ISBN 1-55860-213-5 [contents] - 1990
- [j33]Leslie G. Valiant:
A Bridging Model for Parallel Computation. Commun. ACM 33(8): 103-111 (1990) - [p1]Leslie G. Valiant:
General Purpose Parallel Architectures. Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity (A) 1990: 943-972
1980 – 1989
- 1989
- [j32]Andrzej Ehrenfeucht, David Haussler, Michael J. Kearns, Leslie G. Valiant:
A General Lower Bound on the Number of Examples Needed for Learning. Inf. Comput. 82(3): 247-261 (1989) - [c27]Michael J. Kearns, Leslie G. Valiant:
Cryptographic Limitations on Learning Boolean Formulae and Finite Automata. STOC 1989: 433-444 - 1988
- [j31]Leonard Pitt, Leslie G. Valiant:
Computational limitations on learning from examples. J. ACM 35(4): 965-984 (1988) - [c26]Leslie G. Valiant:
Functionality in Neural Nets. AAAI 1988: 629-634 - [c25]Leslie G. Valiant:
Functionality in Neural Nets. COLT 1988: 28-39 - [c24]Andrzej Ehrenfeucht, David Haussler, Michael J. Kearns, Leslie G. Valiant:
A General Lower Bound on the Number of Examples Needed for Learning. COLT 1988: 139-154 - 1987
- [j30]John H. Reif, Leslie G. Valiant:
A logarithmic time sort for linear size networks. J. ACM 34(1): 60-76 (1987) - [c23]Leslie G. Valiant:
Recent Developments in the Theory of Learning (Abstract). ICALP 1987: 563 - [c22]Michael J. Kearns, Ming Li, Leonard Pitt, Leslie G. Valiant:
On the Learnability of Boolean Formulae. STOC 1987: 285-295 - 1986
- [j29]Leslie G. Valiant:
Negation is Powerless for Boolean Slice Functions. SIAM J. Comput. 15(2): 531-535 (1986) - [j28]Mark Jerrum, Leslie G. Valiant, Vijay V. Vazirani:
Random Generation of Combinatorial Structures from a Uniform Distribution. Theor. Comput. Sci. 43: 169-188 (1986) - [j27]Leslie G. Valiant, Vijay V. Vazirani:
NP is as Easy as Detecting Unique Solutions. Theor. Comput. Sci. 47(3): 85-93 (1986) - [c21]Leslie G. Valiant:
Pragmatic Aspects of Complexity Theory (Panel). IFIP Congress 1986: 7-8 - 1985
- [j26]Sven Skyum, Leslie G. Valiant:
A Complexity Theory Based on Boolean Algebra. J. ACM 32(2): 484-502 (1985) - [c20]Leslie G. Valiant:
Learning Disjunction of Conjunctions. IJCAI 1985: 560-566 - [c19]Leslie G. Valiant, Vijay V. Vazirani:
NP Is as Easy as Detecting Unique Solutions. STOC 1985: 458-463 - 1984
- [j25]Leslie G. Valiant:
A Theory of the Learnable. Commun. ACM 27(11): 1134-1142 (1984) - [j24]Leslie G. Valiant:
Short Monotone Formulae for the Majority Function. J. Algorithms 5(3): 363-366 (1984) - [c18]Leslie G. Valiant:
A Theory of the Learnable. STOC 1984: 436-445 - 1983
- [j23]Leslie G. Valiant, Sven Skyum, S. Berkowitz, Charles Rackoff:
Fast Parallel Computation of Polynomials Using Few Processors. SIAM J. Comput. 12(4): 641-644 (1983) - [j22]Leslie G. Valiant:
Optimality of a Two-Phase Strategy for Routing in Interconnection Networks. IEEE Trans. Computers 32(9): 861-863 (1983) - [j21]G. Lev, Leslie G. Valiant:
Size Bounds for Superconcentrators. Theor. Comput. Sci. 22: 233-251 (1983) - [c17]John H. Reif, Leslie G. Valiant:
A Logarithmic Time Sort for Linear Size Networks. STOC 1983: 10-16 - [c16]Leslie G. Valiant:
Exponential Lower Bounds for Restricted Monotone Circuits. STOC 1983: 110-117 - 1982
- [j20]Leslie G. Valiant:
A Scheme for Fast Parallel Communication. SIAM J. Comput. 11(2): 350-361 (1982) - 1981
- [j19]Leslie G. Valiant:
Addendum: Computing Multivariate Polynomials in Parallel. Inf. Process. Lett. 12(1): 54 (1981) - [j18]Gavriela Freund Lev, Nicholas Pippenger, Leslie G. Valiant:
A Fast Parallel Algorithm for Routing in Permutation Networks. IEEE Trans. Computers 30(2): 93-100 (1981) - [j17]Leslie G. Valiant:
Universality Considerations in VLSI Circuits. IEEE Trans. Computers 30(2): 135-140 (1981) - [c15]Sven Skyum, Leslie G. Valiant:
A Complexity Theory Based on Boolean Algebra. FOCS 1981: 244-253 - [c14]Leslie G. Valiant, Sven Skyum:
Fast Parallel Computation of Polynomials Using Few Processes. MFCS 1981: 132-139 - [c13]Leslie G. Valiant, Gordon J. Brebner:
Universal Schemes for Parallel Communication. STOC 1981: 263-277 - 1980
- [j16]Leslie G. Valiant:
Computing Multivariate Polynomials in Parallel. Inf. Process. Lett. 11(1): 44-45 (1980) - [j15]Leslie G. Valiant:
Negation can be Exponentially Powerful. Theor. Comput. Sci. 12: 303-314 (1980)
1970 – 1979
- 1979
- [j14]Dana Angluin, Leslie G. Valiant:
Fast Probabilistic Algorithms for Hamiltonian Circuits and Matchings. J. Comput. Syst. Sci. 18(2): 155-193 (1979) - [j13]Leslie G. Valiant:
The Complexity of Enumeration and Reliability Problems. SIAM J. Comput. 8(3): 410-421 (1979) - [j12]Leslie G. Valiant:
The Complexity of Computing the Permanent. Theor. Comput. Sci. 8: 189-201 (1979) - [c12]Leslie G. Valiant:
Negation Can Be Exponentially Powerful. STOC 1979: 189-196 - [c11]Leslie G. Valiant:
Completeness Classes in Algebra. STOC 1979: 249-261 - [c10]Leslie G. Valiant:
Negative Results on Counting. Theoretical Computer Science 1979: 38-46 - 1978
- [c9]Leslie G. Valiant:
The Complexity of Combinatorial Computations: An Introduction. GI Jahrestagung 1978: 326-337 - 1977
- [j11]John E. Hopcroft, Wolfgang J. Paul, Leslie G. Valiant:
On Time Versus Space. J. ACM 24(2): 332-337 (1977) - [c8]Leslie G. Valiant:
Graph-Theoretic Arguments in Low-Level Complexity. MFCS 1977: 162-176 - [c7]Dana Angluin, Leslie G. Valiant:
Fast Probabilistic Algorithms for Hamiltonian Circuits and Matchings. STOC 1977: 30-41 - 1976
- [j10]Leslie G. Valiant:
A Note on the Succinctness of Descriptions of Deterministic Languages. Inf. Control. 32(2): 139-145 (1976) - [j9]Leslie G. Valiant:
Relative Complexity of Checking and Evaluating. Inf. Process. Lett. 5(1): 20-23 (1976) - [j8]Nicholas Pippenger, Leslie G. Valiant:
Shifting Graphs and Their Applications. J. ACM 23(3): 423-432 (1976) - [j7]Leslie G. Valiant:
Graph-Theoretic Properties in computational Complexity. J. Comput. Syst. Sci. 13(3): 278-285 (1976) - [j6]Mike Paterson, Leslie G. Valiant:
Circuit Size is Nonlinear in Depth. Theor. Comput. Sci. 2(3): 397-400 (1976) - [c6]Leslie G. Valiant:
The Equivalence Problem for D0L Systems and its Decidability for Binary Alphabets. ICALP 1976: 31-37 - [c5]Leslie G. Valiant:
Universal Circuits (Preliminary Report). STOC 1976: 196-203 - 1975
- [j5]Leslie G. Valiant:
Regularity and Related Problems for Deterministic Pushdown Automata. J. ACM 22(1): 1-10 (1975) - [j4]Leslie G. Valiant:
General Context-Free Recognition in Less than Cubic Time. J. Comput. Syst. Sci. 10(2): 308-315 (1975) - [j3]Leslie G. Valiant, Mike Paterson:
Deterministic One-Counter Automata. J. Comput. Syst. Sci. 10(3): 340-350 (1975) - [j2]Leslie G. Valiant:
Parallelism in Comparison Problems. SIAM J. Comput. 4(3): 348-355 (1975) - [c4]John E. Hopcroft, Wolfgang J. Paul, Leslie G. Valiant:
On Time versus Space and Related Problems. FOCS 1975: 57-64 - [c3]Leslie G. Valiant:
On Non-linear Lower Bounds in Computational Complexity. STOC 1975: 45-53 - 1974
- [j1]Leslie G. Valiant:
The Equivalence Problem for Deterministic Finite-Turn Pushdown Automata. Inf. Control. 25(2): 123-133 (1974) - [c2]Leslie G. Valiant:
The Decidability of Equivalence for Deterministic Finite-Turn Pushdown Automata. STOC 1974: 27-32 - 1973
- [b1]Leslie G. Valiant:
Decision procedures for families of deterministic pushdown automata. University of Warwick, Coventry, UK, 1973 - [c1]Leslie G. Valiant, Mike Paterson:
Deterministic one-counter automata. Automatentheorie und Formale Sprachen 1973: 104-115
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-02 21:48 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
