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=245
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Delay-insensitivity and ternary simulation
J.A. Brzozowski
Theoretical Computer Science
245
(1), 2000, pp. 3-25
On complete systems of automata
Pál Dömösi
,
Chrystopher L. Nehaniv
Theoretical Computer Science
245
(1), 2000, pp. 27-54
A hidden agenda
Joseph Goguen
,
Grant Malcolm
Theoretical Computer Science
245
(1), 2000, pp. 55-101
On the equivalence of the cube-product and the general product of automata
B. Imreh
Theoretical Computer Science
245
(1), 2000, pp. 103-113
Shuffle and scattered deletion closure of languages
Masami Ito
,
Lila Kari
,
Gabriel Thierrin
Theoretical Computer Science
245
(1), 2000, pp. 115-133
Programs over semigroups of dot-depth one
Alexis Maciel
,
Pierre Péladeau
,
Denis Thérien
Theoretical Computer Science
245
(1), 2000, pp. 135-148
Algorithms for the parallel alternating direction access machine
Bogdan S. Chlebus
,
Artur Czumaj
,
Leszek Ga̧sieniec
,
Mirosƚaw Kowaluk
,
Wojciech Plandowski
Theoretical Computer Science
245
(2), 2000, pp. 151-173
Periodic comparator networks
Brigitte Oesterdiekhoff
Theoretical Computer Science
245
(2), 2000, pp. 175-202
On the structure of minimum broadcast digraphs
Guillaume Fertin
Theoretical Computer Science
245
(2), 2000, pp. 203-216
A survey on interval routing
Cyril Gavoille
Theoretical Computer Science
245
(2), 2000, pp. 217-253
On the complexity of multi-dimensional interval routing schemes
Peter Ruz̑ic̑ka
,
Daniel S̑tefankovic̑
Theoretical Computer Science
245
(2), 2000, pp. 255-280
A new lower bound for the bipartite crossing number with applications
Farhad Shahrokhi
,
Ondrej Sýkora
,
László A. Székely
,
Imrich Vrt'o
Theoretical Computer Science
245
(2), 2000, pp. 281-294