Publikationsliste einschränken

Chart

 bis  

• englisch (52)
• deutsch (2)

• Merkle, Wolfgang (6)
• Müller, Gert H. (1923-2006) (3)
• Kräling, Thorsten (2)
• Bentzien, Levke (2)
• Nies, André (2)
• Stephan, Frank (1)
• Monath, Martin (1)

• Wang, Yongge (1)

• Sacks, Gerald E. (1933-2019) (5)
• Terwijn, Sebastiaan A. (5)
• Lempp, Steffen (3)
• Bakibayev, Timur (3)
• Zheng, Xizhong (3)
• Fejer, Peter A. (3)
• Soare, Robert I. (2)

• Lerman, Manuel (2)
• Löwe, Benedikt (2)
• Soare, Robert I. (2)
• Mayordomo, Elvira (2)
• Decheng, Ding (2)
• Shore, Richard A. (2)
• Neis, Hans-Christian (2)
• Slaman, Theodore A. (1)
• Gončarov, Sergej S. (1)
• Homer, Steven (1)
• Downey, R. G. (1)
• Lachlan, Alistair H. (1)
• Fejer, Peter A. (1)
• Ng, Keng Meng (1)
• Monath, Martin (1)
• Downey, Rod G. (1)
• Cooper, Stuart B. (1943-2015) (1)
• Brandt, Ulrike (1)
• Ziegler, Martin (1)
• Löwe, Benedikt (1)
• Badaev, Serikzhan (1)

Publikationen in heiBIB     

• Ambos-Spies, Klaus: Notes on Sacks' splitting theorem / Klaus Ambos-Spies, Rod G. Downey, Martin Monath, and Keng Meng Ng, 26 October 2023. - 30 S.
  In: The journal of symbolic logic, ISSN 1943-5886. (2023), online ahead of print
  DOI: 10.1017/jsl.2023.77
• Ambos-Spies, Klaus: Normalized information distance and the oscillation hierarchy / Klaus Ambos-Spies, Wolfgang Merkle, Sebastiaan A. Terwijn, 2022. - 12 S.
  In: Journal of computer and system sciences, ISSN 1090-2724. 124(2022) vom: März, Seite 65-76
  DOI: 10.1016/j.jcss.2021.08.006
• Ambos-Spies, Klaus: On supersets of non-low2 sets / Klaus Ambos-Spies, Rod G. Downey, and Martin Monath, 13 September 2021. - 11 S.
  In: The journal of symbolic logic, ISSN 1943-5886. 86(2021), 3, Seite 1282-1292
  DOI: 10.1017/jsl.2021.72
• Ambos-Spies, Klaus: Weak completeness notions for exponential time / Klaus Ambos-Spies, Timur Bakibayev, 04 April 2019. - 25 S.
  In: Theory of computing systems, ISSN 1433-0490. 63(2019), 6, Seite 1388-1412
  DOI: 10.1007/s00224-019-09920-4
• Ambos-Spies, Klaus: Automorphism bases for the recursively enumerable degrees : in memory of S. Barry Cooper (1943-2015) / Klaus Ambos-Spies, 7 June 2018. - 22 S.
  In: Computability, ISSN 2211-3576. 7(2018), 2-3, Seite 237-258
  DOI: 10.3233/COM-180088
• Ambos-Spies, Klaus: Degrees of unsolvability / Klaus Ambos-Spies and Peter A. Fejer. - 52 S.
  In: Computational logic. (2014), S. 443-494
  DOI: 10.1016/B978-0-444-51624-4.50010-1
• Ambos-Spies, Klaus: Numberings and learnability / Klaus Ambos-Spies. - 2 S.
  In: Lobachevskii journal of mathematics, ISSN 1818-9962. 35(2014), 4, S. 302-303
  DOI: 10.1134/S1995080214040106
• Ambos-Spies, Klaus: On the strongly bounded turing degrees of simple sets / Klaus Ambos-Spies. - 56 S.
  In: Logic, Computation, Hierarchies. (2014), S. 23-78
  DOI: 10.1515/9781614518044.23
