| Experimental Design for Multiplexed SNP Genotyping | J. Gramm, A. Ben-Dor, and R. Sharan | Manuscript | January 05 2004 | 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 | |
| Reinforcement Learning for Trading: Immediate vs. Future Rewards | J. Moody and M. Saffell | Knowledge Discovery and Datamining, Proceedings of the 1998 New York Conference, AAAI Press, 1998. | 1998 | Algorithms | |
| Decision Technologies for Computational Finance, Proceedings of the London Conference | A. Refenes, N. Burgess, and J. Moody, editors. | Kluwer Financial Publishing, The Netherlands, 1998. | 1998 | 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 | |
| Probabilistic recurrence relations | R. M. Karp | Journal of the Association for Computing Machinery, Vol. 41, No. 6, pp. 1136-50 | November 1994 | Algorithms | |
| Randomized parallel algorithms for backtrack search and branch-and-bound computation | R. M. Karp and Y. Zhang | Journal of the Association for Computing Machinery, Vol. 40, No.3, pp. 765-89 | July 1993 | 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 | |
| Theoretical improvements in algorithmic efficiency for network flow problems | J. Edmonds and R. M. Karp | Journal of the Association for Computing Machinery, Vol. 19, No. 2, p. 248-64 | April 1972 | Algorithms | |
| Asymmetric K-Center Is Log* N-Hard to Approximate | J. Chuzhoy, S. Guha, E. Halperin, S. Khanna, G. Kortsarz, R. Krauthgamer, and J. Naor | Journal of the ACM, Vol. 52, Issue 4, pp. 538-551 | July 2005 | Algorithms | |
| On Parallel Evaluation of Game Trees | R.M. Karp and Y. Zhang | Journal of the ACM, Nov. 1998, vol.45, (no.6):1050-75. | 1998 | Algorithms | |
| Association Mapping and Significance Estimation via the Coalescent | G. Kimmel, R. M. Karp, M. A. Jordan, and E. Halperin | Journal of Human Genetics, Vol. 83, Issue 6, pp. 675-683 | December 2008 | Algorithms | [PDF]
|
| Performance Functions and Reinforcement Learning for Trading Systems and Portfolios | J. Moody, L. Wu, Y. Liao, and M. Saffell | Journal of Forecasting, vol. 17, pp. 441-470, 1998. | 1998 | Algorithms | |
| A Phenomenon in the Theory of Sorting | D. Gale and R. M. Karp | Journal of Computer and System Sciences, Vol. 6, No. 2, p. 103-15 | April 1972 | Algorithms | |
| The complexity of parallel search | R.M. Karp, E. Upfal, and A. Wigderson | Journal of Computer and System Sciences, Vol. 36, No. 2. Also in the proceedings of the 17th Annual ACM Symposium on the Theory of Computing, Providence, Rhode Island, May 1985, pp. 225-53 | April 1988 | 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 | |
| Probabilistic Inference of Viral Quasispecies Subject to Recombination | A. Topfer, O. Zagordi, S. Prabhakaran, V. Roth, E. Halperin, and N. Beerenwinkel | Journal of Computational Biology, Vol. 20, No. 2, pp. 113-123 | February 2013 | Algorithms | |
| Haplotype Inference in Complex Pedigrees | B. Kirkpatrick, E. Halperin, and R. M. Karp | Journal of Computational Biology, Vol. 17, No. 3, pp. 269-280 | March 2010 | Algorithms | |
| Topology-Free Querying of Protein Interaction Networks | S. Bruckner, F. Huffner, R. M. Karp, R. Shamir, and R. Sharan | Journal of Computational Biology, Vol. 17, Issue 3, pp. 237-252 | March 2010 | Algorithms | [PDF]
|
| Torque: Topology-Free Querying of Protein Interaction Networks | S. Bruckner, F. Hüffner, R. M. Karp, R. Shamir, and R. Sharan | Journal of Computational Biology, Vol. 17, Issue 3, pp. 237-252 | March 2010 | Algorithms | |
| Comparing Protein Interaction Networks via a Graph Match-and-Split Algorithm | M. Narayanan and R. M. Karp | Journal of Computational Biology, Vol. 14, Issue 7, pp. 892-907 | September 2007 | Algorithms | [PDF]
|
| Efficient Algorithms for Detecting Signaling Pathways in Protein Interaction Networks | J. Scott, T. Ideker, R. M. Karp, and R. Sharan | Journal of Computational Biology, Vol. 13, Issue 2 pp. 133-144 | March 2006 | Algorithms | [PDF]
|
| Identification of Protein Complexes by Comparative Analysis of Yeast and Bacterial Protein Interaction Data | R. Sharan, T. Ideker, B. P. Kelley, R. Shamir, and R. M. Karp | Journal of Computational Biology, Vol. 12, Issue 6, pp. 835-846; also in Proceedings of the 8th Annual International Conference on Research in Computational Molecular Biology (RECOMB'04), San Diego, California, pp. 282-289, March 2004 | July 2005 | Algorithms | |
| Towards Optimally Multiplexed Applications of Universal Arrays | A. Ben-Dor, T. Hartman, R. M. Karp, B. Schwikowski, R. Sharan, and Z. Yakhini | Journal of Computational Biology, Vol. 11, Nos. 2-3, pp. 477-493 | January 2004 | Algorithms | [PDF]
|
| Discovering Local Structure in Gene Expression Data: The Order-Preserving Submatrix Problem | A. Ben-Dor, B. Chor, R. M. Karp, and Z. Yakhini | Journal of Computational Biology, Vol. 10, No. 3-4, pp. 385-398 | 2003 | Algorithms | |
| The Restriction Scaffold Problem | A. Ben-Dor, R.M. Karp, B. Schwikowski, and R. Shamir | Journal of Computational Biology, Vol. 10, No. 3-4, pp. 385-398 | 2003 | Algorithms | |
| Comparing Pedigree Graphs | B. Kirkpatrick, Y. Reshef, H. Finucane, H. Jiang, B. Zhu, and R. M. Karp | Journal of Computational Biology | 2012 | Algorithms | [PDF]
|
| A Simplex variant solving an m*d linear program in O(min(m2, d2)) expected number of pivot steps | I. Adler, R. M. Karp, and R. Shamir | Journal of Complexity, Vol. 3, No. 4, pp. 372-87 | December 1987 | Algorithms | |
| Monte-Carlo algorithms for the planar multiterminal network reliability problem | R. M. Karp and M. Luby | Journal of Complexity, Vol. 1, No. 1. Also in the Proceedings of the Symposium on the Complexity of Approximately Solved Problems, New York, New York, pp. 45-64, April 1985 | October 1985 | Algorithms | |
| A Note on Optimally Phasing Long Genomic Regions Using Local Haplotype Predictions | E. Eskin, E. Halperin, and R. Sharan | Journal of Bioinformatics and Computational Biology, Vol. 4, No. 3, pp. 639-647 | June 2006 | Algorithms | |
| Efficient Reconstruction of Haplotype Structure Via Perfect Phylogeny | E. Eskin, E. Halperin, and R.M. Karp | Journal of Bioinformatics and Computational Biology (JBCB) 1(1) 1-20 | 2003 | Algorithms | |
| A Practical Computer Immunology Approach for Self-Protection Enhanced by Optimization Techniques | A. Pietzowski, B. Satzger, W. Trumler, and T. Ungerer | Journal of Autonomic and Trusted Computing | 2010 | Algorithms | |
| A Probabilistic Model for the Survivability of Cells | I. Adler, H-S Ahn, R. M. Karp, and S.M. Ross | Journal of Applied Probability, Vol. 42, No. 4, pp. 919-931 | December 2005 | Algorithms | |
| Temperature Profiles Induced by a Scanning CW Laser Beam | J. Moody and R.H. Hendel | Journal of Applied Physics, Vol. 53, Issue 6, pp. 4364-4371 | 1982 | Algorithms | |
| Competitive paging algorithms | A. Fiat, R. M. Karp, M. Luby, L.A. McGeoch, D.D. Sleator, and N.E. Young | Journal of Algorithms, Vol. 12, No. 4, pp. 685-99 | December 1991 | 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 | |
| Monte-Carlo approximation algorithms for enumeration problems | R. M. Karp, M. Luby, and N. Madras | Journal of Algorithms, Vol. 10, No.3, pp. 429-48 | September 1989 | Algorithms | |
| Pattern Matching for Arc-Annotated Sequences | J. Gramm, J. Guo, and R. Niedermeier | Journal of Algorithms | January 05 2004 | Algorithms | |
| Aufträge, Partner, Kosten - Kooperation statt Konkurrenz | J. Lässig, S. Heinrich, and U. Trommler | IT&Production, Issue 10, pp. 74-76 | November 2009 | Algorithms | |
| Deciphering the Genetic Components of Human Diseases | E. Halperin | Invited talk at the 7th International Conference on Algorithms and Complexity (CIAC 2010), Rome, Italy | May 2010 | Algorithms | |
| Autonomous and Scalable Failure Detection in Distributed Systems | B. Satzger, A. Pietzowski, and T. Ungerer | International Journal of Autonomous and Adaptive Communications Systems, Vol. 4, No.1, pp. 61-77 | January 2011 | Algorithms | |
| Computational Problems in Noisy SNP and Haplotype Analysis: Block Scores, Block Identification and Population Stratification | G. Kimmel, R. Sharan, and R. Shamir | INFORMS Journal on Computing, in press | January 05 2004 | Algorithms | |
| Branch and Infer: A Unifying Framework for Integer and Nite Domain Constraint Programming | A. Bockmayr and T. Kasper | INFORMS Journal on Computing, 10(3): 287-300, 1998. | 1998 | Algorithms | |
| The Complexity of Testing Whether a Graph is a Superconcentrator | M. Blum, R. M. Karp, O.Vornberger, C.H. Papadimitriou, and M. Yannakakis | Information Processing Letters, Vol. 13, No. 4-5, pp. 164-7 | 1981 | Algorithms | |
| On the security of ping-pong protocols | D. Dolev, S. Even, and R. M. Karp | Information and Control, Vol. 55, No.1-3, pp. 57-68 | 1982 | Algorithms | |
| Combinatorics, Complexity and Stochastic Algorithms | R. M. Karp | Informatie, Vol. 28, No. 9, pp. 722-33 | September 1986 | Algorithms | |
| Smoothed Analysis of Balancing Networks | T. Friedrich, T. Sauerwald, and D. Vilenchik | In Random Structures and Algorithms, Vol. 39, No. 1, pp. 115-138, DOI: 10.1002/rsa.20341 | August 2010 | Algorithms | |
| Optimally Phasing Long Genomic Regions using Local Haplotype Predictions | E. Eskin, E. Halperin, and R. Sharan | In Proceedings of the Second RECOMB Satellite Workshop on Computational Methods for SNPs and Haplotypes, pp. 13-16 | January 05 2004 | Algorithms | |
| Tight Lower Bounds for the Asymetric k-Center Problem | J. Chuzhoy, S. Guha, E. Halperin, S. Khanna, G. Kortsarz and S. Naor | In Proceedings of the 36th Annual ACM Symposium on Theory of Computing (STOC04) | January 05 2004 | Algorithms | |
| Perfect Phylogeny and Haplotype Assignment | E. Halperin and R.M. Karp | In Proceedings of RECOMB | January 05 2004 | Algorithms | |
