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=24
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Constructing a tree from homeomorphic subtrees, with applications to computational evolutionary biology
M.R. Henzinger
,
V. King
,
T. Warnow
Algorithmica
24
(1), 1999, pp. 1-13
Efficiency of randomized parallel backtrack search
Yanjun Zhang
,
A. Ortynski
Algorithmica
24
(1), 1999, pp. 14-28
On-line resource management with application to routing and scheduling
S. Leonardi
,
A. Marchetti-Spaccamela
Algorithmica
24
(1), 1999, pp. 29-49
Computing vision points in polygons
S. Carlsson
,
B.J. Nilsson
Algorithmica
24
(1), 1999, pp. 50-75
A fast bit-parallel algorithm for computing the subset partial order
P. Pritchard
Algorithmica
24
(1), 1999, pp. 76-86
A comparison of resource-bounded molecular computation models
B. Fu
,
R. Beigel
Algorithmica
24
(2), 1999, pp. 87-95
Bounded degree interval sandwich problems
H. Kaplan
,
R. Shamir
Algorithmica
24
(2), 1999, pp. 96-104
Isomorphism for graphs of bounded distance width
K. Yamazaki
,
H.L. Bodlaender
,
B. de Fluiter
,
D.M. Thilikos
Algorithmica
24
(2), 1999, pp. 105-127
Approximating Latin square extensions
S.R. Kumar
,
A. Russell
,
R. Sundaram
Algorithmica
24
(2), 1999, pp. 128-138
Efficient algorithms for dynamic allocation of distributed memory
T. Leighton
,
E.J. Schwabe
Algorithmica
24
(2), 1999, pp. 139-171
String search in coarse-grained parallel computers
P. Ferrragina
,
F. Luccio
Algorithmica
24
(3-4), 1999, pp. 177-194
d
-dimensional range search on multicomputers
A. Ferreira
,
C. Kenyon
,
A. Rau-Chaplin
,
S. Ubéda
Algorithmica
24
(3-4), 1999, pp. 195-208
The complexity of parallel multisearch on coarse-grained machines
A. Bäumker
,
W. Dittrich
,
A. Pietracaprina
Algorithmica
24
(3-4), 1999, pp. 209-242
Design and implementation of a practical parallel Delaunay algorithm
G.E. Blelloch
,
J.C. Hardwick
,
G.L. Miller
,
D. Talmor
Algorithmica
24
(3-4), 1999, pp. 243-269
A randomized algorithm for the Voronoi diagram of line segments on coarse-grained multiprocessors
Xiaotie Deng
,
Binhai Zhu
Algorithmica
24
(3-4), 1999, pp. 270-286
Memory-efficient matrix multiplication in the BSP model
W.F. McColl
,
A. Tiskin
Algorithmica
24
(3-4), 1999, pp. 287-297
Efficient algorithms for block-cyclic redistribution of arrays
Y.W. Lim
,
P.B. Bhat
,
V.K. Prasanna
Algorithmica
24
(3-4), 1999, pp. 298-330
Distributed matrix-free solution of large sparse linear systems over finite fields
E. Kaltofen
,
A. Lobo
Algorithmica
24
(3-4), 1999, pp. 331-348
Performing BMMC permutations efficiently on distributed-memory multiprocessors with MPI
T.H. Cormen
,
J.C. Clippinger
Algorithmica
24
(3-4), 1999, pp. 349-370
A note on parallel selection on coarse-grained multicomputers
E.L.G. Saukas
,
S.W. Song
Algorithmica
24
(3-4), 1999, pp. 371-380
Modeling parallel bandwidth: Local versus global restrictions
M. Adler
,
P.B. Gibbons
,
Y. Matias
,
V. Ramachandran
Algorithmica
24
(3-4), 1999, pp. 381-404
BSP versus LogP
G. Bilardi
,
K.T. Herley
,
A. Pietracaprina
,
G. Pucci
,
P. Spirakis
Algorithmica
24
(3-4), 1999, pp. 405-421