Publications
Average case analysis of a heuristic for the assignment problem.
Mathematics of Operations Research. 19(3), 513-522.
(1994). Probabilistic Behavior of a Naive Coloring Algorithm on Random Graphs.
Bulletin of the Operations Research Society of America. 23,
(1975). Monte-Carlo approximation algorithms for enumeration problems.
Journal of Algorithms. 10(3), 429-448.
(1989).
(1991).
(2004).
(1992). Mapping the Genome: some combinatorial problems arising in molecular biology.
Proceedings of 25th Annual Symposium on the Theory of Computing. 278-285.
(1993).
(2006). Probabilistic Analysis of Graph-theoretic Algorithms.
Proceedings of the Computer Science and Statistics 12th Annual Symposium on the Interface.
(1979).
(1974). An optimal algorithm for on-line bipartite matching.
Proceedings of the 22nd Annual ACM Symposium on Theory of Computing.
(1990).
(1989). A fast parallel algorithm for the maximal independent set problem.
Journal of the Association for Computing Machinery. 32(4), 762-773.
(1985). Algorithms for Optical Mapping.
Proceedings of the Second Annual International Conference on Computational Molecular Biology. 117-124.
(1998). Heuristic Algorithms in Computations Molecular Biology.
Journal of Computer and System Sciences. 77(1), 122-128.
(2011). Modeling parallel communication.
Proceedings of the 9th International Parallel Processing Symposium (IPDPS '95). 2.
(1995). Monte-Carlo Algorithms for Enumeration and Reliability Problems.
Proceedings of the 24th Annual Symposium on Foundations of Computer Science. 56-64.
(1983). Global wire routing in two-dimensional arrays.
2(1), 113-129.
(1987). Probabilistic recurrence relations.
Journal of the Association for Computing Machinery. 41(6), 1136-1150.
(1994).
(1991). On Linear Characterizations of Combinatorial Optimization Problems.
Proceedings of the 21st Annual IEEE Symposium on Foundations of Computer Science. 1-9.
(1980). On the Optimality of Huffman Trees.
SIAM Journal on Applied Mathematics. 31(2), 368-378.
(1976).
(2011).
(2000).
(1993).