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 
S
Chandrayana, K.., Karp R. M., Roughan M.., Sen S.., & Zhang Y. (2004).  Search Strategies in Inter-Domain Traffic Engineering.
Karp, R. M., & Pearl J.. (1983).  Searching for an optimal path in a tree with random costs. Artificial Intelligence. 21(1-2), 99-116.
Dolev, D., Even S., & Karp R. M. (1982).  On the security of ping-pong protocols.
Dolev, D., Even S., & Karp R. M. (1982).  On the security of ping-pong protocols. 55(1-3), 57-68.
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. (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.
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.
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.
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. (1990).  Subtree isomorphism is in random NC. Discrete Applied Mathematics. 29(1), 35-62.
Gibbons, P. B., Karp R. M., Miller G. L., & Soroker D. (1989).  Subtree Isomorphism is in Random NC.
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.

Pages