Publications

Found 19 results
Author Title Type [ Year(Desc)]
Filters: First Letter Of Title is M and Author is Richard M. Karp  [Clear All Filters]
1981
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.
1983
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.
1985
Karp, R. M., & Luby M. (1985).  Monte-Carlo Algorithms for the Planar Multiterminal Network Reliability Problem. Journal of Complexity. 1,
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.
1989
Karp, R. M., Luby M., & Madras N.. (1989).  Monte-Carlo approximation algorithms for enumeration problems. Journal of Algorithms. 10(3), 429-448.
1990
Karmarkar, N., Karp R. M., Lipton R. J., Lovász L., & Luby M. (1990).  A Monte-Carlo Algorithm for Estimating the Permanent.
1991
Alt, H., Guibas L. J., Mehlhorn K., Karp R. M., & Wigderson A. (1991).  A Method for Obtaining Randomized Algorithms with Small Tail Probabilities.
1993
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.
Karmarkar, N., Karp R. M., Lipton R. J., Lovász L., & Luby M. (1993).  A Monte-Carlo algorithm for estimating the permanent. SIAM Journal on Computing. 22(2), 284-293.
El-Yaniv, R., & Karp R. M. (1993).  The mortgage problem. Proceedings of the Second Israel Symposium on Theory and Computing Systems . 304-312.
1995
Karp, R. M. (1995).  Modeling parallel communication. Proceedings of the 9th International Parallel Processing Symposium (IPDPS '95). 2.
1996
Alt, H., Guibas L. J., Mehlhorn K., & Karp R. M. (1996).  A Method for Obtaining Randomized Algorithms with Small Tail Probabilities. Algorithmica. 16(4-5), 543-547.
1997
Jiang, T., & Karp R. M. (1997).  Mapping Clones with a Given Ordering or Interleaving. Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms. 400-409.
1998
Jiang, T., & Karp R. M. (1998).  Mapping Clones with a Given Ordering or Interleaving. 21,
2001
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.
2002
Karp, R. M. (2002).  Mathematical Challenges from Genomics and Molecular Biology. 49(5), 544-553.
2004
Halperin, E., & Karp R. M. (2004).  The Minimum-Entropy Set Cover Problem. Proceedings of ICALP.
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.
2005
Halperin, E., & Karp R. M. (2005).  The Minimum-Entropy Set Cover Problem. Theoretical Computer Science. 348(2), 240-250.