Publications
(1979).
The Complexity of Parallel Search.
Proceedings of the 17th Annual ACM Symposium on the Theory of Computing. 225-253.
(1988).
(1999). Variations on the Theme of "Twenty Questions".
Proceedings of the 1998 IEEE International Symposium on Information Theory. 3.
(1998).
(1975). Efficient PRAM simulation on a distributed memory machine.
Proceedings of the 24th Annual ACM Symposium on the Theory of Computing. 318-326.
(1992). Two Special Cases of the Assignment Problem.
Discrete Mathematics (Netherlands). 13(2), 129-142.
(1975). The bit vector intersection problem.
Proceedings of the 36th Annual Symposium on Foundations of Computer Science (FOCS'95). 621-630.
(1995). An Introduction to Randomized Algorithms.
Proceedings of the Capital City Conference on Combinatorics and Theoretical Computer Science. 165-201.
(1991).
(1980). Optimal Flow Distribution Among Multiple Channels with Unknown Capacities.
Proceedings of the Second Brazilian Symposium of Graphs, Algorithms, and Combinatorics (GRACO 2005). 225-231.
(2005). Efficient randomized pattern-matching algorithms.
IBM Journal of Research and Development. 31(2), 249-260.
(1987). The complexity of parallel computation.
Proceedings of the Fourth MIT Conference on Advanced Resarch in VLSI.
(1986).
(2005). Probabilistic Analysis of Partitioning Algorithms for the Traveling-salesman Problem in the Plane.
Mathematics of Operations Research. 2(3), 209-224.
(1977). Randomized Rumor Spreading.
Proceedings of the IEEE 41st Annual Symposium on Foundations of Computer Science (FOCS 2000). 565-574.
(2000). A Simple Algorithm for Finding Frequent Elements in Streams and Bags.
ACM Transactions on Database Systems. 28(1), 51-55.
(2003). An n5/2 Algorithm for Maximum Matchings in Bipartite Graphs.
SIAM Journal on Computing. 2(4), 225-231.
(1973). A Simple Algorithm for Finding Frequent Elements in Streams and Bags.
ACM Transactions on Database Systems. 28(1), 51-55.
(2003).
(2010). On Linear Characterizations of Combinatorial Optimization Problems.
SIAM Journal on Computing. 11(4), 620-632.
(1982). The Complexity of Parallel Search.
Journal of Computer and System Sciences. 36,
(1988). Probabilistic analysis of network flow algorithms.
Mathematics of Operations Research. 18(1), 71-97.
(1993).
(1990). A Patching Algorithm for the Nonsymmetric Traveling-salesman Problem.
SIAM Journal on Computing. 8(4), 561-573.
(1979).