• Special issue: computability in Europe 2009 : [... Conference CiE 2009: mathematical theory and computational practice ... Fifth Conference on Computability in Europe ... Heidelberg, Germany, in July 2009 ... 10 papers] / [guest ed: Klaus Ambos-Spies ...]. -
  Oxford: Oxford Univ. Press, 2013. - S. 727 - 924
  (Journal of logic and computation ; 23.2013,4)
  (Annals of pure and applied logic ; 163.2012,5)
  (Theory of computing systems ; 51.2012,1)
• Ambos-Spies, Klaus: Real benefit of promises and advice / Klaus Ambos-Spies ; Ulrike Brandt ; Martin Ziegler. - 11 S.
  In: The nature of computation. (2013), S. 1-11
• Ambos-Spies, Klaus: Maximal pairs of computably enumerable sets in the computably Lipschitz degrees / Klaus Ambos-Spies ... Wolfgang Merkle. - 26 S.
  In: Theory of computing systems, ISSN 1433-0490. 52(2013), 1, S. 2-27
  DOI: 10.1007/s00224-012-9424-1
• Ambos-Spies, Klaus: Computability in Europe 2009 / Klaus Ambos-Spies .... - 2 S.
  In: Journal of logic and computation, ISSN 1465-363X. 23(2013), 4, S. 727-728
  DOI: 10.1093/logcom/exr051
• Ambos-Spies, Klaus: The partial orderings of the computably enumerable ibT-degrees and cl-degrees are not elementarily equivalent / Klaus Ambos-Spies ... Thorsten Kräling. - 12 S.
  In: Annals of pure and applied logic, ISSN 1873-2461. 164(2013), 5, S. 577–588
  DOI: 10.1016/j.apal.2012.11.002
• Ambos-Spies, Klaus: Nontriviality for exponential time w.r.t. weak reducibilities / Klaus Ambos-Spies ; Timur Bakibayev. - 11 S.
  In: Theoretical computer science, ISSN 1879-2294. 494(2013), S. 2-12
  DOI: 10.1016/j.tcs.2012.05.022
• Ambos-Spies, Klaus: Computability in Europe 2009 / Klaus Ambos-Spies .... - 2 S.
  In: Annals of pure and applied logic, ISSN 1873-2461. 163(2012), 5, S. 483-484
  DOI: 10.1016/j.apal.2011.06.006
• 2011 European Summer Meeting of the Association for Symbolic Logic, Logic Colloquium ’11 : Barcelona, Catalonia, Spain, July 11 - 16, 2011 / Ambos-Spies, Klaus (ed.). - 59 S.
  In: Bulletin of symbolic logic, ISSN 1943-5894. 18(2012), 3, S. 418-476
• Ambos-Spies, Klaus: Comparing nontriviality for E and EXP / Klaus Ambos-Spies ; Timur Bakibayev. - 17 S.
  In: Theory of computing systems, ISSN 1433-0490. 51(2012), 1, S. 106-122
  DOI: 10.1007/s00224-011-9370-3
• Computability in Europe 2009 : held at Heidelberg, Germany, in July 2009] / ed. by Klaus Ambos-Spies .... -
  Amsterdam [u.a.]: Elsevier, 2012. - IV S., S. 483 - 619
  (Annals of pure and applied logic ; 163.2012,5 : Special issue)
• Ambos-Spies, Klaus: Inductive inference and computable numberings / Klaus Ambos-Spies ; Serikzhan Badaev ; Sergey Goncharov. - 17 S.
  In: Theoretical computer science, ISSN 1879-2294. 412(2011), 18, S. 1652-1668
  DOI: 10.1016/j.tcs.2010.12.041
• Ambos-Spies, Klaus: Quantitative aspects of speed-up and gap phenomena / Klaus Ambos-Spies and Thorsten Kräling, 27 October 2010. - 16 S.
  In: Mathematical structures in computer science, ISSN 1469-8072. 20(2010), 5, Seite 707-722
  DOI: 10.1017/S0960129510000174
