William Hesse

12 papers A* 4A 2Journal 4Unranked 2
YearRankTypeTitle / Venue / Authors
2014 J jnl
Corrigendum to "Uniform constant-depth threshold circuits for division and iterated multiplication" [J. Comput. System Sci. 65(4) (2002) 695-716].
J. Comput. Syst. Sci.
William Hesse, Eric Allender, David A. Mix Barrington
2014 — conf
Dynamic Complexity of Directed Reachability and Other Problems.
ICALP (1)
Samir Datta, William Hesse, Raghav Kulkarni
2006 — conf
Some Algebraic Problems with Connections to Circuit Complexity of Dynamic Data Structures.
Circuits, Logic, and Games
William Hesse
2003 A* conf
Directed graphs requiring large numbers of shortcuts.
SODA
William Hesse
2003 J jnl
The dynamic complexity of transitive closure is in DynTC
Theor. Comput. Sci.
William Hesse
2002 A* conf
Abstracting C with abC.
CAV
Dennis Dams, William Hesse, Gerard J. Holzmann
2002 A* conf
Complete Problems for Dynamic Complexity Classes.
LICS
William Hesse, Neil Immerman
2002 J jnl
Uniform constant-depth threshold circuits for division and iterated multiplication.
J. Comput. Syst. Sci.
William Hesse, Eric Allender, David A. Mix Barrington
2001 A* conf
Division Is in Uniform TC
ICALP
William Hesse
2001 A conf
The Dynamic Complexity of Transitive Closure Is In DynTC
ICDT
William Hesse
2001 J jnl
Uniform Circuits for Division: Consequences and Problems
Electron. Colloquium Comput. Complex.
Eric Allender, David A. Mix Barrington, William Hesse
2001 A conf
Uniform Circuits for Division: Consequences and Problems.
CCC
Eric Allender, David A. Mix Barrington, William Hesse