Eric Bach ProfessorPh.D., University of California, Berkeley, 1984
Computer Sciences Department
University of Wisconsin
1210 W. Dayton St.
Madison, WI 53706-1685
telephone: (608) 262-1204
fax: (608) 262-9777
email: bach at cs.wisc.edu
I am also interested in applying probability theory to the design and analysis of algorithms. For example, if a large number is composite, it can be proved so by a simple test that uses an auxiliary number, called a `witness.' In practice one usually finds a witness by direct search among the small primes. This leads to the following natural question. How large is the least witness, as a function of the number tested? In recent work, we have given an accurate heuristic model, based on probabilistic assumptions, that allows this, and similar questions, to be answered.
DNA models and algorithms for NP-complete problems (with A. Condon, E. Glaser, S. Tanguay), Journal of Computer and System Sciences 57, 172-186, 1998.
Threshold data structures and coding theory (with M. Kiwi) Theoretical Computer Science 235, 3-23, 2000. Special issue dedicated to Manuel Blum.
One-dimensional quantum walks (with A. Ambianis, A. Nayak, A. Vishwanath, and J. Watrous) Proc. 33rd ACM Symposium on Theory of Computing, pp. 37-49, 2001.
On testing for zero polynomials by a set of points with bounded precision (with J.-Y. Cai), Proc. 2001 Conference on Combinatorics and Computing (COCOON), to appear.