Publications

Found 238 results
Author [ Title(Asc)] 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 
S
Adler, M., Halperin E., Karp R. M., & Vazirani V. V. (2003).  A Stochastic Process on the Hypercube with Applications to Peer-to-peer Networks. Proceedings of the 35th Annual ACM Symposium on Theory of Computing (STOC 2003). 575-584.
Adler, M., Halperin E., Karp R. M., & Vazirani V. V. (2003).  A Stochastic Process on the Hypercube with Applications to Peer to Peer Networks. Proceedings of the 35th Annual ACM Symposium on Theory of Computing (STOC).
Daskalakis, C., Karp R. M., Mossel E., Riesenfeld S., & Verbin E.. (2009).  Sorting and Selection in Posets. 392-401.
Adler, I., Karp R. M., & Shamir R. (1987).  A Simplex variant solving an m*d linear program in O(min(m2, d2)) expected number of pivot steps. Journal of Complexity. 3(4), 372-387.
Karp, R. M., Shenker S., & Papadimitriou C. H. (2003).  A Simple Algorithm for Finding Frequent Elements in Streams and Bags. ACM Transactions on Database Systems. 28(1), 51-55.
Karp, R. M., Shenker S., & Papadimitriou C. H. (2003).  A Simple Algorithm for Finding Frequent Elements in Streams and Bags. ACM Transactions on Database Systems. 28(1), 51-55.
Akella, A., Karp R. M., Papadimitriou C. H., Seshan S., & Shenker S. (2002).  Selfish Behavior and Stability of the Internet: A Gamer-Theoretic Analysis of TCP. Proceedings of ACM Special Interest Group on Data Communications Conference (SIGCOMM 2002). 117-130.
Akella, A., Karp R. M., Papadimitriou C. H., Seshan S., & Shenker S. (2002).  Selfish Behavior and Stability of the Internet: A Gamer-Theoretic Analysis of TCP. ACM SIGCOMM Computer Communication Review. 32(4), 117-130.
Adler, M., Gemmell P., Harchol-Balter M., Karp R. M., & Kenyon C. (1994).  Selection in the presence of noise: the design of playoff systems. Proceedings of Fifth Annual ACM-SIAM Symposium on Discrete Algorithms. 564-572.
Dolev, D., Even S., & Karp R. M. (1982).  On the security of ping-pong protocols. 55(1-3), 57-68.
Dolev, D., Even S., & Karp R. M. (1982).  On the security of ping-pong protocols.
Karp, R. M., & Pearl J.. (1983).  Searching for an optimal path in a tree with random costs. Artificial Intelligence. 21(1-2), 99-116.
Chandrayana, K.., Karp R. M., Roughan M.., Sen S.., & Zhang Y. (2004).  Search Strategies in Inter-Domain Traffic Engineering.
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.
Adler, M., Byers J. W., & Karp R. M. (1995).  Scheduling Parallel Communication: The h-Relation Problem.
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.
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.
Ratnasamy, S., Francis P., Handley M., Karp R. M., & Shenker S. (2000).  A Scalable Content Addressable Network.
R
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.
Karp, R. M. (2005).  Report of the SIGACT Committee on funding for Theoretical Computer Science.
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.
Sharan, R., & Karp R. M. (2012).  Reconstructing Boolean Models of Signaling. 261-271.
Karp, R. M. (1979).  Recent Advances in the Probabilistic Analysis of Graph-theoretic Algorithms. 338-339.

Pages