Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[1]
Hilfe
Suche: Author="Hertling, Peter"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A sequentially computable function that is not effectively continuous at any point
Peter Hertling
Journal of Complexity
22
(6), 2006, pp. 752-767
Random elements in effective topological spaces with measure
Peter Hertling
,
Klaus Weihrauch
Information and Computation
181
(1), 2003, pp. 32-56
Topological properties of real numer representations
Vasco Brattka
,
Peter Hertling
Theoretical Computer Science
284
(2), 2002, pp. 241-257
Topological complexity of zero finding with algebraic operations
Peter Hertling
Journal of Complexity
18
(4), 2002, pp. 912-942
A Banach-Mazur computable but not Markov computable function on the computable real numbers
Peter Hertling
Lecture Notes in Computer Science
2380
, 2002, pp. 962-972
A lower bound for range enclosure in interval arithmetic
Peter Hertling
Theoretical Computer Science
279
(1-2), 2002, pp. 83-95
Recursively enumberable reals and Chaitin
\Omega
numbers
Cristian S. Calude
,
Peter H. Hertling
,
Bakhadyr Khoussainov
,
Yongge Wang
Theoretical Computer Science
255
(1-2), 2001, pp. 125-149
Nonlinear Lebesgue and Itô integration problems of high complexity
Peter Hertling
Journal of Complexity
17
(2), 2001, pp. 366-387
An effective Riemann mapping theorem
Peter Hertling
Theoretical Computer Science
219
(1-2), 1999, pp. 225-265
Feasible real random access machines
Vasco Brattka
,
Peter Hertling
Journal of Complexity
14
(4), 1998, pp. 490-526
Recursively enumerable reals and Chaitin
\Omega
numbers
Cristian S. Calude
,
Peter H. Hertling
,
Bakhadyr Khoussainov
,
Yongge Wang
Lecture Notes in Computer Science
1373
, 1998, pp. 596-606
Randomness spaces
Peter Hertling
,
Klaus Weihrauch
Lecture Notes in Computer Science
1443
, 1998, pp. 796-807
Topological complexity with continuous operations
Peter Hertling
Journal of Complexity
12
(4), 1996, pp. 315-338
Feasible real random access machines
Vasko Brattka
,
Peter Hertling
Workshop on Computability and Complexity in Analysis (FernUniversität Hagen, Germany, August 19-20, 1995) (190-9/1995), 1995, pp. 71-82