Peter Hertling
Orcid: 0000-0002-4442-6711Affiliations:
- Universität der Bundeswehr München, Neubiberg, Germany
According to our database1,
Peter Hertling
authored at least 56 papers
between 1994 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
1995
2000
2005
2010
2015
2020
0
1
2
3
4
5
6
7
1
1
1
1
1
2
1
1
1
1
1
2
2
3
1
1
5
3
2
2
4
3
1
2
2
2
2
1
1
1
2
1
1
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on unibw.de
-
on orcid.org
-
on andrej.com
On csauthors.net:
Bibliography
2024
2023
2021
EXPSPACE-Completeness of the Logics K4 × S5 and S4 × S5 and the Logic of Subset Spaces.
ACM Trans. Comput. Log., 2021
2020
Forests describing Wadge degrees and topological Weihrauch degrees of certain classes of functions and relations.
Comput., 2020
2019
EXPSPACE-Completeness of the Logics K4xS5 and S4xS5 and the Logic of Subset Spaces, Part 2: EXPSPACE-Hardness.
CoRR, 2019
EXPSPACE-Completeness of the Logics K4xS5 and S4xS5 and the Logic of Subset Spaces, Part 1: ESPACE-Algorithms.
CoRR, 2019
2017
2016
2015
2014
Log. Methods Comput. Sci., 2014
Proceedings of the Logic, Computation, Hierarchies, 2014
2011
Proceedings of the Models of Computation in Context, 2011
2010
2009
CCA 2009 Preface - Proceedings of the Sixth International Conference on Computability and Complexity in Analysis.
Proceedings of the Sixth International Conference on Computability and Complexity in Analysis, 2009
CCA 2009 Front Matter - Proceedings of the Sixth International Conference on Computability and Complexity in Analysis.
Proceedings of the Sixth International Conference on Computability and Complexity in Analysis, 2009
2008
Fundam. Informaticae, 2008
Discret. Math. Theor. Comput. Sci., 2008
08271 Executive Summary - Topological and Game-Theoretic Aspects of Infinite Computations.
Proceedings of the Topological and Game-Theoretic Aspects of Infinite Computations, 29.06., 2008
08271 Abstracts Collection - Topological and Game-Theoretic Aspects of Infinite Computations.
Proceedings of the Topological and Game-Theoretic Aspects of Infinite Computations, 29.06., 2008
2006
J. Complex., 2006
06021 Abstracts Collection -- Reliable Implementation of Real Number Algorithms: Theory and Practice.
Proceedings of the Reliable Implementation of Real Number Algorithms: Theory and Practice, 08.01., 2006
06021 Summary -- Reliable Implementation of Real Number Algorithms: Theory and Practice.
Proceedings of the Reliable Implementation of Real Number Algorithms: Theory and Practice, 08.01., 2006
2005
A Banach-Mazur computable but not Markov computable function on the computable real numbers.
Ann. Pure Appl. Log., 2005
Computable Analysis via Representations.
Proceedings of the CCA 2005, 2005
A Sequentially Computable Function that is not Effectively Continous at any Point.
Proceedings of the CCA 2005, 2005
2004
2003
2002
Proceedings of the Computability and Complexity in Analysis, 2002
2001
J. Complex., 2001
2000
Proceedings of the Computability and Complexity in Analysis, 4th International Workshop, 2000
1999
1998
Fundam. Informaticae, 1998
Proceedings of the Automata, Languages and Programming, 25th International Colloquium, 1998
1997
J. Univers. Comput. Sci., 1997
Representing Variable-Length Codes in Fixed-Length T-Depletion Format in Encoders and Decoders.
J. Univers. Comput. Sci., 1997
Do the Zeros of Riemann's Zeta-Function Form a Random Sequence?
Bull. EATCS, 1997
1996
IEEE Trans. Robotics Autom., 1996
Effectivity and Effective Continuity of Functions between Computable Metric Spaces.
Proceedings of the First Conference of the Centre for Discrete Mathematics and Theoretical Computer Science, 1996
Computable Real Functions: Type 1 Computability Versus Type 2 Computability.
Proceedings of the Second Workshop on Computability and Complexity in Analysis, 1996
1994
Levels of Degeneracy and Exact Lower Complexity Bounds for Geometric Algorithms.
Proceedings of the 6th Canadian Conference on Computational Geometry, 1994