• Mathematical theory and computational practice : 5th Conference on Computability in Europe, CiE 2009, Heidelberg, Germany, July 19-24, 2009. Proceedings / edited by Klaus Ambos-Spies, Benedikt Löwe, Wolfgang Merkle. -
  Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. - Online-Ressource (digital), ISBN 978-3-642-03073-4
  (Lecture Notes in Computer Science ; 5635)
  (SpringerLink : Bücher)
  DOI: 10.1007/978-3-642-03073-4
• Mathematical theory and computational practice : 5th Conference on Computability in Europe, CiE 2009, Heidelberg, Germany, July 19 - 24, 2009; Abstract booklet / Klaus Ambos-Spies ... Wolfgang Merkle (eds.). -
  Heidelberg: Univ., Dept. of Mathematics and Computer Science, Mathematical Logic and Theoretical Computer Science Group, 2009. - XVI, 360 S. : graph. Darst.
• Mathematical theory and computational practice : 5th Conference on Computability in Europe, CiE 2009, Heidelberg, Germany, July 19-24, 2009 ; proceedings / Klaus Ambos-Spies; Benedikt Löwe; Wolfgang Merkle (eds.). -
  Berlin ; Heidelberg [u.a.]: Springer, 2009. - XIV, 510 S. : graph. Darst., ISBN 978-3-642-03072-7
  (Lecture notes in computer science ; 5635)
• Berechenbarkeitstheorie : 21.01. - 27.01.2001 / Klaus Ambos-Spies, Heidelberg; Steffen Lempp, Madison; Theodore A. Slaman, Berkeley. -
  Oberwolfach: Math. Forschungsinst., 2001. - 16 S.
  (Tagungsbericht / Mathematisches Forschungsinstitut Oberwolfach ; 2001,3)
• Ambos-Spies, Klaus: Collapsing polynomial-time degrees / Klaus Ambos-Spies, Levke Bentzien, Peter A. Fejer, Wolfgang Merkle, and Frank Stephan. - 24 S.
  In: Logic Colloquium '98. (2000), S. 1-24
• Ambos-Spies, Klaus: Polynomial time reducibilities and degrees / Klaus Ambos-Spies, 1999. - 23 S.
  In: Handbook of computability theory. (1999), Seite 683-705
  DOI: 10.1016/S0049-237X(99)80034-2
• Conference on computability theory : 27 January - 3 February 1996, Oberwolfach, Germany / guest ed.: Klaus Amos-Spies .... -
  Amsterdam [u.a.]: North-Holland, 1998. - VI, 296 S.
  (Annals of pure and applied logic ; 94.1998 : Special volume)
• Ambos-Spies, Klaus: Separating NP-completeness notions under strong hypotheses / K. Ambos-Spies, L. Bentzien, 1997. - 7 S.
  In: Proceedings / Twelfth Annual IEEE Conference on Computational Complexity; (formerly: Structure in Complexity Theory Conference). (1997), Seite 121-127
• Ambos-Spies, Klaus: Resource bounded randomness and weakly complete problems / Klaus Ambos-Spies, Sebastiaan A. Terwijn, Zheng Xizhong, 1997. - 13 S.
  In: Theoretical computer science, ISSN 1879-2294. 172(1997), 1, Seite 195-207
  DOI: 10.1016/S0304-3975(95)00260-X
• Ambos-Spies, Klaus: Resource-bounded measure and randomness / K. Ambos-Spies mit E. Mayordomo, 1997. - 47 S.
  In: Complexity, logic, and recursion theory. (1997), Seite 1-47
• Ambos-Spies, Klaus: Genericity and measure for exponential time / Klaus Ambos-Spies, Hans-Christian Neis, Sebastiaan A. Terwijn, 10 November 1996. - 17 S.
  In: Theoretical computer science, ISSN 1879-2294. 168(1996), 1, Seite 3-19
  DOI: 10.1016/0304-3975(96)89424-2
• Ambos-Spies, Klaus: A comparison of weak completeness notions / Wolfgang Ambos-Spies, 1996. - 8 S.
  In: Proceedings / Eleventh Annual IEEE Conference on Computational Complexity. (1996), Seite 171-178
