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=242
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Algorithms of distributed task allocation for cooperative agents
Sarit Kraus
,
Tatjana Plotkin
Theoretical Computer Science
242
(1-2), 2000, pp. 1-27
Presorting algorithms: An average-case point of view
Hsien-Kuei Hwang
,
Bo-Yin Yang
,
Yeong-Nan Yeh
Theoretical Computer Science
242
(1-2), 2000, pp. 29-40
Counting problems over the reals
Klaus Meer
Theoretical Computer Science
242
(1-2), 2000, pp. 41-58
On the size of parsers and LR(
k
)-grammars
Hing Leung
,
Detlef Wotschke
Theoretical Computer Science
242
(1-2), 2000, pp. 59-69
Effective decomposability of sequential behaviours
Antonín Kuc̑era
Theoretical Computer Science
242
(1-2), 2000, pp. 71-89
Suites équilibrées
P. Hubert
Theoretical Computer Science
242
(1-2), 2000, pp. 91-108
Strip tiling and regular grammars
Donatella Merlini
,
Renzo Sprugnoli
,
M. Cecilia Verri
Theoretical Computer Science
242
(1-2), 2000, pp. 109-124
A new algorithm for linear regular tree pattern matching
Priti Shankar
,
Amitranjan Gantait
,
A.R. Yuvaraj
,
Maya Madhavan
Theoretical Computer Science
242
(1-2), 2000, pp. 125-142
On the variance of the internal path length of generalized digital trees - The Mellin convolution approach
Friedrich Hubalek
Theoretical Computer Science
242
(1-2), 2000, pp. 143-168
On the complexity of coordinated display of multimedia objects
Martha L. Escobar-Molano
,
Shahram Ghandeharizadeh
Theoretical Computer Science
242
(1-2), 2000, pp. 169-197
The counting complexity of group-definable languages
V. Arvind
,
N.V. Vinodchandran
Theoretical Computer Science
242
(1-2), 2000, pp. 199-218
Finite nondeterministic automata: Simulation and minimality
Cristian S. Calude
,
Elena Calude
,
Bakhadyr Khoussainov
Theoretical Computer Science
242
(1-2), 2000, pp. 219-235
Fault tolerant
K
-center problems
Samir Khuller
,
Robert Pless
,
Yoram J. Sussmann
Theoretical Computer Science
242
(1-2), 2000, pp. 237-245
PSPACE-complete problems for subgroups of free groups and inverse finite automata
J.-C. Birget
,
S. Margolis
,
J. Meakin
,
P. Weil
Theoretical Computer Science
242
(1-2), 2000, pp. 247-281
Sturmian words and words with a critical exponent
Drew Vandeth
Theoretical Computer Science
242
(1-2), 2000, pp. 283-300
On hard instances
Martin Mundhenk
Theoretical Computer Science
242
(1-2), 2000, pp. 301-311
On the competitiveness of the move-to-front rule
Conrado Martínez
,
Salvador Roura
Theoretical Computer Science
242
(1-2), 2000, pp. 313-325
On lengths of words in context-free languages
Lucian Ilie
Theoretical Computer Science
242
(1-2), 2000, pp. 327-359
Families of locally testable languages
Pascal Caron
Theoretical Computer Science
242
(1-2), 2000, pp. 361-376
Tight bounds on the solutions of multidimensional divide-and-conquer maximin recurrences
Biing-Feng Wang
Theoretical Computer Science
242
(1-2), 2000, pp. 377-401
Parametrisation of solutions of parametric equation in free monoid
Gennady S. Makanin
,
Tatiana A. Makanina
Theoretical Computer Science
242
(1-2), 2000, pp. 403-475
A property of left-linear rewrite systems preserving recognizability
Pál Gyenizse
,
Sándor Vágvölgyi
Theoretical Computer Science
242
(1-2), 2000, pp. 477-498