Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Klaus Ambos-Spies
@article{DBLP:journals/jcss/Ambos-SpiesMT22,
author = {Klaus Ambos{-}Spies and
Wolfgang Merkle and
Sebastiaan A. Terwijn},
title = {Normalized information distance and the oscillation hierarchy},
journal = {J. Comput. Syst. Sci.},
volume = {124},
pages = {65--76},
year = {2022},
url = {https://doi.org/10.1016/j.jcss.2021.08.006},
doi = {10.1016/J.JCSS.2021.08.006},
timestamp = {Sat, 25 Dec 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/Ambos-SpiesMT22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/Ambos-SpiesDM21,
author = {Klaus Ambos{-}Spies and
Rodney G. Downey and
Martin Monath},
title = {On Supersets of non-low 22{\_}2 Sets},
journal = {J. Symb. Log.},
volume = {86},
number = {3},
pages = {1282--1292},
year = {2021},
url = {https://doi.org/10.1017/jsl.2021.72},
doi = {10.1017/JSL.2021.72},
timestamp = {Thu, 13 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jsyml/Ambos-SpiesDM21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/birthday/Ambos-Spies21,
author = {Klaus Ambos{-}Spies},
editor = {Alexander Raschke and
Elvinia Riccobene and
Klaus{-}Dieter Schewe},
title = {Some Observations on Mitotic Sets},
booktitle = {Logic, Computation and Rigorous Methods - Essays Dedicated to Egon
B{\"{o}}rger on the Occasion of His 75th Birthday},
series = {Lecture Notes in Computer Science},
volume = {12750},
pages = {14--28},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-76020-5\_2},
doi = {10.1007/978-3-030-76020-5\_2},
timestamp = {Sat, 12 Jun 2021 12:58:01 +0200},
biburl = {https://dblp.org/rec/conf/birthday/Ambos-Spies21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/Ambos-SpiesB19,
author = {Klaus Ambos{-}Spies and
Timur Bakibayev},
title = {Weak Completeness Notions for Exponential Time},
journal = {Theory Comput. Syst.},
volume = {63},
number = {6},
pages = {1388--1412},
year = {2019},
url = {https://doi.org/10.1007/s00224-019-09920-4},
doi = {10.1007/S00224-019-09920-4},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/Ambos-SpiesB19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cie/Ambos-SpiesZ19,
author = {Klaus Ambos{-}Spies and
Xizhong Zheng},
editor = {Florin Manea and
Barnaby Martin and
Dani{\"{e}}l Paulusma and
Giuseppe Primiero},
title = {On the Differences and Sums of Strongly Computably Enumerable Real
Numbers},
booktitle = {Computing with Foresight and Industry - 15th Conference on Computability
in Europe, CiE 2019, Durham, UK, July 15-19, 2019, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11558},
pages = {310--322},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-22996-2\_27},
doi = {10.1007/978-3-030-22996-2\_27},
timestamp = {Sun, 25 Oct 2020 22:53:05 +0100},
biburl = {https://dblp.org/rec/conf/cie/Ambos-SpiesZ19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/computability/Ambos-Spies18,
author = {Klaus Ambos{-}Spies},
title = {Automorphism bases for the recursively enumerable degrees},
journal = {Comput.},
volume = {7},
number = {2-3},
pages = {237--258},
year = {2018},
url = {https://doi.org/10.3233/COM-180088},
doi = {10.3233/COM-180088},
timestamp = {Thu, 24 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/computability/Ambos-Spies18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cie/Ambos-Spies18,
author = {Klaus Ambos{-}Spies},
editor = {Florin Manea and
Russell G. Miller and
Dirk Nowotka},
title = {Multiple Permitting and Array Noncomputability},
booktitle = {Sailing Routes in the World of Computation - 14th Conference on Computability
in Europe, CiE 2018, Kiel, Germany, July 30 - August 3, 2018, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10936},
pages = {30--39},
publisher = {Springer},
year = {2018},
url = {https://doi.org/10.1007/978-3-319-94418-0\_3},
doi = {10.1007/978-3-319-94418-0\_3},
timestamp = {Wed, 16 Nov 2022 11:08:36 +0100},
biburl = {https://dblp.org/rec/conf/cie/Ambos-Spies18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/birthday/Ambos-Spies17,
author = {Klaus Ambos{-}Spies},
editor = {Adam R. Day and
Michael R. Fellows and
Noam Greenberg and
Bakhadyr Khoussainov and
Alexander G. Melnikov and
Frances A. Rosamond},
title = {On the Strongly Bounded Turing Degrees of the Computably Enumerable
Sets},
booktitle = {Computability and Complexity - Essays Dedicated to Rodney G. Downey
on the Occasion of His 60th Birthday},
series = {Lecture Notes in Computer Science},
volume = {10010},
pages = {563--598},
publisher = {Springer},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-50062-1\_34},
doi = {10.1007/978-3-319-50062-1\_34},
timestamp = {Sun, 25 Oct 2020 23:08:30 +0100},
biburl = {https://dblp.org/rec/conf/birthday/Ambos-Spies17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1708-03583,
author = {Klaus Ambos{-}Spies and
Wolfgang Merkle and
Sebastiaan A. Terwijn},
title = {Normalized Information Distance and the Oscillation Hierarchy},
journal = {CoRR},
volume = {abs/1708.03583},
year = {2017},
url = {http://arxiv.org/abs/1708.03583},
eprinttype = {arXiv},
eprint = {1708.03583},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1708-03583.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dagstuhl-reports/Ambos-SpiesBDL17,
author = {Klaus Ambos{-}Spies and
Vasco Brattka and
Rodney G. Downey and
Steffen Lempp},
title = {Computability Theory (Dagstuhl Seminar 17081)},
journal = {Dagstuhl Reports},
volume = {7},
number = {2},
pages = {89--101},
year = {2017},
url = {https://doi.org/10.4230/DagRep.7.2.89},
doi = {10.4230/DAGREP.7.2.89},
timestamp = {Wed, 20 Sep 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dagstuhl-reports/Ambos-SpiesBDL17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alt/Ambos-Spies16,
author = {Klaus Ambos{-}Spies},
editor = {Ronald Ortner and
Hans Ulrich Simon and
Sandra Zilles},
title = {Learning Finite Variants of Single Languages from Informant},
booktitle = {Algorithmic Learning Theory - 27th International Conference, {ALT}
2016, Bari, Italy, October 19-21, 2016, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9925},
pages = {163--173},
year = {2016},
url = {https://doi.org/10.1007/978-3-319-46379-7\_11},
doi = {10.1007/978-3-319-46379-7\_11},
timestamp = {Fri, 08 Sep 2023 21:18:15 +0200},
biburl = {https://dblp.org/rec/conf/alt/Ambos-Spies16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:books/daglib/p/Ambos-Spies14,
author = {Klaus Ambos{-}Spies},
editor = {Vasco Brattka and
Hannes Diener and
Dieter Spreen},
title = {On the strongly bounded turing degrees of simple sets},
booktitle = {Logic, Computation, Hierarchies},
series = {Ontos Mathematical Logic},
volume = {4},
pages = {23--78},
publisher = {De Gruyter},
year = {2014},
url = {https://doi.org/10.1515/9781614518044.23},
doi = {10.1515/9781614518044.23},
timestamp = {Tue, 16 May 2017 14:01:34 +0200},
biburl = {https://dblp.org/rec/books/daglib/p/Ambos-Spies14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:series/hhl/Ambos-SpiesF14,
author = {Klaus Ambos{-}Spies and
Peter A. Fejer},
editor = {J{\"{o}}rg H. Siekmann},
title = {Degrees of Unsolvability},
booktitle = {Computational Logic},
series = {Handbook of the History of Logic},
volume = {9},
pages = {443--494},
publisher = {Elsevier},
year = {2014},
url = {https://doi.org/10.1016/B978-0-444-51624-4.50010-1},
doi = {10.1016/B978-0-444-51624-4.50010-1},
timestamp = {Wed, 12 Jul 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/series/hhl/Ambos-SpiesF14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/apal/Ambos-SpiesBFK13,
author = {Klaus Ambos{-}Spies and
Philipp Bodewig and
Yun Fan and
Thorsten Kr{\"{a}}ling},
title = {The partial orderings of the computably enumerable ibT-degrees and
cl-degrees are not elementarily equivalent},
journal = {Ann. Pure Appl. Log.},
volume = {164},
number = {5},
pages = {577--588},
year = {2013},
url = {https://doi.org/10.1016/j.apal.2012.11.002},
doi = {10.1016/J.APAL.2012.11.002},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/apal/Ambos-SpiesBFK13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/apal/Ambos-SpiesBCK13,
author = {Klaus Ambos{-}Spies and
Joan Bagaria and
Enrique Casanovas and
Ulrich Kohlenbach},
title = {Preface},
journal = {Ann. Pure Appl. Log.},
volume = {164},
number = {12},
pages = {1177},
year = {2013},
url = {https://doi.org/10.1016/j.apal.2013.06.005},
doi = {10.1016/J.APAL.2013.06.005},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/apal/Ambos-SpiesBCK13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/logcom/Ambos-SpiesBCL13,
author = {Klaus Ambos{-}Spies and
Arnold Beckmann and
Erzs{\'{e}}bet Csuhaj{-}Varj{\'{u}} and
Benedikt L{\"{o}}we},
title = {Computability in Europe 2009},
journal = {J. Log. Comput.},
volume = {23},
number = {4},
pages = {727--728},
year = {2013},
url = {https://doi.org/10.1093/logcom/exr051},
doi = {10.1093/LOGCOM/EXR051},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/logcom/Ambos-SpiesBCL13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/Ambos-SpiesDFM13,
author = {Klaus Ambos{-}Spies and
Decheng Ding and
Yun Fan and
Wolfgang Merkle},
title = {Maximal Pairs of Computably Enumerable Sets in the Computably Lipschitz
Degrees},
journal = {Theory Comput. Syst.},
volume = {52},
number = {1},
pages = {2--27},
year = {2013},
url = {https://doi.org/10.1007/s00224-012-9424-1},
doi = {10.1007/S00224-012-9424-1},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/Ambos-SpiesDFM13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Ambos-SpiesB13,
author = {Klaus Ambos{-}Spies and
Timur Bakibayev},
title = {Nontriviality for exponential time w.r.t. weak reducibilities},
journal = {Theor. Comput. Sci.},
volume = {494},
pages = {2--12},
year = {2013},
url = {https://doi.org/10.1016/j.tcs.2012.05.022},
doi = {10.1016/J.TCS.2012.05.022},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/Ambos-SpiesB13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cie/Ambos-SpiesBZ13,
author = {Klaus Ambos{-}Spies and
Ulrike Brandt and
Martin Ziegler},
editor = {Paola Bonizzoni and
Vasco Brattka and
Benedikt L{\"{o}}we},
title = {Real Benefit of Promises and Advice},
booktitle = {The Nature of Computation. Logic, Algorithms, Applications - 9th Conference
on Computability in Europe, CiE 2013, Milan, Italy, July 1-5, 2013.
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7921},
pages = {1--11},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-39053-1\_1},
doi = {10.1007/978-3-642-39053-1\_1},
timestamp = {Tue, 14 May 2019 10:00:41 +0200},
biburl = {https://dblp.org/rec/conf/cie/Ambos-SpiesBZ13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/apal/Ambos-SpiesBBL12,
author = {Klaus Ambos{-}Spies and
Arnold Beckmann and
Samuel R. Buss and
Benedikt L{\"{o}}we},
title = {Computability in Europe 2009},
journal = {Ann. Pure Appl. Log.},
volume = {163},
number = {5},
pages = {483--484},
year = {2012},
url = {https://doi.org/10.1016/j.apal.2011.06.006},
doi = {10.1016/J.APAL.2011.06.006},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/apal/Ambos-SpiesBBL12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/Ambos-SpiesB12,
author = {Klaus Ambos{-}Spies and
Timur Bakibayev},
title = {Comparing Nontriviality for {E} and {EXP}},
journal = {Theory Comput. Syst.},
volume = {51},
number = {1},
pages = {106--122},
year = {2012},
url = {https://doi.org/10.1007/s00224-011-9370-3},
doi = {10.1007/S00224-011-9370-3},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/Ambos-SpiesB12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Ambos-SpiesBG11,
author = {Klaus Ambos{-}Spies and
Serikzhan A. Badaev and
Sergey S. Goncharov},
title = {Inductive inference and computable numberings},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {18},
pages = {1652--1668},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.12.041},
doi = {10.1016/J.TCS.2010.12.041},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Ambos-SpiesBG11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mscs/Ambos-SpiesK10,
author = {Klaus Ambos{-}Spies and
Thorsten Kr{\"{a}}ling},
title = {Quantitative aspects of speed-up and gap phenomena},
journal = {Math. Struct. Comput. Sci.},
volume = {20},
number = {5},
pages = {707--722},
year = {2010},
url = {https://doi.org/10.1017/S0960129510000174},
doi = {10.1017/S0960129510000174},
timestamp = {Wed, 01 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mscs/Ambos-SpiesK10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/Ambos-SpiesB10,
author = {Klaus Ambos{-}Spies and
Timur Bakibayev},
editor = {Samson Abramsky and
Cyril Gavoille and
Claude Kirchner and
Friedhelm Meyer auf der Heide and
Paul G. Spirakis},
title = {Weak Completeness Notions for Exponential Time},
booktitle = {Automata, Languages and Programming, 37th International Colloquium,
{ICALP} 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part
{I}},
series = {Lecture Notes in Computer Science},
volume = {6198},
pages = {503--514},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-14165-2\_43},
doi = {10.1007/978-3-642-14165-2\_43},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/Ambos-SpiesB10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tamc/Ambos-SpiesB10,
author = {Klaus Ambos{-}Spies and
Timur Bakibayev},
editor = {Jan Kratochv{\'{\i}}l and
Angsheng Li and
Jir{\'{\i}} Fiala and
Petr Kolman},
title = {Nontriviality for Exponential Time w.r.t. Weak Reducibilities},
booktitle = {Theory and Applications of Models of Computation, 7th Annual Conference,
{TAMC} 2010, Prague, Czech Republic, June 7-11, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6108},
pages = {84--93},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-13562-0\_9},
doi = {10.1007/978-3-642-13562-0\_9},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/tamc/Ambos-SpiesB10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/Ambos-SpiesDWY09,
author = {Klaus Ambos{-}Spies and
Decheng Ding and
Wei Wang and
Liang Yu},
title = {Bounding non-GL\({}_{\mbox{2}}\) and {R.E.A}},
journal = {J. Symb. Log.},
volume = {74},
number = {3},
pages = {989--1000},
year = {2009},
url = {https://doi.org/10.2178/jsl/1245158095},
doi = {10.2178/JSL/1245158095},
timestamp = {Thu, 14 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/Ambos-SpiesDWY09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tamc/Ambos-SpiesK09,
author = {Klaus Ambos{-}Spies and
Thorsten Kr{\"{a}}ling},
editor = {Jianer Chen and
S. Barry Cooper},
title = {Quantitative Aspects of Speed-Up and Gap Phenomena},
booktitle = {Theory and Applications of Models of Computation, 6th Annual Conference,
{TAMC} 2009, Changsha, China, May 18-22, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5532},
pages = {88--97},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-02017-9\_12},
doi = {10.1007/978-3-642-02017-9\_12},
timestamp = {Tue, 14 May 2019 10:00:46 +0200},
biburl = {https://dblp.org/rec/conf/tamc/Ambos-SpiesK09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/cie/2009,
editor = {Klaus Ambos{-}Spies and
Benedikt L{\"{o}}we and
Wolfgang Merkle},
title = {Mathematical Theory and Computational Practice, 5th Conference on
Computability in Europe, CiE 2009, Heidelberg, Germany, July 19-24,
2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5635},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-03073-4},
doi = {10.1007/978-3-642-03073-4},
isbn = {978-3-642-03072-7},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cie/2009.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tamc/Ambos-SpiesBG08,
author = {Klaus Ambos{-}Spies and
Serikzhan A. Badaev and
Sergey Goncharov},
editor = {Manindra Agrawal and
Ding{-}Zhu Du and
Zhenhua Duan and
Angsheng Li},
title = {On a Question of Frank Stephan},
booktitle = {Theory and Applications of Models of Computation, 5th International
Conference, {TAMC} 2008, Xi'an, China, April 25-29, 2008. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4978},
pages = {423--432},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-79228-4\_37},
doi = {10.1007/978-3-540-79228-4\_37},
timestamp = {Tue, 14 May 2019 10:00:46 +0200},
biburl = {https://dblp.org/rec/conf/tamc/Ambos-SpiesBG08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/Ambos-SpiesKLS04,
author = {Klaus Ambos{-}Spies and
Bj{\o}rn Kjos{-}Hanssen and
Steffen Lempp and
Theodore A. Slaman},
title = {Comparing {DNR} and {WWKL}},
journal = {J. Symb. Log.},
volume = {69},
number = {4},
pages = {1089--1104},
year = {2004},
url = {https://doi.org/10.2178/jsl/1102022212},
doi = {10.2178/JSL/1102022212},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jsyml/Ambos-SpiesKLS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/Ambos-SpiesB04,
author = {Klaus Ambos{-}Spies and
Edgar Busse},
editor = {Jir{\'{\i}} Fiala and
V{\'{a}}clav Koubek and
Jan Kratochv{\'{\i}}l},
title = {Computational Aspects of Disjunctive Sequences},
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 = {711--722},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-28629-5\_55},
doi = {10.1007/978-3-540-28629-5\_55},
timestamp = {Tue, 14 May 2019 10:00:37 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/Ambos-SpiesB04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Ambos-SpiesMRT03,
author = {Klaus Ambos{-}Spies and
Wolfgang Merkle and
Jan Reimann and
Sebastiaan Terwijn},
title = {Almost complete sets},
journal = {Theor. Comput. Sci.},
volume = {306},
number = {1-3},
pages = {177--194},
year = {2003},
url = {https://doi.org/10.1016/S0304-3975(03)00262-7},
doi = {10.1016/S0304-3975(03)00262-7},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Ambos-SpiesMRT03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dmtcs/Ambos-SpiesB03,
author = {Klaus Ambos{-}Spies and
Edgar Busse},
editor = {Cristian Calude and
Michael J. Dinneen and
Vincent Vajnovszki},
title = {Automatic Forcing and Genericity: On the Diagonalization Strength
of Finite Automata},
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 = {97--108},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/3-540-45066-1\_7},
doi = {10.1007/3-540-45066-1\_7},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/dmtcs/Ambos-SpiesB03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/Ambos-Spies03,
author = {Klaus Ambos{-}Spies},
editor = {Branislav Rovan and
Peter Vojt{\'{a}}s},
title = {Problems with Cannot Be Reduced to Any Proper Subproblems},
booktitle = {Mathematical Foundations of Computer Science 2003, 28th International
Symposium, {MFCS} 2003, Bratislava, Slovakia, August 25-29, 2003,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2747},
pages = {162--168},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/978-3-540-45138-9\_10},
doi = {10.1007/978-3-540-45138-9\_10},
timestamp = {Tue, 14 May 2019 10:00:37 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/Ambos-Spies03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/apal/Ambos-SpiesF01,
author = {Klaus Ambos{-}Spies and
Peter A. Fejer},
title = {Embedding of N\({}_{\mbox{5}}\) and the contiguous degrees},
journal = {Ann. Pure Appl. Log.},
volume = {112},
number = {2-3},
pages = {151--188},
year = {2001},
url = {https://doi.org/10.1016/S0168-0072(01)00028-8},
doi = {10.1016/S0168-0072(01)00028-8},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/apal/Ambos-SpiesF01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Ambos-SpiesMRS01,
author = {Klaus Ambos{-}Spies and
Wolfgang Merkle and
Jan Reimann and
Frank Stephan},
title = {Hausdorff Dimension in Exponential Time},
booktitle = {Proceedings of the 16th Annual {IEEE} Conference on Computational
Complexity, Chicago, Illinois, USA, June 18-21, 2001},
pages = {210--217},
publisher = {{IEEE} Computer Society},
year = {2001},
url = {https://doi.org/10.1109/CCC.2001.933888},
doi = {10.1109/CCC.2001.933888},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Ambos-SpiesMRS01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/apal/Ambos-SpiesHS00,
author = {Klaus Ambos{-}Spies and
Denis R. Hirschfeldt and
Richard A. Shore},
title = {Undecidability and 1-types in intervals of the computably enumerable
degrees},
journal = {Ann. Pure Appl. Log.},
volume = {106},
number = {1-3},
pages = {1--47},
year = {2000},
url = {https://doi.org/10.1016/S0168-0072(99)00011-1},
doi = {10.1016/S0168-0072(99)00011-1},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/apal/Ambos-SpiesHS00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jc/Ambos-SpiesWZ00,
author = {Klaus Ambos{-}Spies and
Klaus Weihrauch and
Xizhong Zheng},
title = {Weakly Computable Real Numbers},
journal = {J. Complex.},
volume = {16},
number = {4},
pages = {676--690},
year = {2000},
url = {https://doi.org/10.1006/jcom.2000.0561},
doi = {10.1006/JCOM.2000.0561},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jc/Ambos-SpiesWZ00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/Ambos-SpiesB00,
author = {Klaus Ambos{-}Spies and
Levke Bentzien},
title = {Separating NP-Completeness Notions under Strong Hypotheses},
journal = {J. Comput. Syst. Sci.},
volume = {61},
number = {3},
pages = {335--361},
year = {2000},
url = {https://doi.org/10.1006/jcss.1999.1674},
doi = {10.1006/JCSS.1999.1674},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/Ambos-SpiesB00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/Ambos-Spies00,
author = {Klaus Ambos{-}Spies},
editor = {Mogens Nielsen and
Branislav Rovan},
title = {Measure Theoretic Completeness Notions for the Exponential Time Classes},
booktitle = {Mathematical Foundations of Computer Science 2000, 25th International
Symposium, {MFCS} 2000, Bratislava, Slovakia, August 28 - September
1, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1893},
pages = {152--161},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-44612-5\_11},
doi = {10.1007/3-540-44612-5\_11},
timestamp = {Tue, 14 May 2019 10:00:37 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/Ambos-Spies00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Ambos-SpiesMRT00,
author = {Klaus Ambos{-}Spies and
Wolfgang Merkle and
Jan Reimann and
Sebastiaan Terwijn},
editor = {Horst Reichel and
Sophie Tison},
title = {Almost Complete Sets},
booktitle = {{STACS} 2000, 17th Annual Symposium on Theoretical Aspects of Computer
Science, Lille, France, February 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1770},
pages = {419--430},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-46541-3\_35},
doi = {10.1007/3-540-46541-3\_35},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/Ambos-SpiesMRT00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:books/el/99/Ambos-Spies99,
author = {Klaus Ambos{-}Spies},
editor = {Edward R. Griffor},
title = {Polynomial Time Reducibilities and Degrees},
booktitle = {Handbook of Computability Theory},
series = {Studies in Logic and the Foundations of Mathematics},
volume = {140},
pages = {683--705},
publisher = {North-Holland},
year = {1999},
url = {https://doi.org/10.1016/s0049-237x(99)80034-2},
doi = {10.1016/S0049-237X(99)80034-2},
timestamp = {Thu, 14 May 2020 15:29:16 +0200},
biburl = {https://dblp.org/rec/books/el/99/Ambos-Spies99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/Ambos-SpiesLM98,
author = {Klaus Ambos{-}Spies and
Steffen Lempp and
Gunther Mainhardt},
editor = {Lubos Brim and
Jozef Gruska and
Jir{\'{\i}} Zlatuska},
title = {Randomness vs. Completeness: On the Diagonalization Strength of Resource-Bounded
Random Sets},
booktitle = {Mathematical Foundations of Computer Science 1998, 23rd International
Symposium, MFCS'98, Brno, Czech Republic, August 24-28, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1450},
pages = {465--473},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/BFb0055796},
doi = {10.1007/BFB0055796},
timestamp = {Tue, 14 May 2019 10:00:37 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/Ambos-SpiesLM98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Ambos-SpiesTZ97,
author = {Klaus Ambos{-}Spies and
Sebastiaan Terwijn and
Xizhong Zheng},
title = {Resource Bounded Randomness and Weakly Complete Problems},
journal = {Theor. Comput. Sci.},
volume = {172},
number = {1-2},
pages = {195--207},
year = {1997},
url = {https://doi.org/10.1016/S0304-3975(95)00260-X},
doi = {10.1016/S0304-3975(95)00260-X},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Ambos-SpiesTZ97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Ambos-SpiesB97,
author = {Klaus Ambos{-}Spies and
Levke Bentzien},
title = {Separating NP-Completeness Notions under Strong Hypotheses},
booktitle = {Proceedings of the Twelfth Annual {IEEE} Conference on Computational
Complexity, Ulm, Germany, June 24-27, 1997},
pages = {121--127},
publisher = {{IEEE} Computer Society},
year = {1997},
url = {https://doi.org/10.1109/CCC.1997.612307},
doi = {10.1109/CCC.1997.612307},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Ambos-SpiesB97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/Ambos-SpiesFLL96,
author = {Klaus Ambos{-}Spies and
Peter A. Fejer and
Steffen Lempp and
Manuel Lerman},
title = {Decidability of the Two-Quantifier Theory of the Recursively Enumerable
Weak Truth-Table Degrees and Other Distributive Upper Semi-Lattices},
journal = {J. Symb. Log.},
volume = {61},
number = {3},
pages = {880--905},
year = {1996},
url = {https://doi.org/10.2307/2275790},
doi = {10.2307/2275790},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/Ambos-SpiesFLL96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Ambos-SpiesNT96,
author = {Klaus Ambos{-}Spies and
Hans{-}Christian Neis and
Sebastiaan Terwijn},
title = {Genericity and Measure for Exponential Time},
journal = {Theor. Comput. Sci.},
volume = {168},
number = {1},
pages = {3--19},
year = {1996},
url = {https://doi.org/10.1016/0304-3975(96)89424-2},
doi = {10.1016/0304-3975(96)89424-2},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Ambos-SpiesNT96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Ambos-SpiesMZ96,
author = {Klaus Ambos{-}Spies and
Elvira Mayordomo and
Xizhong Zheng},
editor = {Steven Homer and
Jin{-}Yi Cai},
title = {A Comparison of Weak Completeness Notions},
booktitle = {Proceedings of the Eleveth Annual {IEEE} Conference on Computational
Complexity, Philadelphia, Pennsylvania, USA, May 24-27, 1996},
pages = {171--178},
publisher = {{IEEE} Computer Society},
year = {1996},
url = {https://doi.org/10.1109/CCC.1996.507679},
doi = {10.1109/CCC.1996.507679},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Ambos-SpiesMZ96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Ambos-SpiesMWZ96,
author = {Klaus Ambos{-}Spies and
Elvira Mayordomo and
Yongge Wang and
Xizhong Zheng},
editor = {Claude Puech and
R{\"{u}}diger Reischuk},
title = {Resource-Bounded Balanced Genericity, Stochasticity and Weak Randomness},
booktitle = {{STACS} 96, 13th Annual Symposium on Theoretical Aspects of Computer
Science, Grenoble, France, February 22-24, 1996, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1046},
pages = {63--74},
publisher = {Springer},
year = {1996},
url = {https://doi.org/10.1007/3-540-60922-9\_6},
doi = {10.1007/3-540-60922-9\_6},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stacs/Ambos-SpiesMWZ96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Ambos-Spies95,
author = {Klaus Ambos{-}Spies},
title = {Resource-Bounded Genericity},
booktitle = {Proceedings of the Tenth Annual Structure in Complexity Theory Conference,
Minneapolis, Minnesota, USA, June 19-22, 1995},
pages = {162--181},
publisher = {{IEEE} Computer Society},
year = {1995},
url = {https://doi.org/10.1109/SCT.1995.514855},
doi = {10.1109/SCT.1995.514855},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Ambos-Spies95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/Ambos-Spies95,
author = {Klaus Ambos{-}Spies},
editor = {Zolt{\'{a}}n F{\"{u}}l{\"{o}}p and
Ferenc G{\'{e}}cseg},
title = {On Optimal Polynomial Time Approximations: P-Levelability vs. Delta-Levelability
(Extended Abstract)},
booktitle = {Automata, Languages and Programming, 22nd International Colloquium,
ICALP95, Szeged, Hungary, July 10-14, 1995, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {944},
pages = {384--392},
publisher = {Springer},
year = {1995},
url = {https://doi.org/10.1007/3-540-60084-1\_90},
doi = {10.1007/3-540-60084-1\_90},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/Ambos-Spies95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mlq/DingA94,
author = {Decheng Ding and
Klaus Ambos{-}Spies},
title = {Discontinuity of Cappings in the Recursively Enumerable Degrees and
Strongly Nonbranching Degrees},
journal = {Math. Log. Q.},
volume = {40},
pages = {287--317},
year = {1994},
url = {https://doi.org/10.1002/malq.19940400302},
doi = {10.1002/MALQ.19940400302},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mlq/DingA94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Ambos-SpiesHS94,
author = {Klaus Ambos{-}Spies and
Steven Homer and
Robert I. Soare},
title = {Minimal Pairs and Complete Problems},
journal = {Theor. Comput. Sci.},
volume = {132},
number = {2},
pages = {229--241},
year = {1994},
url = {https://doi.org/10.1016/0304-3975(94)90234-8},
doi = {10.1016/0304-3975(94)90234-8},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Ambos-SpiesHS94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/Ambos-SpiesTZ94,
author = {Klaus Ambos{-}Spies and
Sebastiaan Terwijn and
Xizhong Zheng},
editor = {Ding{-}Zhu Du and
Xiang{-}Sun Zhang},
title = {Resource Bounded Randomness and Weakly Complete Problems},
booktitle = {Algorithms and Computation, 5th International Symposium, {ISAAC} '94,
Beijing, P. R. China, August 25-27, 1994, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {834},
pages = {369--377},
publisher = {Springer},
year = {1994},
url = {https://doi.org/10.1007/3-540-58325-4\_201},
doi = {10.1007/3-540-58325-4\_201},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/isaac/Ambos-SpiesTZ94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/Ambos-SpiesNT94,
author = {Klaus Ambos{-}Spies and
Hans{-}Christian Neis and
Sebastiaan Terwijn},
editor = {Igor Pr{\'{\i}}vara and
Branislav Rovan and
Peter Ruzicka},
title = {Genericity and Measure for Exponential Time},
booktitle = {Mathematical Foundations of Computer Science 1994, 19th International
Symposium, MFCS'94, Kosice, Slovakia, August 22 - 26, 1994, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {841},
pages = {221--232},
publisher = {Springer},
year = {1994},
url = {https://doi.org/10.1007/3-540-58338-6\_69},
doi = {10.1007/3-540-58338-6\_69},
timestamp = {Tue, 14 May 2019 10:00:37 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/Ambos-SpiesNT94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/apal/Ambos-SpiesS93,
author = {Klaus Ambos{-}Spies and
Richard A. Shore},
title = {Undecidability and 1-Types in the Recursively Enumerable Degrees},
journal = {Ann. Pure Appl. Log.},
volume = {63},
number = {1},
pages = {3--37},
year = {1993},
url = {https://doi.org/10.1016/0168-0072(93)90206-S},
doi = {10.1016/0168-0072(93)90206-S},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/apal/Ambos-SpiesS93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/apal/Ambos-SpiesLS93,
author = {Klaus Ambos{-}Spies and
Alistair H. Lachlan and
Robert I. Soare},
title = {The Continuity of Cupping to 0'},
journal = {Ann. Pure Appl. Log.},
volume = {64},
number = {3},
pages = {195--209},
year = {1993},
url = {https://doi.org/10.1016/0168-0072(93)90143-2},
doi = {10.1016/0168-0072(93)90143-2},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/apal/Ambos-SpiesLS93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/dagstuhl/1992complexity,
editor = {Klaus Ambos{-}Spies and
Steven Homer and
Uwe Sch{\"{o}}ning},
title = {Complexity Theory: Current Research, Dagstuhl Workshop, February 2-8,
1992},
publisher = {Cambridge University Press},
year = {1993},
isbn = {0-521-44220-6},
timestamp = {Mon, 15 Jul 2002 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/dagstuhl/1992complexity.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/aml/Ambos-SpiesN92,
author = {Klaus Ambos{-}Spies and
Andr{\'{e}} Nies},
title = {Cappable recursively enumerable degrees and Post's program},
journal = {Arch. Math. Log.},
volume = {32},
number = {1},
pages = {51--56},
year = {1992},
url = {https://doi.org/10.1007/BF01270394},
doi = {10.1007/BF01270394},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/aml/Ambos-SpiesN92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/Ambos-SpiesNS92,
author = {Klaus Ambos{-}Spies and
Andr{\'{e}} Nies and
Richard A. Shore},
title = {The Theory of the Recursively Enumerable Weak Truth-Table Degrees
Is Undecidability},
journal = {J. Symb. Log.},
volume = {57},
number = {3},
pages = {864--874},
year = {1992},
url = {https://doi.org/10.2307/2275436},
doi = {10.2307/2275436},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/Ambos-SpiesNS92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Ambos-SpiesN92,
author = {Klaus Ambos{-}Spies and
Andr{\'{e}} Nies},
editor = {Alain Finkel and
Matthias Jantzen},
title = {The Theory of the Polynomial Many-One Degrees of Recursive Sets is
Undecidable},
booktitle = {{STACS} 92, 9th Annual Symposium on Theoretical Aspects of Computer
Science, Cachan, France, February 13-15, 1992, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {577},
pages = {209--218},
publisher = {Springer},
year = {1992},
url = {https://doi.org/10.1007/3-540-55210-3\_185},
doi = {10.1007/3-540-55210-3\_185},
timestamp = {Tue, 14 May 2019 10:00:48 +0200},
biburl = {https://dblp.org/rec/conf/stacs/Ambos-SpiesN92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Ambos-SpiesHS90,
author = {Klaus Ambos{-}Spies and
Steven Homer and
Robert I. Soare},
editor = {Christian Choffrut and
Thomas Lengauer},
title = {Minimal Pairs and Complete Problems},
booktitle = {{STACS} 90, 7th Annual Symposium on Theoretical Aspects of Computer
Science, Rouen, France, February 22-24, 1990, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {415},
pages = {24--36},
publisher = {Springer},
year = {1990},
url = {https://doi.org/10.1007/3-540-52282-4\_29},
doi = {10.1007/3-540-52282-4\_29},
timestamp = {Tue, 14 May 2019 10:00:48 +0200},
biburl = {https://dblp.org/rec/conf/stacs/Ambos-SpiesHS90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/apal/Ambos-SpiesS89,
author = {Klaus Ambos{-}Spies and
Robert I. Soare},
title = {The Recursively Enumerable Degrees have Infinitely Many One-Types},
journal = {Ann. Pure Appl. Log.},
volume = {44},
number = {1-2},
pages = {1--23},
year = {1989},
url = {https://doi.org/10.1016/0168-0072(89)90042-0},
doi = {10.1016/0168-0072(89)90042-0},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/apal/Ambos-SpiesS89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/Ambos-Spies89,
author = {Klaus Ambos{-}Spies},
title = {Honest Polynomial Time Reducibilities and the {P} = ? {NP} Problem},
journal = {J. Comput. Syst. Sci.},
volume = {39},
number = {3},
pages = {250--281},
year = {1989},
url = {https://doi.org/10.1016/0022-0000(89)90023-8},
doi = {10.1016/0022-0000(89)90023-8},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/Ambos-Spies89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/Ambos-SpiesL89,
author = {Klaus Ambos{-}Spies and
Manuel Lerman},
title = {Lattice Embeddings into the Recursively Enumerable Degrees {II}},
journal = {J. Symb. Log.},
volume = {54},
number = {3},
pages = {735--760},
year = {1989},
url = {https://doi.org/10.2307/2274738},
doi = {10.2307/2274738},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/Ambos-SpiesL89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Ambos-Spies89,
author = {Klaus Ambos{-}Spies},
title = {On the Relative Complexity of Hard Problems for Complexity Classes
without Complete Problems},
journal = {Theor. Comput. Sci.},
volume = {63},
number = {1},
pages = {43--61},
year = {1989},
url = {https://doi.org/10.1016/0304-3975(89)90066-2},
doi = {10.1016/0304-3975(89)90066-2},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Ambos-Spies89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/csl/Ambos-SpiesY89,
author = {Klaus Ambos{-}Spies and
Dongping Yang},
editor = {Egon B{\"{o}}rger and
Hans Kleine B{\"{u}}ning and
Michael M. Richter},
title = {Honest Polynomial-Time Degrees of Elementary Recursive Sets},
booktitle = {{CSL} '89, 3rd Workshop on Computer Science Logic, Kaiserslautern,
Germany, October 2-6, 1989, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {440},
pages = {1--15},
publisher = {Springer},
year = {1989},
url = {https://doi.org/10.1007/3-540-52753-2\_29},
doi = {10.1007/3-540-52753-2\_29},
timestamp = {Tue, 14 May 2019 10:00:42 +0200},
biburl = {https://dblp.org/rec/conf/csl/Ambos-SpiesY89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/Ambos-SpiesF88,
author = {Klaus Ambos{-}Spies and
Peter A. Fejer},
title = {Degree Theoretical Splitting Properties of Recursively Enumerable
Sets},
journal = {J. Symb. Log.},
volume = {53},
number = {4},
pages = {1110--1137},
year = {1988},
url = {https://doi.org/10.1017/S0022481200027961},
doi = {10.1017/S0022481200027961},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/Ambos-SpiesF88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/csl/Ambos-SpiesK88,
author = {Klaus Ambos{-}Spies and
J{\"{u}}rgen K{\"{a}}mper},
editor = {Egon B{\"{o}}rger and
Hans Kleine B{\"{u}}ning and
Michael M. Richter},
title = {On Disjunctive Self-Reducibility},
booktitle = {{CSL} '88, 2nd Workshop on Computer Science Logic, Duisburg, Germany,
October 3-7, 1988, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {385},
pages = {1--13},
publisher = {Springer},
year = {1988},
url = {https://doi.org/10.1007/BFb0026292},
doi = {10.1007/BFB0026292},
timestamp = {Tue, 14 May 2019 10:00:42 +0200},
biburl = {https://dblp.org/rec/conf/csl/Ambos-SpiesK88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Ambos-SpiesFH87,
author = {Klaus Ambos{-}Spies and
Hans Fleischhack and
Hagen Huwig},
title = {Diagonalizations over Polynomial Time Computable Sets},
journal = {Theor. Comput. Sci.},
volume = {51},
pages = {177--204},
year = {1987},
url = {https://doi.org/10.1016/0304-3975(87)90053-3},
doi = {10.1016/0304-3975(87)90053-3},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Ambos-SpiesFH87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/birthday/Ambos-Spies87,
author = {Klaus Ambos{-}Spies},
editor = {Egon B{\"{o}}rger},
title = {Minimal Pairs for Polynomial Time Reducibilities},
booktitle = {Computation Theory and Logic, In Memory of Dieter R{\"{o}}dding},
series = {Lecture Notes in Computer Science},
volume = {270},
pages = {1--13},
publisher = {Springer},
year = {1987},
url = {https://doi.org/10.1007/3-540-18170-9\_149},
doi = {10.1007/3-540-18170-9\_149},
timestamp = {Fri, 17 Jul 2020 16:12:48 +0200},
biburl = {https://dblp.org/rec/conf/birthday/Ambos-Spies87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Ambos-Spies87,
author = {Klaus Ambos{-}Spies},
title = {Honest polynomial reducibilities, recursively enumerable sets, and
the P=?NP problem},
booktitle = {Proceedings of the Second Annual Conference on Structure in Complexity
Theory, Cornell University, Ithaca, New York, USA, June 16-19, 1987},
pages = {60--68},
publisher = {{IEEE} Computer Society},
year = {1987},
url = {https://ieeexplore.ieee.org/document/10319255},
timestamp = {Tue, 21 Nov 2023 11:59:25 +0100},
biburl = {https://dblp.org/rec/conf/coco/Ambos-Spies87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/csl/Ambos-SpiesFH87,
author = {Klaus Ambos{-}Spies and
Hans Fleischhack and
Hagen Huwig},
editor = {Egon B{\"{o}}rger and
Hans Kleine B{\"{u}}ning and
Michael M. Richter},
title = {Diagonalizing over Deterministic Polynomial Time},
booktitle = {{CSL} '87, 1st Workshop on Computer Science Logic, Karlsruhe, Germany,
October 12-16, 1987, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {329},
pages = {1--16},
publisher = {Springer},
year = {1987},
url = {https://doi.org/10.1007/3-540-50241-6\_25},
doi = {10.1007/3-540-50241-6\_25},
timestamp = {Tue, 14 May 2019 10:00:42 +0200},
biburl = {https://dblp.org/rec/conf/csl/Ambos-SpiesFH87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Ambos-Spies86,
author = {Klaus Ambos{-}Spies},
title = {Inhomogeneities in the Polynomial-Time Degrees: The Degrees of Super
Sparse Sets},
journal = {Inf. Process. Lett.},
volume = {22},
number = {3},
pages = {113--117},
year = {1986},
url = {https://doi.org/10.1016/0020-0190(86)90054-2},
doi = {10.1016/0020-0190(86)90054-2},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Ambos-Spies86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Ambos-Spies86a,
author = {Klaus Ambos{-}Spies},
title = {A Note on the Complete Problems for Complexity Classes},
journal = {Inf. Process. Lett.},
volume = {23},
number = {5},
pages = {227--230},
year = {1986},
url = {https://doi.org/10.1016/0020-0190(86)90078-5},
doi = {10.1016/0020-0190(86)90078-5},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Ambos-Spies86a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/Ambos-SpiesL86,
author = {Klaus Ambos{-}Spies and
Manuel Lerman},
title = {Lattice Embeddings into the Recursively Enumerable Degrees},
journal = {J. Symb. Log.},
volume = {51},
number = {2},
pages = {257--272},
year = {1986},
url = {https://doi.org/10.1017/S0022481200031133},
doi = {10.1017/S0022481200031133},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/Ambos-SpiesL86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Ambos-Spies86,
author = {Klaus Ambos{-}Spies},
title = {An Inhomogeneity in the Structure of Karp Degrees},
journal = {{SIAM} J. Comput.},
volume = {15},
number = {4},
pages = {958--963},
year = {1986},
url = {https://doi.org/10.1137/0215067},
doi = {10.1137/0215067},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Ambos-Spies86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Ambos-Spies86,
author = {Klaus Ambos{-}Spies},
editor = {Alan L. Selman},
title = {Randomness, Relativizations, and Polynomial Reducibilities},
booktitle = {Structure in Complexity Theory, Proceedings of the Conference hold
at the University of California, Berkeley, California, USA, June 2-5,
1986},
series = {Lecture Notes in Computer Science},
volume = {223},
pages = {23--34},
publisher = {Springer},
year = {1986},
url = {https://doi.org/10.1007/3-540-16486-3\_87},
doi = {10.1007/3-540-16486-3\_87},
timestamp = {Thu, 02 Feb 2023 13:27:01 +0100},
biburl = {https://dblp.org/rec/conf/coco/Ambos-Spies86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@phdthesis{DBLP:books/daglib/0078326,
author = {Klaus Ambos{-}Spies},
title = {On the structure of the polynomial time degrees of recursive sets},
school = {University of Dortmund, Germany},
year = {1985},
timestamp = {Tue, 09 Jul 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/books/daglib/0078326.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/aml/Ambos-Spies85,
author = {Klaus Ambos{-}Spies},
title = {Cupping and noncapping in the r.e. weak truth table and turing degrees},
journal = {Arch. Math. Log.},
volume = {25},
number = {1},
pages = {109--126},
year = {1985},
url = {https://doi.org/10.1007/BF02007561},
doi = {10.1007/BF02007561},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/aml/Ambos-Spies85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/Ambos-spies85,
author = {Klaus Ambos{-}Spies},
title = {Sublattices of the Polynomial Time Degrees},
journal = {Inf. Control.},
volume = {65},
number = {1},
pages = {63--84},
year = {1985},
url = {https://doi.org/10.1016/S0019-9958(85)80020-6},
doi = {10.1016/S0019-9958(85)80020-6},
timestamp = {Mon, 18 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/iandc/Ambos-spies85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mlq/Ambos-Spies85,
author = {Klaus Ambos{-}Spies},
title = {Anti-Mitotic Recursively Enumerable Sets},
journal = {Math. Log. Q.},
volume = {31},
number = {29-30},
pages = {461--477},
year = {1985},
url = {https://doi.org/10.1002/malq.19850312903},
doi = {10.1002/MALQ.19850312903},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mlq/Ambos-Spies85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Ambos-Spies85,
author = {Klaus Ambos{-}Spies},
title = {Three Theorems on Polynomial Degrees of NP-Sets},
booktitle = {26th Annual Symposium on Foundations of Computer Science, Portland,
Oregon, USA, 21-23 October 1985},
pages = {51--55},
publisher = {{IEEE} Computer Society},
year = {1985},
url = {https://doi.org/10.1109/SFCS.1985.61},
doi = {10.1109/SFCS.1985.61},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Ambos-Spies85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Ambos-Spies85,
author = {Klaus Ambos{-}Spies},
editor = {Kurt Mehlhorn},
title = {On the Relative Complexity of Subproblems of Intractable Problems},
booktitle = {{STACS} 85, 2nd Symposium of Theoretical Aspects of Computer Science,
Saarbr{\"{u}}cken, Germany, January 3-5, 1985, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {182},
pages = {1--12},
publisher = {Springer},
year = {1985},
url = {https://doi.org/10.1007/BFb0023989},
doi = {10.1007/BFB0023989},
timestamp = {Tue, 14 May 2019 10:00:48 +0200},
biburl = {https://dblp.org/rec/conf/stacs/Ambos-Spies85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/Ambos-Spies84,
author = {Klaus Ambos{-}Spies},
title = {An Extension of the Nondiamond Theorem in Classical and alpha-Recursion
Theory},
journal = {J. Symb. Log.},
volume = {49},
number = {2},
pages = {586--607},
year = {1984},
url = {https://doi.org/10.2307/2274191},
doi = {10.2307/2274191},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/Ambos-Spies84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/Ambos-Spies84,
author = {Klaus Ambos{-}Spies},
editor = {Jan Paredaens},
title = {P-Generic Sets},
booktitle = {Automata, Languages and Programming, 11th Colloquium, Antwerp, Belgium,
July 16-20, 1984, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {172},
pages = {58--68},
publisher = {Springer},
year = {1984},
url = {https://doi.org/10.1007/3-540-13345-3\_5},
doi = {10.1007/3-540-13345-3\_5},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/Ambos-Spies84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Ambos-Spies84,
author = {Klaus Ambos{-}Spies},
editor = {Max Fontet and
Kurt Mehlhorn},
title = {On the Structure of Polynomial Time Degrees},
booktitle = {{STACS} 84, Symposium of Theoretical Aspects of Computer Science,
Paris, France, 11-13 April, 1984, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {166},
pages = {198--208},
publisher = {Springer},
year = {1984},
url = {https://doi.org/10.1007/3-540-12920-0\_18},
doi = {10.1007/3-540-12920-0\_18},
timestamp = {Tue, 14 May 2019 10:00:48 +0200},
biburl = {https://dblp.org/rec/conf/stacs/Ambos-Spies84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lam/Ambos-Spies83,
author = {Klaus Ambos{-}Spies},
editor = {Egon B{\"{o}}rger and
Gisbert Hasenjaeger and
Dieter R{\"{o}}dding},
title = {P-mitotic sets},
booktitle = {Logic and Machines: Decision Problems and Complexity, Proceedings
of the Symposium "Rekursive Kombinatorik" held from May 23-28, 1983
at the Institut f{\"{u}}r Mathematische Logik und Grundlagenforschung
der Universit{\"{a}}t M{\"{u}}nster/Westfalen},
series = {Lecture Notes in Computer Science},
volume = {171},
pages = {1--23},
publisher = {Springer},
year = {1983},
url = {https://doi.org/10.1007/3-540-13331-3\_30},
doi = {10.1007/3-540-13331-3\_30},
timestamp = {Fri, 17 Jul 2020 16:12:46 +0200},
biburl = {https://dblp.org/rec/conf/lam/Ambos-Spies83.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 16:55 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:
