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=21
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Fast generation of random permutations via networks simulation
A. Czumaj
,
P. Kanarek
,
M. Kutyƚowski
,
K. Loryś
Algorithmica
21
(1), 1998, pp. 2-20
Greedy algorithms for the shortest common superstring that are asymptotically optimal
A. Frieze
,
W. Szpankowski
Algorithmica
21
(1), 1998, pp. 21-36
The analysis of linear probing hashing with buckets
A. Viola
,
P.V. Poblete
Algorithmica
21
(1), 1998, pp. 37-71
Parallel approximation algorithms by positive linear programming
L. Trevisan
Algorithmica
21
(1), 1998, pp. 72-88
Matching convex shapes with respect to the symmetric difference
H. Alt
,
U. Fuchs
,
G. Rote
,
G. Weber
Algorithmica
21
(1), 1998, pp. 89-103
On-line and off-line approximation algorithms for vector covering problems
N. Alon
,
Y. Azar
,
J. Csirik
,
L. Epstein
,
S.V. Sevastianov
,
A.P.A. Vestjens
,
G.J. Woeginger
Algorithmica
21
(1), 1998, pp. 104-118
On minimum-area hulls
E.M. Arkin
,
Y.-J. Chiang
,
M. Held
,
J.S.B. Mitchell
,
V. Sacristan
,
S.S. Skiena
,
T.-C. Yang
Algorithmica
21
(1), 1998, pp. 119-136
Lempel-Ziv index for
q
-grams
J. Kärkkäinen
,
E. Sutinen
Algorithmica
21
(1), 1998, pp. 137-154
Interval routing schemes
P. Fraigniaud
,
C. Gavoille
Algorithmica
21
(2), 1998, pp. 155-182
Finding largest subtrees and smallest supertrees
A. Gupta
,
N. Nishimura
Algorithmica
21
(2), 1998, pp. 183-210
Finding all minimal shapes in a routing channel
L.-F. Chao
,
A. LaPaugh
Algorithmica
21
(2), 1998, pp. 211-244
On-line load balancing and network flow
S. Phillips
,
J. Westbrook
Algorithmica
21
(3), 1998, pp. 245-261
Mapping clones with a given ordering or interleaving
Tao Jiang
,
R.M. Karp
Algorithmica
21
(3), 1998, pp. 262-284
A linear-time approximation scheme for minimum weight triangulation of convex polygons
C. Levcopoulos
,
D. Krznaric
Algorithmica
21
(3), 1998, pp. 285-311
Average case analysis of list update algorithms, with applications to data compression
S. Albers
,
M. Mitzenmacher
Algorithmica
21
(3), 1998, pp. 312-329
Computing Betti numbers via combinatorial Laplacians
J. Friedman
Algorithmica
21
(4), 1998, pp. 331-346
A lower bound for nearly minimal adaptive and hot potato algorithms
I. Ben-Aroya
,
D.D. Chinn
,
A. Schuster
Algorithmica
21
(4), 1998, pp. 347-376
On certificates and lookahead in dynamic graph problems
S. Khanna
,
R. Motwani
,
R.H. Wilson
Algorithmica
21
(4), 1998, pp. 377-394
Approximating biconnectivity in parallel
Wong Chong Ka
,
Tak Wah Lam
Algorithmica
21
(4), 1998, pp. 395-410