Peter Hertling

ORCID

Publication Activity (10 Years)

Years Active: 1994-2024
Publications (10 Years): 10

Top Venues

CoRR

Comput.

ACM Trans. Comput. Log.

Inf. Comput.

University of Hagen, Germany (PHD)

Education History

University of Hagen, Germany

PHD

Publications

Peter Hertling, Philip Janicki
Nearly computable real numbers. Comput. 13 (1) (2024)
Peter Hertling, Philip Janicki
Nearly Computable Real Numbers. CoRR (2023)
Peter Hertling
Remarks on the effective Jordan decomposition. Theor. Comput. Sci. 940 (Part) (2023)
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) (2021)
Peter Hertling
Forests describing Wadge degrees and topological Weihrauch degrees of certain classes of functions and relations. Comput. 9 (3-4) (2020)
Peter Hertling, Gisela Krommes
EXPSPACE-Completeness of the Logics K4xS5 and S4xS5 and the Logic of Subset Spaces, Part 1: ESPACE-Algorithms. CoRR (2019)
Peter Hertling, Gisela Krommes
EXPSPACE-Completeness of the Logics K4xS5 and S4xS5 and the Logic of Subset Spaces, Part 2: EXPSPACE-Hardness. CoRR (2019)
Peter Hertling
Clarke's generalized gradient and Edalat's L-derivative. J. Log. Anal. 9 (2017)
Peter Hertling
Two Counterexamples Concerning the Scott Topology on a Partial Order. CoRR (2016)
Volker Bosserhoff, Peter Hertling
. Inf. Comput. 245 (2015)
Peter Hertling, Christoph Spandl
Computing a Solution of Feigenbaum's Functional Equation in Polynomial Time. Log. Methods Comput. Sci. 10 (4) (2014)
Peter Hertling, Victor L. Selivanov
Complexity Issues for Preorders on Finite Labeled Forests. CiE (2011)
Andrej Bauer, Peter Hertling, Ker-I Ko
Computability and Complexity in Analysis. J. Univers. Comput. Sci. 16 (18) (2010)
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)
Andrej Bauer, Peter Hertling, Ker-I Ko
CCA 2009 Preface - Proceedings of the Sixth International Conference on Computability and Complexity in Analysis. CCA (2009)
Peter Hertling, Christoph Spandl
Shifts with Decidable Language and Non-Computable Entropy. Discret. Math. Theor. Comput. Sci. 10 (3) (2008)
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)
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)
Peter Hertling, Christoph Spandl
Computability Theoretic Properties of the Entropy of Gap Shifts. Fundam. Informaticae 83 (1-2) (2008)
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)
Peter Hertling
A sequentially computable function that is not effectively continuous at any point. J. Complex. 22 (6) (2006)
Vasco Brattka, Peter Hertling, Ker-I Ko, Hideki Tsuiki
Computability and complexity in analysis. J. Complex. 22 (6) (2006)
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)
Peter Hertling
Computable Analysis via Representations. CCA (2005)
Peter Hertling
A Banach-Mazur computable but not Markov computable function on the computable real numbers. Ann. Pure Appl. Log. 132 (2-3) (2005)
Peter Hertling
Nonrandom Sequences between Random Sequences. J. Univers. Comput. Sci. 11 (12) (2005)
Peter Hertling
Is the Mandelbrot set computable? Math. Log. Q. 51 (1) (2005)
Peter Hertling
A Sequentially Computable Function that is not Effectively Continous at any Point. CCA (2005)
Vasco Brattka, Peter Hertling, Ker-I Ko, Ning Zhong
Preface: MLQ - Math. Log. Quart. 4-5/2004. Math. Log. Q. 50 (4-5) (2004)
Peter Hertling, Klaus Weihrauch
Random elements in effective topological spaces with measure. Inf. Comput. 181 (1) (2003)
Peter Hertling
Topological Complexity of Zero Finding with Algebraic Operations. J. Complex. 18 (4) (2002)
Peter Hertling
A lower bound for range enclosure in interval arithmetic. Theor. Comput. Sci. 279 (1-2) (2002)
Peter Hertling
A Comparison of Certain Representations of Regularly Closed Sets. Electron. Notes Theor. Comput. Sci. 66 (1) (2002)
Vasco Brattka, Peter Hertling
Topological properties of real number representations. Theor. Comput. Sci. 284 (2) (2002)
Vasco Brattka, Peter Hertling, Mariko Yasugi, Ning Zhong
Preface: MLQ - Math. Log. Quart. Supplement 1/2002. Math. Log. Q. 48 (S1) (2002)
Peter Hertling
Simply Normal Numbers to Different Bases. J. Univers. Comput. Sci. 8 (2) (2002)
Peter Hertling
A Banach-Mazur Computable But Not Markov Computable Function on the Computable Real Numbers. ICALP (2002)
Peter Hertling
A Limitation for Underestimation Via Twin Arithmetic. Reliab. Comput. 7 (2) (2001)
Cristian Calude, Peter Hertling, Bakhadyr Khoussainov, Yongge Wang
Recursively enumerable reals and Chaitin Omega numbers. Theor. Comput. Sci. 255 (1-2) (2001)
Peter Hertling
Nonlinear Lebesgue and Ito^ Integration Problems of High Complexity. J. Complex. 17 (2) (2001)
Peter Hertling
Banach-Mazur Computable Functions on Metric Spaces. CCA (2000)
Peter Hertling
A Real Number Structure that is Effectively Categorical. Math. Log. Q. 45 (1999)
Peter Hertling
The Effective Riemann Mapping Theorem. Theor. Comput. Sci. 219 (1-2) (1999)
Peter Hertling, Klaus Weihrauch
Randomness Spaces. ICALP (1998)
Vasco Brattka, Peter Hertling
Feasible Real Random Access Machines. J. Complex. 14 (4) (1998)
Cristian Calude, Peter Hertling, Bakhadyr Khoussainov, Yongge Wang
Recursively Enumerable Reals and Chaitin Omega Numbers. STACS (1998)
Cristian Calude, Peter Hertling
Computable Approximations of Reals: An Information-Theoretic Analysis. Fundam. Informaticae 33 (2) (1998)
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) (1997)
Peter Hertling, Yongge Wang
Invariance Properties of Random Sequences. J. Univers. Comput. Sci. 3 (11) (1997)
Cristian Calude, Peter Hertling, Bakhadyr Khoussainov
Do the Zeros of Riemann's Zeta-Function Form a Random Sequence? Bull. EATCS 62 (1997)
Peter Hertling
Surjective Functions on Computably Growing Cantor Sets. J. Univers. Comput. Sci. 3 (11) (1997)
Peter Hertling
Disjunctive omega-Words and Real Numbers. J. Univers. Comput. Sci. 2 (7) (1996)
Peter Hertling
Topological Complexity with Continuous Operations. J. Complex. 12 (4) (1996)
Vasco Brattka, Peter Hertling
Feasible Real Random Access Machines. SOFSEM (1996)
Peter Hertling
Effectivity and Effective Continuity of Functions between Computable Metric Spaces. DMTCS (1996)
Peter Hertling
Computable Real Functions: Type 1 Computability Versus Type 2 Computability. CCA (1996)
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) (1996)
Peter Hertling, Klaus Weihrauch
Levels of Degeneracy and Exact Lower Complexity Bounds for Geometric Algorithms. CCCG (1994)

Peter Hertling.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Peter Hertling