default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDWilliam Hesse
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2014
[j3]William Hesse, Eric Allender
, David A. Mix Barrington:
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. 80(2): 496-497 (2014)- [c7]Samir Datta, William Hesse, Raghav Kulkarni:
Dynamic Complexity of Directed Reachability and Other Problems. ICALP (1) 2014: 356-367
2000 – 2009
- 2006
- [i2]William Hesse:
Some Algebraic Problems with Connections to Circuit Complexity of Dynamic Data Structures. Circuits, Logic, and Games 2006 - 2003
- [j2]William Hesse:
The dynamic complexity of transitive closure is in DynTC0. Theor. Comput. Sci. 296(3): 473-485 (2003) - [c6]William Hesse:
Directed graphs requiring large numbers of shortcuts. SODA 2003: 665-669 - 2002
- [j1]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) - [c5]Dennis Dams, William Hesse, Gerard J. Holzmann:
Abstracting C with abC. CAV 2002: 515-520 - [c4]William Hesse, Neil Immerman:
Complete Problems for Dynamic Complexity Classes. LICS 2002: 313- - 2001
- [c3]Eric Allender, David A. Mix Barrington, William Hesse:
Uniform Circuits for Division: Consequences and Problems. CCC 2001: 150-159 - [c2]William Hesse:
Division Is in Uniform TC0. ICALP 2001: 104-114 - [c1]William Hesse:
The Dynamic Complexity of Transitive Closure Is In DynTC0. ICDT 2001: 234-247 - [i1]Eric Allender, David A. Mix Barrington, William Hesse:
Uniform Circuits for Division: Consequences and Problems. Electron. Colloquium Comput. Complex. TR01 (2001)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:47 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
