Leslie G. Valiant

	2011
110		Heng Guo, Pinyan Lu, Leslie G. Valiant: The Complexity of Symmetric Boolean Parity Holant Problems - (Extended Abstract). ICALP (1) 2011: 712-723
109		Leslie G. Valiant: A bridging model for multi-core computing. J. Comput. Syst. Sci. 77(1): 154-166 (2011)
	2010
108		Varun Kanade, Leslie G. Valiant, Jennifer Wortman Vaughan: Evolution with Drifting Targets. COLT 2010: 155-167
107		Leslie G. Valiant: Some Observations on Holographic Algorithms. LATIN 2010: 577-590
106		Varun Kanade, Leslie G. Valiant, Jennifer Wortman Vaughan: Evolution with Drifting Targets CoRR abs/1005.3566: (2010)
	2009
105		Leslie G. Valiant: Neural Computations That Support Long Mixed Sequences of Knowledge Acquisition Tasks. TAMC 2009: 1-2
104		Leslie G. Valiant: Evolvability. J. ACM 56(1): (2009)
103		Vitaly Feldman, Leslie G. Valiant: Experience-Induced Neural Circuits That Achieve High Capacity. Neural Computation 21(10): 2715-2754 (2009)
	2008
102		Vitaly Feldman, Leslie G. Valiant: The Learning Power of Evolution. COLT 2008: 513-514
101		Leslie G. Valiant: A Bridging Model for Multi-core Computing. ESA 2008: 13-28
100		Leslie G. Valiant: Knowledge Infusion: In Pursuit of Robustness in Artificial Intelligence. FSTTCS 2008: 415-422
99		Loizos Michael, Leslie G. Valiant: A First Experimental Demonstration of Massive Knowledge Infusion. KR 2008: 378-389
98		Leslie G. Valiant: Holographic Algorithms. SIAM J. Comput. 37(5): 1565-1594 (2008)
	2007
97		Leslie G. Valiant: Evolvability. MFCS 2007: 22-43
	2006
96		Leslie G. Valiant: Knowledge Infusion. AAAI 2006: 1546-1551
95		Leslie G. Valiant: Accidental Algorthims. FOCS 2006: 509-517
94		Leslie G. Valiant: A Quantitative Theory of Neural Computation. Biological Cybernetics 95(3): 205-211 (2006)
93		Leslie G. Valiant: Evolvability. Electronic Colloquium on Computational Complexity (ECCC) 13(120): (2006)
	2005
92		Leslie G. Valiant: Completeness for Parity Problems. COCOON 2005: 1-8
91		Leslie G. Valiant: Holographic Circuits. ICALP 2005: 1-15
90		Leslie G. Valiant: Memorization and Association on a Realistic Neural Model Electronic Colloquium on Computational Complexity (ECCC)(004): (2005)
89		Leslie G. Valiant: Holographic Algorithms Electronic Colloquium on Computational Complexity (ECCC)(099): (2005)
88		Leslie G. Valiant: Memorization and Association on a Realistic Neural Model. Neural Computation 17(3): 527-555 (2005)
	2004
87		Leslie G. Valiant: Holographic Algorithms (Extended Abstract). FOCS 2004: 306-315
	2003
86		Leslie G. Valiant: Three problems in computer science. J. ACM 50(1): 96-99 (2003)
	2002
85		Leslie G. Valiant: Quantum Circuits That Can Be Simulated Classically in Polynomial Time. SIAM J. Comput. 31(4): 1229-1254 (2002)
84		Leslie G. Valiant: Expressiveness of matchgates. Theor. Comput. Sci. 289(1): 457-471 (2002)
	2001
83		Leslie G. Valiant: Quantum computers that can be simulated classically in polynomial time. STOC 2001: 114-123
	2000
82		Leslie G. Valiant: Robust logics. Artif. Intell. 117(2): 231-253 (2000)
81		Leslie G. Valiant: A neuroidal architecture for cognitive computation. J. ACM 47(5): 854-882 (2000)
	1999
