Found 238 results
Author Title [ Type(Asc)] Year
Filters: Author is Richard M. Karp  [Clear All Filters]
Journal Article
Karp, R. M., & Papadimitriou C. H. (1982).  On Linear Characterizations of Combinatorial Optimization Problems. SIAM Journal on Computing. 11(4), 620-632.
Karp, R. M. (1991).  An Introduction to Randomized Algorithms. Discrete Applied Mathematics. 34,
Ronen, B.., & Karp R. M. (1994).  An information entropy approach to the small-lot concept. IEEE Transactions on Engineering Management. 41(1), 89-92.
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.
Karp, R. M. (2011).  Heuristic Algorithms in Computations Molecular Biology. Journal of Computer and System Sciences. 77(1), 122-128.
Kirkpatrick, B., Halperin E., & Karp R. M. (2010).  Haplotype Inference in Complex Pedigrees. Journal of Computational Biology. 17(3), 269-280.
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.
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.
Gusfield, D., Karp R. M., Wang L., & Stelling P. (1998).  Graph Traversals, Genes and Matroids: An Efficient Case of the Travelling Salesman Problem. 88,
Karp, R. M. (2006).  George Dantzig's Impact on the Theory of Computation. Discrete Optimization. 5(2), 174-185.
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., & Wigderson A. (1985).  A fast parallel algorithm for the maximal independent set problem. Journal of the Association for Computing Machinery. 32(4), 762-773.
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., Kenyon C., & Waarts O. (1999).  Error-Resilient DNA Computation. 15,
Suthram, S.., Beyer A.., Karp R. M., Eldar Y.., & Ideker T. E. (2008).  E-QED: An Efficient Method for Interpreting eQTL Associations Using Protein Networks. Molecular Systems Biology.
Eskin, E., Halperin E., & Karp R. M. (2003).  Efficient Reconstruction of Haplotype Structure Via Perfect Phylogeny. Journal of Bioinformatics and Computational Biology. 1(1), 1-20.
Karp, R. M., & Rabin M.. O. (1987).  Efficient randomized pattern-matching algorithms. IBM Journal of Research and Development. 31(2), 249-260.
Karp, R. M., Luby M., & der Heide F. Meyer auf (1996).  Efficient PRAM Simulation on a Distributed Memory Machine. Algorithmica. 16(4-5), 517-542.
Scott, J., Ideker T. E., Karp R. M., & Sharan R. (2006).  Efficient Algorithms for Detecting Signaling Pathways in Protein Interaction Networks. Journal of Computational Biology. 13, 133-144.
Beame, P., Karp R. M., Pitassi T., & Saks M. (2002).  The Efficiency of Resolution and Davis-Putnamn Procedures. 31(4), 1048-1075.
Karp, R. M. (1982).  Dynamic Programming Meets the Principle of Inclusion and Exclusion. Operations Research Letters. 1(2), 49-51.
Ben-Dor, A., Chor B., Karp R. M., & Yakhini Z. (2003).  Discovering Local Structure in Gene Expression Data: The Order-Preserving Submatrix Problem. Journal of Computational Biology. 10(3-4), 385-398.
Karp, R. M., Motwani R., & Raghaven P.. (1988).  Deferred Data Structuring. SIAM Journal on Computing. 17(5), 883-902.
Karp, R. M. (1975).  On the Computational Complexity of Combinatorial Problems. Networks. 5,
Karp, R. M., Upfal E., & Wigderson A. (1988).  The Complexity of Parallel Search. Journal of Computer and System Sciences. 36,