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
[1]
Hilfe
Suche: Journal=Theor.~Comput.~Sci. AND Volume=359
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
DLS-trees: A model of evolutionary scenarios
Paweƚ Górecki
,
Jerzy Tiuryn
Theoretical Computer Science
359
(1-3), 2006, pp. 378-399
Approximation schemes for scheduling and covering on unrelated machines
Pavlos S. Efraimidis
,
Paul G. Spirakis
Theoretical Computer Science
359
(1-3), 2006, pp. 400-417
The conference call search problem in wireless networks
Leah Epstein
,
Asaf Levin
Theoretical Computer Science
359
(1-3), 2006, pp. 418-429
New resource augmentation analysis of the total stretch of SRPT and SJF in multiprocessor scheduling
Wun-Tat Chan
,
Tak-Wah Lam
,
Kin-Shing Liu
,
Prudence W.H. Wong
Theoretical Computer Science
359
(1-3), 2006, pp. 430-439
Application of Kolmogorov complexity and universal codes to identity testing and nonparametric testing of serial independence for time series
Boris Ryabko
,
Jaakko Astola
,
Alex Gammerman
Theoretical Computer Science
359
(1-3), 2006, pp. 440-448
Completing codes and the Rédei property of groups
Sándor Szabó
Theoretical Computer Science
359
(1-3), 2006, pp. 449-454
An efficient approach for the rank aggregation problem
Liviu P. Dinu
,
Florin Manea
Theoretical Computer Science
359
(1-3), 2006, pp. 455-461
Seiten
<
1
2