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., & Zhang Y. (1989).  On Parallel Evaluation of Game Trees.
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., & Wigderson A. (1985).  A fast parallel algorithm for the maximal independent set problem. Journal of the Association for Computing Machinery. 32(4), 762-773.
Karp, R. M. (2011).  Heuristic Algorithms in Computations Molecular Biology. Journal of Computer and System Sciences. 77(1), 122-128.
Karp, R. M. (1995).  Modeling parallel communication. Proceedings of the 9th International Parallel Processing Symposium (IPDPS '95). 2.
Karp, R. M., & Luby M. (1983).  Monte-Carlo Algorithms for Enumeration and Reliability Problems. Proceedings of the 24th Annual Symposium on Foundations of Computer Science. 56-64.
Karp, R. M., & Papadimitriou C. H. (1980).  On Linear Characterizations of Combinatorial Optimization Problems. Proceedings of the 21st Annual IEEE Symposium on Foundations of Computer Science. 1-9.
Karp, R. M. (1991).  Probabilistic Recurrence Relations.
Karp, R. M., F. Leighton T., Rivest R. L., Thomborson C. David, Vazirani U. V., & Vazirani V. V. (1987).  Global wire routing in two-dimensional arrays. 2(1), 113-129.
Karp, R. M. (1994).  Probabilistic recurrence relations. Journal of the Association for Computing Machinery. 41(6), 1136-1150.
Karp, R. M., & Shamir R. (2000).  Algorithms for Optical Mapping.
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. (2011).  Effective Heuristics for NP-Hard Problems.
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.
Karp, R. M., Luby M., & der Heide F. Meyer auf (1993).  Efficient PRAM Simulation on a Distributed Memory Machine.
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. (1982).  Dynamic Programming Meets the Principle of Inclusion and Exclusion. Operations Research Letters. 1(2), 49-51.
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., & 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. (2010).  Implicit Hitting Set Problems and Multi-Genome Alignment.
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.

Pages