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 YEAR=2006
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
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
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
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
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
On a question of Leiss regarding the Hanoi tower problem
D. Azriel
,
D. Berend
Theoretical Computer Science
369
(1-3), 2006, pp. 377-383
Partial multicuts in trees
Asaf Levin
,
Danny Segev
Theoretical Computer Science
369
(1-3), 2006, pp. 384-395
Coding with variable block maps
Vicente Acuña
,
Gilles Didier
,
Alejandro Maass
Theoretical Computer Science
369
(1-3), 2006, pp. 396-405
Two algebraic approaches to variants of the concatenation product
Mário J.J. Branco
Theoretical Computer Science
369
(1-3), 2006, pp. 406-426
Pairwise edge disjoint shortest paths in the
n
-cube
Teofilo F. Gonzalez
,
David Serena
Theoretical Computer Science
369
(1-3), 2006, pp. 427-435
A note on ambiguity of internal contextual grammars
Lakshmanan Kuppusamy
Theoretical Computer Science
369
(1-3), 2006, pp. 436-441
Cost distribution of the Chang-Roberts leader election algorithm and related problems
Wei-Mei Chen
Theoretical Computer Science
369
(1-3), 2006, pp. 442-447
Seiten 1
2
3
4
5
6
7
8
9
10
11
12
>