Publications

Found 238 results
Author Title [ Type(Desc)] Year
Filters: Author is Richard M. Karp  [Clear All Filters]
Journal Article
Ratnasamy, S., Handley M., Karp R. M., & Shenker S. (2001).  Application-Level Multicast Using Content-Addressable Networks. 2233, 14-29.
Kimmel, G., Karp R. M., Jordan M.. A., & Halperin E. (2008).  Association Mapping and Significance Estimation via the Coalescent. Journal of Human Genetics. 83(6), 675-683.
Karp, R. M., Kan A.. H. G. Rinn, & Vohra R.. V. (1994).  Average case analysis of a heuristic for the assignment problem. Mathematics of Operations Research. 19(3), 513-522.
Karp, R. M., & Zhang Y. (1995).  Bounded branching process and AND/OR tree evaluation. Random Structures and Algorithms. 7(2), 97-116.
Karp, R. M. (1978).  A Characterization of the Minimum Cycle Mean in a Digraph. Discrete Mathematics (Netherlands). 23(3), 309-311.
Xing, E. P., & Karp R. M. (2001).  CLIFF: Clustering of High-Dimensional Microarray Data via Iterative Feature Filtering Using Normalized Cuts. 17, S306-S315.
Adler, I., Ahn H.. S., Karp R. M., & Ross S. M. (2003).  Coalescing Times for IID Random Variables.
Hellerstein, L., Gibson G. A., Karp R. M., Katz R.. M., & Patterson D. (1994).  Coding techniques for handling failures in large disk arrays. Algorithmica. 12(2-3), 182-208.
Karp, R. M. (1986).  Combinatorics, Complexity, and Randomness. Communications of the ACM. 29(2), 98-109.
Karp, R. M. (1986).  Combinatorics, Complexity and Stochastic Algorithms. Informatie. 28(9), 722-733.
Kirkpatrick, B., Reshef Y., Finucane H., Jiang H., Zhu B., & Karp R. M. (2012).  Comparing Pedigree Graphs. Journal of Computational Biology. 19(9), 998-1014.
Narayanan, M.., & Karp R. M. (2007).  Comparing Protein Interaction Networks via a Graph Match-and-Split Algorithm. Journal of Computational Biology. 14(7), 892-907.
Fiat, A., Karp R. M., Luby M., McGeoch L.. A., Sleator D.. D., & Young N.. E. (1991).  Competitive paging algorithms. Journal of Algorithms. 12(4), 685-699.
Karp, R. M., Upfal E., & Wigderson A. (1988).  The Complexity of Parallel Search. Journal of Computer and System Sciences. 36,
Karp, R. M. (1975).  On the Computational Complexity of Combinatorial Problems. Networks. 5,
Karp, R. M., Motwani R., & Raghaven P.. (1988).  Deferred Data Structuring. SIAM Journal on Computing. 17(5), 883-902.
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. (1982).  Dynamic Programming Meets the Principle of Inclusion and Exclusion. Operations Research Letters. 1(2), 49-51.
Beame, P., Karp R. M., Pitassi T., & Saks M. (2002).  The Efficiency of Resolution and Davis-Putnamn Procedures. 31(4), 1048-1075.
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.
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.
Karp, R. M., & Rabin M.. O. (1987).  Efficient randomized pattern-matching algorithms. IBM Journal of Research and Development. 31(2), 249-260.
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.
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.
Karp, R. M., Kenyon C., & Waarts O. (1999).  Error-Resilient DNA Computation. 15,

Pages