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=Algorithmica AND Volume=42
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Key-independent optimality
John Iacono
Algorithmica
42
(1), 2005, pp. 3-10
Universal asymptotics for random tries and PATRICIA trees
Luc Devroye
Algorithmica
42
(1), 2005, pp. 11-29
Biased skip lists
Amitabha Bagchi
,
Adam L. Buchsbaum
,
Michael T. Goodrich
Algorithmica
42
(1), 2005, pp. 31-48
Queaps
John Iacono
,
Stefan Langerman
Algorithmica
42
(1), 2005, pp. 49-56
Characterizing history independent data structures
Jason D. Hartline
,
Edwin S. Hong
,
Alexander E. Mohr
,
William R. Pentney
,
Emily C. Rocke
Algorithmica
42
(1), 2005, pp. 57-74
Reconstructing curves without Delaunay computation
Sumanta Guha
,
Son Dinh Tran
Algorithmica
42
(1), 2005, pp. 75-94
Average-case competitive analyses for ski-rental problems
Hiroshi Fujiwara
,
Kazuo Iwama
Algorithmica
42
(1), 2005, pp. 95-107
Improved approximation algorithms for the quality of service multicast tree problem
Marek Karpinski
,
Ion I. Măndoiu
,
Alexander Olshevsky
,
Alexander Zelikovsky
Algorithmica
42
(2), 2005, pp. 109-120
Approximating maximum weight cycle covers in directed graphs with weights zero and one
Markus Bläser
,
Bodo Manthey
Algorithmica
42
(2), 2005, pp. 121-139
A fast, accurate, and simple method for pricing European-Asian and Saving-Asian options
Ken'ichiro Ohta
,
Kunihiko Sadakane
,
Akiyoshi Shioura
,
Takeshi Tokuyama
Algorithmica
42
(2), 2005, pp. 141-158
Drawing planar graphs symmetrically, II: Biconnected planar graphs
Seok-Hee Hong
,
Peter Eades
Algorithmica
42
(2), 2005, pp. 159-197
Near-linear time approximation algorithms for curve simplification
Pankaj K. Agarwal
,
Sariel Har-Peled
,
Nabil H. Mustafa
,
Yusu Wang
Algorithmica
42
(3-4), 2005, pp. 203-219
Approximation algorithms for a
k
-line center
Pankaj K. Agarwal
,
Cecilia M. Procopiuc
,
Kasturi R. Varadarajan
Algorithmica
42
(3-4), 2005, pp. 221-230
The
k
-splittable flow problem
Georg Baier
,
Ekkehard Köhler
,
Martin Skutella
Algorithmica
42
(3-4), 2005, pp. 231-248
Constructing plane spanners of bounded degree and low weight
Prosenjit Bose
,
Joachim Gudmundsson
,
Michiel Smid
Algorithmica
42
(3-4), 2005, pp. 249-264
Optimal terrain construction problems and applications in intensity-modulated radiation therapy
Danny Z. Chen
,
Xiaobo S. Hu
,
Shuang Luan
,
Xiadong Wu
,
Cedric X. Yu
Algorithmica
42
(3-4), 2005, pp. 265-288
A comparison of multicast pull models
Kirk R. Pruhs
,
Patchrawat Uthaisombut
Algorithmica
42
(3-4), 2005, pp. 289-307
Minimizing makespan and preemption costs on a system of uniform machines
Hadas Shachnai
,
Tami Tamir
,
Gerhard J. Woeginger
Algorithmica
42
(3-4), 2005, pp. 309-334