| Reducibility among combinatorial problems RM Karp 50 Years of Integer Programming 1958-2008: From the Early Years to the State …, 2010 | 19440 | 2010 |
| A scalable content-addressable network S Ratnasamy, P Francis, M Handley, R Karp, S Shenker Proceedings of the 2001 conference on Applications, technologies …, 2001 | 11011 | 2001 |
| An Algorithm for Maximum Matchings in Bipartite Graphs JE Hopcroft, RM Karp SIAM Journal on computing 2 (4), 225-231, 1973 | 3844 | 1973 |
| Theoretical improvements in algorithmic efficiency for network flow problems J Edmonds, RM Karp Journal of the ACM (JACM) 19 (2), 248-264, 1972 | 3681 | 1972 |
| LogP: Towards a realistic model of parallel computation D Culler, R Karp, D Patterson, A Sahay, KE Schauser, E Santos, ... Proceedings of the fourth ACM SIGPLAN symposium on Principles and practice …, 1993 | 2516 | 1993 |
| Efficient randomized pattern-matching algorithms RM Karp, MO Rabin IBM journal of research and development 31 (2), 249-260, 1987 | 2003 | 1987 |
| The traveling-salesman problem and minimum spanning trees M Held, RM Karp Operations research 18 (6), 1138-1162, 1970 | 1966 | 1970 |
| A dynamic programming approach to sequencing problems M Held, RM Karp Journal of the Society for Industrial and Applied mathematics 10 (1), 196-210, 1962 | 1938 | 1962 |
| The traveling-salesman problem and minimum spanning trees: Part II M Held, RM Karp Mathematical programming 1 (1), 6-25, 1971 | 1571 | 1971 |
| Parallel program schemata RM Karp, RE Miller Journal of Computer and system Sciences 3 (2), 147-195, 1969 | 1563 | 1969 |
| A survey of parallel algorithms for shared-memory machines RM Karp University of California at Berkeley, 1988 | 1492 | 1988 |
| Topologically-aware overlay construction and server selection S Ratnasamy, M Handley, R Karp, S Shenker Proceedings. Twenty-First Annual Joint Conference of the IEEE Computer and …, 2002 | 1223 | 2002 |
| A characterization of the minimum cycle mean in a digraph RM Karp Discrete mathematics 23 (3), 309-311, 1978 | 1010 | 1978 |
| On the computational complexity of combinatorial problems RM Karp Networks 5 (1), 45-68, 1975 | 982 | 1975 |
| An optimal algorithm for on-line bipartite matching RM Karp, UV Vazirani, VV Vazirani Proceedings of the twenty-second annual ACM symposium on Theory of computing …, 1990 | 979 | 1990 |
| Feature selection for high-dimensional genomic microarray data EP Xing, MI Jordan, RM Karp Icml 1 (3), 601-608, 2001 | 968 | 2001 |
| Conserved patterns of protein interaction in multiple species R Sharan, S Suthram, RM Kelley, T Kuhn, S McCuine, P Uetz, T Sittler, ... Proceedings of the National Academy of Sciences 102 (6), 1974-1979, 2005 | 957 | 2005 |
| Application-level multicast using content-addressable networks S Ratnasamy, M Handley, R Karp, S Shenker International Workshop on Networked Group Communication, 14-29, 2001 | 954 | 2001 |
| Discovering local structure in gene expression data: the order-preserving submatrix problem A Ben-Dor, B Chor, R Karp, Z Yakhini Proceedings of the sixth annual international conference on Computational …, 2002 | 930 | 2002 |
| Randomized rumor spreading R Karp, C Schindelhauer, S Shenker, B Vocking Proceedings 41st Annual Symposium on Foundations of Computer Science, 565-574, 2000 | 902 | 2000 |
