William Hesse
Assistant Professor
Department of Mathematics and Computer Science
Clarkson University
Potsdam, NY, 13699
Email: whesse@clarkson.edu
Office: Rm. 383 Science Center
Phone:
OFFICE HOURS (Spring 2008)
- M: TBD
- T: TBD
- W: TBD
- R: TBD
- F: TBD
Teaching
Spring 2008
Fall 2007
- CS 443/543: Parallel Programming
- CS 453/553: Mainframe Computing
Spring 2007
Fall 2006
- CS 643: Parallel Computation
- CS 446/546: Computational Geometry
Research:
PhD dissertation:
Dynamic Computational Complexity (abstract)
(Postscript)(PDF)
Not yet published:
Publications:
- The dynamic complexity of transitive
closure is in DynTC0. William Hesse. Theoretical
Computer Science, Volume 296, Issue 3, March 2003, pp. 473 - 485.
Preliminary version appeared in Proceedings of the Eighth
International Conference on Database Theory (ICDT 2001).
- Directed Graphs Requiring Large
Numbers of Shortcuts William Hesse. In Proceedings of the
Symposium on Discrete Algorithms (SODA 2003).
- Uniform constant-depth threshold circuits
for division and iterated multiplication William Hesse,
Eric Allender, and David A. Mix Barrington. Journal of Computer and
System Sciences Volume 65, Issue 4, December 2002, Pages 695-716.
Preliminary versions of this work appeared in ICALP 2001 and CCC 2001.
-
Complete Problems for Dynamic Complexity
Classes William Hesse, Neil Immerman. In Proceedings of
Logic in Computer Science 2002 (LICS 2002).
- Division is in Uniform
TC0.William Hesse. In Proceedings of the Twenty
- Eighth International Colloquium on Automata, Languages and
Programming (ICALP 2001).
- Uniform Circuits for Division:
Consequences and Problems. Eric Allender, David A. Mix
Barrington, William Hesse. In Proceedings of the Sixteenth Annual
IEEE Conference on Computational Complexity (CCC 2001).
Research Interests:
- Algorithms for program verification and analysis.
- Development of abstract models for dynamic complexity, especially
low-level and highly parallel dynamic complexity classes.
- Highly parallel algorithms for dynamic problems.