1. Bipartite perfect matching is in quasi-NC;Proceedings of the forty-eighth annual ACM symposium on Theory of Computing;2016-06-19
2. Randomized parallel algorithms;Solving Combinatorial Optimization Problems in Parallel;1996
3. A Case for Randomized Parallel Algorithms;Opportunities and Constraints of Parallel Computing;1989
4. Parallel algorithmic techniques for combinatorial computation;Automata, Languages and Programming;1989
5. Randomization in parallel algorithms and its impact on computational geometry;Lecture Notes in Computer Science;1989