80		Roni Khardon, Dan Roth, Leslie G. Valiant: Relational Learning for NLP using Linear Threshold Elements. IJCAI 1999: 911-919
79		Leslie G. Valiant: Robust Logics. STOC 1999: 642-651
78		Leslie G. Valiant: Projection Learning. Machine Learning 37(2): 115-130 (1999)
	1998
77		Leslie G. Valiant: Projection Learning. COLT 1998: 287-293
76		Leslie G. Valiant: A Neuroidal Architecture for Cognitive Computation. ICALP 1998: 642-669
	1996
75		Leslie G. Valiant: Managing Complexity in Neurodial Circuits. ALT 1996: 1-11
	1995
74		Leslie G. Valiant: Circuits of the mind. Oxford University Press 1995: I-XIII, 1-237
73		Leslie G. Valiant: Rationality. COLT 1995: 3-14
72		Leslie G. Valiant: Cognitive Computation (Extended Abstract). FOCS 1995: 2-3
71		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
70		Leslie G. Valiant: A Computational Model for Cognition (Abstract). IFIP Congress (1) 1994: 234
69		Michael J. Kearns, Leslie G. Valiant: Cryptographic Limitations on Learning Boolean Formulae and Finite Automata. J. ACM 41(1): 67-95 (1994)
68		Michael J. Kearns, Ming Li, Leslie G. Valiant: Learning Boolean Formulas. J. ACM 41(6): 1298-1328 (1994)
67		Alexandros V. Gerbessiotis, Leslie G. Valiant: Direct Bulk-Synchronous Parallel Algorithms. J. Parallel Distrib. Comput. 22(2): 251-267 (1994)
	1993
66		Leslie G. Valiant: Why BSP Computers? IPPS 1993: 2-5
65		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
64		Leslie G. Valiant: A Combining Mechanism for Parallel Computers. Heinz Nixdorf Symposium 1992: 1-10
63		Alexandros V. Gerbessiotis, Leslie G. Valiant: Direct Bulk-Synchronous Parallel Algorithms. SWAT 1992: 1-18
	1991
62		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
	1990
61		Leslie G. Valiant: General Purpose Parallel Architectures. Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity (A) 1990: 943-972
60		Leslie G. Valiant: A Bridging Model for Parallel Computation. Commun. ACM 33(8): 103-111 (1990)
	1989
59		Michael J. Kearns, Leslie G. Valiant: Cryptographic Limitations on Learning Boolean Formulae and Finite Automata STOC 1989: 433-444
58		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)
	1988
57		Leslie G. Valiant: Functionality in Neural Nets. AAAI 1988: 629-634
56		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
55		Leslie G. Valiant: Functionality in Neural Nets. COLT 1988: 28-39
54		Leonard Pitt, Leslie G. Valiant: Computational limitations on learning from examples. J. ACM 35(4): 965-984 (1988)
	1987
53		Leslie G. Valiant: Recent Developments in the Theory of Learning (Abstract). ICALP 1987: 563
52		Michael J. Kearns, Ming Li, Leonard Pitt, Leslie G. Valiant: On the Learnability of Boolean Formulae STOC 1987: 285-295
51		John H. Reif, Leslie G. Valiant: A logarithmic time sort for linear size networks. J. ACM 34(1): 60-76 (1987)
	1986
50		Leslie G. Valiant: Pragmatic Aspects of Complexity Theory (Panel). IFIP Congress 1986: 7-8
49		Leslie G. Valiant: Negation is Powerless for Boolean Slice Functions. SIAM J. Comput. 15(2): 531-535 (1986)
48		Mark Jerrum, Leslie G. Valiant, Vijay V. Vazirani: Random Generation of Combinatorial Structures from a Uniform Distribution. Theor. Comput. Sci. 43: 169-188 (1986)
47		Leslie G. Valiant, Vijay V. Vazirani: NP is as Easy as Detecting Unique Solutions. Theor. Comput. Sci. 47(3): 85-93 (1986)
	1985
