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=Algorithmica AND Volume=56
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Approximation algorithms for treewidth
Eyal Amir
Algorithmica
56
(4), 2010, pp. 448-479
Capabilities and limits of compact error resilience methods for algorithmic self-assembly
Sudheer Sahu
,
John H. Reif
Algorithmica
56
(4), 2010, pp. 480-504
Bin packing with rejection revisited
Leah Epstein
Algorithmica
56
(4), 2010, pp. 505-528
Approximate
k
-Steiner forests via the Lagrangian relaxation technique with internal preprocessing
Danny Segev
,
Gil Segev
Algorithmica
56
(4), 2010, pp. 529-549
A timing assumption and two
t
-resilient protocols for implementing an eventual leader service in asynchronous shared memory systems
Antonio Fernández
,
Ernesto Jiménez
,
Michel Raynal
,
Gilles Trédan
Algorithmica
56
(4), 2010, pp. 550-576
\l_2^2
spreading metrics for vertex ordering problems
Moses Charikar
,
Mohammad Taghi Hajiaghayi
,
Howard Karloff
,
Satish Rao
Algorithmica
56
(4), 2010, pp. 577-604
Random matrices and codes for the erasure channel
Chris Studholme
,
Ian F. Blake
Algorithmica
56
(4), 2010, pp. 605-620
Seiten
<
1
2