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 YEAR=1999
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
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
Limit values of the recurrence quotient of Sturmian sequences
Julien Cassaigne
Theoretical Computer Science
218
(1), 1999, pp. 3-12
On the combinatorics of finite words
Aldo de Luca
Theoretical Computer Science
218
(1), 1999, pp. 13-39
Lyndon words and singular factors of Sturmian words
Guy Melançon
Theoretical Computer Science
218
(1), 1999, pp. 41-59
On Abelian squares and substitutions
Arturo Carpi
Theoretical Computer Science
218
(1), 1999, pp. 61-81
Fine and Wilf's theorem for three periods and a generalization of Sturmian words
M. Gabriella Castelli
,
Filippo Mignosi
,
Antonio Restivo
Theoretical Computer Science
218
(1), 1999, pp. 83-94
The exact number of squares in Fibonacci words
Aviezri S. Fraenkel
,
Jamie Simpson
Theoretical Computer Science
218
(1), 1999, pp. 95-106
Maximal bifix codes
Véronique Bruyère
,
Dominique Perrin
Theoretical Computer Science
218
(1), 1999, pp. 107-121
Generalized factorizations of words and their algorithmic properties
Juhani Karhumäki
,
Wojciech Plandowski
,
Wojciech Rytter
Theoretical Computer Science
218
(1), 1999, pp. 123-133
Partial words and a theorem of fine and Wilf
Jean Berstel
,
Luc Boasson
Theoretical Computer Science
218
(1), 1999, pp. 135-141
Transcendence of formal power series with rational coefficients
J.-P. Allouche
Theoretical Computer Science
218
(1), 1999, pp. 143-160
On repetition-free binary words of minimal density
Roman Kolpakov
,
Gregory Kucherov
,
Yuri Tarannikov
Theoretical Computer Science
218
(1), 1999, pp. 161-175
Complexity for finite factors of infinite sequences
Sébastien Ferenczi
,
Zoltán Kása
Theoretical Computer Science
218
(1), 1999, pp. 177-195
Constant-space string-matching in sublinear average time
Maxime Crochemore
,
Leszek Ga̧sieniec
,
Wojciech Rytter
Theoretical Computer Science
218
(1), 1999, pp. 197-203
Quasiperiodicity and string covering
Costas S. Iliopoulos
,
Laurent Mouchard
Theoretical Computer Science
218
(1), 1999, pp. 205-216
Random generation of trees and other combinatorial objects
Elena Barcucci
,
Alberto del Lungo
,
Elisa Pergola
Theoretical Computer Science
218
(2), 1999, pp. 219-232
Seiten
<
1
2
3
4
5
6
7
8
9
10
>