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