Publications
An Introduction to Randomized Algorithms.
Proceedings of the Capital City Conference on Combinatorics and Theoretical Computer Science. 165-201.
(1991). Large Scale Reconstruction of Haplotypes from Genotype Data.
Proceedings of the Seventh Conference on Research in Computational Biology (RECOMB).
(2003).
(2002). On Linear Characterizations of Combinatorial Optimization Problems.
SIAM Journal on Computing. 11(4), 620-632.
(1982). On Linear Characterizations of Combinatorial Optimization Problems.
Proceedings of the 21st Annual IEEE Symposium on Foundations of Computer Science. 1-9.
(1980). Linked Decomposition of Networks and the Power of Choice in Polya Urns.
Proceedings of ACM-SIAM Symposium on Discrete Algorithms (SODA 2008). 993-1002.
(2008). Load Balancing in Dynamic Structured P2P Systems.
Proceedings of INFOCOMM.
(2004). Load Balancing in Dynamic Structured P2P Systems.
Proceedings of INFOCOMM.
(2004). Load Balancing in Structured P2P Systems.
Proceedings of the Second International Workshop on Peer-to-Peer Systems.
(2003). Load Balancing in Structured P2P Systems.
Proceedings of the Second International Workshop on Peer-to-Peer Systems (IPTPS '03).
(2003). Load Balancing in Structured P2P Systems.
Second International Workshop on Peer-to-Peer Systems.
(2003). LOGOS: A Modular Bayesian Model for de Novo Motif Detection.
Proceedings of IEEE Computer Society Bioinformatic Conference IPTPS.
(2003). LogP: A Practical Model of Parallel Computation.
Communications of the ACM. 39(11), 78-85.
(1996). LogP: towards a realistic model of parallel computation.
SIGPLAN Notices. 28,
(1993). LogP: towards a realistic model of parallel computation.
Proceedings of the Fourth ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming. 1-12.
(1993).
(1998).
Mapping Clones with a Given Ordering or Interleaving.
Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms. 400-409.
(1997). Mapping the Genome: some combinatorial problems arising in molecular biology.
Proceedings of 25th Annual Symposium on the Theory of Computing. 278-285.
(1993). Mathematical Challenges from Genomics and Molecular Biology.
49(5), 544-553.
(2002). Maximum Matchings in Sparse Random Graphs.
Proceedings of the 22nd IEEE Annual Symposium on Foundations of Computer Science. 364-375.
(1981). A Maximun Likelihood Polynomial Time Syndrome Decoder to Correct Linearly Independent Errors.
Proceedings of International Symposium on Information Theory.
(2001).
(1991). A Method for Obtaining Randomized Algorithms with Small Tail Probabilities.
Algorithmica. 16(4-5), 543-547.
(1996). The Minimum-Entropy Set Cover Problem.
Theoretical Computer Science. 348(2), 240-250.
(2005). The Minimum-Entropy Set Cover Problem.
Proceedings of ICALP.
(2004).