Publications
On a Search Problem Related to Branch-and-Bound Procedures.
Proceedings of the 27th Annual Symposium on Foundations of Computer Science. 19-28.
(1986). Searching for an optimal path in a tree with random costs.
Artificial Intelligence. 21(1-2), 99-116.
(1983).
(2009). Dynamic Programming Meets the Principle of Inclusion and Exclusion.
Operations Research Letters. 1(2), 49-51.
(1982). Monte-Carlo Algorithms for the Planar Multiterminal Network Reliability Problem.
Proceedings of the Symposium on the Complexity of Approximately Solved Problems. 45-64.
(1985). A randomized parallel branch-and-bound procedure.
Proceedings of the 20th Annual ACM Symposium on Theory of Computing. 290-300.
(1988).
(2010). Efficient PRAM Simulation on a Distributed Memory Machine.
Algorithmica. 16(4-5), 517-542.
(1996). Mathematical Challenges from Genomics and Molecular Biology.
49(5), 544-553.
(2002).
(1979). The Complexity of Parallel Search.
Proceedings of the 17th Annual ACM Symposium on the Theory of Computing. 225-253.
(1988).
(1999). A generalization of binary search.
Proceedings of the Third Workshop on Algorithms and Data Structures (WADS'93). 27-34.
(1993).
(2006).
(1975). Efficient PRAM simulation on a distributed memory machine.
Proceedings of the 24th Annual ACM Symposium on the Theory of Computing. 318-326.
(1992). Two Special Cases of the Assignment Problem.
Discrete Mathematics (Netherlands). 13(2), 129-142.
(1975). Variations on the Theme of "Twenty Questions".
Proceedings of the 1998 IEEE International Symposium on Information Theory. 3.
(1998). The bit vector intersection problem.
Proceedings of the 36th Annual Symposium on Foundations of Computer Science (FOCS'95). 621-630.
(1995).
(1980). 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). Efficient randomized pattern-matching algorithms.
IBM Journal of Research and Development. 31(2), 249-260.
(1987). An Introduction to Randomized Algorithms.
Proceedings of the Capital City Conference on Combinatorics and Theoretical Computer Science. 165-201.
(1991). Randomized Rumor Spreading.
Proceedings of the IEEE 41st Annual Symposium on Foundations of Computer Science (FOCS 2000). 565-574.
(2000). Probabilistic Analysis of Partitioning Algorithms for the Traveling-salesman Problem in the Plane.
Mathematics of Operations Research. 2(3), 209-224.
(1977).