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=33
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Experimental analysis of heuristic algorithms for the dominating set problem
L.A. Sanchis
Algorithmica
33
(1), 2002, pp. 3-18
An experimental study of compression methods for dynamic tries
S. Nilsson
,
M. Tikkanen
Algorithmica
33
(1), 2002, pp. 19-33
An experimental study of algorithms for weighted completion time scheduling
I.D. Baev
,
W.M. Meleis
,
A. Eichenberger
Algorithmica
33
(1), 2002, pp. 34-51
A tutorial for designing flexible geometric algorithms
V. Kapoor
,
D. Kühl
,
A. Wolff
Algorithmica
33
(1), 2002, pp. 52-70
A neural algorithm for the maximum clique problem: Analysis, experiments, and circuit implementation
A. Bertoni
,
P. Campadelli
,
G. Grossi
Algorithmica
33
(1), 2002, pp. 71-88
Experimental performance of shared RSA modulus generation
R.N. Wright
,
S. Spalding
Algorithmica
33
(1), 2002, pp. 89-103
Efficient bulk operations on dynamic
R
-trees
L. Arge
,
K.H. Hinrichs
,
J. Vahrenhold
,
J.S. Vitter
Algorithmica
33
(1), 2002, pp. 104-128
Fault identification in system-level diagnosis: A logic-based framework and an
O(n^2\sqrt{tau}/\sqrt{\log n})
algorithm
B. Ayeb
Algorithmica
33
(2), 2002, pp. 129-149
Efficiently approximating polygonal paths in three and higher dimensions
G. Barequet
,
D.Z. Chen
,
O. Daescu
,
M.T. Goodrich
,
J. Snoeyink
Algorithmica
33
(2), 2002, pp. 150-167
Quasi-fully dynamic algorithmms for two-connectivity and cycle equivalence
M.R. Korupolu
,
V. Ramachandran
Algorithmica
33
(2), 2002, pp. 168-182
Efficient parallel graph algorithms for coarse-grained multicomputers and BSP
F. Dehne
,
A. Ferreira
,
E. Cáceres
,
S.W. Song
,
A. Roncato
Algorithmica
33
(2), 2002, pp. 183-200
Exact and approximation algorithms for clustering
P.K. Agarwal
,
C.M. Procopiuc
Algorithmica
33
(2), 2002, pp. 201-226
Computing approximate shortest paths on convex polytopes
P.K. Agarwal
,
S. Har-Peled
,
M. Karia
Algorithmica
33
(2), 2002, pp. 227-242
Augmenting trees to meet biconnectivity and diameter constraints
V. Cheopi
,
Y. Vaxes
Algorithmica
33
(2), 2002, pp. 243-262
Fast algorithms for approximating distances
S. Bespamyatnikh
,
M. Segal
Algorithmica
33
(2), 2002, pp. 263-269
Fast, fair and frugal bandwidth allocation in ATM networks
Y. Bartal
,
M. Farach-Colton
,
S. Yooseph
,
L. Zhang
Algorithmica
33
(3), 2002, pp. 272-286
Optimal online algorithms for an electronic commerce money distribution system
H. Kawazoe
,
T. Shibuya
,
T. Tokuyama
Algorithmica
33
(3), 2002, pp. 287-299
Exploiting regularities in web traffic patterns for cache replacement
E. Cohen
,
H. Kaplan
Algorithmica
33
(3), 2002, pp. 300-334
Extending greedy multicast routing to delay sensitive applications
A. Goel
,
K. Munagala
Algorithmica
33
(3), 2002, pp. 335-352
Caching for web searching
B. Kalyanasundaram
,
J. Noga
,
K.R. Pruhs
,
G.J. Woeginger
Algorithmica
33
(3), 2002, pp. 353-370
On-line file caching
N.E. Young
Algorithmica
33
(3), 2002, pp. 371-383
Page replacement with multi-size pages and applications to web caching
S. Irani
Algorithmica
33
(3), 2002, pp. 384-409
Some aperture-angle optimization problems
P. Bose
,
F. Hurtado-Diaz
,
E. Omaña-Pulido
,
J. Snoeyink
,
G.T. Toussaint
Algorithmica
33
(4), 2002, pp. 411-435
Optimal parallel randomized algorithms for the Voronoi diagram of line segments in the plane
S. Rajasekaran
,
S. Ramaswami
Algorithmica
33
(4), 2002, pp. 436-460
Fixed parameter algorithms for DOMINATING SET and related problems on planar graphs
J. Alber
,
H.L. Bodlaender
,
H. Fernau
,
T. Kloks
,
R. Niedermeier
Algorithmica
33
(4), 2002, pp. 461-493
Seiten 1
2
>