Publications

Found 24 results
Author Title Type [ Year(Desc)]
Filters: First Letter Of Title is C and Author is Richard M. Karp  [Clear All Filters]
1978
Karp, R. M. (1978).  A Characterization of the Minimum Cycle Mean in a Digraph. Discrete Mathematics (Netherlands). 23(3), 309-311.
1985
Karp, R. M. (1985).  The complexity of parallel computation. Proceedings of the 23rd Annual Allerton Conference on Communication, Control, and Computing. 1.
1986
Frankle, J.., & Karp R. M. (1986).  Circuit placements and costs bounds by eigenvector decomposition. Proceedings of the IEEE International Conference on Computer-Aided Design (ICCAD-86), A Conference for the EE CAD Professional. 414-417.
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.
Karp, R. M. (1986).  The complexity of parallel computation. Proceedings of the Fourth MIT Conference on Advanced Resarch in VLSI.
1988
Karp, R. M., Upfal E., & Wigderson A. (1988).  The Complexity of Parallel Search. Proceedings of the 17th Annual ACM Symposium on the Theory of Computing. 225-253.
Karp, R. M., Upfal E., & Wigderson A. (1988).  The Complexity of Parallel Search. Journal of Computer and System Sciences. 36,
1991
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.
1992
El-Yaniv, R., Fiat A., Karp R. M., & Turpin G. (1992).  Competitive Analysis of Financial Games.
El-Yaniv, R., Fiat A., Karp R. M., & Turpin G. (1992).  Competitive analysis of financial games. Proceedings 33rd Annual Symposium on Foundations of Computer Science. 327-333.
1998
Beame, P., Karp R. M., Pitassi T., & Saks M. (1998).  On the Complexity of Unsatisfiability Proofs for Random k-CNF Formulas. Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing. 561-571.
Fasulo, D., Jiang T., Karp R. M., & Sharma N. (1998).  Constructing Maps Using the Span and Inclusion Relations. RECOMB 98. Proceedings of the Second Annual International Conference on Computational Molecular Biology. 64-73.
2003
Adler, I., Ahn H.. S., Karp R. M., & Ross S. M. (2003).  Coalescing Times for IID Random Variables.
Kelley, B. P., Sharan R., Karp R. M., Sittler T., Root D. E., Stockwell B. R., et al. (2003).  Conserved Pathways Within Bacteria and Yeast as Revealed by Global Protein Network Alignment. Proceedings of the National Academy of Sciences of the United States of America. 100(20), 11394-11399.
Sharan, R., Ovcharenko I., Ben-Hur A., & Karp R. M. (2003).  CRÈME: A Framework for Identifying Cis-Regulatory Modules in Human-Mouse Conserved Segments. Proceedings of the Eleventh International Conference on Intelligent Systems for Molecular Biology (ISMB'03). 1283-1291.
2005
Sharan, R., Sutharan S., Kelley R. M., Kuhn T., McCuine S., Sittler T., et al. (2005).  Conserved Patterns of Protein Interaction in Multiple Species. Proceedings of National Academy of Science. 102(6), 1974-1979.
2007
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.
2012
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.