Publications

Found 91 results
[ Author(Desc)] Title 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 
K
Karp, R. M., Luby M., & M. Shokrollahi A. (2004).  Finite-Length Analysis of LT-codes. Proceedings of International Symposium on Information Theory (ISIT).
Karp, R. M., & Kenyon C. (2003).  A Gambling Game and its Application to the Analysis of Adaptive Randomized Rounding.
Karp, R. M., Rao A., Lakshminarayanan K., Surana S., & Stoica I. (2003).  Load Balancing in Structured P2P Systems. Proceedings of the Second International Workshop on Peer-to-Peer Systems.
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., Luby M., & M. Shokrollahi A. (2004).  Finite-Length Analysis of LT-codes.
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., Koutsoupias E.., Papadimitriou C. H., & Shenker S. (2000).  Optimization Problems in Congestion Control. Proceedings of the 41st Annual Symposium on Foundations of Computer Science (FOCS 2000). 66-74.
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.
Karp, R. M., & Shamir R. (2000).  Algorithms for Optical Mapping.
Karp, R. M. (2002).  Mathematical Challenges from Genomics and Molecular Biology. 49(5), 544-553.
Karp, R. M., Kenyon C., & Waarts O. (1999).  Error-Resilient DNA Computation. 15,
Karp, R. M. (1998).  Variations on the Theme of "Twenty Questions". Proceedings of the 1998 IEEE International Symposium on Information Theory. 3.
Karp, R. M., & Shamir R. (1998).  Algorithms for Optical Mapping. Proceedings of the Second Annual International Conference on Computational Molecular Biology. 117-124.
Karp, R. M., & Zhang Y. (1998).  On Parallel Evaluation of Game Trees. 45,
Karp, R. M., Luby M., & der Heide F. Meyer auf (1996).  Efficient PRAM Simulation on a Distributed Memory Machine. Algorithmica. 16(4-5), 517-542.
Karp, R. M., & Zhang Y. (1989).  On Parallel Evaluation of Game Trees.
Karp, R. M. (1989).  The Transitive Closure of a Random Digraph.
Karp, R. M. (1990).  An Introduction to Randomized Algorithms.
Karp, R. M. (1991).  Parallel Combinatorial Computing.
Karp, R. M. (1991).  Probabilistic Recurrence Relations.
Karp, R. M. (1992).  On-Line Algorithms Versus Off-Line Algorithms: How Much Is It Worth to Know the Future?.
Karp, R. M., Luby M., & der Heide F. Meyer auf (1993).  Efficient PRAM Simulation on a Distributed Memory Machine.
Karp, R. M. (1993).  Finite Branching Processes and AND/OR Tree Evaluation.
Karp, R. M., & Zhang Y. (1995).  Bounded branching process and AND/OR tree evaluation. Random Structures and Algorithms. 7(2), 97-116.
Karp, R. M., Waarts O., & Zweig G. (1995).  The bit vector intersection problem. Proceedings of the 36th Annual Symposium on Foundations of Computer Science (FOCS'95). 621-630.

Pages