Publications
Mapping the Genome: some combinatorial problems arising in molecular biology.
Proceedings of 25th Annual Symposium on the Theory of Computing. 278-285.
(1993). Maximum Matchings in Sparse Random Graphs.
Proceedings of the 22nd IEEE Annual Symposium on Foundations of Computer Science. 364-375.
(1981). A Maximun Likelihood Polynomial Time Syndrome Decoder to Correct Linearly Independent Errors.
Proceedings of International Symposium on Information Theory.
(2001). The Minimum-Entropy Set Cover Problem.
Proceedings of ICALP.
(2004). Modeling parallel communication.
Proceedings of the 9th International Parallel Processing Symposium (IPDPS '95). 2.
(1995). Monte-Carlo Algorithms for Enumeration and Reliability Problems.
Proceedings of the 24th Annual Symposium on Foundations of Computer Science. 56-64.
(1983). Monte-Carlo Algorithms for the Planar Multiterminal Network Reliability Problem.
Proceedings of the Symposium on the Complexity of Approximately Solved Problems. 45-64.
(1985). The mortgage problem.
Proceedings of the Second Israel Symposium on Theory and Computing Systems . 304-312.
(1993). 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). Noisy Binary Search.
Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA 2007). 881-890.
(2007). 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.
(1992). An optimal algorithm for Monte Carlo estimation.
Proceedings of the 36th Annual Symposium on Foundations of Computer Science (FOCS'95). 142-149.
(1995). An optimal algorithm for on-line bipartite matching.
Proceedings of the 22nd Annual ACM Symposium on Theory of Computing.
(1990). Optimal Flow Distribution Among Multiple Channels with Unknown Capacities.
Proceedings of the Second Brazilian Symposium of Graphs, Algorithms, and Combinatorics (GRACO 2005). 225-231.
(2005). Optimization Problems in Congestion Control.
Proceedings of the 41st Annual Symposium on Foundations of Computer Science (FOCS 2000). 66-74.
(2000). On parallel evaluation of game trees.
Proceedings of the 1989 ACM Symposium on Parallel Algorithms and Architectures (SPAA '89). 409-420.
(1989). Parallel sorting with limited bandwidth.
Proceedings of the 7th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA '95). 129-136.
(1995).
(2011). Perfect Phylogeny and Haplotype Assignment.
Proceedings of RECOMB.
(2004). Physical mapping of chromosomes using unique probes.
Proceedings of Fifth Annual ACM-SIAM Symposium on Discrete Algorithms. 489-500.
(1994). On the power of randomization in online algorithms.
Proceedings of the 22nd Annual ACM Symposium on Theory of Computing. 379-386.
(1990). Probabilistic Analysis of Graph-theoretic Algorithms.
Proceedings of the Computer Science and Statistics 12th Annual Symposium on the Interface.
(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.
(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.
(1979). A randomized parallel branch-and-bound procedure.
Proceedings of the 20th Annual ACM Symposium on Theory of Computing. 290-300.
(1988).