Publications
Failure correction techniques for large disk arrays.
Proceedings of the Third International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS-III). 123-132.
(1989). 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).
(1989).
(1989).
(1989).
(1990).
(1990).
An optimal algorithm for on-line bipartite matching.
Proceedings of the 22nd Annual ACM Symposium on Theory of Computing.
(1990).
(1990). On the power of randomization in online algorithms.
Proceedings of the 22nd Annual ACM Symposium on Theory of Computing. 379-386.
(1990). Subtree isomorphism is in random NC.
Discrete Applied Mathematics. 29(1), 35-62.
(1990). Competitive paging algorithms.
Journal of Algorithms. 12(4), 685-699.
(1991).
(1991).
(1991). An Introduction to Randomized Algorithms.
Proceedings of the Capital City Conference on Combinatorics and Theoretical Computer Science. 165-201.
(1991). An Introduction to Randomized Algorithms.
Discrete Applied Mathematics. 34,
(1991).
(1991).
(1991).
(1991). Transitive Compaction in Parallel via Branchings.
Journal of Algorithms. 12(1), 110-125.
(1991).
(1992).
Competitive analysis of financial games.
Proceedings 33rd Annual Symposium on Foundations of Computer Science. 327-333.
(1992). Efficient PRAM simulation on a distributed memory machine.
Proceedings of the 24th Annual ACM Symposium on the Theory of Computing. 318-326.
(1992). 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).