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). On the power of randomization in online algorithms.
Proceedings of the 22nd Annual ACM Symposium on Theory of Computing. 379-386.
(1990). On the power of randomization in on-line algorithms.
Algorithmica. 11(1), 2-14.
(1994).
(1990).
(1995). A fast parallel algorithm for the maximal independent set problem.
Journal of the Association for Computing Machinery. 32(4), 762-773.
(1985). The Complexity of Parallel Search.
Journal of Computer and System Sciences. 36,
(1988). The Complexity of Parallel Search.
Proceedings of the 17th Annual ACM Symposium on the Theory of Computing. 225-253.
(1988).