Publications
A family of simplex variants solving an m*d linear program in expected number of pivot steps depending on d only.
Mathematics of Operations Research. 11(4), 570-590.
(1986). A fast parallel algorithm for the maximal independent set problem.
Journal of the Association for Computing Machinery. 32(4), 762-773.
(1985). Genome-Wide Association Data Reveal a Global Map of Genetic Interaction Among Protein Complexes.
PLoS Genetics. 5(12),
(2009). George Dantzig's Impact on the Theory of Computation.
Discrete Optimization. 5(2), 174-185.
(2006).
(1998). A graph-theoretic game and its application to the k-server problem.
SIAM Journal on Computing. 24(1), 78-100.
(1995). HAPLOPOOL: Improving Haplotype Frequency Estimation Through DNA Pools and Phylogenetic Modeling.
Bioinformatics. 23(22), 3048-3055.
(2007). Haplotype Inference in Complex Pedigrees.
Journal of Computational Biology. 17(3), 269-280.
(2010). Heuristic Algorithms in Computations Molecular Biology.
Journal of Computer and System Sciences. 77(1), 122-128.
(2011). Identification of Protein Complexes by Comparative Analysis of Yeast and Bacterial Protein Interaction Data.
Journal of Computational Biology. 12(6), 835-846.
(2005). An information entropy approach to the small-lot concept.
IEEE Transactions on Engineering Management. 41(1), 89-92.
(1994). An Introduction to Randomized Algorithms.
Discrete Applied Mathematics. 34,
(1991). On Linear Characterizations of Combinatorial Optimization Problems.
SIAM Journal on Computing. 11(4), 620-632.
(1982). 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). 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). A Monte-Carlo algorithm for estimating the permanent.
SIAM Journal on Computing. 22(2), 284-293.
(1993). Monte-Carlo Algorithms for the Planar Multiterminal Network Reliability Problem.
Journal of Complexity. 1,
(1985). Monte-Carlo approximation algorithms for enumeration problems.
Journal of Algorithms. 10(3), 429-448.
(1989). An n5/2 Algorithm for Maximum Matchings in Bipartite Graphs.
SIAM Journal on Computing. 2(4), 225-231.
(1973). Near-optimal Solutions to a 2-dimensional Placement Problem.
SIAM Journal on Computing. 4(3), 271-286.
(1975).
(2000). An Optimal Algorithm for Monte-Carlo Estimation.
29(5), 1484-1496.
(2000). On the Optimality of Huffman Trees.
SIAM Journal on Applied Mathematics. 31(2), 368-378.
(1976).