Richard M. Karp [FOAF] [Follow]

Position:	Professor
Affiliation:	Department of Electrical Engineering and Computer Science University of California at Berkeley
Address:	621 Soda Hall #1776 Berkeley, CA 94720-1776
Email:
Homepage:	http://www.cs.berkeley.edu/~karp/
	[Edit]

Statistics:	H-index: 73 (See all experts' h-index.) total citation number: 26728 highest-cited paper: A scalable content-addressable network (2001) at SIGCOMM (Cited By 121) More Statistics...

bio:

His current activities center around algorithmic methods in genomics and computer networking. He has ... More

Research Interest:

Parallel Computation, Probabilistic Analysis, Combinatorial Problem, Competitive Paging Algorithms, Efficient Algorithms

Show Temporal Interests (Do you want to see the change of his/her research interests?)

Publications: [Edit disambiguation Result]

Group By Year Group By Category

2009 Top (5)
[194]	Bonnie Kirkpatrick, Javier Rosa, Eran Halperin, Richard M. Karp. Haplotype Inference in Complex Pedigrees. RECOMB'2009. pp.108~120 [Bibtex]
[193]	Sharon Bruckner, Falk Huffner, Richard M. Karp, Ron Shamir, Roded Sharan. Topology-Free Querying of Protein Interaction Networks. RECOMB'2009. pp.74~89 Cited By 9[Bibtex]
[192]	Constantinos Daskalakis, Richard M. Karp, Elchanan Mossel, Samantha Riesenfeld, Elad Verbin. Sorting and selection in posets. SODA'2009. pp.392~401 Cited By 12[Bibtex] [PDF]
[191]	Brighten Godfrey, Richard M. Karp. On the Price of Heterogeneity in Parallel Systems. Theory Comput. Syst., 2009: 280~301 Cited By 3[Bibtex]
[190]	Sharon Bruckner, Falk Huffner, Richard M. Karp, Ron Shamir, Roded Sharan. Torque: topology-free querying of protein interaction networks. Nucleic Acids Research, 2009: 106~108 Cited By 3[Bibtex]
2008 Top (5)
[189]	Richard M. Karp. Computer Science as a Lens on the Sciences. ICDCS'2008. pp.1~2 [Bibtex]
[188]	Igor Ulitsky, Richard M. Karp, Ron Shamir. Detecting Disease-Specific Dysregulated Pathways Via Analysis of Clinical Expression Profiles. RECOMB'2008. pp.347~359 Cited By 16[Bibtex]
[187]	Henry Lin, Christos Amanatidis, Martha Sideri, Richard M. Karp, Christos H. Papadimitriou. Linked decompositions of networks and the power of choice in Polya urns. SODA'2008. pp.993~1002 Cited By 1[Bibtex]
[186]	Constantinos Daskalakis, Alexandros G. Dimakis, Richard M. Karp, Martin J. Wainwright. Probabilistic Analysis of Linear Programming Decoding. IEEE Transactions on Information Theory, 2008: 3565~3578 Cited By 16[Bibtex] [PDF]
[185]	Richard M. Karp. George Dantzig's impact on the theory of computation. Discrete Optimization, 2008: 174~185 Cited By 1[Bibtex]
2007 Top (11)
[184]	Richard M. Karp. Streaming Algorithms for Selection and Approximate Sorting. FSTTCS'2007. pp.9~20 [Bibtex]
[183]	Lucian Popa, Afshin Rostamizadeh, Richard M. Karp, Christos H. Papadimitriou, Ion Stoica. Balancing traffic load in wireless networks with curveball routing. MobiHoc'2007. pp.170~179 Cited By 37[Bibtex]
[182]	Constantinos Daskalakis, Alexandros G. Dimakis, Richard M. Karp, Martin J. Wainwright. Probabilistic analysis of linear programming decoding. SODA'2007. pp.385~394 Cited By 16[Bibtex] [PDF]
[181]	Richard M. Karp, Robert Kleinberg. Noisy binary search and its applications. SODA'2007. pp.881~890 Cited By 15[Bibtex]
[180]	Richard M. Karp. Computer Science as a Lens on the Sciences:. Web Intelligence'2007. [Bibtex]
[179]	Richard M. Karp. Computer Science as a Lens on the Sciences: The Example of Computational Molecular Biology. BIBM'2007. pp.5~5 [Bibtex]
[178]	Bonnie Kirkpatrick, Carlos Santos Armendariz, Richard M. Karp, Eran Halperin. HAPLOPOOL: improving haplotype frequency estimation through DNA pools and phylogenetic modeling. Bioinformatics, 2007: 3048~3055 Cited By 7[Bibtex]
[177]	Constantinos Daskalakis, Alexandros G. Dimakis, Richard M. Karp, Martin J. Wainwright. Probabilistic Analysis of Linear Programming Decoding. CoRR, 2007. Cited By 16[Bibtex] [PDF]
[176]	Constantinos Daskalakis, Richard M. Karp, Elchanan Mossel, Samantha Riesenfeld, Elad Verbin. Sorting and Selection in Posets. CoRR, 2007. Cited By 12[Bibtex] [PDF]
[175]	Manikandan Narayanan, Richard M. Karp. Comparing Protein Interaction Networks via a Graph Match-and-Split Algorithm. Journal of Computational Biology, 2007: 892~907 Cited By 13[Bibtex] [PDF]
[174]	Richard M. Karp, Ming Li, Pavel A. Pevzner, Ron Shamir. Special issue on computational molecular biology. J. Comput. Syst. Sci., 2007: 1023~1023 [Bibtex]
2006 Top (6)
[173]	Richard M. Karp. Fair Bandwidth Allocation Without Per-Flow State. Essays in Memory of Shimon Even'2006. pp.88~110 Cited By 1[Bibtex]
[172]	Richard M. Karp, Till Nierhoff, Till Tantau. Optimal Flow Distribution Among Multiple Channels with Unknown Capacities. Essays in Memory of Shimon Even'2006. pp.111~128 [Bibtex] [PDF]
[171]	Brighten Godfrey, Richard M. Karp. On the price of heterogeneity in parallel systems. SPAA'2006. pp.84~92 Cited By 3[Bibtex]
[170]	Jacob Scott, Trey Ideker, Richard M. Karp, Roded Sharan. Efficient Algorithms for Detecting Signaling Pathways in Protein Interaction Networks. Journal of Computational Biology, 2006: 133~144 Cited By 110[Bibtex] [PDF]
[169]	Sonesh Surana, Brighten Godfrey, Karthik Lakshminarayanan, Richard M. Karp, Ion Stoica. Load balancing in dynamic structured peer-to-peer systems. Perform. Eval., 2006: 217~240 Cited By 30[Bibtex]
[168]	Irit Gat-Viks, Richard M. Karp, Ron Shamir, Roded Sharan. Reconstructing Chain Functions in Genetic Networks. SIAM J. Discrete Math., 2006: 727~740 Cited By 4[Bibtex]
2005 Top (5)
[167]	Jacob Scott, Trey Ideker, Richard M. Karp, Roded Sharan. Efficient Algorithms for Detecting Signaling Pathways in Protein Interaction Networks. RECOMB'2005. pp.1~13 Cited By 110[Bibtex] [PDF]
[166]	Roded Sharan, Trey Ideker, Brian P. Kelley, Ron Shamir, Richard M. Karp. Identification of Protein Complexes by Comparative Analysis of Yeast and Bacterial Protein Interaction Data. Journal of Computational Biology, 2005: 835~846 Cited By 108[Bibtex] [PDF]
[165]	Richard M. Karp, Ming Li, Pavel A. Pevzner, Ron Shamir. Guest Editors' foreword. J. Comput. Syst. Sci., 2005: 283~283 [Bibtex]
[164]	Eran Halperin, Richard M. Karp. The minimum-entropy set cover problem. Theor. Comput. Sci., 2005: 240~250 Cited By 21[Bibtex] [PDF]
[163]	Richard M. Karp, Till Nierhoff, Till Tantau. Optimal flow distribution among multiple channels with unknown capacities. Electronic Notes in Discrete Mathematics, 2005: 225~231 [Bibtex] [PDF]
2004 Top (11)
[162]	Eran Halperin, Richard M. Karp. The Minimum-Entropy Set Cover Problem. ICALP'2004. pp.733~744 Cited By 21[Bibtex] [PDF]
[161]	Brighten Godfrey, Karthik Lakshminarayanan, Sonesh Surana, Richard M. Karp, Ion Stoica. Load Balancing in Dynamic Structured P2P Systems. INFOCOM'2004. Cited By 227[Bibtex]
[160]	Jeremy Elson, Richard M. Karp, Christos H. Papadimitriou, Scott Shenker. Global Synchronization in Sensornets. LATIN'2004. pp.609~624 Cited By 16[Bibtex] [PDF]
[159]	Irit Gat-Viks, Ron Shamir, Richard M. Karp, Roded Sharan. Reconstructing Chain Functions in Genetic Networks. Pacific Symposium on Biocomputing'2004. pp.498~509 Cited By 4[Bibtex]
[158]	Eran Halperin, Richard M. Karp. Perfect phylogeny and haplotype assignment. RECOMB'2004. pp.10~19 Cited By 43[Bibtex] [PDF]
[157]	Richard M. Karp. Algorithms for inferring cis-regulatory structures and protein interaction networks. RECOMB'2004. pp.45~45 [Bibtex]
[156]	Roded Sharan, Trey Ideker, Brian P. Kelley, Ron Shamir, Richard M. Karp. Identification of protein complexes by comparative analysis of yeast and bacterial protein interaction data. RECOMB'2004. pp.282~289 Cited By 108[Bibtex] [PDF]
[155]	Manikandan Narayanan, Richard M. Karp. Gapped Local Similarity Search with Provable Guarantees. WABI'2004. pp.74~86 Cited By 8[Bibtex]
[154]	Richard M. Karp. The Role of Experimental Algorithms in Genomics. WEA'2004. pp.299~300 Cited By 1[Bibtex]
[153]	Eric P. Xing, Wei Wu, Michael I. Jordan, Richard M. Karp. Logos: a Modular Bayesian Model for de Novo Motif Detection. J. Bioinformatics and Computational Biology, 2004: 127~154 Cited By 59[Bibtex] [PDF]
[152]	Amir Ben-Dor, Tzvika Hartman, Richard M. Karp, Benno Schwikowski, Roded Sharan, Zohar Yakhini. Towards Optimally Multiplexed Applications of Universal Arrays. Journal of Computational Biology, 2004: 476~492 Cited By 5[Bibtex]
2003 Top (12)
[151]	Richard M. Karp. The Role of Algorithmic Research in Computational Genomics. CSB'2003. pp.10~12 Cited By 2[Bibtex]
[150]	Eric P. Xing, Wei Wu, Michael I. Jordan, Richard M. Karp. LOGOS: a modular Bayesian model for de novo motif detection. CSB'2003. pp.266~276 Cited By 59[Bibtex] [PDF]
[149]	Ananth Rao, Karthik Lakshminarayanan, Sonesh Surana, Richard M. Karp, Ion Stoica. Load Balancing in Structured P2P Systems. IPTPS'2003. pp.68~79 Cited By 319[Bibtex] [PDF]
[148]	Eran Halperin, Jeremy Buhler, Richard M. Karp, Robert Krauthgamer, Ben Westover. Detecting protein sequence conservation via metric embeddings. ISMB (Supplement of Bioinformatics)'2003. pp.122~129 Cited By 10[Bibtex]
[147]	Roded Sharan, Ivan Ovcharenko, Asa Ben-Hur, Richard M. Karp. CREME: a framework for identifying cis-regulatory modules in human-mouse conserved segments. ISMB (Supplement of Bioinformatics)'2003. pp.283~291 Cited By 105[Bibtex]
[146]	Richard M. Karp, Claire Kenyon. A Gambling Game Arising in the Analysis of Adaptive Randomized Rounding. RANDOM-APPROX'2003. pp.329~340 [Bibtex]
[145]	Eleazar Eskin, Eran Halperin, Richard M. Karp. Large scale reconstruction of haplotypes from genotype data. RECOMB'2003. pp.104~113 Cited By 64[Bibtex] [PDF]
[144]	Micah Adler, Eran Halperin, Richard M. Karp, Vijay V. Vazirani. A stochastic process on the hypercube with applications to peer-to-peer networks. STOC'2003. pp.575~584 Cited By 96[Bibtex]
[143]	Amir Ben-Dor, Benny Chor, Richard M. Karp, Zohar Yakhini. Discovering Local Structure in Gene Expression Data: The Order-Preserving Submatrix Problem. Journal of Computational Biology, 2003: 373~384 Cited By 230[Bibtex] [PDF]
[142]	Amir Ben-Dor, Richard M. Karp, Benno Schwikowski, Ron Shamir. The Restriction Scaffold Problem. Journal of Computational Biology, 2003: 385~398 Cited By 8[Bibtex] [PDF]
[141]	Ilan Adler, Hyun-Soo Ahn, Richard M. Karp, Sheldon M. Ross. Coalescing times for IID random variables with applications to population biology. Random Struct. Algorithms, 2003: 155~166 Cited By 7[Bibtex]
[140]	Richard M. Karp, Scott Shenker, Christos H. Papadimitriou. A simple algorithm for finding frequent elements in streams and bags. ACM Trans. Database Syst., 2003: 51~55 Cited By 246[Bibtex]
2002 Top (7)
[139]	Sylvia Ratnasamy, Mark Handley, Richard M. Karp, Scott Shenker. Topologically-Aware Overlay Construction and Server Selection. INFOCOM'2002. Cited By 789[Bibtex] [PDF]
[138]	Eric P. Xing, Michael I. Jordan, Richard M. Karp, Stuart J. Russell. A Hierarchical Bayesian Markovian Model for Motifs in Biopolymer Sequences. NIPS'2002. pp.1489~1496 Cited By 25[Bibtex] [PDF]
[137]	Amir Ben-Dor, Benny Chor, Richard M. Karp, Zohar Yakhini. Discovering local structure in gene expression data: the order-preserving submatrix problem. RECOMB'2002. pp.49~57 Cited By 229[Bibtex] [PDF]
[136]	Amir Ben-Dor, Richard M. Karp, Benno Schwikowski, Ron Shamir. The restriction scaffold problem. RECOMB'2002. pp.58~66 Cited By 8[Bibtex] [PDF]
[135]	Aditya Akella, Srinivasan Seshan, Richard M. Karp, Scott Shenker, Christos H. Papadimitriou. Selfish behavior and stability of the internet: a game-theoretic analysis of TCP. SIGCOMM'2002. pp.117~130 Cited By 149[Bibtex]
[134]	Amos Fiat, Richard M. Karp, Michael Luby, Lyle A. McGeoch, Daniel Dominic Sleator, Neal E. Young. Competitive Paging Algorithms. CoRR, 2002. Cited By 326[Bibtex] [PDF]
[133]	Paul Beame, Richard M. Karp, Toniann Pitassi, Michael E. Saks. The Efficiency of Resolution and Davis--Putnam Procedures. SIAM J. Comput., 2002: 1048~1075 Cited By 82[Bibtex]
2001 Top (8)
[132]	Richard M. Karp. The Genomics Revolution and its Challenges for Algorithmic Research. Current Trends in Theoretical Computer Science, 2001: 631~642 Cited By 2[Bibtex] [PDF]
[131]	Jack Edmonds, Richard M. Karp. Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems. Combinatorial Optimization'2001. pp.31~33 Cited By 1060[Bibtex]
[130]	Eric P. Xing, Michael I. Jordan, Richard M. Karp. Feature selection for high-dimensional genomic microarray data. ICML'2001. pp.601~608 Cited By 306[Bibtex] [PDF]
[129]	Eric P. Xing, Richard M. Karp. CLIFF: clustering of high-dimensional microarray data via iterative feature filtering using normalized cuts. ISMB (Supplement of Bioinformatics)'2001. pp.306~315 Cited By 164[Bibtex]
[128]	Sylvia Ratnasamy, Mark Handley, Richard M. Karp, Scott Shenker. Application-Level Multicast Using Content-Addressable Networks. Networked Group Communication'2001. pp.14~29 Cited By 653[Bibtex] [PDF]
[127]	Sylvia Ratnasamy, Paul Francis, Mark Handley, Richard M. Karp, Scott Shenker. A scalable content-addressable network. SIGCOMM'2001. pp.161~172 Cited By 121[Bibtex] [PDF]
[126]	Ran El-Yaniv, Amos Fiat, Richard M. Karp, G. Turpin. Optimal Search and One-Way Trading Online Algorithms. Algorithmica, 2001: 101~139 Cited By 62[Bibtex]
[125]	Anne Condon, Richard M. Karp. Algorithms for graph partitioning on the planted partition model. Random Struct. Algorithms, 2001: 116~140 Cited By 54[Bibtex] [PDF]
2000 Top (9)
[124]	Richard M. Karp, Elias Koutsoupias, Christos H. Papadimitriou, Scott Shenker. Optimization Problems in Congestion Control. FOCS'2000. pp.66~74 Cited By 78[Bibtex] [PDF]
[123]	Richard M. Karp, Christian Schindelhauer, Scott Shenker, Berthold Vocking. Randomized Rumor Spreading. FOCS'2000. pp.565~574 Cited By 287[Bibtex] [PDF]
[122]	Richard M. Karp. The Genomics Revolution and Its Challenges for Algorithmic Research. ICALP'2000. pp.428~428 Cited By 2[Bibtex] [PDF]
[121]	Amir Ben-Dor, Richard M. Karp, Benno Schwikowski, Zohar Yakhini. Universal DNA tag systems: a combinatorial design scheme. RECOMB'2000. pp.65~75 Cited By 73[Bibtex] [PDF]
[120]	Amir Ben-Dor, Richard M. Karp, Benno Schwikowski, Zohar Yakhini. Universal DNA Tag Systems: A Combinatorial Design Scheme. Journal of Computational Biology, 2000: 503~519 Cited By 73[Bibtex] [PDF]
[119]	Richard M. Karp, Itsik Pe'er, Ron Shamir. An Algorithm Combining Discrete and Continuous Methods for Optical Mapping. Journal of Computational Biology, 2000: 745~760 Cited By 2[Bibtex] [PDF]
[118]	Richard M. Karp, Ron Shamir. Algorithms for Optical Mapping. Journal of Computational Biology, 2000: 303~316 Cited By 25[Bibtex] [PDF]
[117]	Micah Adler, John W. Byers, Richard M. Karp. Parallel Sorting with Limited Bandwidth. SIAM J. Comput., 2000: 1997~2015 Cited By 53[Bibtex]
[116]	Paul Dagum, Richard M. Karp, Michael Luby, Sheldon M. Ross. An Optimal Algorithm for Monte Carlo Estimation. SIAM J. Comput., 2000: 1484~1496 Cited By 80[Bibtex]
1999 Top (5)
[115]	Richard M. Karp, Itsik Pe'er, Ron Shamir. An Algorithm Combining Discrete and Continuous Methods for Optical Mapping. ISMB'1999. pp.159~168 Cited By 2[Bibtex] [PDF]
[114]	Anne Condon, Richard M. Karp. Algorithms for Graph Partitioning on the Planted Partition Model. RANDOM-APPROX'1999. pp.221~232 Cited By 54[Bibtex] [PDF]
[113]	Richard M. Karp, Roland Stoughton, Ka Yee Yeung. Algorithms for choosing differential gene expression experiments. RECOMB'1999. pp.208~217 Cited By 25[Bibtex]
[112]	Daniel P. Fasulo, Tao Jiang, Richard M. Karp, Reuben Settergren, Edward C. Thayer. An Algorithmic Approach to Multiple Complete Digest Mapping. Journal of Computational Biology, 1999: 187~208 Cited By 19[Bibtex]
[111]	Richard M. Karp, Claire Kenyon, Orli Waarts. Error-resilient DNA computation. Random Struct. Algorithms, 1999: 450~466 Cited By 58[Bibtex]
1998 Top (7)
[110]	Daniel P. Fasulo, Tao Jiang, Richard M. Karp, Nitin Sharma. Constructing maps using the span and inclusion relations. RECOMB'1998. pp.64~73 Cited By 7[Bibtex]
[109]	Richard M. Karp, Ron Shamir. Algorithms for optical mapping. RECOMB'1998. pp.117~124 Cited By 25[Bibtex] [PDF]
[108]	Richard M. Karp. Random Graphs, Random Walks, Differential Equations and the Probabilistic Analysis of Algorithms. STACS'1998. pp.1~2 Cited By 2[Bibtex]
[107]	Paul Beame, Richard M. Karp, Toniann Pitassi, Michael E. Saks. On the Complexity of Unsatisfiability Proofs for Random k-CNF Formulas. STOC'1998. pp.561~571 Cited By 106[Bibtex]
[106]	Tao Jiang, Richard M. Karp. Mapping Clones with a Given Ordering or Interleaving. Algorithmica, 1998: 262~284 Cited By 18[Bibtex]
[105]	Dan Gusfield, Richard M. Karp, Lusheng Wang, Paul Stelling. Graph Traversals, Genes and Matroids: An Efficient Case of the Travelling Salesman Problem. Discrete Applied Mathematics, 1998: 167~180 [Bibtex]
[104]	Richard M. Karp, Yangun Zhang. On Parallel Evaluation of Game Trees. J. ACM, 1998: 1050~1075 Cited By 15[Bibtex]
1997 Top (6)
[103]	Oren Zamir, Oren Etzioni, Omid Madani, Richard M. Karp. Fast and Intuitive Clustering of Web Documents. KDD'1997. pp.287~290 Cited By 230[Bibtex] [PDF]
[102]	Tao Jiang, Richard M. Karp. Mapping clones with a given ordering or interleaving (abstract). RECOMB'1997. pp.162~162 Cited By 18[Bibtex]
[101]	Daniel P. Fasulo, Tao Jiang, Richard M. Karp, Reuben Settergren, Edward C. Thayer. An algorithmic approach to multiple complete digest mapping. RECOMB'1997. pp.118~127 Cited By 19[Bibtex]
[100]	Tao Jiang, Richard M. Karp. Mapping Clones with a Given Ordering or Interleaving (Extended Abstract). SODA'1997. pp.400~409 Cited By 18[Bibtex]
[99]	Johannes Blomer, Richard M. Karp, Emo Welzl. The rank of sparse random matrices over finite fields. Random Struct. Algorithms, 1997: 407~419 Cited By 36[Bibtex]
[98]	Alfred V. Aho, David S. Johnson, Richard M. Karp, S. Rao Kosaraju, Catherine C. McGeoch, Christos H. Papadimitriou, Pavel A. Pevzner. Emerging opportunities for theoretical computer science. SIGACT News, 1997: 65~74 Cited By 5[Bibtex] [PDF]
1996 Top (6)
[97]	Dan Gusfield, Richard M. Karp, Lusheng Wang, Paul Stelling. Graph Traversals, Genes, and Matroids: An Efficient Case of the Travelling Salesman Problem. CPM'1996. pp.304~319 [Bibtex]
[96]	Oren Etzioni, Steve Hanks, Tao Jiang, Richard M. Karp, Omid Madani, Orli Waarts. Efficient Information Gathering on the Internet (extended abstract). FOCS'1996. pp.234~243 Cited By 60[Bibtex] [PDF]
[95]	Richard M. Karp, Claire Kenyon, Orli Waarts. Error-Resilient DNA Computation. SODA'1996. pp.458~467 Cited By 58[Bibtex]
[94]	Helmut Alt, Leonidas J. Guibas, Kurt Mehlhorn, Richard M. Karp, Avi Wigderson. A Method for Obtaining Randomized Algorithms with Small Tail Probabilities. Algorithmica, 1996: 543~547 Cited By 34[Bibtex] [PDF]
[93]	Richard M. Karp, Michael Luby, Friedhelm Meyer auf der Heide. Efficient PRAM Simulation on a Distributed Memory Machine. Algorithmica, 1996: 517~542 Cited By 220[Bibtex]
[92]	David E. Culler, Richard M. Karp, David A. Patterson, Abhijit Sahay, Eunice E. Santos, Klaus E. Schauser, Ramesh Subramonian, Thorsten von Eicken. LogP: A Practical Model of Parallel Computation. Commun. ACM, 1996: 78~85 Cited By 267[Bibtex]
1995 Top (11)
[91]	Paul Dagum, Richard M. Karp, Michael Luby, Sheldon M. Ross. An Optimal Algorithm for Monte Carlo Estimation (Extended Abstract). FOCS'1995. pp.142~149 Cited By 80[Bibtex] [PDF]
[90]	Richard M. Karp, Orli Waarts, Geoffrey Zweig. The Bit Vector Intersection Problem (Preliminary Version). FOCS'1995. pp.621~630 Cited By 13[Bibtex] [PDF]
[89]	Richard M. Karp. Modeling parallel communication. IPPS'1995. pp.2~2 [Bibtex]
[88]	Micah Adler, John W. Byers, Richard M. Karp. Scheduling Parallel Communication: The h-relation Problem. MFCS'1995. pp.1~20 Cited By 36[Bibtex]
[87]	Micah Adler, John W. Byers, Richard M. Karp. Parallel Sorting with Limited Bandwidth. SPAA'1995. pp.129~136 Cited By 53[Bibtex]
[86]	Farid Alizadeh, Richard M. Karp, Lee Aaron Newberg, Deborah K. Weisser. Physical Mapping of Chromosomes: A Combinatorial Problem in Molecular Biology. Algorithmica, 1995: 52~76 Cited By 107[Bibtex] [PDF]
[85]	Richard M. Karp, Lee Aaron Newberg. An algorithm for analysing probed partial digestion experiments. Computer Applications in the Biosciences, 1995: 229~235 Cited By 2[Bibtex]
[84]	Farid Alizadeh, Richard M. Karp, Deborah K. Weisser, Geoffrey Zweig. Physical Mapping of Chromosomes Using Unique Probes. Journal of Computational Biology, 1995: 159~184 Cited By 101[Bibtex]
[83]	Richard M. Karp, Yanjun Zhang. Bounded Branching Process AND/OR Tree Evaluation. Random Struct. Algorithms, 1995: 97~116 [Bibtex]
[82]	Noga Alon, Richard M. Karp, David Peleg, Douglas B. West. A Graph-Theoretic Game and Its Application to the k-Server Problem. SIAM J. Comput., 1995: 78~100 [Bibtex] [PDF]
[81]	Alan M. Frieze, Richard M. Karp, Bruce A. Reed. When is the Assignment Bound Tight for the Asymmetric Traveling-Salesman Problem?. SIAM J. Comput., 1995: 484~493 Cited By 22[Bibtex] [PDF]
1994 Top (5)
[80]	Farid Alizadeh, Richard M. Karp, Deborah K. Weisser, Geoffrey Zweig. Physical Mapping of Chromosomes Using Unique Probes. SODA'1994. pp.489~500 Cited By 101[Bibtex]
[79]	Micah Adler, Peter Gemmell, Mor Harchol-Balter, Richard M. Karp, Claire Kenyon. Selection in the Presence of Noise: The Design of Playoff Systems. SODA'1994. pp.564~572 Cited By 9[Bibtex] [PDF]
[78]	Shai Ben-David, Allan Borodin, Richard M. Karp, Gabor Tardos, Avi Wigderson. On the Power of Randomization in On-Line Algorithms. Algorithmica, 1994: 2~14 Cited By 332[Bibtex]
[77]	Lisa Hellerstein, Garth A. Gibson, Richard M. Karp, Randy H. Katz, David A. Patterson. Coding Techniques for Handling Failures in Large Disk Arrays. Algorithmica, 1994: 182~208 Cited By 97[Bibtex]
[76]	Richard M. Karp. Probabilistic Recurrence Relations. J. ACM, 1994: 1136~1150 Cited By 84[Bibtex]
1993 Top (8)
[75]	Richard M. Karp. A Generalization of Binary Search. WADS'1993. pp.27~34 Cited By 3[Bibtex]
[74]	Ran El-Yaniv, Richard M. Karp. The Mortgage Problem. ISTCS'1993. pp.304~312 Cited By 10[Bibtex]
[73]	David E. Culler, Richard M. Karp, David A. Patterson, Abhijit Sahay, Klaus E. Schauser, Eunice E. Santos, Ramesh Subramonian, Thorsten von Eicken. LogP: Towards a Realistic Model of Parallel Computation. PPOPP'1993. pp.1~12 Cited By 1481[Bibtex] [PDF]
[72]	Farid Alizadeh, Richard M. Karp, Lee Aaron Newberg, Deborah K. Weisser. Physical Mapping of Chromosomes: A Combinatorial Problem in Molecular Biology. SODA'1993. pp.371~381 Cited By 107[Bibtex] [PDF]
[71]	Richard M. Karp, Abhijit Sahay, Eunice E. Santos, Klaus E. Schauser. Optimal Broadcast and Summation in the LogP Model. SPAA'1993. pp.142~153 Cited By 188[Bibtex] [PDF]
[70]	Richard M. Karp. Mapping the genome: some combinatorial problems arising in molecular biology. STOC'1993. pp.278~285 Cited By 109[Bibtex]
[69]	Richard M. Karp, Yanjun Zhang. Randomized Parallel Algorithms for Backtrack Search and Branch-and-Bound Computation. J. ACM, 1993: 765~789 Cited By 113[Bibtex]
[68]	Narendra Karmarkar, Richard M. Karp, Richard J. Lipton, Laszlo Lovasz, Michael Luby. A Monte-Carlo Algorithm for Estimating the Permanent. SIAM J. Comput., 1993: 284~293 Cited By 71[Bibtex]
1992 Top (5)
[67]	Ran El-Yaniv, Amos Fiat, Richard M. Karp, G. Turpin. Competitive Analysis of Financial Games. FOCS'1992. pp.327~333 Cited By 74[Bibtex] [PDF]
[66]	Richard M. Karp. On-Line Algorithms Versus Off-Line Algorithms: How Much is it Worth to Know the Future?. IFIP Congress (1)'1992. pp.416~429 Cited By 109[Bibtex]
[65]	Alan M. Frieze, Richard M. Karp, Bruce A. Reed. When is the Assignment Bound Tight for the Asymmetric Traveling Salesman Problem?. IPCO'1992. pp.453~461 Cited By 22[Bibtex] [PDF]
[64]	Richard M. Karp, Michael Luby, Friedhelm Meyer auf der Heide. Efficient PRAM Simulation on a Distributed Memory Machine. STOC'1992. pp.318~326 Cited By 220[Bibtex]
[63]	Richard M. Karp. Three-Stage Generalized Connectors. SIAM J. Discrete Math., 1992: 259~272 Cited By 3[Bibtex]
1991 Top (5)
[62]	Richard M. Karp. Probabilistic Recurrence Relations. STOC'1991. pp.190~197 Cited By 84[Bibtex]
[61]	Sally Floyd, Richard M. Karp. FFD Bin Packing for Item Sizes with Uniform Distributions on [0, 1/2]. Algorithmica, 1991: 222~240 Cited By 9[Bibtex]
[60]	Richard M. Karp. An introduction to randomized algorithms. Discrete Applied Mathematics, 1991: 165~201 Cited By 78[Bibtex]
[59]	Amos Fiat, Richard M. Karp, Michael Luby, Lyle A. McGeoch, Daniel Dominic Sleator, Neal E. Young. Competitive Paging Algorithms. J. Algorithms, 1991: 685~699 Cited By 326[Bibtex] [PDF]
[58]	Phillip B. Gibbons, Richard M. Karp, Vijaya Ramachandran, Danny Soroker, Robert Endre Tarjan. Transitive Compaction in Parallel via Branchings. J. Algorithms, 1991: 110~125 Cited By 17[Bibtex]
1990 Top (5)
[57]	Richard M. Karp, Vijaya Ramachandran. Parallel Algorithms for Shared-Memory Machines. Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity (A), 1990: 869~942 Cited By 686[Bibtex]
[56]	Shai Ben-David, Allan Borodin, Richard M. Karp, Gabor Tardos, Avi Wigderson. On the Power of Randomization in Online Algorithms (Extended Abstract). STOC'1990. pp.379~386 Cited By 332[Bibtex]
[55]	Richard M. Karp, Umesh V. Vazirani, Vijay V. Vazirani. An Optimal Algorithm for On-line Bipartite Matching. STOC'1990. pp.352~358 Cited By 146[Bibtex]
[54]	Phillip B. Gibbons, Richard M. Karp, Gary L. Miller, Danny Soroker. Subtree isomorphism is in random NC. Discrete Applied Mathematics, 1990: 35~62 [Bibtex]
[53]	Richard M. Karp. The Transitive Closure of a Random Digraph. Random Struct. Algorithms, 1990: 73~94 Cited By 110[Bibtex]
1989 Top (3)
[52]	Garth A. Gibson, Lisa Hellerstein, Richard M. Karp, Randy H. Katz, David A. Patterson. Failure Correction Techniques for Large Disk Arrays. ASPLOS'1989. pp.123~132 Cited By 67[Bibtex]
[51]	Richard M. Karp, Yanjun Zhang. On Parallel Evaluation of Game Trees. SPAA'1989. pp.409~420 Cited By 15[Bibtex]
[50]	Richard M. Karp, Michael Luby, Neal Madras. Monte-Carlo Approximation Algorithms for Enumeration Problems. J. Algorithms, 1989: 429~448 Cited By 176[Bibtex]
1988 Top (4)
[49]	Phillip B. Gibbons, Richard M. Karp, Gary L. Miller, Danny Soroker. Subtree Isomorphism is in Random NC. AWOC'1988. pp.43~52 [Bibtex]
[48]	Richard M. Karp, Yanjun Zhang. A Randomized Parallel Branch-and-Bound Procedure. STOC'1988. pp.290~300 Cited By 105[Bibtex]
[47]	Richard M. Karp, Eli Upfal, Avi Wigderson. The Complexity of Parallel Search. J. Comput. Syst. Sci., 1988: 225~253 Cited By 56[Bibtex]
[46]	Richard M. Karp, Rajeev Motwani, Prabhakar Raghavan. Deferred Data Structuring. SIAM J. Comput., 1988: 883~902 Cited By 20[Bibtex]
1987 Top (3)
[45]	Richard M. Karp, Frank Thomson Leighton, Ronald L. Rivest, Clark D. Thompson, Umesh V. Vazirani, Vijay V. Vazirani. Global Wire Routing in Two-Dimensional Arrays. Algorithmica, 1987: 113~129 Cited By 91[Bibtex]
[44]	Richard M. Karp, Michael O. Rabin. Efficient Randomized Pattern-Matching Algorithms. IBM Journal of Research and Development, 1987: 249~260 Cited By 620[Bibtex]
[43]	Ilan Adler, Richard M. Karp, Ron Shamir. A simplex variant solving an m times d linear program in O(min(m2, d2) expected number of pivot steps. J. Complexity, 1987: 372~387 [Bibtex]
1986 Top (4)
[42]	Sally Floyd, Richard M. Karp. FFD Bin Packing for Item Sizes with Distributions on [0,1/2]. FOCS'1986. pp.322~330 [Bibtex]
[41]	Richard M. Karp, Michael E. Saks, Avi Wigderson. On a Search Problem Related to Branch-and-Bound Procedures. FOCS'1986. pp.19~28 Cited By 18[Bibtex] [PDF]
[40]	Richard M. Karp. Combinatorics, Complexity, and Randomness. Commun. ACM, 1986: 97~109 Cited By 77[Bibtex]
[39]	Richard M. Karp, Eli Upfal, Avi Wigderson. Constructing a perfect matching is in random NC. Combinatorica, 1986: 35~48 Cited By 187[Bibtex]
1985 Top (5)
[38]	Richard M. Karp, Eli Upfal, Avi Wigderson. The Complexity of Parallel Computation on Matroids. FOCS'1985. pp.541~550 Cited By 9[Bibtex] [PDF]
[37]	Richard M. Karp, Eli Upfal, Avi Wigderson. Constructing a Perfect Matching is in Random NC. STOC'1985. pp.22~32 Cited By 187[Bibtex]
[36]	Richard M. Karp, Eli Upfal, Avi Wigderson. Are Search and Decision Problems Computationally Equivalent?. STOC'1985. pp.464~475 [Bibtex]
[35]	Richard M. Karp, Avi Wigderson. A Fast Parallel Algorithm for the Maximal Independent Set Problem. J. ACM, 1985: 762~773 Cited By 250[Bibtex]
[34]	Richard M. Karp, Michael Luby. Monte-Carlo algorithms for the planar multiterminal network reliability problem. J. Complexity, 1985: 45~64 [Bibtex]
1984 Top (2)
[33]	Richard M. Karp, Michael Luby, Alberto Marchetti-Spaccamela. A Probabilistic Analysis of Multidimensional Bin Packing Problems. STOC'1984. pp.289~298 Cited By 68[Bibtex]
[32]	Richard M. Karp, Avi Wigderson. A Fast Parallel Algorithm for the Maximal Independent Set Problem. STOC'1984. pp.266~272 Cited By 250[Bibtex]
1983 Top (3)
[31]	Richard M. Karp, Michael Luby. Monte-Carlo Algorithms for Enumeration and Reliability Problems. FOCS'1983. pp.56~64 Cited By 203[Bibtex] [PDF]
[30]	Richard M. Karp, Frank Thomson Leighton, Ronald L. Rivest, Clark D. Thompson, Umesh V. Vazirani, Vijay V. Vazirani. Global Wire Routing in Two-Dimensional Arrays (Extended Abstract). FOCS'1983. pp.453~459 Cited By 91[Bibtex] [PDF]
[29]	Richard M. Karp, Judea Pearl. Searching for an Optimal Path in a Tree with Random Costs. Artif. Intell., 1983: 99~116 Cited By 74[Bibtex]
1982 Top (4)
[28]	Danny Dolev, Shimon Even, Richard M. Karp. On the Security of Ping-Pong Protocols. CRYPTO'1982. pp.177~186 Cited By 125[Bibtex]
[27]	Narendra Karmarkar, Richard M. Karp. An Efficient Approximation Scheme for the One-Dimensional Bin-Packing Problem. FOCS'1982. pp.312~320 Cited By 267[Bibtex] [PDF]
[26]	Danny Dolev, Shimon Even, Richard M. Karp. On the Security of Ping-Pong Protocols. Information and Control, 1982: 57~68 Cited By 125[Bibtex]
[25]	Richard M. Karp, Christos H. Papadimitriou. On Linear Characterizations of Combinatorial Optimization Problems. SIAM J. Comput., 1982: 620~632 Cited By 138[Bibtex] [PDF]
1981 Top (2)
[24]	Richard M. Karp, Michael Sipser. Maximum Matchings in Sparse Random Graphs. FOCS'1981. pp.364~375 [Bibtex] [PDF]
[23]	Manuel Blum, Richard M. Karp, Oliver Vornberger, Christos H. Papadimitriou, Mihalis Yannakakis. The Complexity of Testing Whether a Graph is a Superconcentrator. Inf. Process. Lett., 1981: 164~167 [Bibtex]
1980 Top (4)
[22]	Richard M. Karp, Christos H. Papadimitriou. On Linear Characterizations of Combinatorial Optimization Problems. FOCS'1980. pp.1~9 Cited By 138[Bibtex] [PDF]
[21]	Richard M. Karp, Richard J. Lipton. Some Connections between Nonuniform and Uniform Complexity Classes. STOC'1980. pp.302~309 Cited By 486[Bibtex]
[20]	Richard M. Karp, Robert Endre Tarjan. Linear Expected-Time Algorithms for Connectivity Problems (Extended Abstract). STOC'1980. pp.368~377 Cited By 36[Bibtex]
[19]	Richard M. Karp, Robert Endre Tarjan. Linear Expected-Time Algorithms for Connectivity Problems. J. Algorithms, 1980: 374~393 Cited By 36[Bibtex]
1979 Top (3)
[18]	Romas Aleliunas, Richard M. Karp, Richard J. Lipton, Laszlo Lovasz, Charles Rackoff. Random Walks, Universal Traversal Sequences, and the Complexity of Maze Problems. FOCS'1979. pp.218~223 Cited By 414[Bibtex]
[17]	Richard M. Karp. Recent Advances in the Probabilistic Analysis of Graph-Theoretic Algorithms (Abstract). ICALP'1979. pp.338~339 Cited By 1[Bibtex] [PDF]
[16]	Richard M. Karp. A Patching Algorithm for the Nonsymmetric Traveling-Salesman Problem. SIAM J. Comput., 1979: 561~573 Cited By 133[Bibtex]
1975 Top (1)
[15]	Richard M. Karp, A. C. McKellar, C. K. Wong. Near-Optimal Solutions to a 2-Dimensional Placement Problem. SIAM J. Comput., 1975: 271~286 [Bibtex]
1973 Top (1)
[14]	John E. Hopcroft, Richard M. Karp. An n5/2 Algorithm for Maximum Matchings in Bipartite Graphs. SIAM J. Comput., 1973: 225~231 [Bibtex]
1972 Top (3)
[13]	Richard M. Karp, Raymond E. Miller, Arnold L. Rosenberg. Rapid Identification of Repeated Patterns in Strings, Trees and Arrays. STOC'1972. pp.125~136 Cited By 233[Bibtex]
[12]	Jack Edmonds, Richard M. Karp. Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems. J. ACM, 1972: 248~264 Cited By 1060[Bibtex]
[11]	David Gale, Richard M. Karp. A Phenomenon in the Theory of Sorting. J. Comput. Syst. Sci., 1972: 103~115 Cited By 12[Bibtex] [PDF]
1971 Top (1)
[10]	John E. Hopcroft, Richard M. Karp. A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs. FOCS'1971. pp.122~125 Cited By 1077[Bibtex]
1970 Top (1)
[9]	David Gale, Richard M. Karp. A Phenomenon in the Theory of Sorting. FOCS'1970. pp.51~59 [Bibtex] [PDF]
1969 Top (1)
[8]	Richard M. Karp, Raymond E. Miller. Parallel Program Schemata. J. Comput. Syst. Sci., 1969: 147~195 Cited By 663[Bibtex]
1967 Top (3)
[7]	Richard M. Karp, Raymond E. Miller. Parallel Program Schemata: A Mathematical Model for Parallel Computation. FOCS'1967. pp.55~61 Cited By 663[Bibtex] [PDF]
[6]	Richard M. Karp. Some Bounds on the Storage Requirements of Sequential Machines and Turing Machines. J. ACM, 1967: 478~489 Cited By 21[Bibtex]
[5]	Richard M. Karp, Raymond E. Miller, Shmuel Winograd. The Organization of Computations for Uniform Recurrence Equations. J. ACM, 1967: 563~590 Cited By 541[Bibtex]
1966 Top (1)
[4]	L. P. Horwitz, Richard M. Karp, Raymond E. Miller, Shmuel Winograd. Index Register Allocation. J. ACM, 1966: 43~61 Cited By 81[Bibtex]
1965 Top (1)
[3]	Michael Held, Richard M. Karp. The Construction of Discrete Dynamic Programming Algorithms. IBM Systems Journal, 1965: 136~147 Cited By 12[Bibtex]
1961 Top (1)
[2]	Richard M. Karp, F. E. McFarlin, J. P. Roth, J. R. Wilts. A computer program for the synthesis of combinational switching circuits. FOCS'1961. pp.182~194 Cited By 23[Bibtex] [PDF]
1960 Top (1)
[1]	Richard M. Karp. A Note on the Applicaton of Graph Theory to Digital Computer Programming. Information and Control, 1960: 179~190 [Bibtex]

Communication Complexity / Lower Bounds Data Compression / Arithmetic Coding Approximation Algorithms / Perfect Graphs

Communication Complexity / Lower Bounds(154)

Top

[194]	Constantinos Daskalakis, Richard M. Karp, Elchanan Mossel, Samantha Riesenfeld, Elad Verbin. Sorting and selection in posets. SODA'2009. pp.392~401 Cited By 12[Bibtex] [PDF]
[193]	Brighten Godfrey, Richard M. Karp. On the Price of Heterogeneity in Parallel Systems. Theory Comput. Syst., 2009: 280~301 Cited By 3[Bibtex]
[192]	Richard M. Karp. Computer Science as a Lens on the Sciences. ICDCS'2008. pp.1~2 [Bibtex]
[191]	Henry Lin, Christos Amanatidis, Martha Sideri, Richard M. Karp, Christos H. Papadimitriou. Linked decompositions of networks and the power of choice in Polya urns. SODA'2008. pp.993~1002 Cited By 1[Bibtex]
[190]	Constantinos Daskalakis, Alexandros G. Dimakis, Richard M. Karp, Martin J. Wainwright. Probabilistic Analysis of Linear Programming Decoding. IEEE Transactions on Information Theory, 2008: 3565~3578 Cited By 16[Bibtex] [PDF]
[189]	Richard M. Karp. George Dantzig's impact on the theory of computation. Discrete Optimization, 2008: 174~185 Cited By 1[Bibtex]
[188]	Richard M. Karp. Streaming Algorithms for Selection and Approximate Sorting. FSTTCS'2007. pp.9~20 [Bibtex]
[187]	Lucian Popa, Afshin Rostamizadeh, Richard M. Karp, Christos H. Papadimitriou, Ion Stoica. Balancing traffic load in wireless networks with curveball routing. MobiHoc'2007. pp.170~179 Cited By 37[Bibtex]
[186]	Constantinos Daskalakis, Alexandros G. Dimakis, Richard M. Karp, Martin J. Wainwright. Probabilistic analysis of linear programming decoding. SODA'2007. pp.385~394 Cited By 16[Bibtex] [PDF]
[185]	Richard M. Karp, Robert Kleinberg. Noisy binary search and its applications. SODA'2007. pp.881~890 Cited By 15[Bibtex]
[184]	Richard M. Karp. Computer Science as a Lens on the Sciences:. Web Intelligence'2007. [Bibtex]
[183]	Richard M. Karp. Computer Science as a Lens on the Sciences: The Example of Computational Molecular Biology. BIBM'2007. pp.5~5 [Bibtex]
[182]	Constantinos Daskalakis, Alexandros G. Dimakis, Richard M. Karp, Martin J. Wainwright. Probabilistic Analysis of Linear Programming Decoding. CoRR, 2007. Cited By 16[Bibtex] [PDF]
[181]	Constantinos Daskalakis, Richard M. Karp, Elchanan Mossel, Samantha Riesenfeld, Elad Verbin. Sorting and Selection in Posets. CoRR, 2007. Cited By 12[Bibtex] [PDF]
[180]	Richard M. Karp. Fair Bandwidth Allocation Without Per-Flow State. Essays in Memory of Shimon Even'2006. pp.88~110 Cited By 1[Bibtex]
[179]	Richard M. Karp, Till Nierhoff, Till Tantau. Optimal Flow Distribution Among Multiple Channels with Unknown Capacities. Essays in Memory of Shimon Even'2006. pp.111~128 [Bibtex] [PDF]
[178]	Brighten Godfrey, Richard M. Karp. On the price of heterogeneity in parallel systems. SPAA'2006. pp.84~92 Cited By 3[Bibtex]
[177]	Sonesh Surana, Brighten Godfrey, Karthik Lakshminarayanan, Richard M. Karp, Ion Stoica. Load balancing in dynamic structured peer-to-peer systems. Perform. Eval., 2006: 217~240 Cited By 30[Bibtex]
[176]	Eran Halperin, Richard M. Karp. The minimum-entropy set cover problem. Theor. Comput. Sci., 2005: 240~250 Cited By 21[Bibtex] [PDF]
[175]	Richard M. Karp, Till Nierhoff, Till Tantau. Optimal flow distribution among multiple channels with unknown capacities. Electronic Notes in Discrete Mathematics, 2005: 225~231 [Bibtex] [PDF]
[174]	Eran Halperin, Richard M. Karp. The Minimum-Entropy Set Cover Problem. ICALP'2004. pp.733~744 Cited By 21[Bibtex] [PDF]
[173]	Brighten Godfrey, Karthik Lakshminarayanan, Sonesh Surana, Richard M. Karp, Ion Stoica. Load Balancing in Dynamic Structured P2P Systems. INFOCOM'2004. Cited By 227[Bibtex]
[172]	Jeremy Elson, Richard M. Karp, Christos H. Papadimitriou, Scott Shenker. Global Synchronization in Sensornets. LATIN'2004. pp.609~624 Cited By 16[Bibtex] [PDF]
[171]	Eran Halperin, Richard M. Karp. Perfect phylogeny and haplotype assignment. RECOMB'2004. pp.10~19 Cited By 43[Bibtex] [PDF]
[170]	Richard M. Karp. Algorithms for inferring cis-regulatory structures and protein interaction networks. RECOMB'2004. pp.45~45 [Bibtex]
[169]	Richard M. Karp. The Role of Experimental Algorithms in Genomics. WEA'2004. pp.299~300 Cited By 1[Bibtex]
[168]	Richard M. Karp. The Role of Algorithmic Research in Computational Genomics. CSB'2003. pp.10~12 Cited By 2[Bibtex]
[167]	Ananth Rao, Karthik Lakshminarayanan, Sonesh Surana, Richard M. Karp, Ion Stoica. Load Balancing in Structured P2P Systems. IPTPS'2003. pp.68~79 Cited By 319[Bibtex] [PDF]
[166]	Eran Halperin, Jeremy Buhler, Richard M. Karp, Robert Krauthgamer, Ben Westover. Detecting protein sequence conservation via metric embeddings. ISMB (Supplement of Bioinformatics)'2003. pp.122~129 Cited By 10[Bibtex]
[165]	Richard M. Karp, Claire Kenyon. A Gambling Game Arising in the Analysis of Adaptive Randomized Rounding. RANDOM-APPROX'2003. pp.329~340 [Bibtex]
[164]	Micah Adler, Eran Halperin, Richard M. Karp, Vijay V. Vazirani. A stochastic process on the hypercube with applications to peer-to-peer networks. STOC'2003. pp.575~584 Cited By 96[Bibtex]
[163]	Ilan Adler, Hyun-Soo Ahn, Richard M. Karp, Sheldon M. Ross. Coalescing times for IID random variables with applications to population biology. Random Struct. Algorithms, 2003: 155~166 Cited By 7[Bibtex]
[162]	Richard M. Karp, Scott Shenker, Christos H. Papadimitriou. A simple algorithm for finding frequent elements in streams and bags. ACM Trans. Database Syst., 2003: 51~55 Cited By 246[Bibtex]
[161]	Sylvia Ratnasamy, Mark Handley, Richard M. Karp, Scott Shenker. Topologically-Aware Overlay Construction and Server Selection. INFOCOM'2002. Cited By 789[Bibtex] [PDF]
[160]	Aditya Akella, Srinivasan Seshan, Richard M. Karp, Scott Shenker, Christos H. Papadimitriou. Selfish behavior and stability of the internet: a game-theoretic analysis of TCP. SIGCOMM'2002. pp.117~130 Cited By 149[Bibtex]
[159]	Amos Fiat, Richard M. Karp, Michael Luby, Lyle A. McGeoch, Daniel Dominic Sleator, Neal E. Young. Competitive Paging Algorithms. CoRR, 2002. Cited By 326[Bibtex] [PDF]
[158]	Paul Beame, Richard M. Karp, Toniann Pitassi, Michael E. Saks. The Efficiency of Resolution and Davis--Putnam Procedures. SIAM J. Comput., 2002: 1048~1075 Cited By 82[Bibtex]
[157]	Richard M. Karp. The Genomics Revolution and its Challenges for Algorithmic Research. Current Trends in Theoretical Computer Science, 2001: 631~642 Cited By 2[Bibtex] [PDF]
[156]	Jack Edmonds, Richard M. Karp. Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems. Combinatorial Optimization'2001. pp.31~33 Cited By 1060[Bibtex]
[155]	Eric P. Xing, Richard M. Karp. CLIFF: clustering of high-dimensional microarray data via iterative feature filtering using normalized cuts. ISMB (Supplement of Bioinformatics)'2001. pp.306~315 Cited By 164[Bibtex]
[154]	Sylvia Ratnasamy, Mark Handley, Richard M. Karp, Scott Shenker. Application-Level Multicast Using Content-Addressable Networks. Networked Group Communication'2001. pp.14~29 Cited By 653[Bibtex] [PDF]
[153]	Sylvia Ratnasamy, Paul Francis, Mark Handley, Richard M. Karp, Scott Shenker. A scalable content-addressable network. SIGCOMM'2001. pp.161~172 Cited By 121[Bibtex] [PDF]
[152]	Ran El-Yaniv, Amos Fiat, Richard M. Karp, G. Turpin. Optimal Search and One-Way Trading Online Algorithms. Algorithmica, 2001: 101~139 Cited By 62[Bibtex]
[151]	Anne Condon, Richard M. Karp. Algorithms for graph partitioning on the planted partition model. Random Struct. Algorithms, 2001: 116~140 Cited By 54[Bibtex] [PDF]
[150]	Richard M. Karp, Elias Koutsoupias, Christos H. Papadimitriou, Scott Shenker. Optimization Problems in Congestion Control. FOCS'2000. pp.66~74 Cited By 78[Bibtex] [PDF]
[149]	Richard M. Karp, Christian Schindelhauer, Scott Shenker, Berthold Vocking. Randomized Rumor Spreading. FOCS'2000. pp.565~574 Cited By 287[Bibtex] [PDF]
[148]	Richard M. Karp. The Genomics Revolution and Its Challenges for Algorithmic Research. ICALP'2000. pp.428~428 Cited By 2[Bibtex] [PDF]
[147]	Micah Adler, John W. Byers, Richard M. Karp. Parallel Sorting with Limited Bandwidth. SIAM J. Comput., 2000: 1997~2015 Cited By 53[Bibtex]
[146]	Paul Dagum, Richard M. Karp, Michael Luby, Sheldon M. Ross. An Optimal Algorithm for Monte Carlo Estimation. SIAM J. Comput., 2000: 1484~1496 Cited By 80[Bibtex]
[145]	Anne Condon, Richard M. Karp. Algorithms for Graph Partitioning on the Planted Partition Model. RANDOM-APPROX'1999. pp.221~232 Cited By 54[Bibtex] [PDF]
[144]	Richard M. Karp, Claire Kenyon, Orli Waarts. Error-resilient DNA computation. Random Struct. Algorithms, 1999: 450~466 Cited By 58[Bibtex]
[143]	Richard M. Karp. Random Graphs, Random Walks, Differential Equations and the Probabilistic Analysis of Algorithms. STACS'1998. pp.1~2 Cited By 2[Bibtex]
[142]	Paul Beame, Richard M. Karp, Toniann Pitassi, Michael E. Saks. On the Complexity of Unsatisfiability Proofs for Random k-CNF Formulas. STOC'1998. pp.561~571 Cited By 106[Bibtex]
[141]	Tao Jiang, Richard M. Karp. Mapping Clones with a Given Ordering or Interleaving. Algorithmica, 1998: 262~284 Cited By 18[Bibtex]
[140]	Richard M. Karp, Yangun Zhang. On Parallel Evaluation of Game Trees. J. ACM, 1998: 1050~1075 Cited By 15[Bibtex]
[139]	Oren Zamir, Oren Etzioni, Omid Madani, Richard M. Karp. Fast and Intuitive Clustering of Web Documents. KDD'1997. pp.287~290 Cited By 230[Bibtex] [PDF]
[138]	Tao Jiang, Richard M. Karp. Mapping clones with a given ordering or interleaving (abstract). RECOMB'1997. pp.162~162 Cited By 18[Bibtex]
[137]	Tao Jiang, Richard M. Karp. Mapping Clones with a Given Ordering or Interleaving (Extended Abstract). SODA'1997. pp.400~409 Cited By 18[Bibtex]
[136]	Johannes Blomer, Richard M. Karp, Emo Welzl. The rank of sparse random matrices over finite fields. Random Struct. Algorithms, 1997: 407~419 Cited By 36[Bibtex]
[135]	Alfred V. Aho, David S. Johnson, Richard M. Karp, S. Rao Kosaraju, Catherine C. McGeoch, Christos H. Papadimitriou, Pavel A. Pevzner. Emerging opportunities for theoretical computer science. SIGACT News, 1997: 65~74 Cited By 5[Bibtex] [PDF]
[134]	Oren Etzioni, Steve Hanks, Tao Jiang, Richard M. Karp, Omid Madani, Orli Waarts. Efficient Information Gathering on the Internet (extended abstract). FOCS'1996. pp.234~243 Cited By 60[Bibtex] [PDF]
[133]	Richard M. Karp, Claire Kenyon, Orli Waarts. Error-Resilient DNA Computation. SODA'1996. pp.458~467 Cited By 58[Bibtex]
[132]	Helmut Alt, Leonidas J. Guibas, Kurt Mehlhorn, Richard M. Karp, Avi Wigderson. A Method for Obtaining Randomized Algorithms with Small Tail Probabilities. Algorithmica, 1996: 543~547 Cited By 34[Bibtex] [PDF]
[131]	Richard M. Karp, Michael Luby, Friedhelm Meyer auf der Heide. Efficient PRAM Simulation on a Distributed Memory Machine. Algorithmica, 1996: 517~542 Cited By 220[Bibtex]
[130]	David E. Culler, Richard M. Karp, David A. Patterson, Abhijit Sahay, Eunice E. Santos, Klaus E. Schauser, Ramesh Subramonian, Thorsten von Eicken. LogP: A Practical Model of Parallel Computation. Commun. ACM, 1996: 78~85 Cited By 267[Bibtex]
[129]	Paul Dagum, Richard M. Karp, Michael Luby, Sheldon M. Ross. An Optimal Algorithm for Monte Carlo Estimation (Extended Abstract). FOCS'1995. pp.142~149 Cited By 80[Bibtex] [PDF]
[128]	Richard M. Karp, Orli Waarts, Geoffrey Zweig. The Bit Vector Intersection Problem (Preliminary Version). FOCS'1995. pp.621~630 Cited By 13[Bibtex] [PDF]
[127]	Richard M. Karp. Modeling parallel communication. IPPS'1995. pp.2~2 [Bibtex]
[126]	Micah Adler, John W. Byers, Richard M. Karp. Scheduling Parallel Communication: The h-relation Problem. MFCS'1995. pp.1~20 Cited By 36[Bibtex]
[125]	Micah Adler, John W. Byers, Richard M. Karp. Parallel Sorting with Limited Bandwidth. SPAA'1995. pp.129~136 Cited By 53[Bibtex]
[124]	Richard M. Karp, Lee Aaron Newberg. An algorithm for analysing probed partial digestion experiments. Computer Applications in the Biosciences, 1995: 229~235 Cited By 2[Bibtex]
[123]	Farid Alizadeh, Richard M. Karp, Deborah K. Weisser, Geoffrey Zweig. Physical Mapping of Chromosomes Using Unique Probes. Journal of Computational Biology, 1995: 159~184 Cited By 101[Bibtex]
[122]	Richard M. Karp, Yanjun Zhang. Bounded Branching Process AND/OR Tree Evaluation. Random Struct. Algorithms, 1995: 97~116 [Bibtex]
[121]	Noga Alon, Richard M. Karp, David Peleg, Douglas B. West. A Graph-Theoretic Game and Its Application to the k-Server Problem. SIAM J. Comput., 1995: 78~100 [Bibtex] [PDF]
[120]	Alan M. Frieze, Richard M. Karp, Bruce A. Reed. When is the Assignment Bound Tight for the Asymmetric Traveling-Salesman Problem?. SIAM J. Comput., 1995: 484~493 Cited By 22[Bibtex] [PDF]
[119]	Farid Alizadeh, Richard M. Karp, Deborah K. Weisser, Geoffrey Zweig. Physical Mapping of Chromosomes Using Unique Probes. SODA'1994. pp.489~500 Cited By 101[Bibtex]
[118]	Micah Adler, Peter Gemmell, Mor Harchol-Balter, Richard M. Karp, Claire Kenyon. Selection in the Presence of Noise: The Design of Playoff Systems. SODA'1994. pp.564~572 Cited By 9[Bibtex] [PDF]
[117]	Shai Ben-David, Allan Borodin, Richard M. Karp, Gabor Tardos, Avi Wigderson. On the Power of Randomization in On-Line Algorithms. Algorithmica, 1994: 2~14 Cited By 332[Bibtex]
[116]	Lisa Hellerstein, Garth A. Gibson, Richard M. Karp, Randy H. Katz, David A. Patterson. Coding Techniques for Handling Failures in Large Disk Arrays. Algorithmica, 1994: 182~208 Cited By 97[Bibtex]
[115]	Richard M. Karp. Probabilistic Recurrence Relations. J. ACM, 1994: 1136~1150 Cited By 84[Bibtex]
[114]	Richard M. Karp. A Generalization of Binary Search. WADS'1993. pp.27~34 Cited By 3[Bibtex]
[113]	Ran El-Yaniv, Richard M. Karp. The Mortgage Problem. ISTCS'1993. pp.304~312 Cited By 10[Bibtex]
[112]	David E. Culler, Richard M. Karp, David A. Patterson, Abhijit Sahay, Klaus E. Schauser, Eunice E. Santos, Ramesh Subramonian, Thorsten von Eicken. LogP: Towards a Realistic Model of Parallel Computation. PPOPP'1993. pp.1~12 Cited By 1481[Bibtex] [PDF]
[111]	Richard M. Karp, Abhijit Sahay, Eunice E. Santos, Klaus E. Schauser. Optimal Broadcast and Summation in the LogP Model. SPAA'1993. pp.142~153 Cited By 188[Bibtex] [PDF]
[110]	Richard M. Karp. Mapping the genome: some combinatorial problems arising in molecular biology. STOC'1993. pp.278~285 Cited By 109[Bibtex]
[109]	Richard M. Karp, Yanjun Zhang. Randomized Parallel Algorithms for Backtrack Search and Branch-and-Bound Computation. J. ACM, 1993: 765~789 Cited By 113[Bibtex]
[108]	Narendra Karmarkar, Richard M. Karp, Richard J. Lipton, Laszlo Lovasz, Michael Luby. A Monte-Carlo Algorithm for Estimating the Permanent. SIAM J. Comput., 1993: 284~293 Cited By 71[Bibtex]
[107]	Ran El-Yaniv, Amos Fiat, Richard M. Karp, G. Turpin. Competitive Analysis of Financial Games. FOCS'1992. pp.327~333 Cited By 74[Bibtex] [PDF]
[106]	Richard M. Karp. On-Line Algorithms Versus Off-Line Algorithms: How Much is it Worth to Know the Future?. IFIP Congress (1)'1992. pp.416~429 Cited By 109[Bibtex]
[105]	Alan M. Frieze, Richard M. Karp, Bruce A. Reed. When is the Assignment Bound Tight for the Asymmetric Traveling Salesman Problem?. IPCO'1992. pp.453~461 Cited By 22[Bibtex] [PDF]
[104]	Richard M. Karp, Michael Luby, Friedhelm Meyer auf der Heide. Efficient PRAM Simulation on a Distributed Memory Machine. STOC'1992. pp.318~326 Cited By 220[Bibtex]
[103]	Richard M. Karp. Three-Stage Generalized Connectors. SIAM J. Discrete Math., 1992: 259~272 Cited By 3[Bibtex]
[102]	Richard M. Karp. Probabilistic Recurrence Relations. STOC'1991. pp.190~197 Cited By 84[Bibtex]
[101]	Sally Floyd, Richard M. Karp. FFD Bin Packing for Item Sizes with Uniform Distributions on [0, 1/2]. Algorithmica, 1991: 222~240 Cited By 9[Bibtex]
[100]	Richard M. Karp. An introduction to randomized algorithms. Discrete Applied Mathematics, 1991: 165~201 Cited By 78[Bibtex]
[99]	Amos Fiat, Richard M. Karp, Michael Luby, Lyle A. McGeoch, Daniel Dominic Sleator, Neal E. Young. Competitive Paging Algorithms. J. Algorithms, 1991: 685~699 Cited By 326[Bibtex] [PDF]
[98]	Phillip B. Gibbons, Richard M. Karp, Vijaya Ramachandran, Danny Soroker, Robert Endre Tarjan. Transitive Compaction in Parallel via Branchings. J. Algorithms, 1991: 110~125 Cited By 17[Bibtex]
[97]	Richard M. Karp, Vijaya Ramachandran. Parallel Algorithms for Shared-Memory Machines. Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity (A), 1990: 869~942 Cited By 686[Bibtex]
[96]	Shai Ben-David, Allan Borodin, Richard M. Karp, Gabor Tardos, Avi Wigderson. On the Power of Randomization in Online Algorithms (Extended Abstract). STOC'1990. pp.379~386 Cited By 332[Bibtex]
[95]	Richard M. Karp, Umesh V. Vazirani, Vijay V. Vazirani. An Optimal Algorithm for On-line Bipartite Matching. STOC'1990. pp.352~358 Cited By 146[Bibtex]
[94]	Phillip B. Gibbons, Richard M. Karp, Gary L. Miller, Danny Soroker. Subtree isomorphism is in random NC. Discrete Applied Mathematics, 1990: 35~62 [Bibtex]
[93]	Richard M. Karp. The Transitive Closure of a Random Digraph. Random Struct. Algorithms, 1990: 73~94 Cited By 110[Bibtex]
[92]	Garth A. Gibson, Lisa Hellerstein, Richard M. Karp, Randy H. Katz, David A. Patterson. Failure Correction Techniques for Large Disk Arrays. ASPLOS'1989. pp.123~132 Cited By 67[Bibtex]
[91]	Richard M. Karp, Yanjun Zhang. On Parallel Evaluation of Game Trees. SPAA'1989. pp.409~420 Cited By 15[Bibtex]
[90]	Richard M. Karp, Michael Luby, Neal Madras. Monte-Carlo Approximation Algorithms for Enumeration Problems. J. Algorithms, 1989: 429~448 Cited By 176[Bibtex]
[89]	Phillip B. Gibbons, Richard M. Karp, Gary L. Miller, Danny Soroker. Subtree Isomorphism is in Random NC. AWOC'1988. pp.43~52 [Bibtex]
[88]	Richard M. Karp, Yanjun Zhang. A Randomized Parallel Branch-and-Bound Procedure. STOC'1988. pp.290~300 Cited By 105[Bibtex]
[87]	Richard M. Karp, Eli Upfal, Avi Wigderson. The Complexity of Parallel Search. J. Comput. Syst. Sci., 1988: 225~253 Cited By 56[Bibtex]
[86]	Richard M. Karp, Rajeev Motwani, Prabhakar Raghavan. Deferred Data Structuring. SIAM J. Comput., 1988: 883~902 Cited By 20[Bibtex]
[85]	Richard M. Karp, Frank Thomson Leighton, Ronald L. Rivest, Clark D. Thompson, Umesh V. Vazirani, Vijay V. Vazirani. Global Wire Routing in Two-Dimensional Arrays. Algorithmica, 1987: 113~129 Cited By 91[Bibtex]
[84]	Richard M. Karp, Michael O. Rabin. Efficient Randomized Pattern-Matching Algorithms. IBM Journal of Research and Development, 1987: 249~260 Cited By 620[Bibtex]
[83]	Ilan Adler, Richard M. Karp, Ron Shamir. A simplex variant solving an m times d linear program in O(min(m2, d2) expected number of pivot steps. J. Complexity, 1987: 372~387 [Bibtex]
[82]	Sally Floyd, Richard M. Karp. FFD Bin Packing for Item Sizes with Distributions on [0,1/2]. FOCS'1986. pp.322~330 [Bibtex]
[81]	Richard M. Karp, Michael E. Saks, Avi Wigderson. On a Search Problem Related to Branch-and-Bound Procedures. FOCS'1986. pp.19~28 Cited By 18[Bibtex] [PDF]
[80]	Richard M. Karp. Combinatorics, Complexity, and Randomness. Commun. ACM, 1986: 97~109 Cited By 77[Bibtex]
[79]	Richard M. Karp, Eli Upfal, Avi Wigderson. Constructing a perfect matching is in random NC. Combinatorica, 1986: 35~48 Cited By 187[Bibtex]
[78]	Richard M. Karp, Eli Upfal, Avi Wigderson. The Complexity of Parallel Computation on Matroids. FOCS'1985. pp.541~550 Cited By 9[Bibtex] [PDF]
[77]	Richard M. Karp, Eli Upfal, Avi Wigderson. Constructing a Perfect Matching is in Random NC. STOC'1985. pp.22~32 Cited By 187[Bibtex]
[76]	Richard M. Karp, Eli Upfal, Avi Wigderson. Are Search and Decision Problems Computationally Equivalent?. STOC'1985. pp.464~475 [Bibtex]
[75]	Richard M. Karp, Avi Wigderson. A Fast Parallel Algorithm for the Maximal Independent Set Problem. J. ACM, 1985: 762~773 Cited By 250[Bibtex]
[74]	Richard M. Karp, Michael Luby. Monte-Carlo algorithms for the planar multiterminal network reliability problem. J. Complexity, 1985: 45~64 [Bibtex]
[73]	Richard M. Karp, Michael Luby, Alberto Marchetti-Spaccamela. A Probabilistic Analysis of Multidimensional Bin Packing Problems. STOC'1984. pp.289~298 Cited By 68[Bibtex]
[72]	Richard M. Karp, Avi Wigderson. A Fast Parallel Algorithm for the Maximal Independent Set Problem. STOC'1984. pp.266~272 Cited By 250[Bibtex]
[71]	Richard M. Karp, Michael Luby. Monte-Carlo Algorithms for Enumeration and Reliability Problems. FOCS'1983. pp.56~64 Cited By 203[Bibtex] [PDF]
[70]	Richard M. Karp, Frank Thomson Leighton, Ronald L. Rivest, Clark D. Thompson, Umesh V. Vazirani, Vijay V. Vazirani. Global Wire Routing in Two-Dimensional Arrays (Extended Abstract). FOCS'1983. pp.453~459 Cited By 91[Bibtex] [PDF]
[69]	Richard M. Karp, Judea Pearl. Searching for an Optimal Path in a Tree with Random Costs. Artif. Intell., 1983: 99~116 Cited By 74[Bibtex]
[68]	Danny Dolev, Shimon Even, Richard M. Karp. On the Security of Ping-Pong Protocols. CRYPTO'1982. pp.177~186 Cited By 125[Bibtex]
[67]	Narendra Karmarkar, Richard M. Karp. An Efficient Approximation Scheme for the One-Dimensional Bin-Packing Problem. FOCS'1982. pp.312~320 Cited By 267[Bibtex] [PDF]
[66]	Danny Dolev, Shimon Even, Richard M. Karp. On the Security of Ping-Pong Protocols. Information and Control, 1982: 57~68 Cited By 125[Bibtex]
[65]	Richard M. Karp, Christos H. Papadimitriou. On Linear Characterizations of Combinatorial Optimization Problems. SIAM J. Comput., 1982: 620~632 Cited By 138[Bibtex] [PDF]
[64]	Richard M. Karp, Michael Sipser. Maximum Matchings in Sparse Random Graphs. FOCS'1981. pp.364~375 [Bibtex] [PDF]
[63]	Manuel Blum, Richard M. Karp, Oliver Vornberger, Christos H. Papadimitriou, Mihalis Yannakakis. The Complexity of Testing Whether a Graph is a Superconcentrator. Inf. Process. Lett., 1981: 164~167 [Bibtex]
[62]	Richard M. Karp, Christos H. Papadimitriou. On Linear Characterizations of Combinatorial Optimization Problems. FOCS'1980. pp.1~9 Cited By 138[Bibtex] [PDF]
[61]	Richard M. Karp, Richard J. Lipton. Some Connections between Nonuniform and Uniform Complexity Classes. STOC'1980. pp.302~309 Cited By 486[Bibtex]
[60]	Richard M. Karp, Robert Endre Tarjan. Linear Expected-Time Algorithms for Connectivity Problems (Extended Abstract). STOC'1980. pp.368~377 Cited By 36[Bibtex]
[59]	Richard M. Karp, Robert Endre Tarjan. Linear Expected-Time Algorithms for Connectivity Problems. J. Algorithms, 1980: 374~393 Cited By 36[Bibtex]
[58]	Romas Aleliunas, Richard M. Karp, Richard J. Lipton, Laszlo Lovasz, Charles Rackoff. Random Walks, Universal Traversal Sequences, and the Complexity of Maze Problems. FOCS'1979. pp.218~223 Cited By 414[Bibtex]
[57]	Richard M. Karp. Recent Advances in the Probabilistic Analysis of Graph-Theoretic Algorithms (Abstract). ICALP'1979. pp.338~339 Cited By 1[Bibtex] [PDF]
[56]	Richard M. Karp. A Patching Algorithm for the Nonsymmetric Traveling-Salesman Problem. SIAM J. Comput., 1979: 561~573 Cited By 133[Bibtex]
[55]	Richard M. Karp, A. C. McKellar, C. K. Wong. Near-Optimal Solutions to a 2-Dimensional Placement Problem. SIAM J. Comput., 1975: 271~286 [Bibtex]
[54]	John E. Hopcroft, Richard M. Karp. An n5/2 Algorithm for Maximum Matchings in Bipartite Graphs. SIAM J. Comput., 1973: 225~231 [Bibtex]
[53]	Richard M. Karp, Raymond E. Miller, Arnold L. Rosenberg. Rapid Identification of Repeated Patterns in Strings, Trees and Arrays. STOC'1972. pp.125~136 Cited By 233[Bibtex]
[52]	Jack Edmonds, Richard M. Karp. Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems. J. ACM, 1972: 248~264 Cited By 1060[Bibtex]
[51]	David Gale, Richard M. Karp. A Phenomenon in the Theory of Sorting. J. Comput. Syst. Sci., 1972: 103~115 Cited By 12[Bibtex] [PDF]
[50]	John E. Hopcroft, Richard M. Karp. A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs. FOCS'1971. pp.122~125 Cited By 1077[Bibtex]
[49]	David Gale, Richard M. Karp. A Phenomenon in the Theory of Sorting. FOCS'1970. pp.51~59 [Bibtex] [PDF]
[48]	Richard M. Karp, Raymond E. Miller. Parallel Program Schemata. J. Comput. Syst. Sci., 1969: 147~195 Cited By 663[Bibtex]
[47]	Richard M. Karp, Raymond E. Miller. Parallel Program Schemata: A Mathematical Model for Parallel Computation. FOCS'1967. pp.55~61 Cited By 663[Bibtex] [PDF]
[46]	Richard M. Karp. Some Bounds on the Storage Requirements of Sequential Machines and Turing Machines. J. ACM, 1967: 478~489 Cited By 21[Bibtex]
[45]	Richard M. Karp, Raymond E. Miller, Shmuel Winograd. The Organization of Computations for Uniform Recurrence Equations. J. ACM, 1967: 563~590 Cited By 541[Bibtex]
[44]	L. P. Horwitz, Richard M. Karp, Raymond E. Miller, Shmuel Winograd. Index Register Allocation. J. ACM, 1966: 43~61 Cited By 81[Bibtex]
[43]	Michael Held, Richard M. Karp. The Construction of Discrete Dynamic Programming Algorithms. IBM Systems Journal, 1965: 136~147 Cited By 12[Bibtex]
[42]	Richard M. Karp, F. E. McFarlin, J. P. Roth, J. R. Wilts. A computer program for the synthesis of combinational switching circuits. FOCS'1961. pp.182~194 Cited By 23[Bibtex] [PDF]
[41]	Richard M. Karp. A Note on the Applicaton of Graph Theory to Digital Computer Programming. Information and Control, 1960: 179~190 [Bibtex]

Data Compression / Arithmetic Coding(38)

Top

[40]	Bonnie Kirkpatrick, Javier Rosa, Eran Halperin, Richard M. Karp. Haplotype Inference in Complex Pedigrees. RECOMB'2009. pp.108~120 [Bibtex]
[39]	Sharon Bruckner, Falk Huffner, Richard M. Karp, Ron Shamir, Roded Sharan. Topology-Free Querying of Protein Interaction Networks. RECOMB'2009. pp.74~89 Cited By 9[Bibtex]
[38]	Sharon Bruckner, Falk Huffner, Richard M. Karp, Ron Shamir, Roded Sharan. Torque: topology-free querying of protein interaction networks. Nucleic Acids Research, 2009: 106~108 Cited By 3[Bibtex]
[37]	Igor Ulitsky, Richard M. Karp, Ron Shamir. Detecting Disease-Specific Dysregulated Pathways Via Analysis of Clinical Expression Profiles. RECOMB'2008. pp.347~359 Cited By 16[Bibtex]
[36]	Bonnie Kirkpatrick, Carlos Santos Armendariz, Richard M. Karp, Eran Halperin. HAPLOPOOL: improving haplotype frequency estimation through DNA pools and phylogenetic modeling. Bioinformatics, 2007: 3048~3055 Cited By 7[Bibtex]
[35]	Manikandan Narayanan, Richard M. Karp. Comparing Protein Interaction Networks via a Graph Match-and-Split Algorithm. Journal of Computational Biology, 2007: 892~907 Cited By 13[Bibtex] [PDF]
[34]	Richard M. Karp, Ming Li, Pavel A. Pevzner, Ron Shamir. Special issue on computational molecular biology. J. Comput. Syst. Sci., 2007: 1023~1023 [Bibtex]
[33]	Jacob Scott, Trey Ideker, Richard M. Karp, Roded Sharan. Efficient Algorithms for Detecting Signaling Pathways in Protein Interaction Networks. Journal of Computational Biology, 2006: 133~144 Cited By 110[Bibtex] [PDF]
[32]	Irit Gat-Viks, Richard M. Karp, Ron Shamir, Roded Sharan. Reconstructing Chain Functions in Genetic Networks. SIAM J. Discrete Math., 2006: 727~740 Cited By 4[Bibtex]
[31]	Jacob Scott, Trey Ideker, Richard M. Karp, Roded Sharan. Efficient Algorithms for Detecting Signaling Pathways in Protein Interaction Networks. RECOMB'2005. pp.1~13 Cited By 110[Bibtex] [PDF]
[30]	Roded Sharan, Trey Ideker, Brian P. Kelley, Ron Shamir, Richard M. Karp. Identification of Protein Complexes by Comparative Analysis of Yeast and Bacterial Protein Interaction Data. Journal of Computational Biology, 2005: 835~846 Cited By 108[Bibtex] [PDF]
[29]	Richard M. Karp, Ming Li, Pavel A. Pevzner, Ron Shamir. Guest Editors' foreword. J. Comput. Syst. Sci., 2005: 283~283 [Bibtex]
[28]	Irit Gat-Viks, Ron Shamir, Richard M. Karp, Roded Sharan. Reconstructing Chain Functions in Genetic Networks. Pacific Symposium on Biocomputing'2004. pp.498~509 Cited By 4[Bibtex]
[27]	Roded Sharan, Trey Ideker, Brian P. Kelley, Ron Shamir, Richard M. Karp. Identification of protein complexes by comparative analysis of yeast and bacterial protein interaction data. RECOMB'2004. pp.282~289 Cited By 108[Bibtex] [PDF]
[26]	Manikandan Narayanan, Richard M. Karp. Gapped Local Similarity Search with Provable Guarantees. WABI'2004. pp.74~86 Cited By 8[Bibtex]
[25]	Eric P. Xing, Wei Wu, Michael I. Jordan, Richard M. Karp. Logos: a Modular Bayesian Model for de Novo Motif Detection. J. Bioinformatics and Computational Biology, 2004: 127~154 Cited By 59[Bibtex] [PDF]
[24]	Amir Ben-Dor, Tzvika Hartman, Richard M. Karp, Benno Schwikowski, Roded Sharan, Zohar Yakhini. Towards Optimally Multiplexed Applications of Universal Arrays. Journal of Computational Biology, 2004: 476~492 Cited By 5[Bibtex]
[23]	Eric P. Xing, Wei Wu, Michael I. Jordan, Richard M. Karp. LOGOS: a modular Bayesian model for de novo motif detection. CSB'2003. pp.266~276 Cited By 59[Bibtex] [PDF]
[22]	Roded Sharan, Ivan Ovcharenko, Asa Ben-Hur, Richard M. Karp. CREME: a framework for identifying cis-regulatory modules in human-mouse conserved segments. ISMB (Supplement of Bioinformatics)'2003. pp.283~291 Cited By 105[Bibtex]
[21]	Eleazar Eskin, Eran Halperin, Richard M. Karp. Large scale reconstruction of haplotypes from genotype data. RECOMB'2003. pp.104~113 Cited By 64[Bibtex] [PDF]
[20]	Amir Ben-Dor, Benny Chor, Richard M. Karp, Zohar Yakhini. Discovering Local Structure in Gene Expression Data: The Order-Preserving Submatrix Problem. Journal of Computational Biology, 2003: 373~384 Cited By 230[Bibtex] [PDF]
[19]	Amir Ben-Dor, Richard M. Karp, Benno Schwikowski, Ron Shamir. The Restriction Scaffold Problem. Journal of Computational Biology, 2003: 385~398 Cited By 8[Bibtex] [PDF]
[18]	Eric P. Xing, Michael I. Jordan, Richard M. Karp, Stuart J. Russell. A Hierarchical Bayesian Markovian Model for Motifs in Biopolymer Sequences. NIPS'2002. pp.1489~1496 Cited By 25[Bibtex] [PDF]
[17]	Amir Ben-Dor, Benny Chor, Richard M. Karp, Zohar Yakhini. Discovering local structure in gene expression data: the order-preserving submatrix problem. RECOMB'2002. pp.49~57 Cited By 229[Bibtex] [PDF]
[16]	Amir Ben-Dor, Richard M. Karp, Benno Schwikowski, Ron Shamir. The restriction scaffold problem. RECOMB'2002. pp.58~66 Cited By 8[Bibtex] [PDF]
[15]	Eric P. Xing, Michael I. Jordan, Richard M. Karp. Feature selection for high-dimensional genomic microarray data. ICML'2001. pp.601~608 Cited By 306[Bibtex] [PDF]
[14]	Amir Ben-Dor, Richard M. Karp, Benno Schwikowski, Zohar Yakhini. Universal DNA tag systems: a combinatorial design scheme. RECOMB'2000. pp.65~75 Cited By 73[Bibtex] [PDF]
[13]	Amir Ben-Dor, Richard M. Karp, Benno Schwikowski, Zohar Yakhini. Universal DNA Tag Systems: A Combinatorial Design Scheme. Journal of Computational Biology, 2000: 503~519 Cited By 73[Bibtex] [PDF]
[12]	Richard M. Karp, Itsik Pe'er, Ron Shamir. An Algorithm Combining Discrete and Continuous Methods for Optical Mapping. Journal of Computational Biology, 2000: 745~760 Cited By 2[Bibtex] [PDF]
[11]	Richard M. Karp, Ron Shamir. Algorithms for Optical Mapping. Journal of Computational Biology, 2000: 303~316 Cited By 25[Bibtex] [PDF]
[10]	Richard M. Karp, Itsik Pe'er, Ron Shamir. An Algorithm Combining Discrete and Continuous Methods for Optical Mapping. ISMB'1999. pp.159~168 Cited By 2[Bibtex] [PDF]
[9]	Richard M. Karp, Roland Stoughton, Ka Yee Yeung. Algorithms for choosing differential gene expression experiments. RECOMB'1999. pp.208~217 Cited By 25[Bibtex]
[8]	Daniel P. Fasulo, Tao Jiang, Richard M. Karp, Reuben Settergren, Edward C. Thayer. An Algorithmic Approach to Multiple Complete Digest Mapping. Journal of Computational Biology, 1999: 187~208 Cited By 19[Bibtex]
[7]	Daniel P. Fasulo, Tao Jiang, Richard M. Karp, Nitin Sharma. Constructing maps using the span and inclusion relations. RECOMB'1998. pp.64~73 Cited By 7[Bibtex]
[6]	Richard M. Karp, Ron Shamir. Algorithms for optical mapping. RECOMB'1998. pp.117~124 Cited By 25[Bibtex] [PDF]
[5]	Dan Gusfield, Richard M. Karp, Lusheng Wang, Paul Stelling. Graph Traversals, Genes and Matroids: An Efficient Case of the Travelling Salesman Problem. Discrete Applied Mathematics, 1998: 167~180 [Bibtex]
[4]	Daniel P. Fasulo, Tao Jiang, Richard M. Karp, Reuben Settergren, Edward C. Thayer. An algorithmic approach to multiple complete digest mapping. RECOMB'1997. pp.118~127 Cited By 19[Bibtex]
[3]	Dan Gusfield, Richard M. Karp, Lusheng Wang, Paul Stelling. Graph Traversals, Genes, and Matroids: An Efficient Case of the Travelling Salesman Problem. CPM'1996. pp.304~319 [Bibtex]

Approximation Algorithms / Perfect Graphs(2)

Top

[2]	Farid Alizadeh, Richard M. Karp, Lee Aaron Newberg, Deborah K. Weisser. Physical Mapping of Chromosomes: A Combinatorial Problem in Molecular Biology. Algorithmica, 1995: 52~76 Cited By 107[Bibtex] [PDF]
[1]	Farid Alizadeh, Richard M. Karp, Lee Aaron Newberg, Deborah K. Weisser. Physical Mapping of Chromosomes: A Combinatorial Problem in Molecular Biology. SODA'1993. pp.371~381 Cited By 107[Bibtex] [PDF]