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=221
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Worst-case hardness suffices for derandomization: A new method for hardness-randomness trade-offs
Alexander E. Andreev
,
Andrea E.F. Clementi
,
José D.P. Rolim
Theoretical Computer Science
221
(1-2), 1999, pp. 3-18
On-line routing in all-optical networks
Yair Bartal
,
Stefano Leonardi
Theoretical Computer Science
221
(1-2), 1999, pp. 19-39
Enumerative sequences of leaves and nodes in rational trees
Frédérique Bassino
,
Marie-Pierre Béal
,
Dominique Perrin
Theoretical Computer Science
221
(1-2), 1999, pp. 41-60
Tilings and quasiperiodicity
Bruno Durand
Theoretical Computer Science
221
(1-2), 1999, pp. 61-75
A few logs suffice to build (almost) all trees: Part II
Péter L. Erdŏs
,
Michael A. Steel
,
László A. Székely
,
Tandy J. Warnow
Theoretical Computer Science
221
(1-2), 1999, pp. 77-118
Optimal wavelength routing on directed fiber trees
Thomas Erlebach
,
Klaus Jansen
,
Christos Kaklamanis
,
Milena Mihail
,
Pino Persiano
Theoretical Computer Science
221
(1-2), 1999, pp. 119-137
Improving spanning trees by upgrading nodes
Sven O. Krumke
,
Hartmut Noltemeier
,
Hans-C. Wirth
,
Madhav V. Marathe
,
R. Ravi
,
S.S. Ravi
,
R. Sundaram
Theoretical Computer Science
221
(1-2), 1999, pp. 139-155
A complete and efficiently computable topological classification of
D
-dimensional linear cellular automata over
Z_m
Giovanni Manzini
,
Luciano Margara
Theoretical Computer Science
221
(1-2), 1999, pp. 157-177
The essence of constraint propagation
Krzysztof R. Apt
Theoretical Computer Science
221
(1-2), 1999, pp. 179-210
Symbolic reachability analysis of FIFO-channel systems with nonregular sets of configurations
Ahmed Bouajjani
,
Peter Habermehl
Theoretical Computer Science
221
(1-2), 1999, pp. 211-250
Model checking the full modal mu-calculus for infinite sequential processes
Olaf Burkart
,
Bernhard Steffen
Theoretical Computer Science
221
(1-2), 1999, pp. 251-270
Bisimulation for probabilistic transition systems: A coalgebraic approach
E.P. de Vink
,
J.J.M.M. Rutten
Theoretical Computer Science
221
(1-2), 1999, pp. 271-293
An abstract data type for real numbers
Pietro di Gianantonio
Theoretical Computer Science
221
(1-2), 1999, pp. 295-326
Variations on mobile processes
Yuxi Fu
Theoretical Computer Science
221
(1-2), 1999, pp. 327-368
Discrete-time control for rectangular hybrid automata
Thomas A. Henzinger
,
Peter W. Kopke
Theoretical Computer Science
221
(1-2), 1999, pp. 369-392
Game-theoretic analysis of call-by-value computation
Kohei Honda
,
Nobuko Yoshida
Theoretical Computer Science
221
(1-2), 1999, pp. 393-456
The name discipline of uniform receptiveness
Davide Sangiorgi
Theoretical Computer Science
221
(1-2), 1999, pp. 457-493