Publications

Found 23 results
Author Title [ Type(Desc)] Year
Filters: First Letter Of Title is S and Author is Richard M. Karp  [Clear All Filters]
Conference Paper
Ratnasamy, S., Francis P., Handley M., Karp R. M., & Shenker S. J. (2001).  A Scalable Content-Addressable Network. Proceedings of ACM SIGCOMM Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications. 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.
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.
Dolev, D., Even S., & Karp R. M. (1982).  On the security of ping-pong protocols.
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.
Akella, A., Karp R. M., Papadimitriou C. H., Seshan S., & Shenker S. J. (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.
Daskalakis, C., Karp R. M., Mossel E., Riesenfeld S., & Verbin E.. (2009).  Sorting and Selection in Posets. 392-401.
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).
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.
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.
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.
Journal Article
Ratnasamy, S., Francis P., Handley M., Karp R. M., & Shenker S. J. (2001).  A Scalable Content-Addressable Network. ACM SIGCOMM Computer Communication Review. 31(4), 161-172.
Karp, R. M., & Pearl J.. (1983).  Searching for an optimal path in a tree with random costs. Artificial Intelligence. 21(1-2), 99-116.
Akella, A., Karp R. M., Papadimitriou C. H., Seshan S., & Shenker S. J. (2002).  Selfish Behavior and Stability of the Internet: A Gamer-Theoretic Analysis of TCP. ACM SIGCOMM Computer Communication Review. 32(4), 117-130.
Karp, R. M., Shenker S. J., & 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. J., & Papadimitriou C. H. (2003).  A Simple Algorithm for Finding Frequent Elements in Streams and Bags. ACM Transactions on Database Systems. 28(1), 51-55.
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.
Gibbons, P. B., Karp R. M., Miller G. L., & Soroker D. (1990).  Subtree isomorphism is in random NC. Discrete Applied Mathematics. 29(1), 35-62.
Miscellaneous
Chandrayana, K.., Karp R. M., Roughan M.., Sen S.., & Zhang Y. (2004).  Search Strategies in Inter-Domain Traffic Engineering.
Dolev, D., Even S., & Karp R. M. (1982).  On the security of ping-pong protocols. 55(1-3), 57-68.
Technical Report
Ratnasamy, S., Francis P., Handley M., Karp R. M., & Shenker S. J. (2000).  A Scalable Content Addressable Network.
Adler, M., Byers J. W., & Karp R. M. (1995).  Scheduling Parallel Communication: The h-Relation Problem.
Gibbons, P. B., Karp R. M., Miller G. L., & Soroker D. (1989).  Subtree Isomorphism is in Random NC.