| FFD bin packing for item sizes with uniform distributions on (0, 1/2) | S. Floyd and R. M. Karp | Algorithmica, Vol. 6, No. 2, pp. 222-40 | 1991 | Algorithms | |
| FED bin packing for item sizes with distributions on (0,1/2) | S. Floyd and R. M. Karp | Proceedings of the 27th Annual Symposium on Foundations of Computer Science (Cat. No. 86CH2354-9), Toronto, Ontario, Canada, pp. 322-30 | October 1986 | 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 | Proceedings of the 13th Annual International Conference on Research in Computational Molecular Biology (RECOMB 2009), Tucson, Arizona, pp. 74-89 | May 2009 | Algorithms | |
| 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 | |
| Torque: Topology-Free Querying of Protein Interaction Networks | S. Bruckner, F. Hueffner, R. M. Karp, R. Shamir, and R. Sharan | Nucleic Acids Research, Vol. 37, pp. 106-108 | July 2009 | Algorithms | [PDF]
|
| On the power of randomization in on-line algorithms | S. Ben-David, A. Borodin, R. M. Karp, G. Tardos, and A. Wigderson | Algorithmica, Vol. 11, No. 1, pp. 2-14 | January 1994 | Algorithms | |
| On the power of randomization in online algorithms | S. Ben-David, A. Borodin, R. M. Karp, G. Tardos, and A. Wigderson | Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, Baltimore, Maryland, pp. 379-86 | May 1990 | Algorithms | |
| Computing Single Source Shortest Paths Using Single-Objective Fitness Functions | S. Baswana, S. Biswas, DB. Doerr, T. Friedrich, P. Kurur, and F. Neumann | Proceedings of the 10th Foundations of Genetic Algorithms Workshop (FOGA X), Orlando, Florida, pp. 59-66 | January 2009 | Algorithms | [PDF]
|
| 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 | |
| Efficient PRAM Simulation on a Distributed Memory Machine | R.M. Karp, M. Luby, and F. Meyer auf der Heide | Algorithmica, Vol. 16, No. 4-5, pp. 517-42 | October 1996 | Algorithms | |
| Finite-Length Analysis of LT-codes | R.M. Karp, M. Luby, and A. Shokrollahi | Proceedings of International Symposium on Information Theory (ISIT) | January 05 2004 | 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 | |
| Error-Resilient DNA Computation. Random Structures & Algorithms, Random Struct | R.M. Karp, C. Kenyon, and O. Waarts | Algorithms (USA), vol.15, (no.3-4), Wiley, Oct.-Dec. 1999. p.450-66. 19 | October 1999 | Algorithms | |
| Average case analysis of a heuristic for the assignment problem | R.M. Karp, A.H.G. Rinnooy Kan, and R.V. Vohra | Mathematics of Operations Research, Vol. 19, No. 3, pp. 513-22 | August 1994 | Algorithms | |
| Load Balancing in Structured P2P Systems | R.M. Karp, A. Rao, K. Lakshminarayanan, S. Surana, and I. Stoica | Proceedings of the Second International Workshop on Peer-to-Peer Systems | 2003 | 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 | |
| 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 | |
| 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 | |
| Variations on the Theme of "Twenty Questions" | R.M. Karp | Proceedings of the 1998 IEEE International Symposium on Information Theory, Aug. 1998. New York, NY, USA: IEEE, 1998. p. 3. | August 1998 | Algorithms | |
| Genome-Wide Association Data Reveal a Global Map of Genetic Interactions among Protein Complexes | R. Srivas, G. Hannum, A. Guénolé, H. van Attikum, N. J. Krogan, R. M. Karp, and T. Ideker | Presented at the 18th Annual International Conference on Intelligent Systems for Molecular Biology (ISMB 2010), Boston, Massachusetts | July 2010 | Algorithms | |
| 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 | |
| Conserved Patterns of Protein Interaction in Multiple Species | R. Sharan, S. Sutharan, R. Kelley, T. Kuhn, S. McCuine, T.Sittler, R. Karp, and T. Ideker | Proceedings of National Academy of Science, Vol. 102, Issue 6, pp. 1974-1979 | February 2005 | Algorithms | [PDF]
|
| CRÈME: A Framework for Identifying Cis-Regulatory Modules in Human-Mouse Conserved Segments | R. Sharan, I. Ovcharenko, A. Ben-Hur, and R. M. Karp | Proceedings of the Eleventh International Conference on Intelligent Systems for Molecular Biology (ISMB'03), Bioinformatics 19, Supplement 1, pp. 1283-1291 | 2003 | Algorithms | |
| CLICK and EXPANDER: A System for Clustering and Visualizing Gene Expression Data | R. Sharan, A. Maron-Katz, and R. Shamir | Bioinformatics, 19, pp. 1787-1799 | 2003 | Algorithms | |
| CREME: Cis-Regulatory Module Explorer for the Human Genome | R. Sharan, A. Ben-Hur, G.G. Loots, and I. Ovcharenko | Nucleic Acids Research 32, pp. W253-W256 | January 05 2004 | Algorithms | |
| Multiplexing Schemes for Generic SNP Genotyping Assays | R. Sharan, A. Ben-Dor, and Z. Yakhini | Proceedings of PSB'04, pp. 140-151 | January 05 2004 | Algorithms | |
| Reconstructing Boolean Models of Signaling | R. Sharan and R. M. Karp | Proceedings of the 16th Annual International Conference on Research in Computational Molecular Biology (RECOMB 2012), Barcelona, Spain, pp. 261-271 | April 2012 | Algorithms | |
| Cluster Graph Modification Problems | R. Shamir, R. Sharan, and D. Tsur | Discrete Applied Mathematics | January 05 2004 | Algorithms | |
| Optimal Fully Dynamic Algorithms for Cograph Recognition | R. Shamir and R. Sharan | Discrete Applied Mathematics 136, pp. 329-340 | January 05 2004 | Algorithms | |
| MGMR: Leveraging RNA-Seq Population Data to Optimize Expression Estimation | R. Rozov, E. Halperin, and R. Shamir | Proceedings of the Second Annual Satellite Workshop on Massively Parallel Sequencing at the 16th Annual International Conference on Research in Computational Molecular Biology (RECOMB 2012), Barcelona, Spain. Published in BMC Bioinformatics, Vol. 13, Suppl. 6:S2 | April 2012 | Algorithms | [PDF]
|
| miRNAkey: A Software for microRNA Deep Sequencing Analysis | R. Ronen, I. Gan, S. Modai, A. Sukacheov, G. Dror, E. Halperin, and N. Shomron | Bioinformatics, Vol. 26, Issue 20, pp. 2615-2616 | October 2010 | Algorithms | |
| Combinatorial Games with a Pass: A Dynamical Systems Approach | R. Morrison, E. Friedman, and A. Landsberg | Proceedings of the 4th International Conference on Chaotic Modeling, Simulation, and Applications (CHAOS2011), Agios Nikolaos, Greece | May 2011 | Algorithms | [PDF]
|
| Combinatorial Games with a Pass: A dynamical systems approach | R. Morrison, E. Friedman, and A. Landsberg | Chaos, Vol. 21, No. 4 | December 2011 | Algorithms | |
| A generalization of binary search | R. M. Karp. Edited by: F. Dehne, J.R. Sack, N. Santoro, and S. Whitesides | Proceedings of the Third Workshop on Algorithms and Data Structures (WADS'93), Montreal, Quebec, Canada, pp. 27-34 | August 1993 | Algorithms | |
| An optimal algorithm for on-line bipartite matching | R. M. Karp, U.V. Vazirani, and V.V. Vazirani | Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, Baltimore, Maryland | May 1990 | 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]
|
| 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 | |
| Probabilistic analysis of network flow algorithms | R. M. Karp, R. Motwani, and N. Nisan | Mathematics of Operations Research, Vol. 18, No. 1, pp. 71-97 | February 1993 | Algorithms | |
| The bit vector intersection problem | R. M. Karp, O. Waarts and G. Zweig | Proceedings of the 36th Annual Symposium on Foundations of Computer Science (FOCS'95), Milwaukee, Wisconsin, pp. 621-30 | October 1995 | Algorithms | |
| On a search problem related to branch-and-bound procedures | R. M. Karp, M. Saks, and A. Wigderson | Proceedings of the 27th Annual Symposium on Foundations of Computer Science (Cat. No.86CH2354-9), Toronto, Ontario, Canada. Also in IEEE Computer Society Press, Washington D.C., pp.19-28 | October 1986 | 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 | |
| Efficient PRAM simulation on a distributed memory machine | R. M. Karp, M. Luby, and F. Meyer auf der Heide | Proceedings of the 24th Annual ACM Symposium on the Theory of Computing, Victoria, British Columbia, Canada, pp. 318-26 | May 1992 | Algorithms | |
| Global wire routing in two-dimensional arrays | R. M. Karp, F.T. Leighton, R.L. Rivest, C.D. Thompson, U.V. Vazirani, and V.V. Vazirani | Algorithmica, Vol. 2, No.1, pp. 113-29 | 1987 | Algorithms | |
| Global wire routing in two-dimensional arrays | R. M. Karp, F.T. Leighton, R.L. Rivest, C.D. Thompson, U.V. Vazirani, and V.V. Vazirani | Proceedings of the 24th Annual Symposium on Foundations of Computer Science, Tucson, Arizona. Also in IEEE Computer Society Press, Silver Spring, Maryland, pp.453-9 | November 1983 | Algorithms | |
| Recent Advances in the Probabilistic Analysis of Graph-theoretic Algorithms | R. M. Karp, Edited by: Maurer, H.A. | Automata, Languages and Programming, Graz, Austria, Springer-Verlag, pp. 338-9 | July 1979 | Algorithms | |
| The complexity of parallel computation | R. M. Karp, Edited by: C.E. Leiserson | Proceedings of the Fourth MIT Conference on Advanced Resarch in VLSI, Cambridge, Massachusetts, pp.197 | April 1986 | 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 | |
| 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 | |
| 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 | |
