Publications
(1997).
(1990).
(1995).
(1995).
(1995).
(1997).
(1990).
(1997).
(1992).
(1991).
(1996).
(1991).
Bounded branching process and AND/OR tree evaluation.
Random Structures and Algorithms. 7(2), 97-116.
(1995). Streaming Algorithms for Selection and Approximate Sorting.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. 9-20.
(2007). Maximum Matchings in Sparse Random Graphs.
Proceedings of the 22nd IEEE Annual Symposium on Foundations of Computer Science. 364-375.
(1981). George Dantzig's Impact on the Theory of Computation.
Discrete Optimization. 5(2), 174-185.
(2006). Optimization Problems in Congestion Control.
Proceedings of the 41st Annual Symposium on Foundations of Computer Science (FOCS 2000). 66-74.
(2000). Combinatorics, Complexity, and Randomness.
Communications of the ACM. 29(2), 98-109.
(1986). Finite-Length Analysis of LT-codes.
Proceedings of International Symposium on Information Theory (ISIT).
(2004). A Characterization of the Minimum Cycle Mean in a Digraph.
Discrete Mathematics (Netherlands). 23(3), 309-311.
(1978). Load Balancing in Structured P2P Systems.
Proceedings of the Second International Workshop on Peer-to-Peer Systems.
(2003).
(1989). Deferred Data Structuring.
SIAM Journal on Computing. 17(5), 883-902.
(1988). Randomized parallel algorithms for backtrack search and branch-and-bound computation.
Journal of the Association for Computing Machinery. 40(3), 765-789.
(1993).
(1974).