46		Leslie G. Valiant: Learning Disjunction of Conjunctions. IJCAI 1985: 560-566
45		Leslie G. Valiant, Vijay V. Vazirani: NP Is as Easy as Detecting Unique Solutions STOC 1985: 458-463
44		Sven Skyum, Leslie G. Valiant: A Complexity Theory Based on Boolean Algebra J. ACM 32(2): 484-502 (1985)
	1984
43		Leslie G. Valiant: A Theory of the Learnable STOC 1984: 436-445
42		Leslie G. Valiant: A Theory of the Learnable. Commun. ACM 27(11): 1134-1142 (1984)
41		Leslie G. Valiant: Short Monotone Formulae for the Majority Function. J. Algorithms 5(3): 363-366 (1984)
	1983
40		John H. Reif, Leslie G. Valiant: A Logarithmic Time Sort for Linear Size Networks STOC 1983: 10-16
39		Leslie G. Valiant: Exponential Lower Bounds for Restricted Monotone Circuits STOC 1983: 110-117
38		Leslie G. Valiant: Optimality of a Two-Phase Strategy for Routing in Interconnection Networks. IEEE Trans. Computers 32(9): 861-863 (1983)
37		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)
36		G. Lev, Leslie G. Valiant: Size Bounds for Superconcentrators. Theor. Comput. Sci. 22: 233-251 (1983)
	1982
35		Leslie G. Valiant: A Scheme for Fast Parallel Communication. SIAM J. Comput. 11(2): 350-361 (1982)
	1981
34		Sven Skyum, Leslie G. Valiant: A Complexity Theory Based on Boolean Algebra FOCS 1981: 244-253
33		Leslie G. Valiant, Sven Skyum: Fast Parallel Computation of Polynomials Using Few Processes. MFCS 1981: 132-139
32		Leslie G. Valiant, Gordon J. Brebner: Universal Schemes for Parallel Communication STOC 1981: 263-277
31		Leslie G. Valiant: Universality Considerations in VLSI Circuits. IEEE Trans. Computers 30(2): 135-140 (1981)
30		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)
29		Leslie G. Valiant: Addendum: Computing Multivariate Polynomials in Parallel. Inf. Process. Lett. 12(1): 54 (1981)
	1980
28		Leslie G. Valiant: Computing Multivariate Polynomials in Parallel. Inf. Process. Lett. 11(1): 44-45 (1980)
27		Leslie G. Valiant: Negation can be Exponentially Powerful. Theor. Comput. Sci. 12: 303-314 (1980)
	1979
26		Leslie G. Valiant: Negation Can Be Exponentially Powerful STOC 1979: 189-196
25		Leslie G. Valiant: Completeness Classes in Algebra STOC 1979: 249-261
24		Leslie G. Valiant: Negative Results on Counting. Theoretical Computer Science 1979: 38-46
23		Dana Angluin, Leslie G. Valiant: Fast Probabilistic Algorithms for Hamiltonian Circuits and Matchings. J. Comput. Syst. Sci. 18(2): 155-193 (1979)
22		Leslie G. Valiant: The Complexity of Enumeration and Reliability Problems. SIAM J. Comput. 8(3): 410-421 (1979)
21		Leslie G. Valiant: The Complexity of Computing the Permanent. Theor. Comput. Sci. 8: 189-201 (1979)
	1978
20		Leslie G. Valiant: The Complexity of Combinatorial Computations: An Introduction. GI Jahrestagung 1978: 326-337
	1977
19		Leslie G. Valiant: Graph-Theoretic Arguments in Low-Level Complexity. MFCS 1977: 162-176
18		Dana Angluin, Leslie G. Valiant: Fast Probabilistic Algorithms for Hamiltonian Circuits and Matchings STOC 1977: 30-41
17		John E. Hopcroft, Wolfgang J. Paul, Leslie G. Valiant: On Time Versus Space. J. ACM 24(2): 332-337 (1977)
	1976
