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
[2]
Hilfe
Suche: Journal=Theor.~Comput.~Sci. AND Volume=299
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
An asymptotic study for path reversal
Alain Giorgetti
Theoretical Computer Science
299
(1-3), 2003, pp. 585-602
Idempotent and co-idempotent stack filters and min-max operators
Marcel Wild
Theoretical Computer Science
299
(1-3), 2003, pp. 603-631
Hybrid modes in cooperating distributed grammar systems: Combining the
t
-mode with the modes
\leq k
and
=k
H. Fernau
,
M. Holzer
,
R. Freund
Theoretical Computer Science
299
(1-3), 2003, pp. 633-662
On the closure properties of linear conjunctive languages
Alexander Okhotin
Theoretical Computer Science
299
(1-3), 2003, pp. 663-685
Eliminating the storage tape inreachability constructions
Oscar H. Ibarra
,
Zhe Dang
Theoretical Computer Science
299
(1-3), 2003, pp. 687-706
On finding common neighborhoods in massive graphs
Adam L. Buchsbaum
,
Raffaele Giancarlo
,
Jeffery R. Westbrook
Theoretical Computer Science
299
(1-3), 2003, pp. 707-718
Algorithms for vertex-partitioning problems on graphs with fixed clique-width
Michael U. Gerber
,
Daniel Kobler
Theoretical Computer Science
299
(1-3), 2003, pp. 719-734
Some complexity results for polynomial rational expressions
P.-C. Héam
Theoretical Computer Science
299
(1-3), 2003, pp. 735-741
Regular component decomposition of regular languages
Y.J. Liu
Theoretical Computer Science
299
(1-3), 2003, pp. 743-749
The minimum broadcast range assignment problem on linear multi-hop wireless networks
Andrea E.F. Clementi
,
Miriam Di Ianni
,
Riccardo Silvestri
Theoretical Computer Science
299
(1-3), 2003, pp. 751-761
On maximal suffixes and constant-space linear-time versions of KMP algorithm
Wojciech Rytter
Theoretical Computer Science
299
(1-3), 2003, pp. 763-774
Bilateral locally testable languages
Pedro García
,
José Ruiz
,
Manuel Vazquez de Parga
Theoretical Computer Science
299
(1-3), 2003, pp. 775-783
PC grammar systems with five context-free components generate all recursively enumberable languages
Erzsébet Csuhaj-Varjú
,
Gheorghe Păun
,
György Vaszil
Theoretical Computer Science
299
(1-3), 2003, pp. 785-794
Seiten
<
1
2