BibTeX records: William Hesse

download as .bib file

@article{DBLP:journals/jcss/HesseAB14,
  author    = {William Hesse and
               Eric Allender and
               David A. Mix Barrington},
  title     = {Corrigendum to "Uniform constant-depth threshold circuits for
               division and iterated multiplication" {[J.} Comput. System Sci.
               65(4) {(2002)} 695-716]},
  journal   = {J. Comput. Syst. Sci.},
  volume    = {80},
  number    = {2},
  pages     = {496--497},
  year      = {2014},
  url       = {https://doi.org/10.1016/j.jcss.2013.09.002},
  doi       = {10.1016/j.jcss.2013.09.002},
  timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/jcss/HesseAB14.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/DattaHK14,
  author    = {Samir Datta and
               William Hesse and
               Raghav Kulkarni},
  editor    = {Javier Esparza and
               Pierre Fraigniaud and
               Thore Husfeldt and
               Elias Koutsoupias},
  title     = {Dynamic Complexity of Directed Reachability and Other Problems},
  booktitle = {Automata, Languages, and Programming - 41st International Colloquium,
               {ICALP} 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part
               {I}},
  series    = {Lecture Notes in Computer Science},
  volume    = {8572},
  pages     = {356--367},
  publisher = {Springer},
  year      = {2014},
  url       = {https://doi.org/10.1007/978-3-662-43948-7\_30},
  doi       = {10.1007/978-3-662-43948-7\_30},
  timestamp = {Tue, 14 May 2019 10:00:44 +0200},
  biburl    = {https://dblp.org/rec/conf/icalp/DattaHK14.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dagstuhl/Hesse06,
  author    = {William Hesse},
  editor    = {Thomas Schwentick and
               Denis Th{\'{e}}rien and
               Heribert Vollmer},
  title     = {Some Algebraic Problems with Connections to Circuit Complexity of
               Dynamic Data Structures},
  booktitle = {Circuits, Logic, and Games, 08.11. - 10.11.2006},
  series    = {Dagstuhl Seminar Proceedings},
  volume    = {06451},
  publisher = {Internationales Begegnungs- und Forschungszentrum fuer Informatik
               (IBFI), Schloss Dagstuhl, Germany},
  year      = {2006},
  url       = {http://drops.dagstuhl.de/opus/volltexte/2007/974},
  timestamp = {Thu, 10 Jun 2021 13:02:03 +0200},
  biburl    = {https://dblp.org/rec/conf/dagstuhl/Hesse06.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Hesse03,
  author    = {William Hesse},
  title     = {The dynamic complexity of transitive closure is in DynTC\({}^{\mbox{0}}\)},
  journal   = {Theor. Comput. Sci.},
  volume    = {296},
  number    = {3},
  pages     = {473--485},
  year      = {2003},
  url       = {https://doi.org/10.1016/S0304-3975(02)00740-5},
  doi       = {10.1016/S0304-3975(02)00740-5},
  timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/tcs/Hesse03.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/Hesse03,
  author    = {William Hesse},
  title     = {Directed graphs requiring large numbers of shortcuts},
  booktitle = {Proceedings of the Fourteenth Annual {ACM-SIAM} Symposium on Discrete
               Algorithms, January 12-14, 2003, Baltimore, Maryland, {USA}},
  pages     = {665--669},
  publisher = {{ACM/SIAM}},
  year      = {2003},
  url       = {http://dl.acm.org/citation.cfm?id=644108.644216},
  timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
  biburl    = {https://dblp.org/rec/conf/soda/Hesse03.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/HesseAB02,
  author    = {William Hesse and
               Eric Allender and
               David A. Mix Barrington},
  title     = {Uniform constant-depth threshold circuits for division and iterated
               multiplication},
  journal   = {J. Comput. Syst. Sci.},
  volume    = {65},
  number    = {4},
  pages     = {695--716},
  year      = {2002},
  url       = {https://doi.org/10.1016/S0022-0000(02)00025-9},
  doi       = {10.1016/S0022-0000(02)00025-9},
  timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/jcss/HesseAB02.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cav/DamsHH02,
  author    = {Dennis Dams and
               William Hesse and
               Gerard J. Holzmann},
  editor    = {Ed Brinksma and
               Kim Guldstrand Larsen},
  title     = {Abstracting {C} with abC},
  booktitle = {Computer Aided Verification, 14th International Conference, {CAV}
               2002,Copenhagen, Denmark, July 27-31, 2002, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {2404},
  pages     = {515--520},
  publisher = {Springer},
  year      = {2002},
  url       = {https://doi.org/10.1007/3-540-45657-0\_43},
  doi       = {10.1007/3-540-45657-0\_43},
  timestamp = {Tue, 14 May 2019 10:00:43 +0200},
  biburl    = {https://dblp.org/rec/conf/cav/DamsHH02.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lics/HesseI02,
  author    = {William Hesse and
               Neil Immerman},
  title     = {Complete Problems for Dynamic Complexity Classes},
  booktitle = {17th {IEEE} Symposium on Logic in Computer Science {(LICS} 2002),
               22-25 July 2002, Copenhagen, Denmark, Proceedings},
  pages     = {313},
  publisher = {{IEEE} Computer Society},
  year      = {2002},
  url       = {https://doi.org/10.1109/LICS.2002.1029839},
  doi       = {10.1109/LICS.2002.1029839},
  timestamp = {Wed, 16 Oct 2019 14:14:54 +0200},
  biburl    = {https://dblp.org/rec/conf/lics/HesseI02.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/AllenderBH01,
  author    = {Eric Allender and
               David A. Mix Barrington and
               William Hesse},
  title     = {Uniform Circuits for Division: Consequences and Problems},
  booktitle = {Proceedings of the 16th Annual {IEEE} Conference on Computational
               Complexity, Chicago, Illinois, USA, June 18-21, 2001},
  pages     = {150--159},
  publisher = {{IEEE} Computer Society},
  year      = {2001},
  url       = {https://doi.org/10.1109/CCC.2001.933882},
  doi       = {10.1109/CCC.2001.933882},
  timestamp = {Tue, 21 Jul 2020 19:04:52 +0200},
  biburl    = {https://dblp.org/rec/conf/coco/AllenderBH01.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/Hesse01,
  author    = {William Hesse},
  editor    = {Fernando Orejas and
               Paul G. Spirakis and
               Jan van Leeuwen},
  title     = {Division Is in Uniform TC\({}^{\mbox{0}}\)},
  booktitle = {Automata, Languages and Programming, 28th International Colloquium,
               {ICALP} 2001, Crete, Greece, July 8-12, 2001, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {2076},
  pages     = {104--114},
  publisher = {Springer},
  year      = {2001},
  url       = {https://doi.org/10.1007/3-540-48224-5\_9},
  doi       = {10.1007/3-540-48224-5\_9},
  timestamp = {Tue, 14 May 2019 10:00:44 +0200},
  biburl    = {https://dblp.org/rec/conf/icalp/Hesse01.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icdt/Hesse01,
  author    = {William Hesse},
  editor    = {Jan Van den Bussche and
               Victor Vianu},
  title     = {The Dynamic Complexity of Transitive Closure Is In DynTC\({}^{\mbox{0}}\)},
  booktitle = {Database Theory - {ICDT} 2001, 8th International Conference, London,
               UK, January 4-6, 2001, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {1973},
  pages     = {234--247},
  publisher = {Springer},
  year      = {2001},
  url       = {https://doi.org/10.1007/3-540-44503-X\_16},
  doi       = {10.1007/3-540-44503-X\_16},
  timestamp = {Tue, 14 May 2019 10:00:54 +0200},
  biburl    = {https://dblp.org/rec/conf/icdt/Hesse01.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR01-033,
  author    = {Eric Allender and
               David A. Mix Barrington and
               William Hesse},
  title     = {Uniform Circuits for Division: Consequences and Problems},
  journal   = {Electron. Colloquium Comput. Complex.},
  volume    = {8},
  number    = {33},
  year      = {2001},
  url       = {http://eccc.hpi-web.de/eccc-reports/2001/TR01-033/index.html},
  timestamp = {Tue, 08 Sep 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/eccc/ECCC-TR01-033.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of Schloss Dagstuhl - Leibniz Center for Informatics