Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Harald Hempel
@article{DBLP:journals/tcs/HempelK12,
author = {Harald Hempel and
Michael Kr{\"{u}}ger},
title = {Inverse Hamiltonian Cycle and inverse 3Dimensional Matching are coNP-complete},
journal = {Theor. Comput. Sci.},
volume = {426},
pages = {49--65},
year = {2012},
url = {https://doi.org/10.1016/j.tcs.2011.08.020},
doi = {10.1016/J.TCS.2011.08.020},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/HempelK12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/HempelK09,
author = {Harald Hempel and
Madlen Kimmritz},
title = {Aspects of Persistent Computations},
journal = {Int. J. Found. Comput. Sci.},
volume = {20},
number = {4},
pages = {701--715},
year = {2009},
url = {https://doi.org/10.1142/S0129054109006826},
doi = {10.1142/S0129054109006826},
timestamp = {Wed, 25 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/HempelK09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lata/BergH09,
author = {Tobias Berg and
Harald Hempel},
editor = {Adrian{-}Horia Dediu and
Armand{-}Mihai Ionescu and
Carlos Mart{\'{\i}}n{-}Vide},
title = {Reoptimization of Traveling Salesperson Problems: Changing Single
Edge-Weights},
booktitle = {Language and Automata Theory and Applications, Third International
Conference, {LATA} 2009, Tarragona, Spain, April 2-8, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5457},
pages = {141--151},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-00982-2\_12},
doi = {10.1007/978-3-642-00982-2\_12},
timestamp = {Tue, 14 May 2019 10:00:41 +0200},
biburl = {https://dblp.org/rec/conf/lata/BergH09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/KrugerH08,
author = {Michael Kr{\"{u}}ger and
Harald Hempel},
editor = {Xiaodong Hu and
Jie Wang},
title = {Approximating Alternative Solutions},
booktitle = {Computing and Combinatorics, 14th Annual International Conference,
{COCOON} 2008, Dalian, China, June 27-29, 2008, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5092},
pages = {204--214},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-69733-6\_21},
doi = {10.1007/978-3-540-69733-6\_21},
timestamp = {Tue, 10 Dec 2019 14:59:33 +0100},
biburl = {https://dblp.org/rec/conf/cocoon/KrugerH08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ifipTCS/BergH08,
author = {Tobias Berg and
Harald Hempel},
editor = {Giorgio Ausiello and
Juhani Karhum{\"{a}}ki and
Giancarlo Mauri and
C.{-}H. Luke Ong},
title = {Inverse Problems Have Inverse Complexity},
booktitle = {Fifth {IFIP} International Conference On Theoretical Computer Science
- {TCS} 2008, {IFIP} 20th World Computer Congress, {TC} 1, Foundations
of Computer Science, September 7-10, 2008, Milano, Italy},
series = {{IFIP}},
volume = {273},
pages = {73--86},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-0-387-09680-3\_5},
doi = {10.1007/978-0-387-09680-3\_5},
timestamp = {Fri, 27 Sep 2019 10:35:17 +0200},
biburl = {https://dblp.org/rec/conf/ifipTCS/BergH08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wia/HempelK08,
author = {Harald Hempel and
Madlen Kimmritz},
editor = {Oscar H. Ibarra and
Bala Ravikumar},
title = {Persistent Computations of Turing Machines},
booktitle = {Implementation and Applications of Automata, 13th International Conference,
{CIAA} 2008, San Francisco, California, USA, July 21-24, 2008. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5148},
pages = {171--180},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-70844-5\_18},
doi = {10.1007/978-3-540-70844-5\_18},
timestamp = {Wed, 25 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wia/HempelK08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jucs/Hempel06,
author = {Harald Hempel},
title = {Randomized Algorithms and Complexity Theory},
journal = {J. Univers. Comput. Sci.},
volume = {12},
number = {6},
pages = {746--761},
year = {2006},
url = {https://doi.org/10.3217/jucs-012-06-0746},
doi = {10.3217/JUCS-012-06-0746},
timestamp = {Thu, 07 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jucs/Hempel06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/KrugerH06,
author = {Michael Kr{\"{u}}ger and
Harald Hempel},
editor = {Tetsuo Asano},
title = {Inverse {HAMILTONIAN} {CYCLE} and Inverse 3-D {MATCHING} Are coNP-Complete},
booktitle = {Algorithms and Computation, 17th International Symposium, {ISAAC}
2006, Kolkata, India, December 18-20, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4288},
pages = {243--252},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11940128\_26},
doi = {10.1007/11940128\_26},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/isaac/KrugerH06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/HemaspaandraHH05,
author = {Edith Hemaspaandra and
Lane A. Hemaspaandra and
Harald Hempel},
title = {Extending Downward Collapse from 1-versus-2 Queries to m-versus-m
+ 1 Queries},
journal = {{SIAM} J. Comput.},
volume = {34},
number = {6},
pages = {1352--1369},
year = {2005},
url = {https://doi.org/10.1137/S0097539701391002},
doi = {10.1137/S0097539701391002},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/HemaspaandraHH05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/HemaspaandraHH05,
author = {Edith Hemaspaandra and
Lane A. Hemaspaandra and
Harald Hempel},
title = {All superlinear inverse schemes are coNP-hard},
journal = {Theor. Comput. Sci.},
volume = {345},
number = {2-3},
pages = {345--358},
year = {2005},
url = {https://doi.org/10.1016/j.tcs.2005.07.015},
doi = {10.1016/J.TCS.2005.07.015},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/HemaspaandraHH05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-cs-0501022,
author = {Lane A. Hemaspaandra and
Harald Hempel and
Arfst Nickelsen},
title = {Algebraic Properties for Selector Functions},
journal = {CoRR},
volume = {abs/cs/0501022},
year = {2005},
url = {http://arxiv.org/abs/cs/0501022},
eprinttype = {arXiv},
eprint = {cs/0501022},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-cs-0501022.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/HemaspaandraHN04,
author = {Lane A. Hemaspaandra and
Harald Hempel and
Arfst Nickelsen},
title = {Algebraic Properties for Selector Functions},
journal = {{SIAM} J. Comput.},
volume = {33},
number = {6},
pages = {1309--1337},
year = {2004},
url = {https://doi.org/10.1137/S0097539703427550},
doi = {10.1137/S0097539703427550},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/HemaspaandraHN04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/HemaspaandraHH04,
author = {Edith Hemaspaandra and
Lane A. Hemaspaandra and
Harald Hempel},
editor = {Jir{\'{\i}} Fiala and
V{\'{a}}clav Koubek and
Jan Kratochv{\'{\i}}l},
title = {All Superlinear Inverse Schemes Are coNP-Hard},
booktitle = {Mathematical Foundations of Computer Science 2004, 29th International
Symposium, {MFCS} 2004, Prague, Czech Republic, August 22-27, 2004,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3153},
pages = {368--379},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-28629-5\_27},
doi = {10.1007/978-3-540-28629-5\_27},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/HemaspaandraHH04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/cs-CC-0410023,
author = {Edith Hemaspaandra and
Lane A. Hemaspaandra and
Harald Hempel},
title = {All Superlinear Inverse Schemes are coNP-Hard},
journal = {CoRR},
volume = {cs.CC/0410023},
year = {2004},
url = {http://arxiv.org/abs/cs.CC/0410023},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/cs-CC-0410023.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/HemaspaandraH03,
author = {Lane A. Hemaspaandra and
Harald Hempel},
title = {P-immune sets with holes lack self-reducibility properties},
journal = {Theor. Comput. Sci.},
volume = {302},
number = {1-3},
pages = {457--466},
year = {2003},
url = {https://doi.org/10.1016/S0304-3975(02)00576-5},
doi = {10.1016/S0304-3975(02)00576-5},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/HemaspaandraH03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dmtcs/GrosseH03,
author = {Andr{\'{e}} Gro{\ss}e and
Harald Hempel},
editor = {Cristian Calude and
Michael J. Dinneen and
Vincent Vajnovszki},
title = {On Functions and Relations},
booktitle = {Discrete Mathematics and Theoretical Computer Science, 4th International
Conference, {DMTCS} 2003, Dijon, France, July 7-12, 2003. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2731},
pages = {181--192},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/3-540-45066-1\_14},
doi = {10.1007/3-540-45066-1\_14},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/dmtcs/GrosseH03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/HempelK02,
author = {Harald Hempel and
Dieter Kratsch},
title = {On claw-free asteroidal triple-free graphs},
journal = {Discret. Appl. Math.},
volume = {121},
number = {1-3},
pages = {155--180},
year = {2002},
url = {https://doi.org/10.1016/S0166-218X(01)00208-6},
doi = {10.1016/S0166-218X(01)00208-6},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/HempelK02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/BeigelHHV02,
author = {Richard Beigel and
Lane A. Hemaspaandra and
Harald Hempel and
J{\"{o}}rg Vogel},
title = {Optimal Series-Parallel Trade-offs for Reducing a Function to Its
Own Graph},
journal = {Inf. Comput.},
volume = {173},
number = {2},
pages = {123--131},
year = {2002},
url = {https://doi.org/10.1006/inco.2001.3072},
doi = {10.1006/INCO.2001.3072},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/BeigelHHV02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/HemaspaandraHN01,
author = {Lane A. Hemaspaandra and
Harald Hempel and
Arfst Nickelsen},
editor = {Jie Wang},
title = {Algebraic Properties for P-Selectivity},
booktitle = {Computing and Combinatorics, 7th Annual International Conference,
{COCOON} 2001, Guilin, China, August 20-23, 2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2108},
pages = {49--58},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-44679-6\_6},
doi = {10.1007/3-540-44679-6\_6},
timestamp = {Mon, 03 Aug 2020 14:08:01 +0200},
biburl = {https://dblp.org/rec/conf/cocoon/HemaspaandraHN01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dmtcs/HemaspaandraH01,
author = {Lane A. Hemaspaandra and
Harald Hempel},
editor = {Cristian S. Calude and
Michael J. Dinneen and
Silviu Sburlan},
title = {P-Immune Sets with Holes Lack Self-Reducibility Properties},
booktitle = {Combinatorics, Computability and Logic, Proceedings of the Third International
Conference on Combinatorics, Computability and Logic, {DMTCS} 20Ol,
Constanta, Romania},
series = {Discrete mathematics and theoretical computer science},
pages = {115--124},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/978-1-4471-0717-0\_10},
doi = {10.1007/978-1-4471-0717-0\_10},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/dmtcs/HemaspaandraH01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/cs-CC-0102024,
author = {Lane A. Hemaspaandra and
Harald Hempel},
title = {P-Immune Sets with Holes Lack Self-Reducibility Properties},
journal = {CoRR},
volume = {cs.CC/0102024},
year = {2001},
url = {https://arxiv.org/abs/cs/0102024},
timestamp = {Fri, 10 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/cs-CC-0102024.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/cs-CC-0106037,
author = {Edith Hemaspaandra and
Lane A. Hemaspaandra and
Harald Hempel},
title = {Using the No-Search Easy-Hard Technique for Downward Collapse},
journal = {CoRR},
volume = {cs.CC/0106037},
year = {2001},
url = {https://arxiv.org/abs/cs/0106037},
timestamp = {Fri, 10 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/cs-CC-0106037.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/HempelW00,
author = {Harald Hempel and
Gerd Wechsung},
title = {The Operators min and max on the Polynomial Hierarchy},
journal = {Int. J. Found. Comput. Sci.},
volume = {11},
number = {2},
pages = {315--342},
year = {2000},
url = {https://doi.org/10.1142/S0129054100000181},
doi = {10.1142/S0129054100000181},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/HempelW00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/HemaspaandraHW99,
author = {Lane A. Hemaspaandra and
Harald Hempel and
Gerd Wechsung},
title = {Self-Specifying Machines},
journal = {Int. J. Found. Comput. Sci.},
volume = {10},
number = {3},
pages = {263--276},
year = {1999},
url = {https://doi.org/10.1142/S0129054199000198},
doi = {10.1142/S0129054199000198},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/HemaspaandraHW99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/HemaspaandraHH99,
author = {Edith Hemaspaandra and
Lane A. Hemaspaandra and
Harald Hempel},
editor = {Christoph Meinel and
Sophie Tison},
title = {Extending Downward Collapse from 1-versus-2 Queries to j-versus-j+1
Queries},
booktitle = {{STACS} 99, 16th Annual Symposium on Theoretical Aspects of Computer
Science, Trier, Germany, March 4-6, 1999, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1563},
pages = {269--280},
publisher = {Springer},
year = {1999},
url = {https://doi.org/10.1007/3-540-49116-3\_25},
doi = {10.1007/3-540-49116-3\_25},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/HemaspaandraHH99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/HempelK99,
author = {Harald Hempel and
Dieter Kratsch},
editor = {Peter Widmayer and
Gabriele Neyer and
Stephan J. Eidenbenz},
title = {On Claw-Free Asteroidal Triple-Free Graphs},
booktitle = {Graph-Theoretic Concepts in Computer Science, 25th International Workshop,
{WG} '99, Ascona, Switzerland, June 17-19, 1999, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1665},
pages = {377--390},
publisher = {Springer},
year = {1999},
url = {https://doi.org/10.1007/3-540-46784-X\_35},
doi = {10.1007/3-540-46784-X\_35},
timestamp = {Wed, 11 Sep 2019 13:15:53 +0200},
biburl = {https://dblp.org/rec/conf/wg/HempelK99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/cs-CC-9909020,
author = {Lane A. Hemaspaandra and
Harald Hempel and
Gerd Wechsung},
title = {Query Order},
journal = {CoRR},
volume = {cs.CC/9909020},
year = {1999},
url = {https://arxiv.org/abs/cs/9909020},
timestamp = {Fri, 10 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/cs-CC-9909020.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/cs-CC-9910002,
author = {Edith Hemaspaandra and
Lane A. Hemaspaandra and
Harald Hempel},
title = {What's Up with Downward Collapse: Using the Easy-Hard Technique to
Link Boolean and Polynomial Hierarchy Collapses},
journal = {CoRR},
volume = {cs.CC/9910002},
year = {1999},
url = {https://arxiv.org/abs/cs/9910002},
timestamp = {Fri, 10 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/cs-CC-9910002.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/cs-CC-9910003,
author = {Edith Hemaspaandra and
Lane A. Hemaspaandra and
Harald Hempel},
title = {R\({}_{\mbox{1-tt}}\)\({}^{\mbox{SN}}\)(NP) Distinguishes Robust Many-One
and Turing Completeness},
journal = {CoRR},
volume = {cs.CC/9910003},
year = {1999},
url = {https://arxiv.org/abs/cs/9910003},
timestamp = {Fri, 10 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/cs-CC-9910003.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/cs-CC-9910004,
author = {Edith Hemaspaandra and
Lane A. Hemaspaandra and
Harald Hempel},
title = {An Introduction to Query Order},
journal = {CoRR},
volume = {cs.CC/9910004},
year = {1999},
url = {https://arxiv.org/abs/cs/9910004},
timestamp = {Fri, 10 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/cs-CC-9910004.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/cs-CC-9910005,
author = {Edith Hemaspaandra and
Lane A. Hemaspaandra and
Harald Hempel},
title = {Query Order and the Polynomial Hierarchy},
journal = {CoRR},
volume = {cs.CC/9910005},
year = {1999},
url = {https://arxiv.org/abs/cs/9910005},
timestamp = {Fri, 10 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/cs-CC-9910005.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/cs-CC-9910006,
author = {Lane A. Hemaspaandra and
Harald Hempel and
Gerd Wechsung},
title = {Self-Specifying Machines},
journal = {CoRR},
volume = {cs.CC/9910006},
year = {1999},
url = {https://arxiv.org/abs/cs/9910006},
timestamp = {Fri, 10 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/cs-CC-9910006.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/cs-CC-9910007,
author = {Edith Hemaspaandra and
Lane A. Hemaspaandra and
Harald Hempel},
title = {A Downward Collapse within the Polynomial Hierarchy},
journal = {CoRR},
volume = {cs.CC/9910007},
year = {1999},
url = {https://arxiv.org/abs/cs/9910007},
timestamp = {Fri, 10 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/cs-CC-9910007.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/cs-CC-9910008,
author = {Edith Hemaspaandra and
Lane A. Hemaspaandra and
Harald Hempel},
title = {Translating Equality Downwards},
journal = {CoRR},
volume = {cs.CC/9910008},
year = {1999},
url = {https://arxiv.org/abs/cs/9910008},
timestamp = {Fri, 10 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/cs-CC-9910008.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@phdthesis{DBLP:books/daglib/0098213,
author = {Harald Hempel},
title = {Boolean hierarchies - on collapse properties and query order},
school = {University of Jena, Germany},
year = {1998},
url = {https://d-nb.info/955357306},
timestamp = {Sat, 17 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/books/daglib/0098213.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jucs/HemaspaandraHH98,
author = {Edith Hemaspaandra and
Lane A. Hemaspaandra and
Harald Hempel},
title = {Query Order and the Polynomial Hierarchy},
journal = {J. Univers. Comput. Sci.},
volume = {4},
number = {6},
pages = {574--588},
year = {1998},
url = {https://doi.org/10.3217/jucs-004-06-0574},
doi = {10.3217/JUCS-004-06-0574},
timestamp = {Thu, 07 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jucs/HemaspaandraHH98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/HemaspaandraHH98,
author = {Edith Hemaspaandra and
Lane A. Hemaspaandra and
Harald Hempel},
title = {R\({}^{\mbox{\emph{S N}}}\)\({}_{\mbox{1-tt}}\) {(NP)} Distinguishes
Robust Many-One and Turing Completeness},
journal = {Theory Comput. Syst.},
volume = {31},
number = {3},
pages = {307--325},
year = {1998},
url = {https://doi.org/10.1007/s002240000090},
doi = {10.1007/S002240000090},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/HemaspaandraHH98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/HemaspaandraHH98,
author = {Edith Hemaspaandra and
Lane A. Hemaspaandra and
Harald Hempel},
title = {A Downward Collapse within the Polynomial Hierarchy},
journal = {{SIAM} J. Comput.},
volume = {28},
number = {2},
pages = {383--393},
year = {1998},
url = {https://doi.org/10.1137/S0097539796306474},
doi = {10.1137/S0097539796306474},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/HemaspaandraHH98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/HemaspaandraHW98,
author = {Lane A. Hemaspaandra and
Harald Hempel and
Gerd Wechsung},
title = {Query Order},
journal = {{SIAM} J. Comput.},
volume = {28},
number = {2},
pages = {637--651},
year = {1998},
url = {https://doi.org/10.1137/S0097539796297632},
doi = {10.1137/S0097539796297632},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/HemaspaandraHW98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/sigact/HemaspaandraHH98,
author = {Edith Hemaspaandra and
Lane A. Hemaspaandra and
Harald Hempel},
title = {What's up with downward collapse: using the easy-hard technique to
link Boolean and polynomial hierarchy collapses},
journal = {{SIGACT} News},
volume = {29},
number = {3},
pages = {10--22},
year = {1998},
url = {https://doi.org/10.1145/300307.300308},
doi = {10.1145/300307.300308},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/sigact/HemaspaandraHH98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/cs-CC-9808002,
author = {Edith Hemaspaandra and
Lane A. Hemaspaandra and
Harald Hempel},
title = {Downward Collapse from a Weaker Hypothesis},
journal = {CoRR},
volume = {cs.CC/9808002},
year = {1998},
url = {https://arxiv.org/abs/cs/9808002},
timestamp = {Fri, 10 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/cs-CC-9808002.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eatcs/HemaspaandraHH97,
author = {Edith Hemaspaandra and
Lane A. Hemaspaandra and
Harald Hempel},
title = {An Introduction to Query Order},
journal = {Bull. {EATCS}},
volume = {63},
year = {1997},
timestamp = {Thu, 18 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eatcs/HemaspaandraHH97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/HemaspaandraHH97,
author = {Edith Hemaspaandra and
Lane A. Hemaspaandra and
Harald Hempel},
editor = {Gian Carlo Bongiovanni and
Daniel P. Bovet and
Giuseppe Di Battista},
title = {R\({}^{\mbox{SN}}\)\({}_{\mbox{1-tt}}\)(NP) Distinguishes Robust Many-One
and Turing Completeness},
booktitle = {Algorithms and Complexity, Third Italian Conference, {CIAC} '97, Rome,
Italy, March 12-14, 1997, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1203},
pages = {49--60},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/3-540-62592-5\_60},
doi = {10.1007/3-540-62592-5\_60},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/HemaspaandraHH97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fct/HemaspaandraHH97,
author = {Edith Hemaspaandra and
Lane A. Hemaspaandra and
Harald Hempel},
editor = {Bogdan S. Chlebus and
Ludwik Czaja},
title = {Query Order in the Polynomial Hierarchy},
booktitle = {Fundamentals of Computation Theory, 11th International Symposium,
{FCT} '97, Krak{\'{o}}w, Poland, September 1-3, 1997, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1279},
pages = {222--232},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/BFb0036186},
doi = {10.1007/BFB0036186},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fct/HemaspaandraHH97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/HempelW97,
author = {Harald Hempel and
Gerd Wechsung},
editor = {R{\"{u}}diger Reischuk and
Michel Morvan},
title = {The Operators min and max on the Polynomial Hierarchy},
booktitle = {{STACS} 97, 14th Annual Symposium on Theoretical Aspects of Computer
Science, L{\"{u}}beck, Germany, February 27 - March 1, 1997,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1200},
pages = {93--104},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/BFb0023451},
doi = {10.1007/BFB0023451},
timestamp = {Tue, 14 May 2019 10:00:48 +0200},
biburl = {https://dblp.org/rec/conf/stacs/HempelW97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/HemaspaandraHH97,
author = {Edith Hemaspaandra and
Lane A. Hemaspaandra and
Harald Hempel},
editor = {R{\"{u}}diger Reischuk and
Michel Morvan},
title = {A Downward Translation in the Polynomial Hierarchy},
booktitle = {{STACS} 97, 14th Annual Symposium on Theoretical Aspects of Computer
Science, L{\"{u}}beck, Germany, February 27 - March 1, 1997,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1200},
pages = {319--328},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/BFb0023469},
doi = {10.1007/BFB0023469},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/HemaspaandraHH97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR97-025,
author = {Harald Hempel and
Gerd Wechsung},
title = {The Operators min and max on the Polynomial Hierarchy},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR97-025}},
year = {1997},
url = {https://eccc.weizmann.ac.il/eccc-reports/1997/TR97-025/index.html},
eprinttype = {ECCC},
eprint = {TR97-025},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR97-025.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
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.
last updated on 2024-04-21 17:03 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:
