| An optimal algorithm for Monte Carlo estimation | P. Dagum, R. M. Karp, M. Luby, and S. Ross | Proceedings of the 36th Annual Symposium on Foundations of Computer Science (FOCS'95), Milwaukee, Wisconsin, pp. 142-9 | October 1995 | Algorithms | |
| An Optimal Algorithm for Monte Carlo Estimation | P. Dagum, R.M. Karp, M. Luby, and S. Ross | SIAM Journal on Computing, SIAM J. Comput. (USA), vol.29, (no.5), SIAM, 2000. p.1484-96. | 2000 | Algorithms | |
| Transitive Compaction in Parallel via Branchings | P. Gibbons, R. M. Karp, V. Ramachandran, D. Soroker, and R. Tarjan | Journal of Algorithms, Vol. 12, No. 1, pp. 110-25 | March 1991 | Algorithms | |
| Chemokine Polymorphisms and Lymphoma: A Pooled Analysis | P. M. Bracci, C. F. Skibola, L. Conde, E. Halperin, T. Lightfoot, A. Smith, R. A. Paynter, D. R. Skibola, L. Agana, E. Roman, E. Kane, and J. K. Wiencke | Leukemia and Lymphoma, Vol. 51, No. 3, pp. 497-506 | March 2010 | Algorithms | |
| Dynamic Network Topology Changes in Functional Modules Predict Responses to Oxidative Stress in Yeast | P. V. Gopalacharyulu, V. R. Velagapudi, E. Lindfors, E. Halperin, and M. Orešič | Molecular BioSystems, Vol. 5, Issue 3, pp. 276-287 | March 2009 | Algorithms | |
| Subtree isomorphism is in random NC | P.B. Gibbons, R. M. Karp, G.L. Miller, and D. Soroker | Discrete Applied Mathematics, Vol. 29, No. 1, pp. 35-62 | November 1990 | Algorithms | |
| Subtree isomorphism is in random NC | P.B. Gibbons, R. M. Karp, G.L. Miller, and D. Soroker. Edited by J.H. Reif | Proceedings of the Third Aegean Workshop on Computing, VLSI Algorithms and Architectures (AWOC 88), Corfu, Greece, pp. 43-52 | July 1988 | Algorithms | |
| Random Walks, Universal Traversal Sequences, and the Complexity of Maze Problems | R. Aleliunas, R. M. Karp, R.J. Lipton, and L. Lovasz | Proceedings of the Computer Science and Statistics 12th Annual Symposium on the Interface, Waterloo, Ontario, Canada, pp. 174-6 | May 1979 | Algorithms | |
| Random Walks, Universal Traversal Sequences, and the Complexity of Maze Problems | R. Aleliunas, R. M. Karp, R.J. Lipton, L. Lovasz, and C. Rackoff | Proceedings of the 20th Annual IEEE Symposium of Foundations of Computer Science, San Juan, Puerto Rico, pp. 218-23 | October 1979 | Algorithms | |
| The mortgage problem | R. El-Yaniv and R. M. Karp | Proceedings of the Second Israel Symposium on Theory and Computing Systems (Cat. No. 93TH0520-7), Natanya, Israel, pp. 304-12 | June 1993 | Algorithms | |
| Nearly Optimal Competitive Online Replacement Policies | R. El-Yaniv and R.M. Karp | Mathematics of Operations Research, Nov. 1997, vol.22, (no.4):814-39. | 1997 | Algorithms | |
| Competitive analysis of financial games | R. El-Yaniv, A. Fiat, R. M. Karp, and G. Turpin | Proceedings 33rd Annual Symposium on Foundations of Computer Science (Cat. No. 92CH3188-0), Pittsburgh, Pennsylvania, pp. 327-33 | October 1992 | Algorithms | |
| Genome-Wide In-silico Determination of Transcriptional Regulation Modules Controlling Cell Cycle in Human Cells | R. Elkon, C. Linhart, R. Sharan, R. Shamir, and Y. Shiloh | Genome Research, 13, pp. 773-780 | 2003 | Algorithms | |
| Tight Bounds for the Cover Time of Multiple Random Walks | R. Elsässer and T. Sauerwald | Proceedings of the 36th International Colloquium on Automata, Languages, and Programming (ICALP 2009), Rhodes, Greece, pp. 415-426 | July 2009 | Algorithms | [PDF]
|
| On the Runtime and Robustness of Randomized Broadcasting | R. Elsässer and T. Sauerwald | Theoretical Computer Science, Vol. 410, Issue 36, pp. 3414-3427 | August 2009 | Algorithms | [PDF]
|
| Understanding Science Through the Lens of Computation | R. Karp | Presented at the Symposium on Transformational Information Engineering and Science, Singapore | January 2010 | Algorithms | |
| Three Combinatorial Problems in Computational and Genomic Biology | R. Karp | IFORS Distinguished Lecture at the Joint International Meeting of the Canadian Operational Research Society and the Institute for Operations Research and the Management Sciences (CORS-INFORMS International), Toronto, Canada | June 2009 | Algorithms | |
| Theory of Computation as an Enabling Tool for the Sciences | R. Karp | Presented at the Turing Centennial Celebration, Princeton, New Jersey. Also presented at the 9th Annual Conference on Theory and Applications of Models of Computation (TAMC 2012), Turing Centenary Meeting, Beijing, China | May 2012 | Algorithms | |
| Optimal Flow Distribution Among Multiple Channels with Unknown Capacities | R. Karp, T. Nierhoff, and T. Tantau | Proceedings of the Second Brazilian Symposium of Graphs, Algorithms, and Combinatorics (GRACO 2005), Angra dos Reis, Brazil, pp. 225-231 | July 2005 | Algorithms | [PDF]
|
| The Intrinsic Dimensionality of Graphs | R. Krauthgamer and J.R. Lee | Manuscript, 2002. | 2002 | Algorithms | |
| Advances in Neural Information Processing Systems 3 | R. Lippmann, J. Moody, and D. Touretzky, eds. | Morgan Kaufmann, Palo Alto | 1991 | Algorithms | |
| Mathematical Challenges from Genomics and Molecular Biology | R. M. Karp | Notices of the American Mathematical Society, Vol. 49, No. 5, pp. 544-553 | 2002 | Algorithms | |
| Modeling parallel communication | R. M. Karp | Proceedings of the 9th International Parallel Processing Symposium (IPDPS '95), Santa Barbara, California, p. 2 | April 1995 | Algorithms | |
| Probabilistic recurrence relations | R. M. Karp | Journal of the Association for Computing Machinery, Vol. 41, No. 6, pp. 1136-50 | November 1994 | Algorithms | |
| Mapping the Genome: some combinatorial problems arising in molecular biology | R. M. Karp | Proceedings of 25th Annual Symposium on the Theory of Computing, San Diego, California, pp. 278-85 | May 1993 | Algorithms | |
| On-line algorithms versus off-line algorithms: how much is it worth to know the future? | R. M. Karp | Proceedings of the IFIP 12th World Computer Congress on Algorithms, Software, Architecture - Information Processing '92, Madrid, Spain, pp. 416-29 | 1992 | Algorithms | |
| An introduction to randomized algorithms | R. M. Karp | Discrete Applied Mathematics, Vol. 34, No. 1-3. Also in the proceedings of the Capital City Conference on Combinatorics and Theoretical Computer Science, Washington, D.C., pp. 165-201 | November 21 1991 | Algorithms | |
| Combinatorics, Complexity and Stochastic Algorithms | R. M. Karp | Informatie, Vol. 28, No. 9, pp. 722-33 | September 1986 | Algorithms | |
| Combinatorics, Complexity, and Randomness | R. M. Karp | Communications of the ACM, Vol. 29, No. 2, pp. 98-109 | February 1986 | Algorithms | |
| The complexity of parallel computation | R. M. Karp | Proceedings of the 23rd Annual Allerton Conference on Communication, Control, and Computing, Monticello, Illinois, p. 1 | October 1985 | Algorithms | |
| Dynamic programming meets the principle of inclusion and exclusion | R. M. Karp | Operations Research Letters, Vol. 1, No. 2, pp. 49-51 | April 1982 | Algorithms | |
| An Algorithm to Solve the m*n Assignment Problem in Expected Time O(mn log n)* | R. M. Karp | Networks, Vol. 10, No. 2, pp. 143-52 | 1980 | Algorithms | |
| A Patching Algorithm for the Nonsymmetric Traveling-salesman Problem | R. M. Karp | SIAM Journal on Computing, Vol. 8, No. 4, pp. 561-73 | November 1979 | Algorithms | |
| Probabilistic Analysis of Graph-theoretic Algorithms | R. M. Karp | Proceedings of the Computer Science and Statistics 12th Annual Symposium on the Interface, Waterloo, Ontario, pp. 173 | May 1979 | Algorithms | |
| A Characterization of the Minimum Cycle Mean in a Digraph | R. M. Karp | Discrete Mathematics (Netherlands), Vol. 23, No. 3, pp. 309-11 | September 1978 | Algorithms | |
| Probabilistic Analysis of Partitioning Algorithms for the Traveling-salesman Problem in the Plane | R. M. Karp | Mathematics of Operations Research, Vol. 2, No. 3, pp. 209-24 | August 1977 | Algorithms | |
| On the Computational Complexity of Combinatorial Problems | R. M. Karp | Networks, Vol. 5, No.1. Also in the Proceedings of the Symposium on Large-Scale Networks, Evanston, Illinois, pp. 45-68, April 1974 | January 1975 | Algorithms | |
| Fair Bandwidth Allocation Without Per-Flow State | R. M. Karp | In Essays in Theoretical Computer Science in Memory of Shimon Even, O. Goldreich, A. L. Rosenberg, and A. L. Selman, eds., pp. 88-110, Springer | 2006 | Algorithms | |
| Optimization Problems Related to Internet Congestion Control | R. M. Karp | Graph Theory, Combinatorics and Algorithms: Interdisciplinary Applications, M.C. Golumbic and I.B.-A. Hartman, eds., Springer-Verlag, New York | 2005 | Algorithms | |
| George Dantzig's Impact on the Theory of Computation | R. M. Karp | Discrete Optimization, Vol. 5, Issue 2, pp. 174-185 | May 2006 | Algorithms | |
| Report of the SIGACT Committee on funding for Theoretical Computer Science | R. M. Karp | SIGACT (Special Interest Group on Algorithms and Computation Theory) News | December 2005 | Algorithms | |
| Implicit Hitting Set Problems and Multi-Genome Alignment | R. M. Karp | Keynote speech at the 21st Annual Symposium on Combinatorial Pattern Matching (CPM2010), New York, New York | June 2010 | Algorithms | |
| Streaming Algorithms for Selection and Approximate Sorting | R. M. Karp | Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, New Delhi, India, pp. 9-20 | December 2007 | Algorithms | |
| Heuristic Algorithms in Computations Molecular Biology | R. M. Karp | Journal of Computer and System Sciences, Special Issue: Celebrating Karp's Kyoto Prize, Vol. 77, No. 1, pp. 122-128 | January 2011 | Algorithms | |
| Effective Heuristics for NP-Hard Problems | R. M. Karp | Presented at the Michael Rabin Celebration, Cambridge, Massachusetts | August 2011 | Algorithms | |
| A fast parallel algorithm for the maximal independent set problem | R. M. Karp and A. Wigderson | Journal of the Association for Computing Machinery, Vol. 32, No. 4, pp. 762-73 | October 1985 | Algorithms | |
| On Linear Characterizations of Combinatorial Optimization Problems | R. M. Karp and C.H. Papadimitriou | Proceedings of the 21st Annual IEEE Symposium on Foundations of Computer Science, Syracuse, New York, pp. 1-9 | October 1980 | Algorithms | |
| On the Optimality of Huffman Trees | R. M. Karp and C.R. Glassey | SIAM Journal on Applied Mathematics, Vol. 31, No. 2, pp. 368-78 | September 1976 | Algorithms | |
| On the Optimality of Huffman Trees | R. M. Karp and C.R. Glassey | Report number ORC-74-21, University of California, Berkeley, California | June 1974 | Algorithms | |
| Probabilistic Behavior of a Naive Coloring Algorithm on Random Graphs | R. M. Karp and D.W. Matula | Bulletin of the Operations Research Society of America, Vol. 23, supplement 2. Also in the proceedings of the ORSA/TIMS National Meeting (Abstracts only), Las Vegas, Nevada, pp. B264 | 1975 | Algorithms | |
