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=205
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
General varieties of tree languages
Magnus Steinby
Theoretical Computer Science
205
(1-2), 1998, pp. 1-43
Hierarchy theorems for
k
OBDDs and
k
IBDDs
Beate Bollig
,
Martin Sauerhoff
,
Detlef Sieling
,
Ingo Wegener
Theoretical Computer Science
205
(1-2), 1998, pp. 45-60
On representing recursively enumerable languages by internal contextual languages
Andrzej Ehrenfeucht
,
Gheorghe Păun
,
Grzegorz Rozenberg
Theoretical Computer Science
205
(1-2), 1998, pp. 61-83
On the complexity of the
k
-chain subgraph cover problem
Chang-Wu Yu
,
Gen-Huey Chen
,
Tze-Heng Ma
Theoretical Computer Science
205
(1-2), 1998, pp. 85-98
Labelled trees and pairs of input-output permutations in priority queues
M. Golin
,
S. Zaks
Theoretical Computer Science
205
(1-2), 1998, pp. 99-114
Multidimensional interval routing schemes
Michele Flammini
,
Giorgio Gambosi
,
Umberto Nanni
,
Richard B. Tan
Theoretical Computer Science
205
(1-2), 1998, pp. 115-133
Ergodic characterization of linear cellular automata over
Z_m
Tadakazu Sato
Theoretical Computer Science
205
(1-2), 1998, pp. 135-144
Periodicities on trees
Dora Giammarresi
,
Sabrina Mantaci
,
Filippo Mignosi
,
Antonio Restivo
Theoretical Computer Science
205
(1-2), 1998, pp. 145-181
Parallel transient time of one-dimensional sand pile
J.O. Durand-Lose
Theoretical Computer Science
205
(1-2), 1998, pp. 183-193
Characterizations of recursively enumerable languages by means of insertion grammars
Carlos Martin-Vide
,
Gheorghe Păun
,
Arto Salomaa
Theoretical Computer Science
205
(1-2), 1998, pp. 195-205
On the equivalence problem for letter-to-letter top-down tree transducers
Yves Andre
,
Francis Bossut
Theoretical Computer Science
205
(1-2), 1998, pp. 207-229
Simulating the CRCW PRAM on reconfigurable networks
Biing-Feng Wang
Theoretical Computer Science
205
(1-2), 1998, pp. 231-242
Alphabet-independent optimal parallel search for three-dimensional patterns
Marek Karpinski
,
Wojciech Rytter
Theoretical Computer Science
205
(1-2), 1998, pp. 243-260
The parallel complexity of approximating the high degree subgraph problem
A.E. Andreev
,
A. Clementi
,
P. Crescenzi
,
E. Dahlhaus
,
S. de Agostino
,
J.D.P. Rolim
Theoretical Computer Science
205
(1-2), 1998, pp. 261-282
Adjoining to Wythoff's game its
P
-positions as moves
Aviezri S. Fraenkel
,
Michal Ozery
Theoretical Computer Science
205
(1-2), 1998, pp. 283-296
On the bound of the synchronization delay of a local automaton
Marie-Pierre Béal
,
Jean Senellart
Theoretical Computer Science
205
(1-2), 1998, pp. 297-306
Using fast matrix multiplication to find basic solutions
Peter A. Beling
,
Nimrod Megiddo
Theoretical Computer Science
205
(1-2), 1998, pp. 307-316
Boolean operations, joins, and the extended low hierarchy
Lane A. Hemaspaandra
,
Zhigen Jiang
,
Jörg Rothe
,
Osamu Watanabe
Theoretical Computer Science
205
(1-2), 1998, pp. 317-327
On rational series and rational languages
Huaxiong Wang
Theoretical Computer Science
205
(1-2), 1998, pp. 329-336
Unbordered factors of the characteristic sequences of irrational numbers
Wai-fong Chuan
Theoretical Computer Science
205
(1-2), 1998, pp. 337-344