Publications
Noisy Binary Search.
Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA 2007). 881-890.
(2007). Near-optimal Solutions to a 2-dimensional Placement Problem.
SIAM Journal on Computing. 4(3), 271-286.
(1975).
(1997). An n5/2 Algorithm for Maximum Matchings in Bipartite Graphs.
SIAM Journal on Computing. 2(4), 225-231.
(1973). 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). 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.
Proceedings of the Symposium on the Complexity of Approximately Solved Problems. 45-64.
(1985). Monte-Carlo Algorithms for the Planar Multiterminal Network Reliability Problem.
Journal of Complexity. 1,
(1985). Monte-Carlo Algorithms for Enumeration and Reliability Problems.
Proceedings of the 24th Annual Symposium on Foundations of Computer Science. 56-64.
(1983).
(1990). A Monte-Carlo algorithm for estimating the permanent.
SIAM Journal on Computing. 22(2), 284-293.
(1993). Modeling parallel communication.
Proceedings of the 9th International Parallel Processing Symposium (IPDPS '95). 2.
(1995). The Minimum-Entropy Set Cover Problem.
Theoretical Computer Science. 348(2), 240-250.
(2005). The Minimum-Entropy Set Cover Problem.
Proceedings of ICALP.
(2004).
(1991). A Method for Obtaining Randomized Algorithms with Small Tail Probabilities.
Algorithmica. 16(4-5), 543-547.
(1996). A Maximun Likelihood Polynomial Time Syndrome Decoder to Correct Linearly Independent Errors.
Proceedings of International Symposium on Information Theory.
(2001). Maximum Matchings in Sparse Random Graphs.
Proceedings of the 22nd IEEE Annual Symposium on Foundations of Computer Science. 364-375.
(1981). Mathematical Challenges from Genomics and Molecular Biology.
49(5), 544-553.
(2002). Mapping the Genome: some combinatorial problems arising in molecular biology.
Proceedings of 25th Annual Symposium on the Theory of Computing. 278-285.
(1993).
(1998). Mapping Clones with a Given Ordering or Interleaving.
Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms. 400-409.
(1997). LogP: towards a realistic model of parallel computation.
SIGPLAN Notices. 28,
(1993). LogP: towards a realistic model of parallel computation.
Proceedings of the Fourth ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming. 1-12.
(1993).