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
Hilfe
Suche: Journal=Theor.~Comput.~Sci. AND Volume=219
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On the inductive inference of recursive real-valued functions
Kalvis Apsītis
,
Setsuo Arikawa
,
Rūsiņs̑ Freivalds
,
Eiju Hirowatari
,
Carl H. Smith
Theoretical Computer Science
219
(1-2), 1999, pp. 3-17
Effective domain representations of
{\cal H}(X)
, the space of compact subsets
Jens Blanck
Theoretical Computer Science
219
(1-2), 1999, pp. 19-48
Equality is a jump
Paolo Boldi
,
Sebastiano Vigna
Theoretical Computer Science
219
(1-2), 1999, pp. 49-64
Computability on subsets of Euclidean space I: Closed and compact subsets
Vasco Brattka
,
Klaus Weihrauch
Theoretical Computer Science
219
(1-2), 1999, pp. 65-93
Constructive mathematics: A foundation for computable analysis
Douglas S. Bridges
Theoretical Computer Science
219
(1-2), 1999, pp. 95-109
Index sets in computable analysis
Douglas Cenzer
,
Jeffrey B. Remmel
Theoretical Computer Science
219
(1-2), 1999, pp. 111-150
Analytic machines
Thomas Chadzelek
,
Günter Hotz
Theoretical Computer Science
219
(1-2), 1999, pp. 151-167
Computable Banach spaces via domain theory
Abbas Edalat
,
Philipp Süderhauf
Theoretical Computer Science
219
(1-2), 1999, pp. 169-184
On approximate and algebraic computability over the real numbers
Armin Hemmerling
Theoretical Computer Science
219
(1-2), 1999, pp. 185-223
An effective Riemann mapping theorem
Peter Hertling
Theoretical Computer Science
219
(1-2), 1999, pp. 225-265
Markov's constructive analysis; A participant's view
Boris A. Kushner
Theoretical Computer Science
219
(1-2), 1999, pp. 267-285
Computability on random variables
Norbert Th. Müüler
Theoretical Computer Science
219
(1-2), 1999, pp. 287-299
On the cost of uniform and nonuniform algorithms
Erich Novak
,
Henryk Woźniakowski
Theoretical Computer Science
219
(1-2), 1999, pp. 301-318
From axiomatics to intrinsic characterization: Some open problems in computable analysis
Marian Boykan Pour-El
Theoretical Computer Science
219
(1-2), 1999, pp. 319-329
Online computations of differentiable functions
Matthias Schröder
Theoretical Computer Science
219
(1-2), 1999, pp. 331-345
Concrete models of computation for topological algebras
Viggo Stoltenberg-Hansen
,
John V. Tucker
Theoretical Computer Science
219
(1-2), 1999, pp. 347-378
Computation by ``While'' programs on topological partial algebras
J.V. Tucker
,
J.I. Zucker
Theoretical Computer Science
219
(1-2), 1999, pp. 379-420
Computability on the probability measures on the Borel sets of the unit interval
Klaus Weihrauch
Theoretical Computer Science
219
(1-2), 1999, pp. 421-437
Effectiveness of the global modulus of continuity on metric spaces
Klaus Weihrauch
,
Xizhong Zheng
Theoretical Computer Science
219
(1-2), 1999, pp. 439-450
Why does information-based complexity use the real number model?
Henryk Woźniakowski
Theoretical Computer Science
219
(1-2), 1999, pp. 451-465
Effective properties of sets and functions in metric spaces with computability structure
Mariko Yasugi
,
Takakazu Mori
,
Yoshiki Tsujii
Theoretical Computer Science
219
(1-2), 1999, pp. 467-486
Computability structure of the Sobolev spaces and its applications
Ning Zhong
Theoretical Computer Science
219
(1-2), 1999, pp. 487-510