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=J. Algorithms AND Volume=38
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Eliminating migration in multi-processor scheduling
Bala Kalyanasundaram
,
Kirk R. Pruhs
Journal of Algorithms
38
(1), 2001, pp. 2-24
Wavelength conversion in optical networks
Jon Kleinberg
,
Amit Kumar
Journal of Algorithms
38
(1), 2001, pp. 25-50
Cut tree algorithms: An experimental study
Andrew V. Goldberg
,
Kostas Tsioutsiouliklis
Journal of Algorithms
38
(1), 2001, pp. 51-83
A small approximately min-wise independent family of hash functions
Piotr Indyk
Journal of Algorithms
38
(1), 2001, pp. 84-90
Efficiently approximating the minimum-volume bounding box of a point set in three dimensions
Gill Barequet
,
Sariel Har-Peled
Journal of Algorithms
38
(1), 2001, pp. 91-109
Efficient algorithms for Petersen's matching theorem
Therese C. Biedl
,
Prosenjit Bose
,
Erik D. Demaine
,
Anna Lubiw
Journal of Algorithms
38
(1), 2001, pp. 110-134
Combinatorial approximation algorithms for generalized flow problems
Jeffrey D. Oldham
Journal of Algorithms
38
(1), 2001, pp. 135-169
Compact routing with minimum stretch
Lenore J. Cowen
Journal of Algorithms
38
(1), 2001, pp. 170-183
Median bounds and their application
Alan Siegel
Journal of Algorithms
38
(1), 2001, pp. 184-236
Constructing optimal trees from quartets
David Bryant
,
Mike Steel
Journal of Algorithms
38
(1), 2001, pp. 237-259
Placement algorithms for hierarchical cooperative caching
Madhukar R. Korupolu
,
C. Greg Plaxton
,
Rajmohan Rajaraman
Journal of Algorithms
38
(1), 2001, pp. 260-302
Balanced aspect ratio trees: Combining the advantages of
k-d
trees and octrees
Christian A. Duncan
,
Michael T. Goodrich
,
Stephen Kobourov
Journal of Algorithms
38
(1), 2001, pp. 303-333
All-pairs small-stretch paths
Edith Cohen
,
Uri Zwick
Journal of Algorithms
38
(2), 2001, pp. 335-353
An efficient
NC
algorithm for a sparse
k
-edge-connectivity certificate
Hiroshi Nagamochi
,
Toru Hasunuma
Journal of Algorithms
38
(2), 2001, pp. 354-373
En efficient exact algorithm for constraint bipartite vertex cover
Henning Fernau
,
Rolf Niedermeier
Journal of Algorithms
38
(2), 2001, pp. 374-410
On minimum edge ranking spanning trees
Kazuhisa Makino
,
Yushi Uno
,
Toshihide Ibaraki
Journal of Algorithms
38
(2), 2001, pp. 411-437
Approximation algorithms for dispersion problems
Barun Chandra
,
Magnús M. Halldórsson
Journal of Algorithms
38
(2), 2001, pp. 438-465