 | 2006 |
|---|
| 10 |       | William Hesse:
Some Algebraic Problems with Connections to Circuit Complexity of Dynamic Data Structures.
Circuits, Logic, and Games 2006 |
| 2003 |
|---|
| 9 | | William Hesse:
Directed graphs requiring large numbers of shortcuts.
SODA 2003: 665-669 |
| 8 | | William Hesse:
The dynamic complexity of transitive closure is in DynTC0.
Theor. Comput. Sci. 296(3): 473-485 (2003) |
| 2002 |
|---|
| 7 | | Dennis Dams,
William Hesse,
Gerard J. Holzmann:
Abstracting C with abC.
CAV 2002: 515-520 |
| 6 | | William Hesse,
Neil Immerman:
Complete Problems for Dynamic Complexity Classes.
LICS 2002: 313- |
| 5 | | William Hesse,
Eric Allender,
David A. Mix Barrington:
Uniform constant-depth threshold circuits for division and iterated multiplication.
J. Comput. Syst. Sci. 65(4): 695-716 (2002) |
| 2001 |
|---|
| 4 | | William Hesse:
Division Is in Uniform TC0.
ICALP 2001: 104-114 |
| 3 | | William Hesse:
The Dynamic Complexity of Transitive Closure Is In DynTC0.
ICDT 2001: 234-247 |
| 2 | | Eric Allender,
David A. Mix Barrington,
William Hesse:
Uniform Circuits for Division: Consequences and Problems.
IEEE Conference on Computational Complexity 2001: 150-159 |
| 1 | | Eric Allender,
David A. Mix Barrington,
William Hesse:
Uniform Circuits for Division: Consequences and Problems
Electronic Colloquium on Computational Complexity (ECCC) 8(33): (2001) |
