default search action
Leslie G. Valiant
Person information
- award: Turing Award, 2010
Refine list
refinements active!
zoomed in on ?? of ?? records
showing all ?? records
2010 – today
- 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 Computation 24(11): 2873-2899 (2012) - 2011
- [j48]Leslie G. Valiant:
A bridging model for multi-core computing. J. Comput. Syst. Sci. 77(1): 154-166 (2011) - [c55]Heng Guo, Pinyan Lu, Leslie G. Valiant:
The Complexity of Symmetric Boolean Parity Holant Problems - (Extended Abstract). ICALP (1) 2011: 712-723 - 2010
- [c54]Varun Kanade, Leslie G. Valiant, Jennifer Wortman Vaughan:
Evolution with Drifting Targets. COLT 2010: 155-167 - [c53]
- [i4]Varun Kanade, Leslie G. Valiant, Jennifer Wortman Vaughan:
Evolution with Drifting Targets. CoRR abs/1005.3566 (2010)
2000 – 2009
- 2009
- [j47]
- [j46]Vitaly Feldman, Leslie G. Valiant:
Experience-Induced Neural Circuits That Achieve High Capacity. Neural Computation 21(10): 2715-2754 (2009) - [c52]Leslie G. Valiant:
Neural Computations That Support Long Mixed Sequences of Knowledge Acquisition Tasks. TAMC 2009: 1-2 - 2008
- [j45]
- [c51]
- [c50]
- [c49]Leslie G. Valiant:
Knowledge Infusion: In Pursuit of Robustness in Artificial Intelligence. FSTTCS 2008: 415-422 - [c48]Loizos Michael, Leslie G. Valiant:
A First Experimental Demonstration of Massive Knowledge Infusion. KR 2008: 378-389 - 2007
- [c47]
- 2006
- [j44]Leslie G. Valiant:
A Quantitative Theory of Neural Computation. Biological Cybernetics 95(3): 205-211 (2006) - [c46]
- [c45]
- [i3]Leslie G. Valiant:
Evolvability. Electronic Colloquium on Computational Complexity (ECCC) 13(120) (2006) - 2005
- [j43]Leslie G. Valiant:
Memorization and Association on a Realistic Neural Model. Neural Computation 17(3): 527-555 (2005) - [c44]
- [c43]
- [i2]Leslie G. Valiant:
Memorization and Association on a Realistic Neural Model. Electronic Colloquium on Computational Complexity (ECCC)(004) (2005) - [i1]Leslie G. Valiant:
Holographic Algorithms. Electronic Colloquium on Computational Complexity (ECCC)(099) (2005) - 2004
- [c42]
- 2003
- [j42]
- 2002
- [j41]Leslie G. Valiant:
Quantum Circuits That Can Be Simulated Classically in Polynomial Time. SIAM J. Comput. 31(4): 1229-1254 (2002) - [j40]
- 2001
- [c41]Leslie G. Valiant:
Quantum computers that can be simulated classically in polynomial time. STOC 2001: 114-123 - 2000
- [j39]
- [j38]
1990 – 1999
- 1999
- [j37]
- [c40]Roni Khardon, Dan Roth, Leslie G. Valiant:
Relational Learning for NLP using Linear Threshold Elements. IJCAI 1999: 911-919 - [c39]
- 1998
- [c38]
- [c37]
- 1996
- [c36]
- 1995
- [b1]Leslie G. Valiant:
Circuits of the mind. Oxford University Press 1995, ISBN 978-0-19-508926-4, pp. I-XIII, 1-237 - [c35]
- [c34]
- [c33]Thomas 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 Distrib. Comput. 22(2): 251-267 (1994) - [c32]
- 1993
- [c31]
- [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]
- [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]
- [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]
- [c25]
- [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]
- [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]
- 1985
- [j26]Sven Skyum, Leslie G. Valiant:
A Complexity Theory Based on Boolean Algebra. J. ACM 32(2): 484-502 (1985) - [c20]
- [c19]Leslie G. Valiant, Vijay V. Vazirani:
NP Is as Easy as Detecting Unique Solutions. STOC 1985: 458-463 - 1984
- [j25]
- [j24]Leslie G. Valiant:
Short Monotone Formulae for the Majority Function. J. Algorithms 5(3): 363-366 (1984) - [c18]
- 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]
- [c16]
- 1982
- [j20]
- 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]
- [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]
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]
- [c12]
- [c11]
- [c10]
- 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]
- [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. Information and 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]
- 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]
- [c4]John E. Hopcroft, Wolfgang J. Paul, Leslie G. Valiant:
On Time versus Space and Related Problems. FOCS 1975: 57-64 - [c3]
- 1974
- [j1]Leslie G. Valiant:
The Equivalence Problem for Deterministic Finite-Turn Pushdown Automata. Information and 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
- [c1]Leslie G. Valiant, Mike Paterson:
Deterministic one-counter automata. Automatentheorie und Formale Sprachen 1973: 104-115
Coauthor Index
data released under the ODC-BY 1.0 license; see also our legal information page
last updated on 2015-12-24 10:43 CET by the dblp team