| A theory of the learnable LG Valiant Communications of the ACM 27 (11), 1134-1142, 1984 | 8213 | 1984 |
| A bridging model for parallel computation LG Valiant Communications of the ACM 33 (8), 103-111, 1990 | 5499 | 1990 |
| The complexity of computing the permanent LG Valiant Theoretical computer science 8 (2), 189-201, 1979 | 3497 | 1979 |
| The complexity of enumeration and reliability problems LG Valiant siam Journal on Computing 8 (3), 410-421, 1979 | 2662 | 1979 |
| Cryptographic limitations on learning boolean formulae and finite automata M Kearns, L Valiant Journal of the ACM (JACM) 41 (1), 67-95, 1994 | 1372 | 1994 |
| Random generation of combinatorial structures from a uniform distribution MR Jerrum, LG Valiant, VV Vazirani Theoretical computer science 43, 169-188, 1986 | 1274 | 1986 |
| Fast probabilistic algorithms for Hamiltonian circuits and matchings D Angluin, LG Valiant Proceedings of the ninth annual ACM symposium on Theory of computing, 30-41, 1977 | 951 | 1977 |
| Universal schemes for parallel communication LG Valiant, GJ Brebner Proceedings of the thirteenth annual ACM symposium on Theory of computing …, 1981 | 942 | 1981 |
| NP is as easy as detecting unique solutions LG Valiant, VV Vazirani Proceedings of the seventeenth annual ACM symposium on Theory of computing …, 1985 | 927 | 1985 |
| A scheme for fast parallel communication LG Valiant SIAM journal on computing 11 (2), 350-361, 1982 | 887 | 1982 |
| Computational limitations on learning from examples L Pitt, LG Valiant Journal of the ACM (JACM) 35 (4), 965-984, 1988 | 685 | 1988 |
| A general lower bound on the number of examples needed for learning A Ehrenfeucht, D Haussler, M Kearns, L Valiant Information and Computation 82 (3), 247-261, 1989 | 646 | 1989 |
| Completeness classes in algebra LG Valiant Proceedings of the eleventh annual ACM symposium on Theory of computing, 249-261, 1979 | 638 | 1979 |
| General purpose parallel architectures LG Valiant Algorithms and Complexity, 943-971, 1990 | 569 | 1990 |
| Parallelism in comparison problems LG Valiant SIAM Journal on Computing 4 (3), 348-355, 1975 | 548 | 1975 |
| Universality considerations in VLSI circuits LG Valiant IEEE Transactions on Computers 100 (2), 135-140, 1981 | 530 | 1981 |
| Learning Disjunction of Conjunctions. LG Valiant IJCAI, 560-566, 1985 | 522 | 1985 |
| Direct bulk-synchronous parallel algorithms AV Gerbessiotis, LG Valiant Journal of parallel and distributed computing 22 (2), 251-267, 1994 | 498 | 1994 |
| General context-free recognition in less than cubic time L Valiant Carnegie Mellon University, 1974 | 461 | 1974 |
| Graph-theoretic arguments in low-level complexity LG Valiant International Symposium on Mathematical Foundations of Computer Science, 162-176, 1977 | 454 | 1977 |
