Publications

Found 238 results
Author Title [ Type(Asc)] Year
Filters: Author is Richard M. Karp  [Clear All Filters]
Journal Article
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.
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.
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.
Karp, R. M. (1986).  Combinatorics, Complexity and Stochastic Algorithms. Informatie. 28(9), 722-733.
Karp, R. M. (1986).  Combinatorics, Complexity, and Randomness. Communications of the ACM. 29(2), 98-109.
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.
Adler, I., Ahn H.. S., Karp R. M., & Ross S. M. (2003).  Coalescing Times for IID Random Variables.
Xing, E. P., & Karp R. M. (2001).  CLIFF: Clustering of High-Dimensional Microarray Data via Iterative Feature Filtering Using Normalized Cuts. 17, S306-S315.
Karp, R. M. (1978).  A Characterization of the Minimum Cycle Mean in a Digraph. Discrete Mathematics (Netherlands). 23(3), 309-311.
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., 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.
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.
Ratnasamy, S., Handley M., Karp R. M., & Shenker S. J. (2001).  Application-Level Multicast Using Content-Addressable Networks. 2233, 14-29.
Hodgkinson, L., & Karp R. M. (2011).  Algorithms to Detect Multiprotein Modularity Conserved During Evolution. IEEE/ACM Transactions on Computational Biology and Bioinformatics.
Karp, R. M., & Shamir R. (2000).  Algorithms for Optical Mapping.
Conference Paper
Karp, R. M. (1998).  Variations on the Theme of "Twenty Questions". Proceedings of the 1998 IEEE International Symposium on Information Theory. 3.
Maron-Katz, A., Ben Simon E., Jacob Y., Rosenberg K., Karp R. M., Hendler T., et al. (2011).  Using Contiguous Bi-Clustering for Data Driven Temporal Analysis of fMRI Based Functional Connectivity. Proceedings of the 4th Annual INCF Neuroinformatics Congress.
Ben-Dor, A., Karp R. M., Schwikowski B., & Yakhini Z. (2000).  Universal DNA Tag Systems: A Combinatorial Design Scheme. Proceedings of RECOMB 2000.
Bruckner, S., Hüffner F., Karp R. M., Shamir R., & Sharan R. (2009).  Torque: Topology-Free Querying of Protein Interaction Networks. 74-89.
Ratnasamy, S., Handley M., Karp R. M., & Shenker S. J. (2002).  Topologically-Aware Overlay Construction and Server Selection. Proceedings of the 21st Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM 2002). 3, 1190-1199.
Karp, R. M. (2012).  Theory of Computation as an Enabling Tool for the Sciences.
Gibbons, P. B., Karp R. M., Miller G. L., & Soroker D. (1988).  Subtree isomorphism is in random NC. Proceedings of the Third Aegean Workshop on Computing, VLSI Algorithms and Architectures (AWOC 88). 43-52.
Karp, R. M. (2007).  Streaming Algorithms for Selection and Approximate Sorting. Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. 9-20.

Pages