Publications
Found 19 results
Author Title Type [ Year] Filters: First Letter Of Title is M and Author is Richard M. Karp [Clear All Filters]
The Minimum-Entropy Set Cover Problem.
Theoretical Computer Science. 348(2), 240-250.
(2005). The Minimum-Entropy Set Cover Problem.
Proceedings of ICALP.
(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.
(2004). Mathematical Challenges from Genomics and Molecular Biology.
49(5), 544-553.
(2002). A Maximun Likelihood Polynomial Time Syndrome Decoder to Correct Linearly Independent Errors.
Proceedings of International Symposium on Information Theory.
(2001).
(1998).
Mapping Clones with a Given Ordering or Interleaving.
Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms. 400-409.
(1997). A Method for Obtaining Randomized Algorithms with Small Tail Probabilities.
Algorithmica. 16(4-5), 543-547.
(1996). Modeling parallel communication.
Proceedings of the 9th International Parallel Processing Symposium (IPDPS '95). 2.
(1995). Mapping the Genome: some combinatorial problems arising in molecular biology.
Proceedings of 25th Annual Symposium on the Theory of Computing. 278-285.
(1993). A Monte-Carlo algorithm for estimating the permanent.
SIAM Journal on Computing. 22(2), 284-293.
(1993). The mortgage problem.
Proceedings of the Second Israel Symposium on Theory and Computing Systems . 304-312.
(1993). Monte-Carlo approximation algorithms for enumeration problems.
Journal of Algorithms. 10(3), 429-448.
(1989). Monte-Carlo Algorithms for the Planar Multiterminal Network Reliability Problem.
Journal of Complexity. 1,
(1985). Monte-Carlo Algorithms for the Planar Multiterminal Network Reliability Problem.
Proceedings of the Symposium on the Complexity of Approximately Solved Problems. 45-64.
(1985). Monte-Carlo Algorithms for Enumeration and Reliability Problems.
Proceedings of the 24th Annual Symposium on Foundations of Computer Science. 56-64.
(1983). Maximum Matchings in Sparse Random Graphs.
Proceedings of the 22nd IEEE Annual Symposium on Foundations of Computer Science. 364-375.
(1981).