Leslie G. Valiant

120 papers A* 37A 1B 5C 1Misc 1Journal 56Unranked 16

Year	Rank	Type	Title / Venue / Authors
2024	J	`jnl`	The Parameters of Educability. CoRR Leslie G. Valiant
2021	—	`conf`	How to Augment Learning with Reasoning? WI/IAT Leslie G. Valiant
2018	J	`jnl`	Some observations on holographic algorithms. Comput. Complex. Leslie G. Valiant
2018	—	`conf`	What needs to be added to machine learning? TURC Leslie G. Valiant
2017	A*	`conf`	Capacity of Neural Networks for Lifelong Learning of Composable Tasks. FOCS Leslie G. Valiant
2013	J	`jnl`	The Complexity of Symmetric Boolean Parity Holant Problems. SIAM J. Comput. Heng Guo, Pinyan Lu, Leslie G. Valiant
2012	—	`conf`	An Algorithmic View of the Universe. ACM-TURING Christos H. Papadimitriou, Leonard M. Adleman, Richard M. Karp, Donald E. Knuth, Robert E. Tarjan, Leslie G. Valiant
2012	J	`jnl`	The Hippocampus as a Stable Memory Allocator for Cortex. Neural Comput. Leslie G. Valiant
2011	J	`jnl`	A bridging model for multi-core computing. J. Comput. Syst. Sci. Leslie G. Valiant
2011	—	`conf`	The Complexity of Symmetric Boolean Parity Holant Problems - (Extended Abstract). ICALP (1) Heng Guo, Pinyan Lu, Leslie G. Valiant
2010	J	`jnl`	Evolution with Drifting Targets CoRR Varun Kanade, Leslie G. Valiant, Jennifer Wortman Vaughan
2010	A*	`conf`	Evolution with Drifting Targets. COLT Varun Kanade, Leslie G. Valiant, Jennifer Wortman Vaughan
2010	B	`conf`	Some Observations on Holographic Algorithms. LATIN Leslie G. Valiant
2009	J	`jnl`	Evolvability. J. ACM Leslie G. Valiant
2009	J	`jnl`	Experience-Induced Neural Circuits That Achieve High Capacity. Neural Comput. Vitaly Feldman, Leslie G. Valiant
2009	C	`conf`	Neural Computations That Support Long Mixed Sequences of Knowledge Acquisition Tasks. TAMC Leslie G. Valiant
2008	A	`conf`	A Bridging Model for Multi-core Computing. ESA Leslie G. Valiant
2008	A*	`conf`	A First Experimental Demonstration of Massive Knowledge Infusion. KR Loizos Michael, Leslie G. Valiant
2008	J	`jnl`	Holographic Algorithms. SIAM J. Comput. Leslie G. Valiant
2008	—	`conf`	Knowledge Infusion: In Pursuit of Robustness in Artificial Intelligence. FSTTCS Leslie G. Valiant
2008	A*	`conf`	The Learning Power of Evolution. COLT Vitaly Feldman, Leslie G. Valiant
2007	B	`conf`	Evolvability. MFCS Leslie G. Valiant
2006	J	`jnl`	A Quantitative Theory of Neural Computation. Biol. Cybern. Leslie G. Valiant
2006	A*	`conf`	Accidental Algorithms. FOCS Leslie G. Valiant
2006	J	`jnl`	Evolvability. Electron. Colloquium Comput. Complex. Leslie G. Valiant
2006	A*	`conf`	Knowledge Infusion. AAAI Leslie G. Valiant
2005	Misc	`conf`	Completeness for Parity Problems. COCOON Leslie G. Valiant
2005	J	`jnl`	Holographic Algorithms Electron. Colloquium Comput. Complex. Leslie G. Valiant
2005	A*	`conf`	Holographic Circuits. ICALP Leslie G. Valiant
2005	J	`jnl`	Memorization and Association on a Realistic Neural Model Electron. Colloquium Comput. Complex. Leslie G. Valiant
2005	J	`jnl`	Memorization and Association on a Realistic Neural Model. Neural Comput. Leslie G. Valiant
2004	A*	`conf`	Holographic Algorithms (Extended Abstract). FOCS Leslie G. Valiant
2003	J	`jnl`	Three problems in computer science. J. ACM Leslie G. Valiant
2002	J	`jnl`	Expressiveness of matchgates. Theor. Comput. Sci. Leslie G. Valiant
2002	J	`jnl`	Quantum Circuits That Can Be Simulated Classically in Polynomial Time. SIAM J. Comput. Leslie G. Valiant
2001	A*	`conf`	Quantum computers that can be simulated classically in polynomial time. STOC Leslie G. Valiant
2000	J	`jnl`	A neuroidal architecture for cognitive computation. J. ACM Leslie G. Valiant
2000	J	`jnl`	Robust logics. Artif. Intell. Leslie G. Valiant
1999	J	`jnl`	Projection Learning. Mach. Learn. Leslie G. Valiant
1999	A*	`conf`	Relational Learning for NLP using Linear Threshold Elements. IJCAI Roni Khardon, Dan Roth, Leslie G. Valiant
1999	A*	`conf`	Robust Logics. STOC Leslie G. Valiant
1998	A*	`conf`	A Neuroidal Architecture for Cognitive Computation. ICALP Leslie G. Valiant
1998	A*	`conf`	Projection Learning. COLT Leslie G. Valiant
1996	B	`conf`	Managing Complexity in Neurodial Circuits. ALT Leslie G. Valiant
1995	—	`conf`	Bulk synchronous parallel computing-a paradigm for transportable software. HICSS (2) Thomas E. Cheatham, Amr F. Fahmy, Dan C. Stefanescu, Leslie G. Valiant
1995	—	`book`	Circuits of the mind. Leslie G. Valiant
1995	A*	`conf`	Cognitive Computation (Extended Abstract). FOCS Leslie G. Valiant
1995	A*	`conf`	Rationality. COLT Leslie G. Valiant
1994	—	`conf`	A Computational Model for Cognition (Abstract). IFIP Congress (1) Leslie G. Valiant
1994	J	`jnl`	Cryptographic Limitations on Learning Boolean Formulae and Finite Automata. J. ACM Michael J. Kearns, Leslie G. Valiant
1994	J	`jnl`	Direct Bulk-Synchronous Parallel Algorithms. J. Parallel Distributed Comput. Alexandros V. Gerbessiotis, Leslie G. Valiant
1994	J	`jnl`	Learning Boolean Formulas. J. ACM Michael J. Kearns, Ming Li, Leslie G. Valiant
1993	—	`conf`	A neuroidal model for cognitive functions. EuroCOLT Leslie G. Valiant
1993	—	`conf`	Cryptographic Limitations on Learning Boolean Formulae and Finite Automata. Machine Learning: From Theory to Applications Michael J. Kearns, Leslie G. Valiant
1993	—	`conf`	Why BSP Computers? IPPS Leslie G. Valiant
1992	—	`conf`	A Combining Mechanism for Parallel Computers. Heinz Nixdorf Symposium Leslie G. Valiant
1992	—	`conf`	Direct Bulk-Synchronous Parallel Algorithms. SWAT Alexandros V. Gerbessiotis, Leslie G. Valiant
1991	A*	`ed.`	Proceedings of the Fourth Annual Workshop on Computational Learning Theory, COLT 1991, Santa Cruz, California, USA, August 5-7, 1991 COLT Manfred K. Warmuth, Leslie G. Valiant
1990	J	`jnl`	A Bridging Model for Parallel Computation. Commun. ACM Leslie G. Valiant
1990	—	`ch.`	General Purpose Parallel Architectures. Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity (A) Leslie G. Valiant
1989	J	`jnl`	A General Lower Bound on the Number of Examples Needed for Learning Inf. Comput. Andrzej Ehrenfeucht, David Haussler, Michael J. Kearns, Leslie G. Valiant
1989	A*	`conf`	Cryptographic Limitations on Learning Boolean Formulae and Finite Automata STOC Michael J. Kearns, Leslie G. Valiant
1988	A*	`conf`	A General Lower Bound on the Number of Examples Needed for Learning. COLT Andrzej Ehrenfeucht, David Haussler, Michael J. Kearns, Leslie G. Valiant
1988	J	`jnl`	Computational limitations on learning from examples. J. ACM Leonard Pitt, Leslie G. Valiant
1988	A*	`conf`	Functionality in Neural Nets. AAAI Leslie G. Valiant
1988	A*	`conf`	Functionality in Neural Nets. COLT Leslie G. Valiant
1987	J	`jnl`	A logarithmic time sort for linear size networks. J. ACM John H. Reif, Leslie G. Valiant
1987	A*	`conf`	On the Learnability of Boolean Formulae STOC Michael J. Kearns, Ming Li, Leonard Pitt, Leslie G. Valiant
1987	A*	`conf`	Recent Developments in the Theory of Learning (Abstract). ICALP Leslie G. Valiant
1986	J	`jnl`	NP is as Easy as Detecting Unique Solutions. Theor. Comput. Sci. Leslie G. Valiant, Vijay V. Vazirani
1986	J	`jnl`	Negation is Powerless for Boolean Slice Functions. SIAM J. Comput. Leslie G. Valiant
1986	—	`conf`	Pragmatic Aspects of Complexity Theory (Panel). IFIP Congress Leslie G. Valiant
1986	J	`jnl`	Random Generation of Combinatorial Structures from a Uniform Distribution. Theor. Comput. Sci. Mark Jerrum, Leslie G. Valiant, Vijay V. Vazirani
1985	J	`jnl`	A Complexity Theory Based on Boolean Algebra J. ACM Sven Skyum, Leslie G. Valiant
1985	A*	`conf`	Learning Disjunction of Conjunctions. IJCAI Leslie G. Valiant
1985	A*	`conf`	NP Is as Easy as Detecting Unique Solutions STOC Leslie G. Valiant, Vijay V. Vazirani
1984	A*	`conf`	A Theory of the Learnable STOC Leslie G. Valiant
1984	J	`jnl`	A Theory of the Learnable. Commun. ACM Leslie G. Valiant
1984	J	`jnl`	Short Monotone Formulae for the Majority Function. J. Algorithms Leslie G. Valiant
1983	A*	`conf`	A Logarithmic Time Sort for Linear Size Networks STOC John H. Reif, Leslie G. Valiant
1983	A*	`conf`	Exponential Lower Bounds for Restricted Monotone Circuits STOC Leslie G. Valiant
1983	J	`jnl`	Fast Parallel Computation of Polynomials Using Few Processors. SIAM J. Comput. Leslie G. Valiant, Sven Skyum, S. Berkowitz, Charles Rackoff
1983	J	`jnl`	Optimality of a Two-Phase Strategy for Routing in Interconnection Networks. IEEE Trans. Computers Leslie G. Valiant
1983	J	`jnl`	Size Bounds for Superconcentrators. Theor. Comput. Sci. G. Lev, Leslie G. Valiant
1982	J	`jnl`	A Scheme for Fast Parallel Communication. SIAM J. Comput. Leslie G. Valiant
1981	A*	`conf`	A Complexity Theory Based on Boolean Algebra FOCS Sven Skyum, Leslie G. Valiant
1981	J	`jnl`	A Fast Parallel Algorithm for Routing in Permutation Networks. IEEE Trans. Computers Gavriela Freund Lev, Nicholas Pippenger, Leslie G. Valiant
1981	J	`jnl`	Addendum: Computing Multivariate Polynomials in Parallel. Inf. Process. Lett. Leslie G. Valiant
1981	B	`conf`	Fast Parallel Computation of Polynomials Using Few Processes. MFCS Leslie G. Valiant, Sven Skyum
1981	A*	`conf`	Universal Schemes for Parallel Communication STOC Leslie G. Valiant, Gordon J. Brebner
1981	J	`jnl`	Universality Considerations in VLSI Circuits. IEEE Trans. Computers Leslie G. Valiant
1980	J	`jnl`	Computing Multivariate Polynomials in Parallel. Inf. Process. Lett. Leslie G. Valiant
1980	J	`jnl`	Negation can be Exponentially Powerful. Theor. Comput. Sci. Leslie G. Valiant
1979	A*	`conf`	Completeness Classes in Algebra STOC Leslie G. Valiant
1979	J	`jnl`	Fast Probabilistic Algorithms for Hamiltonian Circuits and Matchings. J. Comput. Syst. Sci. Dana Angluin, Leslie G. Valiant
1979	A*	`conf`	Negation Can Be Exponentially Powerful STOC Leslie G. Valiant
1979	—	`conf`	Negative Results on Counting. Theoretical Computer Science Leslie G. Valiant
1979	J	`jnl`	The Complexity of Computing the Permanent. Theor. Comput. Sci. Leslie G. Valiant
1979	J	`jnl`	The Complexity of Enumeration and Reliability Problems. SIAM J. Comput. Leslie G. Valiant
1978	—	`conf`	The Complexity of Combinatorial Computations: An Introduction. GI Jahrestagung Leslie G. Valiant
1977	A*	`conf`	Fast Probabilistic Algorithms for Hamiltonian Circuits and Matchings STOC Dana Angluin, Leslie G. Valiant
1977	B	`conf`	Graph-Theoretic Arguments in Low-Level Complexity. MFCS Leslie G. Valiant
1977	J	`jnl`	On Time Versus Space. J. ACM John E. Hopcroft, Wolfgang J. Paul, Leslie G. Valiant
1976	J	`jnl`	A Note on the Succinctness of Descriptions of Deterministic Languages Inf. Control. Leslie G. Valiant
1976	J	`jnl`	Circuit Size is Nonlinear in Depth. Theor. Comput. Sci. Mike Paterson, Leslie G. Valiant
1976	J	`jnl`	Graph-Theoretic Properties in computational Complexity. J. Comput. Syst. Sci. Leslie G. Valiant
1976	J	`jnl`	Relative Complexity of Checking and Evaluating. Inf. Process. Lett. Leslie G. Valiant
1976	J	`jnl`	Shifting Graphs and Their Applications. J. ACM Nicholas Pippenger, Leslie G. Valiant
1976	A*	`conf`	The Equivalence Problem for D0L Systems and its Decidability for Binary Alphabets. ICALP Leslie G. Valiant
1976	A*	`conf`	Universal Circuits (Preliminary Report) STOC Leslie G. Valiant
1975	J	`jnl`	Deterministic One-Counter Automata. J. Comput. Syst. Sci. Leslie G. Valiant, Mike Paterson
1975	J	`jnl`	General Context-Free Recognition in Less than Cubic Time. J. Comput. Syst. Sci. Leslie G. Valiant
1975	A*	`conf`	On Non-linear Lower Bounds in Computational Complexity STOC Leslie G. Valiant
1975	A*	`conf`	On Time versus Space and Related Problems FOCS John E. Hopcroft, Wolfgang J. Paul, Leslie G. Valiant
1975	J	`jnl`	Parallelism in Comparison Problems. SIAM J. Comput. Leslie G. Valiant
1975	J	`jnl`	Regularity and Related Problems for Deterministic Pushdown Automata. J. ACM Leslie G. Valiant
1974	A*	`conf`	The Decidability of Equivalence for Deterministic Finite-Turn Pushdown Automata STOC Leslie G. Valiant
1974	J	`jnl`	The Equivalence Problem for Deterministic Finite-Turn Pushdown Automata Inf. Control. Leslie G. Valiant
1973	—	`—`	Decision procedures for families of deterministic pushdown automata. Leslie G. Valiant
1973	—	`conf`	Deterministic one-counter automata. Automatentheorie und Formale Sprachen Leslie G. Valiant, Mike Paterson