Publications

Found 238 results
Author [ Title(Desc)] Type Year
Filters: Author is Richard M. Karp  [Clear All Filters]
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z 
P
Karp, R. M., & Matula D. W. (1975).  Probabilistic Behavior of a Naive Coloring Algorithm on Random Graphs. Bulletin of the Operations Research Society of America. 23,
Karp, R. M., & Matula D. W. (1975).  Probabilistic Behavior of a Naive Coloring Algorithm on Random Graphs.
Adler, I., Ahn H-S., Karp R. M., & Ross S. M. (2005).  A Probabilistic Model for the Survivability of Cells. Journal of Applied Probability. 42(4), 919-931.
Karp, R. M. (1991).  Probabilistic Recurrence Relations.
Karp, R. M. (1994).  Probabilistic recurrence relations. Journal of the Association for Computing Machinery. 41(6), 1136-1150.
R
Aleliunas, R., Karp R. M., Lipton R. J., & Lovász L. (1979).  Random Walks, Universal Traversal Sequences, and the Complexity of Maze Problems. Proceedings of the Computer Science and Statistics 12th Annual Symposium on the Interface. 174-176.
Aleliunas, R., Karp R. M., Lipton R. J., Lovász L., & Rackoff C. (1979).  Random Walks, Universal Traversal Sequences, and the Complexity of Maze Problems. Proceedings of the 20th Annual IEEE Symposium of Foundations of Computer Science. 218-223.
Kimmel, G., Jordan M. I., Halperin E., Shamir R., & Karp R. M. (2007).  A Randomization Test for Controlling Population Stratification in Whole-Genome Association Studies. American Journal of Human Genetics. 81(5), 895-905.
Karp, R. M., & Zhang Y. (1993).  Randomized parallel algorithms for backtrack search and branch-and-bound computation. Journal of the Association for Computing Machinery. 40(3), 765-789.
Karp, R. M., & Zhang Y. (1988).  A randomized parallel branch-and-bound procedure. Proceedings of the 20th Annual ACM Symposium on Theory of Computing. 290-300.
Karp, R. M., Schindelhauer C., Shenker S., & Vocking B.. (2000).  Randomized Rumor Spreading. Proceedings of the IEEE 41st Annual Symposium on Foundations of Computer Science (FOCS 2000). 565-574.
Blömer, J., Karp R. M., & Welzl E. (1996).  The Rank of Sparse Random Matrices Over Finite Fields.
Blömer, J., Karp R. M., & Welzl E. (1997).  The Rank of Sparse Random Matrices Over Finite Fields. Random Structures and Algorithms. 10,
Karp, R. M. (1979).  Recent Advances in the Probabilistic Analysis of Graph-theoretic Algorithms. 338-339.
Sharan, R., & Karp R. M. (2012).  Reconstructing Boolean Models of Signaling. 261-271.
Gat-Viks, I., Shamir R., Karp R. M., & Sharan R. (2004).  Reconstructing Chain Functions in Genetic Networks. Proceedings of the Ninth Pacific Symposium on Biocomputing (PSB'04). 498-509.
Karp, R. M. (2005).  Report of the SIGACT Committee on funding for Theoretical Computer Science.
Ben-Dor, A., Karp R. M., Schwikowski B., & Shamir R. (2002).  The Restriction Scaffold Problem. Proceedings of the Sixth Annual International Conference on Research in Computational Molecular Biology (RECOMB'02).
Ben-Dor, A., Karp R. M., Schwikowski B., & Shamir R. (2003).  The Restriction Scaffold Problem. Journal of Computational Biology. 10(3-4), 385-398.
S
Ratnasamy, S., Francis P., Handley M., Karp R. M., & Shenker S. (2000).  A Scalable Content Addressable Network.
Ratnasamy, S., Francis P., Handley M., Karp R. M., & Shenker S. (2001).  A Scalable Content-Addressable Network. Proceedings of ACM SIGCOMM Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications. 161-172.
Ratnasamy, S., Francis P., Handley M., Karp R. M., & Shenker S. (2001).  A Scalable Content-Addressable Network. ACM SIGCOMM Computer Communication Review. 31(4), 161-172.
Adler, M., Byers J. W., & Karp R. M. (1995).  Scheduling parallel communication: the h-relation problem. Proceedings of the 20th International Mathematical Foundations of Computer Science Symposium, (MFCS '95). 1-20.
Adler, M., Byers J. W., & Karp R. M. (1995).  Scheduling Parallel Communication: The h-Relation Problem.
Karp, R. M., Saks M., & Wigderson A. (1986).  On a Search Problem Related to Branch-and-Bound Procedures. Proceedings of the 27th Annual Symposium on Foundations of Computer Science. 19-28.

Pages