• Ambos-Spies, Klaus: Decidability of the two-quantifier theory of the recursively enumerable weak truth-table degrees and other distributive upper semi-lattices / Klaus Ambos-Spies, Peter A. Fejer, Steffen Lempp, Manuel Lerman, 1996. - 26 S.
  In: The journal of symbolic logic, ISSN 1943-5886. 61(1996), 3, Seite 880-905
  DOI: 10.2307/2275790
• Ambos-Spies, Klaus: Resource bounded genericity / Klaus Ambos-Spies, 1996. - 60 S.
  In: Computability, enumerability, unsolvability. (1996), Seite 1-60
• Ambos-Spies, Klaus: Resource-bounded balanced genericity, stochasticity and weak randomness / Klaus Ambos-Spies, Elvira Mayordomo, Yongge Wang, Xizhong Zheng, 1996. - 12 S.
  In: Proceedings / STACS 96. (1996), Seite 63-74
  DOI: 10.1007/3-540-60922-9_6
• Rekursionstheorie : 28.01. - 03.02.1996 / Klaus Ambos-Spies, Heidelberg; Gerald E. Sacks, Cambridge; Robert I. Soare, Chicago. -
  Oberwolfach-Walke: Mathematisches Forschungsinstitut, 1996. - 21 S.
  (Tagungsbericht / Mathematisches Forschungsinstitut Oberwolfach ; 1996,5)
  (Oberwolfach Workshop ; 9605)
  (Oberwolfach Digital Archive)
  DOI: 10.14760/TB-1996-5
• Rekursionstheorie : 28.01. - 03.02.1996 / Klaus Ambos-Spies, Heidelberg; Gerald E. Sacks, Cambridge; Robert I. Soare, Chicago. -
  Oberwolfach-Walke: Mathematisches Forschungsinstitut, 1996. - 21 S.
  (Tagungsbericht / Mathematisches Forschungsinstitut Oberwolfach ; 1996,5)
• Ambos-Spies, Klaus: Discontinuity of cappings in the recursively enumerable degrees and strongly nonbranching degrees / Klaus Ambos-Spies, Ding Decheng, 1994. - 31 S.
  In: Mathematical logic quarterly, ISSN 1521-3870. 40(1994), 3, Seite 287-317
  DOI: 10.1002/malq.19940400302
• Ambos-Spies, Klaus: Genericity and measure for exponential time / Klaus Ambos-Spies, Hans-Christian Neis, Sebastiaan A. Terwijn, 1994. - 12 S.
  In: Mathematical Foundations of Computer Science 1994. (1994), Seite 221-232
  DOI: 10.1007/3-540-58338-6_69
• Ambos-Spies, Klaus: Lattice embeddings into the R.E. degrees Preserving 0 and 1 / Klaus Ambos-Spies, Steffen Lempp, Manuel Lerman, 1994. - 15 S.
  In: Journal of the London Mathematical Society, ISSN 1469-7750. 49(1994), 1, Seite 1-15
  DOI: 10.1112/jlms/49.1.1
• Ambos-Spies, Klaus: Resource bounded randomness and weakly complete problems / Klaus Ambos-Spies, Sebastiaan A. Terwijn, Zheng Xizhong, 1994. - 9 S.
  In: Algorithms and computation. (1994), Seite 369-377
  DOI: 10.1007/3-540-58325-4_201
• Ambos-Spies, Klaus: Minimal pairs and complete problems / Klaus Ambos-Spies, Steven Homer, Robert I. Soare, 1994. - 13 S.
  In: Theoretical computer science, ISSN 1879-2294. 132(1994), 1, Seite 229-241
  DOI: 10.1016/0304-3975(94)90234-8
• Ambos-Spies, Klaus: Embedding distributive lattices preserving 1 below a nonzero recursively enumerable turing degree / Klaus Ambos-Spies, Ding Decheng, Peter A. Fejer, 1993. - 38 S.
  In: Logical methods. (1993), Seite 92-129
  DOI: 10.1007/978-1-4612-0325-4_2
