| A theory of the learnable LG Valiant Communications of the ACM 27 (11), 1134-1142, 1984 | 6882 | 1984 |
| A bridging model for parallel computation LG Valiant Communications of the ACM 33 (8), 103-111, 1990 | 4874 | 1990 |
| The complexity of computing the permanent LG Valiant Theoretical computer science 8 (2), 189-201, 1979 | 2991 | 1979 |
| The complexity of enumeration and reliability problems LG Valiant SIAM Journal on Computing 8 (3), 410-421, 1979 | 2224 | 1979 |
| Cryptographic limitations on learning Boolean formulae and finite automata M Kearns, L Valiant Journal of the ACM (JACM) 41 (1), 67-95, 1994 | 1113 | 1994 |
| Random generation of combinatorial structures from a uniform distribution MR Jerrum, LG Valiant, VV Vazirani Theoretical computer science 43, 169-188, 1986 | 992 | 1986 |
| Fast probabilistic algorithms for Hamiltonian circuits and matchings D Angluin, LG Valiant Journal of Computer and system Sciences 18 (2), 155-193, 1979 | 879 | 1979 |
| Universal schemes for parallel communication LG Valiant, GJ Brebner Proceedings of the thirteenth annual ACM symposium on Theory of computing …, 1981 | 818 | 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 | 817 | 1985 |
| A scheme for fast parallel communication LG Valiant SIAM journal on computing 11 (2), 350-361, 1982 | 781 | 1982 |
| Computational limitations on learning from examples L Pitt, LG Valiant Journal of the ACM (JACM) 35 (4), 965-984, 1988 | 626 | 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 | 584 | 1989 |
| Completeness classes in algebra LG Valiant Proceedings of the eleventh annual ACM symposium on Theory of computing, 249-261, 1979 | 541 | 1979 |
| General purpose parallel architectures LG Valiant Algorithms and Complexity, 943-971, 1990 | 518 | 1990 |
| Parallelism in comparison problems LG Valiant SIAM Journal on Computing 4 (3), 348-355, 1975 | 479 | 1975 |
| Universality considerations in VLSI circuits LG Valiant IEEE Transactions on Computers 100 (2), 135-140, 1981 | 463 | 1981 |
| Learning Disjunction of Conjunctions. LG Valiant IJCAI, 560-566, 1985 | 438 | 1985 |
| General context-free recognition in less than cubic time LG Valiant Journal of computer and system sciences 10 (2), 308-315, 1975 | 386 | 1975 |
| Graph-theoretic arguments in low-level complexity LG Valiant International Symposium on Mathematical Foundations of Computer Science, 162-176, 1977 | 380 | 1977 |
| On the learnability of Boolean formulae M Kearns, M Li, L Pitt, L Valiant Proceedings of the nineteenth annual ACM symposium on Theory of computing …, 1987 | 368 | 1987 |
