Peter Hertling

68 papers A* 2A 1B 1C 12Journal 41Unranked 6

Year	Rank	Type	Title / Venue / Authors
2025	C	`conf`	Binary Expansions of Regular Reals and Reordered Computable Numbers. CiE Peter Hertling, Philip Janicki
2025	J	`jnl`	Regainingly Approximable numbers and Sets. J. Symb. Log. Peter Hertling, Rupert Hölzl, Philip Janicki
2024	J	`jnl`	Nearly computable real numbers. Comput. Peter Hertling, Philip Janicki
2023	J	`jnl`	Nearly Computable Real Numbers. CoRR Peter Hertling, Philip Janicki
2023	J	`jnl`	Remarks on the effective Jordan decomposition. Theor. Comput. Sci. Peter Hertling
2021	J	`jnl`	EXPSPACE-Completeness of the Logics K4 × S5 and S4 × S5 and the Logic of Subset Spaces. ACM Trans. Comput. Log. Peter Hertling, Gisela Krommes
2020	J	`jnl`	Forests describing Wadge degrees and topological Weihrauch degrees of certain classes of functions and relations. Comput. Peter Hertling
2019	J	`jnl`	EXPSPACE-Completeness of the Logics K4xS5 and S4xS5 and the Logic of Subset Spaces, Part 1: ESPACE-Algorithms. CoRR Peter Hertling, Gisela Krommes
2019	J	`jnl`	EXPSPACE-Completeness of the Logics K4xS5 and S4xS5 and the Logic of Subset Spaces, Part 2: EXPSPACE-Hardness. CoRR Peter Hertling, Gisela Krommes
2017	J	`jnl`	Clarke's generalized gradient and Edalat's L-derivative. J. Log. Anal. Peter Hertling
2016	J	`jnl`	Two Counterexamples Concerning the Scott Topology on a Partial Order. CoRR Peter Hertling
2015	J	`jnl`	Effective subsets under homeomorphisms of R Inf. Comput. Volker Bosserhoff, Peter Hertling
2014	—	`ch.`	Complexity issues for Preorders on finite labeled forests. Logic, Computation, Hierarchies Peter Hertling, Victor L. Selivanov
2014	J	`jnl`	Computing a Solution of Feigenbaum's Functional Equation in Polynomial Time. Log. Methods Comput. Sci. Peter Hertling, Christoph Spandl
2011	C	`conf`	Complexity Issues for Preorders on Finite Labeled Forests. CiE Peter Hertling, Victor L. Selivanov
2010	J	`jnl`	Computability and Complexity in Analysis. J. Univers. Comput. Sci. Andrej Bauer, Peter Hertling, Ker-I Ko
2009	C	`conf`	CCA 2009 Front Matter - Proceedings of the Sixth International Conference on Computability and Complexity in Analysis. CCA Andrej Bauer, Peter Hertling, Ker-I Ko
2009	C	`conf`	CCA 2009 Preface - Proceedings of the Sixth International Conference on Computability and Complexity in Analysis. CCA Andrej Bauer, Peter Hertling, Ker-I Ko
2009	C	`ed.`	Sixth International Conference on Computability and Complexity in Analysis, CCA 2009, Ljubljana, Slovenia, August 18-22, 2009 CCA Andrej Bauer, Peter Hertling, Ker-I Ko
2008	—	`conf`	08271 Abstracts Collection - Topological and Game-Theoretic Aspects of Infinite Computations. Topological and Game-Theoretic Aspects of Infinite Computations Peter Hertling, Victor L. Selivanov, Wolfgang Thomas, William W. Wadge, Klaus W. Wagner
2008	—	`conf`	08271 Executive Summary - Topological and Game-Theoretic Aspects of Infinite Computations. Topological and Game-Theoretic Aspects of Infinite Computations Peter Hertling, Victor L. Selivanov, Wolfgang Thomas, William W. Wadge, Klaus W. Wagner
2008	J	`jnl`	Computability Theoretic Properties of the Entropy of Gap Shifts. Fundam. Informaticae Peter Hertling, Christoph Spandl
2008	—	`ed.`	Reliable Implementation of Real Number Algorithms: Theory and Practice, International Seminar Dagstuhl Castle, Germany, January 8-13, 2006, Revised Papers Reliable Implementation of Real Number Algorithms Peter Hertling, Christoph M. Hoffmann, Wolfram Luther, Nathalie Revol
2008	J	`jnl`	Shifts with Decidable Language and Non-Computable Entropy. Discret. Math. Theor. Comput. Sci. Peter Hertling, Christoph Spandl
2008	—	`ed.`	Topological and Game-Theoretic Aspects of Infinite Computations, 29.06. - 04.07.2008 Topological and Game-Theoretic Aspects of Infinite Computations Peter Hertling, Victor L. Selivanov, Wolfgang Thomas, William W. Wadge, Klaus W. Wagner
2006	—	`conf`	06021 Abstracts Collection -- Reliable Implementation of Real Number Algorithms: Theory and Practice. Reliable Implementation of Real Number Algorithms Peter Hertling, Christoph M. Hoffmann, Wolfram Luther, Nathalie Revol
2006	—	`conf`	06021 Summary -- Reliable Implementation of Real Number Algorithms: Theory and Practice. Reliable Implementation of Real Number Algorithms Peter Hertling, Christoph M. Hoffmann, Wolfram Luther, Nathalie Revol
2006	J	`jnl`	A sequentially computable function that is not effectively continuous at any point. J. Complex. Peter Hertling
2006	J	`jnl`	Computability and complexity in analysis. J. Complex. Vasco Brattka, Peter Hertling, Ker-I Ko, Hideki Tsuiki
2006	—	`ed.`	Reliable Implementation of Real Number Algorithms: Theory and Practice, 08.01. - 13.01.2006 Reliable Implementation of Real Number Algorithms Peter Hertling, Christoph M. Hoffmann, Wolfram Luther, Nathalie Revol
2005	J	`jnl`	A Banach-Mazur computable but not Markov computable function on the computable real numbers. Ann. Pure Appl. Log. Peter Hertling
2005	C	`conf`	A Sequentially Computable Function that is not Effectively Continous at any Point. CCA Peter Hertling
2005	C	`ed.`	CCA 2005 - Second International Conference on Computability and Complexity in Analysis, August 25-29, 2005, Kyoto, Japan CCA Tanja Grubba, Peter Hertling, Hideki Tsuiki, Klaus Weihrauch
2005	C	`conf`	Computable Analysis via Representations. CCA Peter Hertling
2005	J	`jnl`	Is the Mandelbrot set computable? Math. Log. Q. Peter Hertling
2005	J	`jnl`	Nonrandom Sequences between Random Sequences. J. Univers. Comput. Sci. Peter Hertling
2004	J	`jnl`	Preface: MLQ - Math. Log. Quart. 4-5/2004. Math. Log. Q. Vasco Brattka, Peter Hertling, Ker-I Ko, Ning Zhong
2003	J	`jnl`	Random elements in effective topological spaces with measure. Inf. Comput. Peter Hertling, Klaus Weihrauch
2002	A*	`conf`	A Banach-Mazur Computable But Not Markov Computable Function on the Computable Real Numbers. ICALP Peter Hertling
2002	C	`conf`	A Comparison of Certain Representations of Regularly Closed Sets. CCA Peter Hertling
2002	J	`jnl`	A lower bound for range enclosure in interval arithmetic. Theor. Comput. Sci. Peter Hertling
2002	J	`jnl`	Preface: MLQ - Math. Log. Quart. Supplement 1/2002. Math. Log. Q. Vasco Brattka, Peter Hertling, Mariko Yasugi, Ning Zhong
2002	J	`jnl`	Simply Normal Numbers to Different Bases. J. Univers. Comput. Sci. Peter Hertling
2002	J	`jnl`	Topological Complexity of Zero Finding with Algebraic Operations. J. Complex. Peter Hertling
2002	J	`jnl`	Topological properties of real number representations. Theor. Comput. Sci. Vasco Brattka, Peter Hertling
2001	J	`jnl`	A Limitation for Underestimation Via Twin Arithmetic. Reliab. Comput. Peter Hertling
2001	C	`ed.`	Computability and Complexity in Analysis, 4th International Workshop, CCA 2000, Swansea, UK, September 17-19, 2000, Selected Papers CCA Jens Blanck, Vasco Brattka, Peter Hertling
2001	J	`jnl`	Nonlinear Lebesgue and Ito^ Integration Problems of High Complexity. J. Complex. Peter Hertling
2001	J	`jnl`	Recursively enumerable reals and Chaitin Omega numbers. Theor. Comput. Sci. Cristian Calude, Peter Hertling, Bakhadyr Khoussainov, Yongge Wang
2000	C	`conf`	Banach-Mazur Computable Functions on Metric Spaces. CCA Peter Hertling
1999	J	`jnl`	A Real Number Structure that is Effectively Categorical. Math. Log. Q. Peter Hertling
1999	J	`jnl`	The Effective Riemann Mapping Theorem. Theor. Comput. Sci. Peter Hertling
1998	J	`jnl`	Computable Approximations of Reals: An Information-Theoretic Analysis. Fundam. Informaticae Cristian Calude, Peter Hertling
1998	J	`jnl`	Feasible Real Random Access Machines. J. Complex. Vasco Brattka, Peter Hertling
1998	A*	`conf`	Randomness Spaces. ICALP Peter Hertling, Klaus Weihrauch
1998	A	`conf`	Recursively Enumerable Reals and Chaitin Omega Numbers. STACS Cristian Calude, Peter Hertling, Bakhadyr Khoussainov, Yongge Wang
1997	J	`jnl`	Do the Zeros of Riemann's Zeta-Function Form a Random Sequence? Bull. EATCS Cristian Calude, Peter Hertling, Bakhadyr Khoussainov
1997	J	`jnl`	Invariance Properties of Random Sequences. J. Univers. Comput. Sci. Peter Hertling, Yongge Wang
1997	J	`jnl`	Representing Variable-Length Codes in Fixed-Length T-Depletion Format in Encoders and Decoders. J. Univers. Comput. Sci. Ulrich Günther, Peter Hertling, Radu Nicolescu, Mark R. Titchener
1997	J	`jnl`	Surjective Functions on Computably Growing Cantor Sets. J. Univers. Comput. Sci. Peter Hertling
1996	C	`conf`	Computable Real Functions: Type 1 Computability Versus Type 2 Computability. CCA Peter Hertling
1996	J	`jnl`	Disjunctive omega-Words and Real Numbers. J. Univers. Comput. Sci. Peter Hertling
1996	—	`conf`	Effectivity and Effective Continuity of Functions between Computable Metric Spaces. DMTCS Peter Hertling
1996	B	`conf`	Feasible Real Random Access Machines. SOFSEM Vasco Brattka, Peter Hertling
1996	J	`jnl`	Task curve planning for painting robots. I. Process modeling and calibration. IEEE Trans. Robotics Autom. Peter Hertling, Lars Hog, Rune Larsen, John W. Perram, Henrik Gordon Petersen
1996	J	`jnl`	Topological Complexity with Continuous Operations. J. Complex. Peter Hertling
1996	—	`—`	Unstetigkeitsgrade von Funktionen in der effektiven Analysis. Peter Hertling
1994	—	`conf`	Levels of Degeneracy and Exact Lower Complexity Bounds for Geometric Algorithms. CCCG Peter Hertling, Klaus Weihrauch