• Ambos-Spies, Klaus: The continuity of cupping to 0' / Klaus Ambos-Spies, Alistair H. Lachlan, Robert I. Soare, 1993. - 15 S.
  In: Annals of pure and applied logic, ISSN 1873-2461. 64(1993), 3, Seite 195-209
  DOI: 10.1016/0168-0072(93)90143-2
• Ambos-Spies, Klaus: Undecidability and 1-types in the recursively enumerable degrees / Klaus Ambos-Spies, Richard A. Shore, 1993. - 35 S.
  In: Annals of pure and applied logic, ISSN 1873-2461. 63(1993), 1, Seite 3-37
  DOI: 10.1016/0168-0072(93)90206-S
• Complexity theory : current research ; [on February 2-8, 1992 a Workshop on Structure and Complexity was held at the Dagstuhl International Conference and Research Center outside the town of Wadern, Germany] / ed. by Klaus Ambos-Spies; Steven Homer; Uwe Schöning. - 1. publ.. -
  Cambridge [u.a.]: Cambridge Univ. Press, 1993. - VIII, 313 S. : graph. Darst, ISBN 978-0-521-44220-6
• Ambos-Spies, Klaus: The theory of the recursively enumerable weak truth-table degrees is undecidable / Klaus Ambos-Spies, André Nies, Richard A. Shore, 1992. - 11 S.
  In: The journal of symbolic logic, ISSN 1943-5886. 57(1992), 3, Seite 864-874
  DOI: 10.2307/2275436
• Ambos-Spies, Klaus: Cappable recursively enumerable degrees and Post's program / Klaus Ambos-Spies, André Nies, 1992. - 6 S.
  In: Archive for mathematical logic, ISSN 1432-0665. 32(1992), 1, Seite 51-56
  DOI: 10.1007/BF01270394
• Ambos-Spies, Klaus: Recursion Theory Week : Proceedings of a Conference held in Oberwolfach, FRG, March 19-25, 1989 / edited by Klaus Ambos-Spies, Gert H. Müller, Gerald E. Sacks. -
  Berlin, Heidelberg: Springer Berlin Heidelberg, 1990. - Online-Ressource (VIII, 400 p, online resource), ISBN 978-3-540-47142-4
  (Lecture Notes in Mathematics ; 1432)
  (Springer eBook Collection : Mathematics and Statistics)
  (SpringerLink : Bücher)
  DOI: 10.1007/BFb0086109
• Rekursionstheorie : 19.3. bis 25.3.1989 / Klaus Ambos-Spies, Heidelberg; Gert H. Müller, Heidelberg; Gerald E. Sacks, Cambridge. -
  Oberwolfach: Math. Forschungsinst., 1989. - 19 S.
  (Tagungsbericht / Mathematisches Forschungsinstitut Oberwolfach ; 1989,12)
  (Oberwolfach Digital Archive)
  (Oberwolfach Workshop ; 8912)
  DOI: 10.14760/TB-1989-12
• Rekursionstheorie : 19.3. bis 25.3.1989 / Klaus Ambos-Spies, Heidelberg; Gert H. Müller, Heidelberg; Gerald E. Sacks, Cambridge. -
  Oberwolfach: Math. Forschungsinst., 1989. - 19 S.
  (Tagungsbericht ; 1989,12)
• Ambos-Spies, Klaus: On the structure of the recursively enumerable degrees / Klaus Ambos-Spies, 1981. - IX, 160 S. : graph. Darst.

IDs

GND:

141551607

Links

Ambos-Spies, Klaus in ...

• Deutsche Nationalbibliothek (DNB)
• Virtual International Authority File (VIAF)

Export Publikationsliste

• RIS (Endnote)
• BibTeX
• RDF
• MODS
• P°NK (ExIni)

heiBIB

Bei fehlerhaften oder unvollständigen Angaben wenden Sie sich bitte an biblio@ub.uni-heidelberg.de.

Informationen zu heiBIB (inkl. Einbettung der Publikationslisten in eigene WWW-Seiten).