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=32
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A theoretical and experimental study on the construction of suffix arrays in external memory
A. Crauser
,
P. Ferragina
Algorithmica
32
(1), 2002, pp. 1-35
On-line multi-threaded paging
E. Feuerstein
,
A. Strejilevich de Loma
Algorithmica
32
(1), 2002, pp. 36-60
Fast parallel reordering and isomorphism testing of
k
-trees
J.G. Del Greco
,
C.N. Sekharan
,
R. Sridhar
Algorithmica
32
(1), 2002, pp. 61-72
The structure and complexity of sports elimination numbers
D. Gusfield
,
C. Martel
Algorithmica
32
(1), 2002, pp. 73-86
Algorithms for coloring quadtrees
D. Eppstein
,
M.W. Bern
,
B. Hutchings
Algorithmica
32
(1), 2002, pp. 87-94
Computing the cover array in linear time
Y. Li
,
W.F. Smyth
Algorithmica
32
(1), 2002, pp. 95-106
Interleaved prefetching
T. Kimbrel
Algorithmica
32
(1), 2002, pp. 107-122
Exploring unknown environments with obstacles
S. Albers
,
K. Kursawe
,
S. Schuierer
Algorithmica
32
(1), 2002, pp. 123-143
Improved algorithms for constructing fault-tolerant spanners
C. Levcopoulos
,
G. Narasimhan
,
M. Smit
Algorithmica
32
(1), 2002, pp. 144-156
A permanent algorithm with exp
[\Omega(n^{1/3}/2lnn)]
expected speedup for 0-1 matrices
E. Bax
,
J. Franklin
Algorithmica
32
(1), 2002, pp. 157-162
Optimal time-critical scheduling via resource augmentation
C.A. Phillips
,
C. Stein
,
E. Torng
,
J. Wein
Algorithmica
32
(2), 2002, pp. 163-200
On the competitive theory and practice of online list accessing algorithms
R. Bachrach
,
R. El-Yaniv
,
M. Reinstädtler
Algorithmica
32
(2), 2002, pp. 201-246
Scheduling independent multiprocessor tasks
A.K. Amoura
,
E. Bampis
,
C. Kenyon
,
Y. Manoussakis
Algorithmica
32
(2), 2002, pp. 247-261
A divide-and-conquer approach to the minimum
k
-way cut problem
Y. Kamidoi
,
S. Wakabayashi
,
N. Yoshida
Algorithmica
32
(2), 2002, pp. 262-276
New algorithms for disk scheduling
M. Andrews
,
M.A. Bender
,
L. Zhang
Algorithmica
32
(2), 2002, pp. 277-301
Property testing in bounded degree graphs
O. Goldreich
,
D. Ron
Algorithmica
32
(2), 2002, pp. 302-343
One-by-one cleaning for practical parallelist ranking
J.F. Sibeyn
Algorithmica
32
(3), 2002, pp. 345-363
Lower bounds for dynamaic data structures on algebraic RAMs
A.M. Ben-Amram
,
Z. Galil
Algorithmica
32
(3), 2002, pp. 364-395
Minimum congestion redundant assignments to tolerate random faults
D.A. Fotakis
,
P.G. Spirakis
Algorithmica
32
(3), 2002, pp. 396-422
Embedding linkages on an integer lattice
S. Landau
,
N. Immerman
Algorithmica
32
(3), 2002, pp. 423-436
A functional approach to external graph algorithms
J. Abello
,
A.L. Buchsbaum
,
J.R. Westbrook
Algorithmica
32
(3), 2002, pp. 437-458
Caching documents with variable sizes and fetching costs: An
LP
-based approach
E. Cohen
,
H. Kaplan
Algorithmica
32
(3), 2002, pp. 459-466
Routing flow through a strongly connected graph
T. Erlebach
,
T. Hagerup
Algorithmica
32
(3), 2002, pp. 467-473
Quasi-upward planarity
P. Bertolazzi
,
G. Di Battista
,
W. Didimo
Algorithmica
32
(3), 2002, pp. 474-506
Linear-time approximation schemes for scheduling malleable parallel tasks
K. Jansen
,
L. Porkolab
Algorithmica
32
(3), 2002, pp. 507-520
Seiten 1
2
>