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.
Progressive solutions to a parallel automata equation
Khaled El-Fakih
,
Nina Yevtushenko
,
Sergey Buffalov
,
Gregor von Bochmann
Theoretical Computer Science
362
(1-3), 2006, pp. 17-32
If
P \neq NP
then some strongly noninvertible functions are invertible
Lane A. Hemaspaandra
,
Kari Pasanen
,
Jörg Rothe
Theoretical Computer Science
362
(1-3), 2006, pp. 54-62
Parity graph-driven read-once branching programs and an exponential lower bound for integer multiplication
Beate Bollig
,
Stephan Waack
,
Philipp Woelfel
Theoretical Computer Science
362
(1-3), 2006, pp. 86-99
Learning in varieties of the form V*LI from positive data
Pedro Garcíia
,
Jose Ruiz
Theoretical Computer Science
362
(1-3), 2006, pp. 100-114
Scheduling linear deteriorating jobs with an availability constraint on a single machine
Min Ji
,
Yong He
,
T.C.E. Cheng
Theoretical Computer Science
362
(1-3), 2006, pp. 115-126
The maximum resource bin packing problem
Joan Boyar
,
Leah Epstein
,
Lene M. Favrholdt
,
Jens S. Kohrt
,
Kim S. Larsen
,
Morten M. Pedersen
,
Sanne Whlk
Theoretical Computer Science
362
(1-3), 2006, pp. 127-139
Improved algorithms for the
k
maximum-sums problems
Chih-Huai Cheng
,
Kuan-Yu Chen
,
Wen-Chin Tien
,
Kun-Mao Chao
Theoretical Computer Science
362
(1-3), 2006, pp. 162-170
Deterministic M2M multicast in radio networks
Leszek Ga̧sieniec
,
Evangelos Kranakis
,
Andrzej Pelc
,
Qin Xin
Theoretical Computer Science
362
(1-3), 2006, pp. 196-206
Word problems recognisable by deterministic blind monoid automata
Mark Kambites
Theoretical Computer Science
362
(1-3), 2006, pp. 232-237
Utilization of nonclairvoyant online schedules
Mohamed Eid Hussein
,
Uwe Schwiegelshohn
Theoretical Computer Science
362
(1-3), 2006, pp. 238-247
Longest repeats with a block of
k
don't cares
Maxime Crochemore
,
Costas S. Iliopoulos
,
Manal Mohamed
,
Marie-France Sagot
Theoretical Computer Science
362
(1-3), 2006, pp. 248-254
Compatible topologies on graphs: An application to graph isomorphism problem complexity
Alain Bretto
,
Alain Faisant
,
Thierry Vallée
Theoretical Computer Science
362
(1-3), 2006, pp. 255-272
Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs
T.C.E. Cheng
,
C.T. Ng
,
J.J. Yuan
Theoretical Computer Science
362
(1-3), 2006, pp. 273-281
Weighted multirecombination evolution strategies
Dirk V. Arnold
Theoretical Computer Science
361
(1), 2006, pp. 18-37
How the (1+1) ES using isotropic mutations minimizes positive definite quadratic forms
Jens Jägersküpper
Theoretical Computer Science
361
(1), 2006, pp. 38-56
Efficient approximation algorithms for the achromatic number
Piotr Krysta
,
Krzysztof Loryś
Theoretical Computer Science
361
(2-3), 2006, pp. 150-171
Correlation clustering in general weighted graphs
Erik D. Demaine
,
Dotan Emanuel
,
Amos Fiat
,
Nicole Immorlica
Theoretical Computer Science
361
(2-3), 2006, pp. 172-187
Asymmetry in
k
-center variants
Inge Li Grtz
,
Anthony Wirth
Theoretical Computer Science
361
(2-3), 2006, pp. 188-199
Tradeoffs in worst-case equilibria
Baruch Awerbuch
,
Yossi Azar
,
Yossi Richter
,
Dekel Tsur
Theoretical Computer Science
361
(2-3), 2006, pp. 200-209
A
\frac{5}{4}
-approximation algorithm for scheduling identical malleable tasks
T. Decker
,
T. Lücking
,
B. Monien
Theoretical Computer Science
361
(2-3), 2006, pp. 226-240
Open block scheduling in optical communication networks
A.A. Ageev
,
A.V. Fishkin
,
A.V. Kononov
,
S.V. Sevastyanov
Theoretical Computer Science
361
(2-3), 2006, pp. 257-274
Incremental algorithms for Facility Location and
k
-median
Dimitris Fotakis
Theoretical Computer Science
361
(2-3), 2006, pp. 275-313
Load balancing of temporary tasks in the
l_p
norm
Yossi Azar
,
Amir Epstein
,
Leah Epstein
Theoretical Computer Science
361
(2-3), 2006, pp. 314-328
How to whack moles
Sandra Gutiérrez
,
Sven O. Krumke
,
Nicole Megow
,
Tjark Vredeveld
Theoretical Computer Science
361
(2-3), 2006, pp. 329-341
Online searching with turn cost
Erik D. Demaine
,
Sandor P. Fekete
,
Shmuel Gal
Theoretical Computer Science
361
(2-3), 2006, pp. 342-355
Seiten
<
1
2
3
4
5
6
7
8
9
10
11
12
>