The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Richard M. Karp: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  171. Implicit Hitting Set Problems and Multi-genome Alignment. [Citation Graph (, )][DBLP]


  172. Streaming Algorithms for Selection and Approximate Sorting. [Citation Graph (, )][DBLP]


  173. Computer Science as a Lens on the Sciences. [Citation Graph (, )][DBLP]


  174. Balancing traffic load in wireless networks with curveball routing. [Citation Graph (, )][DBLP]


  175. Detecting Disease-Specific Dysregulated Pathways Via Analysis of Clinical Expression Profiles. [Citation Graph (, )][DBLP]


  176. Haplotype Inference in Complex Pedigrees. [Citation Graph (, )][DBLP]


  177. Topology-Free Querying of Protein Interaction Networks. [Citation Graph (, )][DBLP]


  178. Linked decompositions of networks and the power of choice in Polya urns. [Citation Graph (, )][DBLP]


  179. Sorting and selection in posets. [Citation Graph (, )][DBLP]


  180. Computer Science as a Lens on the Sciences: . [Citation Graph (, )][DBLP]


  181. Computer Science as a Lens on the Sciences: The Example of Computational Molecular Biology. [Citation Graph (, )][DBLP]


  182. HAPLOPOOL: improving haplotype frequency estimation through DNA pools and phylogenetic modeling. [Citation Graph (, )][DBLP]


  183. An introduction to randomized algorithms. [Citation Graph (, )][DBLP]


  184. Subtree isomorphism is in random NC. [Citation Graph (, )][DBLP]


Search in 0.103secs, Finished in 0.113secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002