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=143
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Characterizations of rational
\omega
-languages by means of right congruences
Do Long Van
,
Bertrand Le Saëc
,
Igor Litovsky
Theoretical Computer Science
143
(1), 1995, pp. 1-21
Nondeterministic, probabilistic and alternating computations on cellular array models
Kamala Krithivasan
,
Meena Mahajan
Theoretical Computer Science
143
(1), 1995, pp. 23-49
Rewriting extended regular expressions
Valentin M. Antimirov
,
Peter D. Mosses
Theoretical Computer Science
143
(1), 1995, pp. 51-72
Parallel interval order recognition and construction of interval representations
Michael A. Bender
,
Michel Gastaldo
,
Michel Morvan
Theoretical Computer Science
143
(1), 1995, pp. 73-91
The complexity of pursuit on a graph
Arthur S. Goldstein
,
Edward M. Reingold
Theoretical Computer Science
143
(1), 1995, pp. 93-112
Mathematical games: The complexity of pursuit on a graph
Arthur S. Goldstein
,
Edward M. Reingold
Theoretical Computer Science
143
(1), 1995, pp. 93-112
Shortest consistent superstrings computable in polynomial time
Tao Jiang
,
Vadim G. Timkovsky
Theoretical Computer Science
143
(1), 1995, pp. 113-122
Optimal simulation of two-dimensional alternating finite automata by three-way nondeterministic Turing machines
Akira Ito
,
Katsushi Inoue
,
Itsuo Takanami
,
Yue Wang
Theoretical Computer Science
143
(1), 1995, pp. 123-135
Alignment of trees - an alternative to tree edit
Tao Jiang
,
Lusheng Wang
,
Kaizhong Zhang
Theoretical Computer Science
143
(1), 1995, pp. 137-148
Weak completeness in
E
and
E_2
David W. Juedes
,
Jack H. Lutz
Theoretical Computer Science
143
(1), 1995, pp. 149-158
Reversible simulation of space-bounded computations
Pierluigi Crescenzi
,
Christos H. Papadimitriou
Theoretical Computer Science
143
(1), 1995, pp. 159-165
On the cell probe complexity of polynomial evaluation
Peter Bro Miltersen
Theoretical Computer Science
143
(1), 1995, pp. 167-174
Minimal path length of trees with known fringe
Roberto de Prisco
,
Giuseppe Parlati
,
Giuseppe Persiano
Theoretical Computer Science
143
(1), 1995, pp. 175-188
Graphs generalizing closed curves with linear construction of the Hamiltonian cycle: Parametrization of discretized curves
Rémy Malgouyres
Theoretical Computer Science
143
(2), 1995, pp. 189-249
Recursive construction of periodic steady state for neural networks
Martín Matamala
Theoretical Computer Science
143
(2), 1995, pp. 251-267
Dynamical properties of
PWD0L
systems
John Harrison
Theoretical Computer Science
143
(2), 1995, pp. 269-284
Deterministic top-down tree transducers with iterated look-ahead
Giora Slutzki
,
Sándor Vágvölgyi
Theoretical Computer Science
143
(2), 1995, pp. 285-308
The maximal
f
-dependent set problem for planar graphs is in
NC
Zhi-Zhong Chen
Theoretical Computer Science
143
(2), 1995, pp. 309-318
Modular Nim
Aviezri S. Fraenkel
,
Alan Jaffray
,
Anton Kotzig
,
Gert Sabidussi
Theoretical Computer Science
143
(2), 1995, pp. 319-333
Mathematical games: Modular Nim
Aviezri S. Fraenkel
,
Alan Jaffray
,
Anton Kotzig
,
Gert Sabidussi
Theoretical Computer Science
143
(2), 1995, pp. 319-333
A nonlinear lower bound on the practical combinational complexity
Xaver Gubás̆
,
Juraj Hromkovic̆
,
Juraj Waczulík
Theoretical Computer Science
143
(2), 1995, pp. 335-342
Context-free recognition via shortest paths computation: A version of Valiant's algorithm
Wojciech Rytter
Theoretical Computer Science
143
(2), 1995, pp. 343-352
On the approximation of longest common nonsupersequences and shortest common nonsubsequences
Louxin Zhang
Theoretical Computer Science
143
(2), 1995, pp. 353-362