Found 238 results
Author Title [ Type(Desc)] Year
Filters: Author is Richard M. Karp  [Clear All Filters]
Journal Article
Adler, I., Karp R. M., & Shamir R. (1986).  A family of simplex variants solving an m*d linear program in expected number of pivot steps depending on d only. Mathematics of Operations Research. 11(4), 570-590.
Karp, R. M., & Wigderson A. (1985).  A fast parallel algorithm for the maximal independent set problem. Journal of the Association for Computing Machinery. 32(4), 762-773.
Hannum, G., Srivas R., Guénolé A., van Attikum H., Krogan N. J., Karp R. M., et al. (2009).  Genome-Wide Association Data Reveal a Global Map of Genetic Interaction Among Protein Complexes. PLoS Genetics. 5(12), 
Karp, R. M. (2006).  George Dantzig's Impact on the Theory of Computation. Discrete Optimization. 5(2), 174-185.
Gusfield, D., Karp R. M., Wang L., & Stelling P. (1998).  Graph Traversals, Genes and Matroids: An Efficient Case of the Travelling Salesman Problem. 88,
Alon, N., Karp R. M., Peleg D., & West D. (1995).  A graph-theoretic game and its application to the k-server problem. SIAM Journal on Computing. 24(1), 78-100.
Kirkpatrick, B., C. Armendariz S., Karp R. M., & Halperin E. (2007).  HAPLOPOOL: Improving Haplotype Frequency Estimation Through DNA Pools and Phylogenetic Modeling. Bioinformatics. 23(22), 3048-3055.
Kirkpatrick, B., Halperin E., & Karp R. M. (2010).  Haplotype Inference in Complex Pedigrees. Journal of Computational Biology. 17(3), 269-280.
Karp, R. M. (2011).  Heuristic Algorithms in Computations Molecular Biology. Journal of Computer and System Sciences. 77(1), 122-128.
Sharan, R., Ideker T. E., Kelley B. P., Shamir R., & Karp R. M. (2005).  Identification of Protein Complexes by Comparative Analysis of Yeast and Bacterial Protein Interaction Data. Journal of Computational Biology. 12(6), 835-846.
Ronen, B.., & Karp R. M. (1994).  An information entropy approach to the small-lot concept. IEEE Transactions on Engineering Management. 41(1), 89-92.
Karp, R. M. (1991).  An Introduction to Randomized Algorithms. Discrete Applied Mathematics. 34,
Karp, R. M., & Papadimitriou C. H. (1982).  On Linear Characterizations of Combinatorial Optimization Problems. SIAM Journal on Computing. 11(4), 620-632.
Culler, D. E., Karp R. M., Patterson D., & Sahay A. (1996).  LogP: A Practical Model of Parallel Computation. Communications of the ACM. 39(11), 78-85.
Culler, D. E., Karp R. M., Patterson D., Sahay A., Schauser K. Erik, Santos E. E., et al. (1993).  LogP: towards a realistic model of parallel computation. SIGPLAN Notices. 28,
Alt, H., Guibas L. J., Mehlhorn K., & Karp R. M. (1996).  A Method for Obtaining Randomized Algorithms with Small Tail Probabilities. Algorithmica. 16(4-5), 543-547.
Halperin, E., & Karp R. M. (2005).  The Minimum-Entropy Set Cover Problem. Theoretical Computer Science. 348(2), 240-250.
Karmarkar, N., Karp R. M., Lipton R. J., Lovász L., & Luby M. (1993).  A Monte-Carlo algorithm for estimating the permanent. SIAM Journal on Computing. 22(2), 284-293.
Karp, R. M., & Luby M. (1985).  Monte-Carlo Algorithms for the Planar Multiterminal Network Reliability Problem. Journal of Complexity. 1,
Karp, R. M., Luby M., & Madras N.. (1989).  Monte-Carlo approximation algorithms for enumeration problems. Journal of Algorithms. 10(3), 429-448.
Karp, R. M., & Hopcroft J.. E. (1973).  An n5/2 Algorithm for Maximum Matchings in Bipartite Graphs. SIAM Journal on Computing. 2(4), 225-231.
Karp, R. M., McKellar A.. C., & Wong C.. K. (1975).  Near-optimal Solutions to a 2-dimensional Placement Problem. SIAM Journal on Computing. 4(3), 271-286.
Dagum, P., Karp R. M., Luby M., & Ross S. (2000).  An Optimal Algorithm for Monte Carlo Estimation. 29,
Dagum, P., Karp R. M., Luby M., & Ross S. (2000).  An Optimal Algorithm for Monte-Carlo Estimation. 29(5), 1484-1496.
Karp, R. M., & Glassey C.. R. (1976).  On the Optimality of Huffman Trees. SIAM Journal on Applied Mathematics. 31(2), 368-378.