Peter Hertling

	2009
46		Andrej Bauer, Peter Hertling, Ker-I Ko: Sixth International Conference on Computability and Complexity in Analysis, CCA 2009, August 18-22, 2009, Ljubljana, Slovenia Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany 2009
45		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
44		Andrej Bauer, Peter Hertling, Ker-I Ko: CCA 2009 Preface - Proceedings of the Sixth International Conference on Computability and Complexity in Analysis. CCA 2009
	2008
43		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 Springer 2008
42		Peter Hertling, Christoph Spandl: Shifts with Decidable Language and Non-Computable Entropy. Discrete Mathematics & Theoretical Computer Science 10(3): (2008)
41		Peter Hertling, Christoph Spandl: Computability Theoretic Properties of the Entropy of Gap Shifts. Fundam. Inform. 83(1-2): 141-157 (2008)
	2006
40		Peter Hertling, Christoph M. Hoffmann, Wolfram Luther, Nathalie Revol: Reliable Implementation of Real Number Algorithms: Theory and Practice, 08.01. - 13.01.2006 Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2006
39		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
38		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
37		Vasco Brattka, Peter Hertling, Ker-I Ko, Hideki Tsuiki: Computability and complexity in analysis. J. Complexity 22(6): 728 (2006)
36		Peter Hertling: A sequentially computable function that is not effectively continuous at any point. J. Complexity 22(6): 752-767 (2006)
	2005
35		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 FernUniversität Hagen, Germany 2005
34		Peter Hertling: A Sequentially Computable Function that is not Effectively Continous at any Point. CCA 2005: 131-148
33		Peter Hertling: Computable Analysis via Representations. CCA 2005: 377
32		Peter Hertling: A Banach-Mazur computable but not Markov computable function on the computable real numbers. Ann. Pure Appl. Logic 132(2-3): 227-246 (2005)
31		Peter Hertling: Nonrandom Sequences between Random Sequences. J. UCS 11(12): 1970-1985 (2005)
30		Peter Hertling: Is the Mandelbrot set computable? Math. Log. Q. 51(1): 5-18 (2005)
	2004
29		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
28		Peter Hertling, Klaus Weihrauch: Random elements in effective topological spaces with measure. Inf. Comput. 181(1): 32-56 (2003)
	2002
27		Peter Hertling: A Banach-Mazur Computable But Not Markov Computable Function on the Computable Real Numbers. ICALP 2002: 962-972
26		Peter Hertling: A Comparison of Certain Representations of Regularly Closed Sets. Electr. Notes Theor. Comput. Sci. 66(1): (2002)
25		Peter Hertling: Topological Complexity of Zero Finding with Algebraic Operations. J. Complexity 18(4): 912-942 (2002)
24		Peter Hertling: Simply Normal Numbers to Different Bases. J. UCS 8(2): 235-242 (2002)
23		Vasco Brattka, Peter Hertling, Mariko Yasugi, Ning Zhong: Preface: MLQ - Math. Log. Quart. Supplement 1/2002. Math. Log. Q. 48(S1): (2002)
22		Peter Hertling: A lower bound for range enclosure in interval arithmetic. Theor. Comput. Sci. 279(1-2): 83-95 (2002)
21		Vasco Brattka, Peter Hertling: Topological properties of real number representations. Theor. Comput. Sci. 284(2): 241-257 (2002)
	2001
20		Jens Blanck, Vasco Brattka, Peter Hertling: Computability and Complexity in Analysis, 4th International Workshop, CCA 2000, Swansea, UK, September 17-19, 2000, Selected Papers Springer 2001
19		Peter Hertling: Nonlinear Lebesgue and Ito^ Integration Problems of High Complexity. J. Complexity 17(2): 366-387 (2001)
18		Peter Hertling: A Limitation for Underestimation Via Twin Arithmetic. Reliable Computing 7(2): 157-169 (2001)
17		Cristian Calude, Peter Hertling, Bakhadyr Khoussainov, Yongge Wang: Recursively enumerable reals and Chaitin Omega numbers. Theor. Comput. Sci. 255(1-2): 125-149 (2001)
	2000
16		Peter Hertling: Banach-Mazur Computable Functions on Metric Spaces. CCA 2000: 69-81
	1999
15		Peter Hertling: A Real Number Structure that is Effectively Categorical. Math. Log. Q. 45: 147-182 (1999)
14		Peter Hertling: The Effective Riemann Mapping Theorem. Theor. Comput. Sci. 219(1-2): 225-265 (1999)
	1998
13		Peter Hertling, Klaus Weihrauch: Randomness Spaces. ICALP 1998: 796-807
12		Cristian Calude, Peter Hertling, Bakhadyr Khoussainov, Yongge Wang: Recursively Enumerable Reals and Chaitin Omega Numbers. STACS 1998: 596-606
11		Cristian Calude, Peter Hertling: Computable Approximations of Reals: An Information-Theoretic Analysis. Fundam. Inform. 33(2): 105-120 (1998)
10		Vasco Brattka, Peter Hertling: Feasible Real Random Access Machines. J. Complexity 14(4): 490-526 (1998)
	1997
9		Cristian Calude, Peter Hertling, Bakhadyr Khoussainov: Do the Zeros of Riemann's Zeta-Function Form a Random Sequence? Bulletin of the EATCS 62: (1997)
8		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. UCS 3(11): 1207-1225 (1997)
7		Peter Hertling: Surjective Functions on Computably Growing Cantor Sets. J. UCS 3(11): 1226-1240 (1997)
6		Peter Hertling, Yongge Wang: Invariance Properties of Random Sequences. J. UCS 3(11): 1241-1249 (1997)
	1996
5		Peter Hertling: Computable Real Functions: Type 1 Computability Versus Type 2 Computability. CCA 1996
4		Vasco Brattka, Peter Hertling: Feasible Real Random Access Machines. SOFSEM 1996: 335-342
3		Peter Hertling: Topological Complexity with Continuous Operations. J. Complexity 12(4): 315-338 (1996)
2		Peter Hertling: Disjunctive omega-Words and Real Numbers. J. UCS 2(7): 549-568 (1996)
	1994
1		Peter Hertling, Klaus Weihrauch: Levels of Degeneracy and Exact Lower Complexity Bounds for Geometric Algorithms. CCCG 1994: 237-242

Coauthor Index

1	Andrej Bauer	[44] [45] [46]
2	Jens Blanck	[20]
3	Vasco Brattka	[4] [10] [20] [21] [23] [29] [37]
4	Cristian S. Calude (Cristian Calude)	[9] [11] [12] [17]
5	Tanja Grubba	[35]
6	Ulrich Günther	[8]
7	Christoph M. Hoffmann	[38] [39] [40] [43]
8	Bakhadyr Khoussainov	[9] [12] [17]
9	Ker-I Ko	[29] [37] [44] [45] [46]
10	Wolfram Luther	[38] [39] [40] [43]
11	Radu Nicolescu	[8]
12	Nathalie Revol	[38] [39] [40] [43]
13	Christoph Spandl	[41] [42]
14	Mark R. Titchener	[8]
15	Hideki Tsuiki	[35] [37]
16	Yongge Wang	[6] [12] [17]
17	Klaus Weihrauch	[1] [13] [28] [35]
18	Mariko Yasugi	[23]
19	Ning Zhong	[23] [29]

Colors in the list of coauthors