Publications
Modeling parallel communication.
Proceedings of the 9th International Parallel Processing Symposium (IPDPS '95). 2.
(1995). Probabilistic recurrence relations.
Journal of the Association for Computing Machinery. 41(6), 1136-1150.
(1994). Average case analysis of a heuristic for the assignment problem.
Mathematics of Operations Research. 19(3), 513-522.
(1994). An Introduction to Randomized Algorithms.
Proceedings of the Capital City Conference on Combinatorics and Theoretical Computer Science. 165-201.
(1991). Randomized parallel algorithms for backtrack search and branch-and-bound computation.
Journal of the Association for Computing Machinery. 40(3), 765-789.
(1993). Probabilistic analysis of network flow algorithms.
Mathematics of Operations Research. 18(1), 71-97.
(1993). A generalization of binary search.
Proceedings of the Third Workshop on Algorithms and Data Structures (WADS'93). 27-34.
(1993). Mapping the Genome: some combinatorial problems arising in molecular biology.
Proceedings of 25th Annual Symposium on the Theory of Computing. 278-285.
(1993). 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). Efficient PRAM simulation on a distributed memory machine.
Proceedings of the 24th Annual ACM Symposium on the Theory of Computing. 318-326.
(1992). An Introduction to Randomized Algorithms.
Discrete Applied Mathematics. 34,
(1991). The Complexity of Parallel Search.
Proceedings of the 17th Annual ACM Symposium on the Theory of Computing. 225-253.
(1988). An optimal algorithm for on-line bipartite matching.
Proceedings of the 22nd Annual ACM Symposium on Theory of Computing.
(1990). Monte-Carlo approximation algorithms for enumeration problems.
Journal of Algorithms. 10(3), 429-448.
(1989). On parallel evaluation of game trees.
Proceedings of the 1989 ACM Symposium on Parallel Algorithms and Architectures (SPAA '89). 409-420.
(1989). Deferred Data Structuring.
SIAM Journal on Computing. 17(5), 883-902.
(1988). The Complexity of Parallel Search.
Journal of Computer and System Sciences. 36,
(1988). A randomized parallel branch-and-bound procedure.
Proceedings of the 20th Annual ACM Symposium on Theory of Computing. 290-300.
(1988). Efficient randomized pattern-matching algorithms.
IBM Journal of Research and Development. 31(2), 249-260.
(1987). Global wire routing in two-dimensional arrays.
2(1), 113-129.
(1987). Combinatorics, Complexity and Stochastic Algorithms.
Informatie. 28(9), 722-733.
(1986). Combinatorics, Complexity, and Randomness.
Communications of the ACM. 29(2), 98-109.
(1986). The complexity of parallel computation.
Proceedings of the Fourth MIT Conference on Advanced Resarch in VLSI.
(1986). On a Search Problem Related to Branch-and-Bound Procedures.
Proceedings of the 27th Annual Symposium on Foundations of Computer Science. 19-28.
(1986). Monte-Carlo Algorithms for the Planar Multiterminal Network Reliability Problem.
Journal of Complexity. 1,
(1985).