Publications
Probabilistic Behavior of a Naive Coloring Algorithm on Random Graphs.
Bulletin of the Operations Research Society of America. 23,
(1975).
(1975). A Probabilistic Model for the Survivability of Cells.
Journal of Applied Probability. 42(4), 919-931.
(2005). Probabilistic recurrence relations.
Journal of the Association for Computing Machinery. 41(6), 1136-1150.
(1994).
(1991). Random Walks, Universal Traversal Sequences, and the Complexity of Maze Problems.
Proceedings of the Computer Science and Statistics 12th Annual Symposium on the Interface. 174-176.
(1979). Random Walks, Universal Traversal Sequences, and the Complexity of Maze Problems.
Proceedings of the 20th Annual IEEE Symposium of Foundations of Computer Science. 218-223.
(1979). A Randomization Test for Controlling Population Stratification in Whole-Genome Association Studies.
American Journal of Human Genetics. 81(5), 895-905.
(2007). Randomized parallel algorithms for backtrack search and branch-and-bound computation.
Journal of the Association for Computing Machinery. 40(3), 765-789.
(1993). A randomized parallel branch-and-bound procedure.
Proceedings of the 20th Annual ACM Symposium on Theory of Computing. 290-300.
(1988). Randomized Rumor Spreading.
Proceedings of the IEEE 41st Annual Symposium on Foundations of Computer Science (FOCS 2000). 565-574.
(2000).
(1996). The Rank of Sparse Random Matrices Over Finite Fields.
Random Structures and Algorithms. 10,
(1997).
(1979).
(2012). Reconstructing Chain Functions in Genetic Networks.
Proceedings of the Ninth Pacific Symposium on Biocomputing (PSB'04). 498-509.
(2004).
(2005). The Restriction Scaffold Problem.
Proceedings of the Sixth Annual International Conference on Research in Computational Molecular Biology (RECOMB'02).
(2002). The Restriction Scaffold Problem.
Journal of Computational Biology. 10(3-4), 385-398.
(2003).
(2000).
A Scalable Content-Addressable Network.
Proceedings of ACM SIGCOMM Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications. 161-172.
(2001). A Scalable Content-Addressable Network.
ACM SIGCOMM Computer Communication Review. 31(4), 161-172.
(2001).
(1995). Scheduling parallel communication: the h-relation problem.
Proceedings of the 20th International Mathematical Foundations of Computer Science Symposium, (MFCS '95). 1-20.
(1995). On a Search Problem Related to Branch-and-Bound Procedures.
Proceedings of the 27th Annual Symposium on Foundations of Computer Science. 19-28.
(1986).