default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPeter Hertling
Person information
- affiliation: Universität der Bundeswehr München, Neubiberg, Germany
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j36]Peter Hertling, Philip Janicki:
Nearly computable real numbers. Comput. 13(1): 57-88 (2024)- 2023
- [j35]Peter Hertling:
Remarks on the effective Jordan decomposition. Theor. Comput. Sci. 940(Part): 176-188 (2023) - [i8]Peter Hertling, Philip Janicki:
Nearly Computable Real Numbers. CoRR abs/2301.08124 (2023) - 2021
- [j34]Peter Hertling
, Gisela Krommes:
EXPSPACE-Completeness of the Logics K4 × S5 and S4 × S5 and the Logic of Subset Spaces. ACM Trans. Comput. Log. 22(4): 24:1-24:71 (2021) - 2020
- [j33]Peter Hertling:
Forests describing Wadge degrees and topological Weihrauch degrees of certain classes of functions and relations. Comput. 9(3-4): 249-307 (2020)
2010 – 2019
- 2019
- [i7]Peter Hertling, Gisela Krommes:
EXPSPACE-Completeness of the Logics K4xS5 and S4xS5 and the Logic of Subset Spaces, Part 1: ESPACE-Algorithms. CoRR abs/1908.03501 (2019) - [i6]Peter Hertling, Gisela Krommes:
EXPSPACE-Completeness of the Logics K4xS5 and S4xS5 and the Logic of Subset Spaces, Part 2: EXPSPACE-Hardness. CoRR abs/1908.03509 (2019) - 2017
- [j32]Peter Hertling:
Clarke's generalized gradient and Edalat's L-derivative. J. Log. Anal. 9 (2017) - 2016
- [i5]Peter Hertling:
Two Counterexamples Concerning the Scott Topology on a Partial Order. CoRR abs/1607.04128 (2016) - 2015
- [j31]Volker Bosserhoff, Peter Hertling:
Effective subsets under homeomorphisms of Rn. Inf. Comput. 245: 197-212 (2015) - 2014
- [j30]Peter Hertling, Christoph Spandl:
Computing a Solution of Feigenbaum's Functional Equation in Polynomial Time. Log. Methods Comput. Sci. 10(4) (2014) - [p1]Peter Hertling, Victor L. Selivanov:
Complexity issues for Preorders on finite labeled forests. Logic, Computation, Hierarchies 2014: 165-190 - 2011
- [c14]Peter Hertling, Victor L. Selivanov:
Complexity Issues for Preorders on Finite Labeled Forests. CiE 2011: 112-121 - 2010
- [j29]Andrej Bauer, Peter Hertling, Ker-I Ko:
Computability and Complexity in Analysis. J. Univers. Comput. Sci. 16(18): 2495 (2010)
2000 – 2009
- 2009
- [c13]Andrej Bauer, Peter Hertling, Ker-I Ko:
CCA 2009 Front Matter - Proceedings of the Sixth International Conference on Computability and Complexity in Analysis. CCA 2009 - [c12]Andrej Bauer, Peter Hertling, Ker-I Ko:
CCA 2009 Preface - Proceedings of the Sixth International Conference on Computability and Complexity in Analysis. CCA 2009 - [e6]Andrej Bauer, Peter Hertling, Ker-I Ko:
Sixth International Conference on Computability and Complexity in Analysis, CCA 2009, August 18-22, 2009, Ljubljana, Slovenia. OASIcs 11, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany 2009 [contents] - 2008
- [j28]Peter Hertling, Christoph Spandl:
Shifts with Decidable Language and Non-Computable Entropy. Discret. Math. Theor. Comput. Sci. 10(3) (2008) - [j27]Peter Hertling, Christoph Spandl:
Computability Theoretic Properties of the Entropy of Gap Shifts. Fundam. Informaticae 83(1-2): 141-157 (2008) - [e5]Peter Hertling, Christoph M. Hoffmann, Wolfram Luther, Nathalie Revol:
Reliable Implementation of Real Number Algorithms: Theory and Practice, International Seminar Dagstuhl Castle, Germany, January 8-13, 2006, Revised Papers. Lecture Notes in Computer Science 5045, Springer 2008, ISBN 978-3-540-85520-0 [contents] - [e4]Peter Hertling, Victor L. Selivanov, Wolfgang Thomas, William W. Wadge, Klaus W. Wagner:
Topological and Game-Theoretic Aspects of Infinite Computations, 29.06. - 04.07.2008. Dagstuhl Seminar Proceedings 08271, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany 2008 [contents] - [i4]Peter Hertling, Victor L. Selivanov, Wolfgang Thomas, William W. Wadge, Klaus W. Wagner:
08271 Abstracts Collection - Topological and Game-Theoretic Aspects of Infinite Computations. Topological and Game-Theoretic Aspects of Infinite Computations 2008 - [i3]Peter Hertling, Victor L. Selivanov, Wolfgang Thomas, William W. Wadge, Klaus W. Wagner:
08271 Executive Summary - Topological and Game-Theoretic Aspects of Infinite Computations. Topological and Game-Theoretic Aspects of Infinite Computations 2008 - 2006
- [j26]Vasco Brattka, Peter Hertling, Ker-I Ko, Hideki Tsuiki:
Computability and complexity in analysis. J. Complex. 22(6): 728 (2006) - [j25]Peter Hertling:
A sequentially computable function that is not effectively continuous at any point. J. Complex. 22(6): 752-767 (2006) - [e3]Peter Hertling, Christoph M. Hoffmann, Wolfram Luther, Nathalie Revol:
Reliable Implementation of Real Number Algorithms: Theory and Practice, 08.01. - 13.01.2006. Dagstuhl Seminar Proceedings 06021, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2006 [contents] - [i2]Peter Hertling, Christoph M. Hoffmann, Wolfram Luther, Nathalie Revol:
06021 Summary -- Reliable Implementation of Real Number Algorithms: Theory and Practice. Reliable Implementation of Real Number Algorithms 2006 - [i1]Peter Hertling, Christoph M. Hoffmann, Wolfram Luther, Nathalie Revol:
06021 Abstracts Collection -- Reliable Implementation of Real Number Algorithms: Theory and Practice. Reliable Implementation of Real Number Algorithms 2006 - 2005
- [j24]Peter Hertling:
A Banach-Mazur computable but not Markov computable function on the computable real numbers. Ann. Pure Appl. Log. 132(2-3): 227-246 (2005) - [j23]Peter Hertling:
Nonrandom Sequences between Random Sequences. J. Univers. Comput. Sci. 11(12): 1970-1985 (2005) - [j22]Peter Hertling:
Is the Mandelbrot set computable? Math. Log. Q. 51(1): 5-18 (2005) - [c11]Peter Hertling:
A Sequentially Computable Function that is not Effectively Continous at any Point. CCA 2005: 131-148 - [c10]Peter Hertling:
Computable Analysis via Representations. CCA 2005: 377 - [e2]Tanja Grubba, Peter Hertling, Hideki Tsuiki, Klaus Weihrauch:
CCA 2005 - Second International Conference on Computability and Complexity in Analysis, August 25-29, 2005, Kyoto, Japan. Informatik Berichte 326-7/2005, FernUniversität Hagen, Germany 2005 [contents] - 2004
- [j21]Vasco Brattka, Peter Hertling, Ker-I Ko, Ning Zhong:
Preface: MLQ - Math. Log. Quart. 4-5/2004. Math. Log. Q. 50(4-5): 327-328 (2004) - 2003
- [j20]Peter Hertling, Klaus Weihrauch:
Random elements in effective topological spaces with measure. Inf. Comput. 181(1): 32-56 (2003) - 2002
- [j19]Peter Hertling:
Topological Complexity of Zero Finding with Algebraic Operations. J. Complex. 18(4): 912-942 (2002) - [j18]Peter Hertling:
Simply Normal Numbers to Different Bases. J. Univers. Comput. Sci. 8(2): 235-242 (2002) - [j17]Vasco Brattka, Peter Hertling, Mariko Yasugi, Ning Zhong:
Preface: MLQ - Math. Log. Quart. Supplement 1/2002. Math. Log. Q. 48(S1) (2002) - [j16]Peter Hertling:
A lower bound for range enclosure in interval arithmetic. Theor. Comput. Sci. 279(1-2): 83-95 (2002) - [j15]Vasco Brattka, Peter Hertling:
Topological properties of real number representations. Theor. Comput. Sci. 284(2): 241-257 (2002) - [c9]Peter Hertling:
A Banach-Mazur Computable But Not Markov Computable Function on the Computable Real Numbers. ICALP 2002: 962-972 - [c8]Peter Hertling:
A Comparison of Certain Representations of Regularly Closed Sets. CCA 2002: 65-78 - 2001
- [j14]Peter Hertling:
Nonlinear Lebesgue and Ito^ Integration Problems of High Complexity. J. Complex. 17(2): 366-387 (2001) - [j13]Peter Hertling:
A Limitation for Underestimation Via Twin Arithmetic. Reliab. Comput. 7(2): 157-169 (2001) - [j12]Cristian Calude, Peter Hertling, Bakhadyr Khoussainov, Yongge Wang:
Recursively enumerable reals and Chaitin Omega numbers. Theor. Comput. Sci. 255(1-2): 125-149 (2001) - [e1]Jens Blanck, Vasco Brattka, Peter Hertling:
Computability and Complexity in Analysis, 4th International Workshop, CCA 2000, Swansea, UK, September 17-19, 2000, Selected Papers. Lecture Notes in Computer Science 2064, Springer 2001, ISBN 3-540-42197-1 [contents] - 2000
- [c7]Peter Hertling:
Banach-Mazur Computable Functions on Metric Spaces. CCA 2000: 69-81
1990 – 1999
- 1999
- [j11]Peter Hertling:
A Real Number Structure that is Effectively Categorical. Math. Log. Q. 45: 147-182 (1999) - [j10]Peter Hertling:
The Effective Riemann Mapping Theorem. Theor. Comput. Sci. 219(1-2): 225-265 (1999) - 1998
- [j9]Cristian Calude, Peter Hertling:
Computable Approximations of Reals: An Information-Theoretic Analysis. Fundam. Informaticae 33(2): 105-120 (1998) - [j8]Vasco Brattka, Peter Hertling:
Feasible Real Random Access Machines. J. Complex. 14(4): 490-526 (1998) - [c6]Peter Hertling, Klaus Weihrauch:
Randomness Spaces. ICALP 1998: 796-807 - [c5]Cristian Calude, Peter Hertling, Bakhadyr Khoussainov, Yongge Wang:
Recursively Enumerable Reals and Chaitin Omega Numbers. STACS 1998: 596-606 - 1997
- [j7]Cristian Calude, Peter Hertling, Bakhadyr Khoussainov:
Do the Zeros of Riemann's Zeta-Function Form a Random Sequence? Bull. EATCS 62 (1997) - [j6]Ulrich Günther, Peter Hertling, Radu Nicolescu, Mark R. Titchener:
Representing Variable-Length Codes in Fixed-Length T-Depletion Format in Encoders and Decoders. J. Univers. Comput. Sci. 3(11): 1207-1225 (1997) - [j5]Peter Hertling:
Surjective Functions on Computably Growing Cantor Sets. J. Univers. Comput. Sci. 3(11): 1226-1240 (1997) - [j4]Peter Hertling, Yongge Wang:
Invariance Properties of Random Sequences. J. Univers. Comput. Sci. 3(11): 1241-1249 (1997) - 1996
- [b1]Peter Hertling:
Unstetigkeitsgrade von Funktionen in der effektiven Analysis. University of Hagen, Germany, 1996, pp. 1-157 - [j3]Peter Hertling:
Topological Complexity with Continuous Operations. J. Complex. 12(4): 315-338 (1996) - [j2]Peter Hertling:
Disjunctive omega-Words and Real Numbers. J. Univers. Comput. Sci. 2(7): 549-568 (1996) - [j1]Peter Hertling, Lars Hog, Rune Larsen, John W. Perram, Henrik Gordon Petersen:
Task curve planning for painting robots. I. Process modeling and calibration. IEEE Trans. Robotics Autom. 12(2): 324-330 (1996) - [c4]Peter Hertling:
Computable Real Functions: Type 1 Computability Versus Type 2 Computability. CCA 1996 - [c3]Peter Hertling:
Effectivity and Effective Continuity of Functions between Computable Metric Spaces. DMTCS 1996: 264-275 - [c2]Vasco Brattka, Peter Hertling:
Feasible Real Random Access Machines. SOFSEM 1996: 335-342 - 1994
- [c1]Peter Hertling, Klaus Weihrauch:
Levels of Degeneracy and Exact Lower Complexity Bounds for Geometric Algorithms. CCCG 1994: 237-242
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-22 19:46 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:
