Publications
On the Complexity of Haplotyping via Perfect Phylogeny.
Proceedings of the Second RECOMB Satellite Workshop on Computational Methods for SNPs and Haplotypes. 35-46.
(2004). The complexity of parallel computation.
Proceedings of the Fourth MIT Conference on Advanced Resarch in VLSI.
(1986). The complexity of parallel computation.
Proceedings of the 23rd Annual Allerton Conference on Communication, Control, and Computing. 1.
(1985). The Complexity of Parallel Search.
Proceedings of the 17th Annual ACM Symposium on the Theory of Computing. 225-253.
(1988). The Complexity of Parallel Search.
Journal of Computer and System Sciences. 36,
(1988).
(1995). The Complexity of Testing Whether a Graph is a Superconcentrator.
13(4-5), 164-167.
(1981).
(1996). On the Complexity of Unsatisfiability Proofs for Random k-CNF Formulas.
Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing. 561-571.
(1998).
(1990).
(2010).
(2009).
(1996).
(1987).
(1996).
(1992). Computation, perception, and mind.
Behavioral and Brain Sciences. 45,
(2022). Computational Auditory Scene Analysis Exploiting Speech-Recognition Knowledge.
Proceedings of the IEEE Workshop on Applications of Signal Processing to Audio and Acoustics. 4.
(1997).
(2005).
(1994).
(1974).
(1975).
(1991).
(1994).
(1991).