Publications

Found 238 results
Author Title [ Type(Desc)] Year
Filters: Author is Richard M. Karp  [Clear All Filters]
Conference Paper
Karp, R. M. (1993).  Mapping the Genome: some combinatorial problems arising in molecular biology. Proceedings of 25th Annual Symposium on the Theory of Computing. 278-285.
Karp, R. M., & Sipser M.. (1981).  Maximum Matchings in Sparse Random Graphs. Proceedings of the 22nd IEEE Annual Symposium on Foundations of Computer Science. 364-375.
Horn, G.. B., & Karp R. M. (2001).  A Maximun Likelihood Polynomial Time Syndrome Decoder to Correct Linearly Independent Errors. Proceedings of International Symposium on Information Theory.
Halperin, E., & Karp R. M. (2004).  The Minimum-Entropy Set Cover Problem. Proceedings of ICALP.
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., & 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.
El-Yaniv, R., & Karp R. M. (1993).  The mortgage problem. Proceedings of the Second Israel Symposium on Theory and Computing Systems . 304-312.
Xing, E. P., & Karp R. M. (2004).  MotifPrototyper: A Bayesian Profile Model for Motif Families. Proceedings of the National Academy of Sciences of the United States of America. 101(29), 10523-10528.
Karp, R. M., & Kleinberg R.. (2007).  Noisy Binary Search. Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA 2007). 881-890.
Karp, R. M. (1992).  On-line algorithms versus off-line algorithms: how much is it worth to know the future?. Proceedings of the IFIP 12th World Computer Congress on Algorithms, Software, Architecture - Information Processing '92. 416-429.
Dagum, P., Karp R. M., Luby M., & Ross S. (1995).  An optimal algorithm for Monte Carlo estimation. Proceedings of the 36th Annual Symposium on Foundations of Computer Science (FOCS'95). 142-149.
Karp, R. M., Vazirani U. V., & Vazirani V. V. (1990).  An optimal algorithm for on-line bipartite matching. Proceedings of the 22nd Annual ACM Symposium on Theory of Computing.
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., 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., & Zhang Y. (1989).  On parallel evaluation of game trees. Proceedings of the 1989 ACM Symposium on Parallel Algorithms and Architectures (SPAA '89). 409-420.
Adler, M., Byers J. W., & Karp R. M. (1995).  Parallel sorting with limited bandwidth. Proceedings of the 7th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA '95). 129-136.
Kirkpatrick, B., Li S. Cheng, Karp R. M., & Halperin E. (2011).  Pedigree Reconstruction Using Identity by Descent. 136-152.
Halperin, E., & Karp R. M. (2004).  Perfect Phylogeny and Haplotype Assignment. Proceedings of RECOMB.
Alizadeh, F., Karp R. M., Weisser D. K., & Zweig G. (1994).  Physical mapping of chromosomes using unique probes. Proceedings of Fifth Annual ACM-SIAM Symposium on Discrete Algorithms. 489-500.
Ben-David, S., Borodin A., Karp R. M., Tardos G., & Wigderson A. (1990).  On the power of randomization in online algorithms. Proceedings of the 22nd Annual ACM Symposium on Theory of Computing. 379-386.
Karp, R. M. (1979).  Probabilistic Analysis of Graph-theoretic Algorithms. Proceedings of the Computer Science and Statistics 12th Annual Symposium on the Interface.
Aleliunas, R., Karp R. M., Lipton R. J., Lovász L., & Rackoff C. (1979).  Random Walks, Universal Traversal Sequences, and the Complexity of Maze Problems. Proceedings of the 20th Annual IEEE Symposium of Foundations of Computer Science. 218-223.
Aleliunas, R., Karp R. M., Lipton R. J., & Lovász L. (1979).  Random Walks, Universal Traversal Sequences, and the Complexity of Maze Problems. Proceedings of the Computer Science and Statistics 12th Annual Symposium on the Interface. 174-176.
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.

Pages