William Hesse

According to our database, William Hesse authored at least 10 papers between 2001 and 2014.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2014

Corrigendum to "Uniform constant-depth threshold circuits for division and iterated multiplication" [J. Comput. System Sci. 65(4) (2002) 695-716].

William Hesse, Eric Allender, David A. Mix Barrington

J. Comput. Syst. Sci., 2014

Dynamic Complexity of Directed Reachability and Other Problems.

Samir Datta, William Hesse, Raghav Kulkarni

Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

2006

Some Algebraic Problems with Connections to Circuit Complexity of Dynamic Data Structures.

William Hesse

Proceedings of the Circuits, Logic, and Games, 08.11. - 10.11.2006, 2006

2003

The dynamic complexity of transitive closure is in DynTC⁰.

William Hesse

Theor. Comput. Sci., 2003

Directed graphs requiring large numbers of shortcuts.

William Hesse

Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003

2002

Uniform constant-depth threshold circuits for division and iterated multiplication.

William Hesse, Eric Allender, David A. Mix Barrington

J. Comput. Syst. Sci., 2002

Complete Problems for Dynamic Complexity Classes.

William Hesse, Neil Immerman

Proceedings of the 17th IEEE Symposium on Logic in Computer Science (LICS 2002), 2002

Abstracting C with abC.

Dennis Dams, William Hesse, Gerard J. Holzmann

Proceedings of the Computer Aided Verification, 14th International Conference, 2002

2001

Uniform Circuits for Division: Consequences and Problems

Eric Allender, David A. Mix Barrington, William Hesse

Electron. Colloquium Comput. Complex., 2001

Division Is in Uniform TC⁰.

William Hesse

Proceedings of the Automata, Languages and Programming, 28th International Colloquium, 2001