| Developments in Forecast Combination and Portfolio Choice | C. Dunis, A. Timmermann, and J. Moody, editors | Wiley Financial Economics, London, 2001. | 2001 | Algorithms | |
| Discrete Prediction Games with Arbitrary Feedback and Loss | A. Piccolboni and C. Schindelhauer | Universitat zu Lubeck Technical Report No. AIIM-TR-A-00-18 | November 2000 | Algorithms | |
| A Simple Algorithm for Finding Frequent Elements in Streams and Bags | R.M. Karp, S. Shenker, and C.H. Papadimitriou | Transactions on Database Systems | 2003 | Algorithms | |
| Computing Nash Equilibria for Scheduling on Restricted Parallel Links | M. Gairing, T. Lücking, M. Mavronicolas, and B. Monien | Theory of Computing Systems, Vol. 47, No. 2, pp. 405-432 | August 2010 | Algorithms | |
| On the Price of Heterogeneity in Parallel Systems | P. Brighten Godfrey and R. M. Karp | Theory of Computing Systems, Vol. 45, No. 2, pp. 280-301 | August 2009 | Algorithms | [PDF]
|
| Comparing Verboseness for Finite Automata and Turing Machines | T. Tantau | Theory of Computing Systems, Vol. 31, No. 1, pp. 95-109 | January 05 2004 | Algorithms | |
| Approximation Algorithms for Data Management in Networks | C. Krick, H. Racke, and M. Westermann | Theory of Computing Systems, 2001. | 2001 | Algorithms | |
| Graph-Modeled Data Clustering: Fixed-Parameter Algorithms for Clique Generation | J. Gramm, J. Guo, F. Hüffner, and R. Niedermeier | Theory of Computing Systems | January 05 2004 | Algorithms | |
| Parameterized Intractability of Distinguishing Substring Selection | J. Gramm, J. Guo, and R. Niedermeier | Theory of Computing Systems | January 05 2004 | Algorithms | |
| Optimal Flow Distribution Among Multiple Channels with Unknown Capacities | R. M. Karp, T. Nierhoff, and T. Tantau | Theoretical Computer Science: Essays in Memory of Shimon Even, O. Goldreich, A. L. Rosenberg, and A. L. Selman, eds., Lecture Notes in Computer Science, Vol. 3895, pp. 111-128, Springer-Verlag | 2006 | Algorithms | [PDF]
|
| A Self-Stabilizing Algorithm for Cut Problems in Synchronous Networks | T. Sauerwald and D. Sudholt | Theoretical Computer Science, Vol. 411, Issues 14-15, pp. 1599-1612 | March 2010 | Algorithms | |
| Plateaus Can Be Harder in Multi-Objective Optimization | T. Friedrich, N. Hebbinghaus, and F. Neumann | Theoretical Computer Science, Vol. 411, Issue 6, pp. 854-864 | February 2010 | 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]
|
| The Minimum-Entropy Set Cover Problem | E. Halperin and R. M. Karp | Theoretical Computer Science, Vol. 348, Issue 2, pp. 240-250 | December 2005 | Algorithms | |
| Performance Aspects of Distributed Caches Using TTL-Based Consistency | E. Cohen, E. Halperin, and H. Kaplan | Theoretical Computer Science, Vol. 331, Issue 1, pp. 73-96 | February 2005 | Algorithms | |
| Computing the Similarity of Two Sequences with Nested Arc Annotations | J. Alber, J. Gramm, J. Guo, and R. Niedermeier | Theoretical Computer Science, Vol. 312, Issues 2-3, pp. 337-358 | January 2004 | Algorithms | |
| On Approximating Optimal Auctions | A. Ronen | The Third ACM Conference on Electronic Commerce (EC01), 11-17, 2001. | 2001 | Algorithms | |
| Leveraging Genetic Variability Across Populations for the Identification of Causal Variants | N. Zaitlen, B. Pasaniuc, T. Gur, E. Zic, and E. Halperin | The American Journal of Human Genetics, Vol. 86, Issue 1, pp. 23-33 | January 2010 | Algorithms | |
| Estimating Local Ancestry in Admixed Populations | S. Sankararaman, S. Sridhar, G. Kimmel, and E. Halperin | The American Journal of Human Genetics, Vol. 82, Issue 2, pp. 290-303 | February 2008 | Algorithms | [PDF]
|
| A Branch and Cut Algorithm for the Optimal Solution of the Side Chain Placement Problem | E. Althaus, O. Kohlbacher, H.P. Lenhof, and P. Muller | Technical Report Vol.2000-1-001, Max-Planck-Institut fur Informatik: Foschungsbericht, 2000. | 2000 | Algorithms | |
| Distributed Caching Independent of the Network Size | M. Westermann | Symposium on Parallel Algorithms and Archiectures, 31-40, 2002. | 2002 | Algorithms | |
| Regularizers and Priors for Feed-Forward Networks | J. Moody and T. Rognvaldsson | Submitted for publication 2003 | 2003 | Algorithms | |
| A Gambling Game and its Application to the Analysis of Adaptive Randomized Rounding | R.M. Karp and C. Kenyon | Springer-Verlag Lecture Notes in Computer Science, Volume 2764 (RANDOM 03), 329-340 | 2003 | Algorithms | |
| LogP: towards a realistic model of parallel computation | D. Culler, R.M. Karp, D. Patterson, A. Sahay, K.E. Schauser, E. Santos, R. Subramonian, and T. von Eicken. | SIGPLAN Notices, Vol. 28, No. 7. Also in the proceedings of the Fourth ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, San Diego, California, USA, May 1993, pp. 1-12 | July 1993 | Algorithms | |
| Emerging Opportunities for Theoretical Computer Science | A.V. Aho, D.S. Johnson, R.M. Karp, S.R. Kosaraju, and others | SIGACT News, Sept. 1997, vol.28, (no.3):65-74. | 1997 | Algorithms | |
| Challenges for Theory of Computing | A. Condon, H. Edelsbrunner, E.A. Emerson, L. Fortnow, et.al. | SIGACT News, June 1999, vol.30, (no.2):62-76. | June 1999 | 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 | |
| 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 | |
| Near-optimal Solutions to a 2-dimensional Placement Problem | R. M. Karp, A.C. McKellar, and C.K. Wong | SIAM Journal on Computing, Vol. 4, No. 3, pp. 271-86 | September 1975 | Algorithms | |
| When is the assignment bound tight for the asymmetric traveling-salesman problem? | A. Frieze, R. M. Karp, and B. Reed | SIAM Journal on Computing, Vol. 24, No. 3, pp. 484-93 | June 1995 | Algorithms | |
| A graph-theoretic game and its application to the k-server problem | N. Alon, R. M. Karp, D Peleg, and D. West | SIAM Journal on Computing, Vol. 24, No. 1, pp. 78-100 | February 1995 | Algorithms | |
| A Monte-Carlo algorithm for estimating the permanent | N. Karmarkar, R. M. Karp, R. Lipton, L. Lovasz, and M. Luby | SIAM Journal on Computing, Vol. 22, No. 2, pp. 284-93 | April 1993 | Algorithms | |
| An n5/2 Algorithm for Maximum Matchings in Bipartite Graphs | R. M. Karp and J.E. Hopcroft | SIAM Journal on Computing, Vol. 2, No. 4, pp. 225-31 | December 1973 | Algorithms | |
| Deferred Data Structuring | R. M. Karp, R. Motwani, and P. Raghaven | SIAM Journal on Computing, Vol. 17, No. 5, pp. 883-902 | October 1988 | Algorithms | |
| On linear characterizations of combinatorial optimization problems | R. M. Karp, C.H. Papadimitriou | SIAM Journal on Computing, Vol. 11, No. 4, pp. 620-32 | November 1982 | 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 | |
| Incomplete Directed Perfect Phylogeny | I. Pe'er, T. Pupko, R. Shamir, and R. Sharan | SIAM Journal on Computing 33(3), pp. 590-607 | January 05 2004 | 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 | |
| The Efficiency of Resolution and Davis-Putnamn Procedures | P. Beame, R. M. Karp, T. Pitassi, and M. Saks | SIAM Journal of Computing, Vol. 31, No. 4, pp. 1048-1075 | 2002 | Algorithms | |
| TSP-Based Curve Reconstruction in Polynomial Time | E. Althaus and K. Melhorn | SIAM Journal of Computing 31(1), 2001. | 2001 | Algorithms | |
| Load Balancing in Structured P2P Systems | A. Rao, K. Lakshminarayanan, S. Surana, R.M. Karp, and I. Stoica | Second International Workshop on Peer-to-Peer Systems | 2003 | Algorithms | |
| Identifying Personal Genomes by Surname Inference | M. Gymrek, A. L. McGuire, D. Golan, E. Halperin, and Y. Erlich | Science, Vol. 339, No. 6117, pp. 321-324 | January 2013 | Algorithms | |
| Whole-Genome Patterns of Common DNA Variation in Three Human Populations | D. A. Hinds, L. L. Stuve, G. B. Nilsen, E. Halperin, E. Eskin, D. G. Ballinger, K. A. Frazer, and D. R. Cox | Science, Vol. 307, No. 5712, pp. 1072-1079. DOI:10.1126/science.1105436 | February 2005 | Algorithms | [PDF]
|
| A New Biology for the 21st Century | National Research Council of the National Academies | Report of Committee on a New Biology for the 21st Century: Ensuring the United States Leads the Coming Biology Revolution | 2010 | Algorithms | [PDF]
|
| 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 | |
| Constructing Maps Using the Span and Inclusion Relations | D. Fasulo, T. Jiang, R.M. Karp, and N. Sharma | RECOMB 98. Proceedings of the Second Annual International Conference on Computational Molecular Biology. March 1998. Edited by: Istrail, S.; Pevzner, P.; Waterman, M. New York, NY, USA: ACM, 1998. p. 64-73. | 1998 | Algorithms | |
| Algorithms for Optical Mapping | R.M. Karp and R. Shamir | RECOMB 98. Proceedings of the Second Annual International Conference on Computational Molecular Biology. 22-25 March 1998. Edited by: Istrail, S.; Pevzner, P.; Waterman, M. New York, NY, USA: ACM, 1998. p. 117-24. | 1998 | Algorithms | |
| Computable Functions and Complexity in Neural Networks | O. Egecioglu, T.R. Smith, and J. Moody | Real Brains, Artificial Minds, J. L. Casti and A. Karlqvist, eds., Elsevier Science Publishing Co | 1987 | Algorithms | |
| Coalescing Times for IID Random Variables | I. Adler, H.S. Ahn, R.M. Karp, and S.M. Ross | Random Structures and Algorithms | 2003 | Algorithms | |
| Bounded branching process and AND/OR tree evaluation | R. M. Karp and Y. Zhang | Random Structures & Algorithms, Vol. 7, No. 2, pp. 97-116 | September 1995 | Algorithms | |
