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=209
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A partial
k
-arboretum of graphs with bounded treewidth
Hans L. Bodlaender
Theoretical Computer Science
209
(1-2), 1998, pp. 1-45
Non-commutative arithmetic circuits: Depth reduction and size lower bunds
Eric Allender
,
Jia Jiao
,
Meena Mahajan
,
V. Vinay
Theoretical Computer Science
209
(1-2), 1998, pp. 47-86
General in formation dispersal algorithms
Philippe Béguin
,
Antonella Cresti
Theoretical Computer Science
209
(1-2), 1998, pp. 87-105
Differential approximation algorithms for some combinatorial optimization problems
Marc Demange
,
Pascal Grisoni
,
Vangelis Th. Paschos
Theoretical Computer Science
209
(1-2), 1998, pp. 107-122
Threshold dominating sets and an improved characterization of
W[2]
Rodney G. Downey
,
Michael R. Fellows
Theoretical Computer Science
209
(1-2), 1998, pp. 123-140
Sample size lower bounds in PAC learning by algorithmic complexity theory
B. Apolloni
,
C. Gentile
Theoretical Computer Science
209
(1-2), 1998, pp. 141-162
On a question of A. Salomaa - The equational theory of regular expressions over a singleton alphabet is not finitely based
Luca Aceto
,
Wan Fokkink
,
Anna Ingólfsdóttir
Theoretical Computer Science
209
(1-2), 1998, pp. 163-178
Language complexity of rotations and Sturmian sequences
François Blanchard
,
Petr Kůrka
Theoretical Computer Science
209
(1-2), 1998, pp. 179-193
Communication complexity of fault-tolerant information diffusion
Luisa Gargano
,
Adele A. Rescigno
Theoretical Computer Science
209
(1-2), 1998, pp. 195-211
Team behaviour in eco-grammar systems
Erzsébet Csuhaj-Varjú
,
Alica Kelemenová
Theoretical Computer Science
209
(1-2), 1998, pp. 213-224
On the size of classes with weak membership properties
Marius Zimand
Theoretical Computer Science
209
(1-2), 1998, pp. 225-235
On the approximability of minimizing nonzero variables or unsatisfied relations in linear systems
Edoardo Amaldi
,
Viggo Kann
Theoretical Computer Science
209
(1-2), 1998, pp. 237-260
Combinatoire des motifs d'une suite Sturmienne bidimensionnelle
Laurent Vuillon
Theoretical Computer Science
209
(1-2), 1998, pp. 261-285
On the hardness of approximating shortest integer relations among rational numbers
Carsten Rössner
,
Jean-Pierre Seifert
Theoretical Computer Science
209
(1-2), 1998, pp. 287-297
Languages recognized by finite aperiodic groupoids
Martin Beaudry
Theoretical Computer Science
209
(1-2), 1998, pp. 299-317
On simulating non-returning PC grammar systems with returning systems
György Vaszil
Theoretical Computer Science
209
(1-2), 1998, pp. 319-329
A linear time algorithm for computing the most reliable source on a series-parallel graph with unreliable edges
Charles J. Colbourn
,
Guoliang Xue
Theoretical Computer Science
209
(1-2), 1998, pp. 331-345
On the hardness of allocating frequencies for hybrid networks
Ewa Malesińska
,
Alessandro Panconesi
Theoretical Computer Science
209
(1-2), 1998, pp. 347-363
On competitive on-line paging with lookahead
Dany Breslauer
Theoretical Computer Science
209
(1-2), 1998, pp. 365-375
Merit factors and Morse sequences
T. Downarowicz
,
Y. Lacroix
Theoretical Computer Science
209
(1-2), 1998, pp. 377-387
A lower bound for monotone arithmetic circuits computing 0-1 permanent
Rimli Sengupta
,
H. Venkateswaran
Theoretical Computer Science
209
(1-2), 1998, pp. 389-398