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=369
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Degrees of non-monotonicity for restarting automata
T. Jurdziński
,
F. Mraz
,
F. Otto
,
M. Plátek
Theoretical Computer Science
369
(1-3), 2006, pp. 1-34
Edge-bandwidth of grids and tori
Oleg Pikhurko
,
Jerzy Wojciechowski
Theoretical Computer Science
369
(1-3), 2006, pp. 35-43
Efficient sample sort and the average case analysis of PEsort
Jing-Chao Chen
Theoretical Computer Science
369
(1-3), 2006, pp. 44-66
Iterated sequential transducers as language generating devices
Henning Bordihn
,
Henning Fernau
,
Markus Holzer
,
Vincenzo Manca
,
Carlos Martín-Vide
Theoretical Computer Science
369
(1-3), 2006, pp. 67-81
Reasoning under minimal upper bounds in propositional logic
Thomas Eiter
,
Georg Gottlob
Theoretical Computer Science
369
(1-3), 2006, pp. 82-115
The price of anarchy for polynomial social cost
Martin Gairing
,
Thomas Lücking
,
Marios Mavronicolas
,
Burkhard Monien
Theoretical Computer Science
369
(1-3), 2006, pp. 116-135
On the intercluster distance of a tree metric
Bang Ye Wu
Theoretical Computer Science
369
(1-3), 2006, pp. 136-141
Low complexity classes of multidimensional cellular automata
Véronique Terrier
Theoretical Computer Science
369
(1-3), 2006, pp. 142-156
Truthful algorithms for scheduling selfish tasks on parallel machines
Eric Angel
,
Evripidis Bampis
,
Fanny Pascual
Theoretical Computer Science
369
(1-3), 2006, pp. 157-168
Visual cryptography schemes with optimal pixel expansion
Carlo Blundo
,
Stelvio Cimato
,
Alfredo De Santis
Theoretical Computer Science
369
(1-3), 2006, pp. 169-182
Algebraic properties of substitution on trajectories
Michael Domaratzki
,
Petr Sosík
,
Alfonso Rodríguez-Patón
Theoretical Computer Science
369
(1-3), 2006, pp. 183-196
Label updating to avoid point-shaped obstacles in fixed model
Farshad Rostamabadi
,
Mohammad Ghodsi
Theoretical Computer Science
369
(1-3), 2006, pp. 197-210
The complexity of membership problems for circuits over sets of integers
Stephen Travers
Theoretical Computer Science
369
(1-3), 2006, pp. 211-229
A fully polynomial approximation scheme for the single machine weighted total tardiness problem with a common due date
Hans Kellerer
,
Vitaly A. Strusevich
Theoretical Computer Science
369
(1-3), 2006, pp. 230-238
The degree distribution of the generalized duplication model
G. Bebek
,
P. Berenbrink
,
C. Cooper
,
T. Friedetzky
,
J. Nadeau
,
S.C. Sahinalp
Theoretical Computer Science
369
(1-3), 2006, pp. 239-249
List edge and list total colorings of planar graphs without 4-cycles
Jianfeng Hou
,
Guizhen Liu
,
Jiansheng Cai
Theoretical Computer Science
369
(1-3), 2006, pp. 250-255
Enumeration of subtrees of trees
Weigen Yan
,
Yeong-Nan Yeh
Theoretical Computer Science
369
(1-3), 2006, pp. 256-268
Sharing the cost of multicast transmissions in wireless networks
V. Bilò
,
M. Flammini
,
G. Melideo
,
L. Moscardelli
,
A. Navarra
Theoretical Computer Science
369
(1-3), 2006, pp. 269-284
On the remote server problem or more about TCP acknowledgments
Leah Epstein
,
Alex Kesselman
Theoretical Computer Science
369
(1-3), 2006, pp. 285-299
A geometric characterization of automatic semigroups
Michael Hoffmann
,
Richard M. Thomas
Theoretical Computer Science
369
(1-3), 2006, pp. 300-313
An algorithmic approach to the problem of a semiretract base
Wit Foryś
,
Tomasz Krawczyk
Theoretical Computer Science
369
(1-3), 2006, pp. 314-322
Scheduling resource allocation with timeslot penalty for changeover
Amrinder Arora
,
Fanchun Jin
,
Hyeong-Ah Choi
Theoretical Computer Science
369
(1-3), 2006, pp. 323-337
Complexity and approximability of
k
-splittable flows
Ronald Koch
,
Ines Spenke
Theoretical Computer Science
369
(1-3), 2006, pp. 338-347
Dynamic load balancing with group communication
Shlomi Dolev
,
Roberto Segala
,
Alexander Shvartsman
Theoretical Computer Science
369
(1-3), 2006, pp. 348-360
Constructive root bound for
k
-ary rational input numbers
Sylvain Pion
,
Chee K. Yap
Theoretical Computer Science
369
(1-3), 2006, pp. 361-376
Seiten 1
2
>