Publications

Found 4228 results
[ Author(Desc)] 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., & Glassey C.. R. (1976).  On the Optimality of Huffman Trees. SIAM Journal on Applied Mathematics. 31(2), 368-378.
Karp, R. M. (2009).  Three Combinatorial Problems in Computational and Genomic Biology.
Karp, R. M., & Pearl J.. (1983).  Searching for an optimal path in a tree with random costs. Artificial Intelligence. 21(1-2), 99-116.
Karp, R. M., & Zhang Y. (1988).  A randomized parallel branch-and-bound procedure. Proceedings of the 20th Annual ACM Symposium on Theory of Computing. 290-300.
Karp, R. M., & Luby M. (1985).  Monte-Carlo Algorithms for the Planar Multiterminal Network Reliability Problem. Proceedings of the Symposium on the Complexity of Approximately Solved Problems. 45-64.
Karp, R. M. (1982).  Dynamic Programming Meets the Principle of Inclusion and Exclusion. Operations Research Letters. 1(2), 49-51.
Karp, R. M. (2010).  Implicit Hitting Set Problems and Multi-Genome Alignment.
Karp, R. M., Nierhoff T., & Tantau T. (2006).  Optimal Flow Distribution Among Multiple Channels with Unknown Capacities. 3895, 111-128.
Karp, R. M. (1993).  A generalization of binary search. Proceedings of the Third Workshop on Algorithms and Data Structures (WADS'93). 27-34.
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. (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., Upfal E., & Wigderson A. (1988).  The Complexity of Parallel Search. Proceedings of the 17th Annual ACM Symposium on the Theory of Computing. 225-253.
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., & 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., & Li S-Y. R. (1975).  Two Special Cases of the Assignment Problem. Discrete Mathematics (Netherlands). 13(2), 129-142.
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., & 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., 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. (1980).  An Algorithm to Solve the m*n Assignment Problem in Expected Time O(mn log n)*. 10(2), 143-152.
Karp, R. M. (2005).  Report of the SIGACT Committee on funding for Theoretical Computer Science.
Karp, R. M. (1986).  The complexity of parallel computation. Proceedings of the Fourth MIT Conference on Advanced Resarch in VLSI.

Pages