Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Peter Hertling
2010 – today
- 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. UCS 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
- [e5]Andrej Bauer, Peter Hertling, Ker-I Ko (Eds.): 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
- 2008
- [j28]Peter Hertling, Christoph Spandl: Shifts with Decidable Language and Non-Computable Entropy. Discrete Mathematics & Theoretical Computer Science 10(3) (2008)
- [j27]Peter Hertling, Christoph Spandl: Computability Theoretic Properties of the Entropy of Gap Shifts. Fundam. Inform. 83(1-2): 141-157 (2008)
- [e4]Peter Hertling, Christoph M. Hoffmann, Wolfram Luther, Nathalie Revol (Eds.): 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
- 2006
- [j26]Vasco Brattka, Peter Hertling, Ker-I Ko, Hideki Tsuiki: Computability and complexity in analysis. J. Complexity 22(6): 728 (2006)
- [j25]Peter Hertling: A sequentially computable function that is not effectively continuous at any point. J. Complexity 22(6): 752-767 (2006)
- [c11]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
- [c10]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
- [e3]Peter Hertling, Christoph M. Hoffmann, Wolfram Luther, Nathalie Revol (Eds.): 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
- 2005
- [j24]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)
- [j23]
- [j22]
- [c9]Peter Hertling: A Sequentially Computable Function that is not Effectively Continous at any Point. CCA 2005: 131-148
- [c8]
- [e2]Tanja Grubba, Peter Hertling, Hideki Tsuiki, Klaus Weihrauch (Eds.): 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
- 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: A Comparison of Certain Representations of Regularly Closed Sets. Electr. Notes Theor. Comput. Sci. 66(1): 65-78 (2002)
- [j18]Peter Hertling: Topological Complexity of Zero Finding with Algebraic Operations. J. Complexity 18(4): 912-942 (2002)
- [j17]
- [j16]Vasco Brattka, Peter Hertling, Mariko Yasugi, Ning Zhong: Preface: MLQ - Math. Log. Quart. Supplement 1/2002. Math. Log. Q. 48(S1) (2002)
- [j15]Peter Hertling: A lower bound for range enclosure in interval arithmetic. Theor. Comput. Sci. 279(1-2): 83-95 (2002)
- [j14]Vasco Brattka, Peter Hertling: Topological properties of real number representations. Theor. Comput. Sci. 284(2): 241-257 (2002)
- [c7]Peter Hertling: A Banach-Mazur Computable But Not Markov Computable Function on the Computable Real Numbers. ICALP 2002: 962-972
- 2001
- [j13]Peter Hertling: Nonlinear Lebesgue and Ito^ Integration Problems of High Complexity. J. Complexity 17(2): 366-387 (2001)
- [j12]Peter Hertling: A Limitation for Underestimation Via Twin Arithmetic. Reliable Computing 7(2): 157-169 (2001)
- [j11]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 (Eds.): 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
- 2000
- [c6]
1990 – 1999
- 1999
- [j10]Peter Hertling: A Real Number Structure that is Effectively Categorical. Math. Log. Q. 45: 147-182 (1999)
- [j9]
- 1998
- [j8]Cristian Calude, Peter Hertling: Computable Approximations of Reals: An Information-Theoretic Analysis. Fundam. Inform. 33(2): 105-120 (1998)
- [j7]Vasco Brattka, Peter Hertling: Feasible Real Random Access Machines. J. Complexity 14(4): 490-526 (1998)
- [c5]
- [c4]Cristian Calude, Peter Hertling, Bakhadyr Khoussainov, Yongge Wang: Recursively Enumerable Reals and Chaitin Omega Numbers. STACS 1998: 596-606
- 1997
- [j6]Cristian Calude, Peter Hertling, Bakhadyr Khoussainov: Do the Zeros of Riemann's Zeta-Function Form a Random Sequence? Bulletin of the EATCS 62 (1997)
- [j5]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)
- [j4]Peter Hertling: Surjective Functions on Computably Growing Cantor Sets. J. UCS 3(11): 1226-1240 (1997)
- [j3]Peter Hertling, Yongge Wang: Invariance Properties of Random Sequences. J. UCS 3(11): 1241-1249 (1997)
- 1996
- [j2]Peter Hertling: Topological Complexity with Continuous Operations. J. Complexity 12(4): 315-338 (1996)
- [j1]
- [c3]Peter Hertling: Computable Real Functions: Type 1 Computability Versus Type 2 Computability. CCA 1996
- [c2]
- 1994
- [c1]Peter Hertling, Klaus Weihrauch: Levels of Degeneracy and Exact Lower Complexity Bounds for Geometric Algorithms. CCCG 1994: 237-242
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-10-02 11:14 CEST by the dblp team