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=31
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Geometry helps in bottleneck matching and related problems
A. Efrat
,
A. Itai
,
M.J. Katz
Algorithmica
31
(1), 2001, pp. 1-28
On-line competitive algorithms for call admission in optical networks
B. Awerbuch
,
Y. Azar
,
A. Fiat
,
S. Leonardi
,
A. Rosén
Algorithmica
31
(1), 2001, pp. 29-43
Permutation routing on reconfigurable meshes
J.C. Cogolludo
,
S. Rajasekaran
Algorithmica
31
(1), 2001, pp. 44-57
Approximation algorithms for degree-constrained minimum-cost network-design problems
R. Ravi
,
M.V. Marathe
,
S.S. Ravi
,
D.J. Rosenkrantz
,
H.B. Hunt III
Algorithmica
31
(1), 2001, pp. 58-78
Inapproximability results for guarding polygons and terrains
S. Eidenbenz
,
C. Stamm
,
P. Widmayer
Algorithmica
31
(1), 2001, pp. 79-113
Bounded space on-line bin packing: Best is better than first
J. Csirik
,
D.S. Johnson
Algorithmica
31
(2), 2001, pp. 115-138
Uniquely restricted matchings
M.C. Golumbic
,
T. Hirst
,
M. Lewenstein
Algorithmica
31
(2), 2001, pp. 139-154
All-to-all optical routing in chordal rings of degree 4
L. Narayanan
,
J. Opatrny
,
D. Sotteau
Algorithmica
31
(2), 2001, pp. 155-178
An efficient output-size sensitive parallel algorithm for hidden-surface removal for terrains
N. Gupta
,
S. Sen
Algorithmica
31
(2), 2001, pp. 179-207
Searching for mobile intruders in a polygonal region by a group of mobile searchers
M. Yamashita
,
H. Umemoto
,
I. Suzuki
,
T. Kameda
Algorithmica
31
(2), 2001, pp. 208-236
Lopsided trees - I: Analysis
V. Choi
,
M.J. Golin
Algorithmica
31
(3), 2001, pp. 240-290
On the probabilistic worst-case time of ``find''
L. Devroye
Algorithmica
31
(3), 2001, pp. 291-303
The asymptotic number of leftist trees
M. Drmota
Algorithmica
31
(3), 2001, pp. 304-317
Average profile of the Lempel-Ziv parsing scheme for a Markovian source
P. Jacquet
,
W. Szpankowski
,
J. Tang
Algorithmica
31
(3), 2001, pp. 318-360
Analytic variations on the airy distribution
P. Flajolet
,
G. Louchard
Algorithmica
31
(3), 2001, pp. 361-377
Efficient reorganization of binary search trees
M. Hofri
,
H. Schachnai
Algorithmica
31
(3), 2001, pp. 378-402
A limit law for outputs in random recursive circuits
T. Tsukiji
,
H. Mahmoud
Algorithmica
31
(3), 2001, pp. 403-412
Exact largest and smallest size of components
D. Panario
,
B. Richmond
Algorithmica
31
(3), 2001, pp. 413-432
A
q
-analogue of the path length of binary search trees
H. Prodinger
Algorithmica
31
(3), 2001, pp. 433-441
Stochastic analysis of Shell Sort
R.T. Smythe
,
J. Wellner
Algorithmica
31
(3), 2001, pp. 442-457
Exact algorithms for linear programming over algebraic extensions
P.A. Beling
Algorithmica
31
(4), 2001, pp. 459-478
Grade of service Steiner minimum trees in the Euclidean plane
G. Xue
,
G.-H. Lin
,
D.-Z. Du
Algorithmica
31
(4), 2001, pp. 479-500
Relaxed balance using standard rotations
K.S. Larsen
,
E. Soisalon-Soininen
,
P. Widmayer
Algorithmica
31
(4), 2001, pp. 501-512
Bounding the inefficiency of lenght-restricted prefix codes
R.L. Milidiú
,
E.S. Laber
Algorithmica
31
(4), 2001, pp. 513-529
Reconstructing a minimum spanning tree after deletion of any node
B. Das
,
M.C. Loui
Algorithmica
31
(4), 2001, pp. 530-547