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 YEAR=2005
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Simultaneous optimization for concave costs: Single sink aggregation or single source buy-at-bulk
Ashish Goel
,
Deborah Estrin
Algorithmica
43
(1-2), 2005, pp. 5-15
Building edge-failure resilient networks
Chandra Chekuri
,
A. Gupta
,
Amit Kumar
,
J. Naor
,
Danny Raz
Algorithmica
43
(1-2), 2005, pp. 17-41
Wavelength conversion in all-optical networks with shortest-path routing
Thomas Erlebach
,
Stamatis Stefanakos
Algorithmica
43
(1-2), 2005, pp. 43-61
Improved competitive guarantees for QoS buffering
Alex Kesselman
,
Yishay Mansour
,
Rob van Stee
Algorithmica
43
(1-2), 2005, pp. 63-80
Management of multi-queue switches in QoS networks
Yossi Azar
,
Yossi Richter
Algorithmica
43
(1-2), 2005, pp. 81-96
Adaptive AIMD congestion control
Alex Kesselman
,
Yishay Mansour
Algorithmica
43
(1-2), 2005, pp. 97-111
Better alternatives to OSFP routing
Jessica H. Fong
,
Anna C. Gilbert
,
Sampath Kannan
,
Martin J. Strauss
Algorithmica
43
(1-2), 2005, pp. 113-131
Effective routing and scheduling in adversarial queueing networks
Jay Sethuraman
,
Chung-Piaw Teo
Algorithmica
43
(1-2), 2005, pp. 133-146
A linear-time algorithm for 7-coloring 1-plane graphs
Zhi-Zhong Chen
,
Mitsuharu Kouno
Algorithmica
43
(3), 2005, pp. 147-177
Sparse normalized local alignment
Nadav Efraty
,
Gad M. Landau
Algorithmica
43
(3), 2005, pp. 179-194
Efficient collision detection among moving spheres with unknown trajectories
Ho Kyung Kim
,
Leonidas J. Guibas
,
Sung Yong Shin
Algorithmica
43
(3), 2005, pp. 195-210
Average case analysis of Gosper's algorithm for a class of urn model inputs
Olgica Milenkovic
,
Kevin J. Compton
Algorithmica
43
(3), 2005, pp. 211-244
Labeled search trees and amortized analysis: Improved upper bounds for
NP
-hard problems
Jianer Chen
,
Iyad A. Kanj
,
Ge Xia
Algorithmica
43
(4), 2005, pp. 245-273
Representing trees of higher degree
David Benoit
,
Erik D. Demaine
,
J. Ian Munro
,
Rajeev Raman
,
Venkatesh Raman
,
S. Srinivasa Rao
Algorithmica
43
(4), 2005, pp. 275-292
Rooted maximum agreement supertrees
Jesper Jansson
,
Joseph H.-K. Ng
,
Kunihiko Sadakane
,
Wing-Kin Sung
Algorithmica
43
(4), 2005, pp. 293-307
Optimal read-once parallel disk scheduling
Mahesh Kallahalla
,
Peter J. Varman
Algorithmica
43
(4), 2005, pp. 309-343
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
Seiten 1
2
3
>