Publications
On parallel evaluation of game trees.
Proceedings of the 1989 ACM Symposium on Parallel Algorithms and Architectures (SPAA '89). 409-420.
(1989). Noisy Binary Search.
Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA 2007). 881-890.
(2007).
(2012). Parametric Shortest Path Algorithms with an Application to Cyclic Staffing.
Discrete Applied Mathematics (Netherlands). 3(1), 37-45.
(1981). Combinatorics, Complexity and Stochastic Algorithms.
Informatie. 28(9), 722-733.
(1986).
(2005).
(2001). Spurring Adoption of DHTs with OpenHash, a Public DHT Service.
Proceedings of the Third International Workshop on Peer-to-Peer Systems.
(2004).
(1998).
(2003). The complexity of parallel computation.
Proceedings of the 23rd Annual Allerton Conference on Communication, Control, and Computing. 1.
(1985).
(1975). Global Wire Routing in Two-Dimensional Arrays.
Proceedings of the 24th Annual Symposium on Foundations of Computer Science. 453-459.
(1983). Average case analysis of a heuristic for the assignment problem.
Mathematics of Operations Research. 19(3), 513-522.
(1994).
(2012). Probabilistic Behavior of a Naive Coloring Algorithm on Random Graphs.
Bulletin of the Operations Research Society of America. 23,
(1975). Monte-Carlo approximation algorithms for enumeration problems.
Journal of Algorithms. 10(3), 429-448.
(1989).
(1991).
(2004).
(1992). Mapping the Genome: some combinatorial problems arising in molecular biology.
Proceedings of 25th Annual Symposium on the Theory of Computing. 278-285.
(1993).
(2006). Probabilistic Analysis of Graph-theoretic Algorithms.
Proceedings of the Computer Science and Statistics 12th Annual Symposium on the Interface.
(1979). Algorithms for Optical Mapping.
Proceedings of the Second Annual International Conference on Computational Molecular Biology. 117-124.
(1998). A fast parallel algorithm for the maximal independent set problem.
Journal of the Association for Computing Machinery. 32(4), 762-773.
(1985).