Journal: Algorithmica

Volume 24, Issue 3-4

173 -- 176Frank K. H. A. Dehne. Guest Editor s Introduction
177 -- 194Paolo Ferragina, Fabrizio Luccio. String Search in Coarse-Grained Parallel Computers
195 -- 208Afonso Ferreira, Claire Kenyon, Andrew Rau-Chaplin, Stéphane Ubéda. ::::d::::-Dimensional Range Search on Multicomputers
209 -- 242Armin Bäumker, Wolfgang Dittrich, Andrea Pietracaprina. The Complexity of Parallel Multisearch on Coarse-Grained Machines
243 -- 269Guy E. Blelloch, Jonathan C. Hardwick, Gary L. Miller, Dafna Talmor. Design and Implementation of a Practical Parallel Delaunay Algorithm
270 -- 286Xiaotie Deng, Binhai Zhu. A Randomized Algorithm for the Voronoi Diagram of Line Segments on Coarse-Grained Multiprocessors
287 -- 297William F. McColl, Alexandre Tiskin. Memory-Efficient Matrix Multiplication in the BSP Model
298 -- 330Young Won Lim, Prashanth B. Bhat, Viktor K. Prasanna. Efficient Algorithms for Block-Cyclic Redistribution of Arrays
331 -- 348Erich Kaltofen, A. Lobo. Distributed Matrix-Free Solution of Large Sparse Linear Systems over Finite Fields
349 -- 370Thomas H. Cormen, James C. Clippinger. Performing BMMC Permutations Efficiently on Distributed-Memory Multiprocessors with MPI
371 -- 380E. L. G. Saukas, S. W. Song. A Note on Parallel Selection on Coarse-Grained Multicomputers
381 -- 404Micah Adler, Phillip B. Gibbons, Yossi Matias, Vijaya Ramachandran. Modeling Parallel Bandwidth: Local versus Global Restrictions
405 -- 422Gianfranco Bilardi, Andrea Pietracaprina, Geppino Pucci, Kieran T. Herley, Paul G. Spirakis. BSP versus LogP