Publications

Found 4228 results
[ Author(Asc)] Title Type Year
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., Nierhoff T., & Tantau T. (2006).  Optimal Flow Distribution Among Multiple Channels with Unknown Capacities. 3895, 111-128.
Karp, R. M. (2002).  Mathematical Challenges from Genomics and Molecular Biology. 49(5), 544-553.
Karp, R. M. (1979).  Recent Advances in the Probabilistic Analysis of Graph-theoretic Algorithms. 338-339.
Karp, R. M., & Li S-Y. R. (1975).  Two Special Cases of the Assignment Problem. Discrete Mathematics (Netherlands). 13(2), 129-142.
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., & Matula D. W. (1975).  Probabilistic Behavior of a Naive Coloring Algorithm on Random Graphs.
Karp, R. M., Luby M., & der Heide F. Meyer auf (1992).  Efficient PRAM simulation on a distributed memory machine. Proceedings of the 24th Annual ACM Symposium on the Theory of Computing. 318-326.
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.
Karp, R. M., Nierhoff T., & Tantau T. (2005).  Optimal Flow Distribution Among Multiple Channels with Unknown Capacities. Proceedings of the Second Brazilian Symposium of Graphs, Algorithms, and Combinatorics (GRACO 2005). 225-231.
Karp, R. M., & Rabin M.. O. (1987).  Efficient randomized pattern-matching algorithms. IBM Journal of Research and Development. 31(2), 249-260.
Karp, R. M. (1991).  An Introduction to Randomized Algorithms. Proceedings of the Capital City Conference on Combinatorics and Theoretical Computer Science. 165-201.
Karp, R. M. (1980).  An Algorithm to Solve the m*n Assignment Problem in Expected Time O(mn log n)*. 10(2), 143-152.
Karp, R. M. (1977).  Probabilistic Analysis of Partitioning Algorithms for the Traveling-salesman Problem in the Plane. Mathematics of Operations Research. 2(3), 209-224.
Karp, R. M. (1986).  The complexity of parallel computation. Proceedings of the Fourth MIT Conference on Advanced Resarch in VLSI.
Karp, R. M. (2005).  Report of the SIGACT Committee on funding for Theoretical Computer Science.
Karp, R. M., Schindelhauer C., Shenker S. J., & 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., & Hopcroft J.. E. (1973).  An n5/2 Algorithm for Maximum Matchings in Bipartite Graphs. SIAM Journal on Computing. 2(4), 225-231.
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. (2010).  Understanding Science Through the Lens of Computation.
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., Upfal E., & Wigderson A. (1988).  The Complexity of Parallel Search. Journal of Computer and System Sciences. 36,
Karp, R. M., & Papadimitriou C. H. (1982).  On Linear Characterizations of Combinatorial Optimization Problems. SIAM Journal on Computing. 11(4), 620-632.
Karp, R. M. (1991).  An Introduction to Randomized Algorithms. Discrete Applied Mathematics. 34,
Karp, R. M. (1990).  An Introduction to Randomized Algorithms.
Karp, R. M., Motwani R., & Nisan N. (1993).  Probabilistic analysis of network flow algorithms. Mathematics of Operations Research. 18(1), 71-97.

Pages