16		Leslie G. Valiant: The Equivalence Problem for D0L Systems and its Decidability for Binary Alphabets. ICALP 1976: 31-37
15		Leslie G. Valiant: Universal Circuits (Preliminary Report) STOC 1976: 196-203
14		Leslie G. Valiant: Relative Complexity of Checking and Evaluating. Inf. Process. Lett. 5(1): 20-23 (1976)
13		Leslie G. Valiant: A Note on the Succinctness of Descriptions of Deterministic Languages Information and Control 32(2): 139-145 (1976)
12		Nicholas Pippenger, Leslie G. Valiant: Shifting Graphs and Their Applications. J. ACM 23(3): 423-432 (1976)
11		Leslie G. Valiant: Graph-Theoretic Properties in computational Complexity. J. Comput. Syst. Sci. 13(3): 278-285 (1976)
10		Mike Paterson, Leslie G. Valiant: Circuit Size is Nonlinear in Depth. Theor. Comput. Sci. 2(3): 397-400 (1976)
	1975
9		John E. Hopcroft, Wolfgang J. Paul, Leslie G. Valiant: On Time versus Space and Related Problems FOCS 1975: 57-64
8		Leslie G. Valiant: On Non-linear Lower Bounds in Computational Complexity STOC 1975: 45-53
7		Leslie G. Valiant: Regularity and Related Problems for Deterministic Pushdown Automata. J. ACM 22(1): 1-10 (1975)
6		Leslie G. Valiant: General Context-Free Recognition in Less than Cubic Time. J. Comput. Syst. Sci. 10(2): 308-315 (1975)
5		Leslie G. Valiant, Mike Paterson: Deterministic One-Counter Automata. J. Comput. Syst. Sci. 10(3): 340-350 (1975)
4		Leslie G. Valiant: Parallelism in Comparison Problems. SIAM J. Comput. 4(3): 348-355 (1975)
	1974
3		Leslie G. Valiant: The Decidability of Equivalence for Deterministic Finite-Turn Pushdown Automata STOC 1974: 27-32
2		Leslie G. Valiant: The Equivalence Problem for Deterministic Finite-Turn Pushdown Automata Information and Control 25(2): 123-133 (1974)
	1973
1		Leslie G. Valiant, Mike Paterson: Deterministic one-counter automata. Automatentheorie und Formale Sprachen 1973: 104-115

Coauthor Index

1	Dana Angluin	[18] [23]
2	S. Berkowitz	[37]
3	Gordon J. Brebner	[32]
4	Thomas Cheatham	[71]
5	Andrzej Ehrenfeucht	[56] [58]
6	Amr F. Fahmy	[71]
7	Vitaly Feldman	[102] [103]
8	Alexandros V. Gerbessiotis	[63] [67]
9	Heng Guo	[110]
10	David Haussler	[56] [58]
11	John E. Hopcroft	[9] [17]
12	Mark Jerrum	[48]
13	Varun Kanade	[106] [108]
14	Michael Kearns (Michael J. Kearns, Michael S. Kearns)	[52] [56] [58] [59] [65] [68] [69]
15	Roni Khardon	[80]
16	G. Lev	[36]
17	Gavriela Freund Lev	[30]
18	Ming Li	[52] [68]
19	Pinyan Lu	[110]
20	Loizos Michael	[99]
21	Mike Paterson	[1] [5] [10]
22	Wolfgang J. Paul	[9] [17]
23	Nicholas Pippenger	[12] [30]
24	Leonard Pitt	[52] [54]
25	Charles Rackoff	[37]
26	John H. Reif	[40] [51]
27	Dan Roth	[80]
28	Sven Skyum	[33] [34] [37] [44]
29	Dan C. Stefanescu	[71]
30	Jennifer Wortman Vaughan (Jennifer Wortman)	[106] [108]
31	Vijay V. Vazirani	[45] [47] [48]
32	Manfred K. Warmuth	[62]

Colors in the list of coauthors

Last update Fri May 25 01:42:58 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page