Parallel algorithms column 1: models of computation
ACM SIGACT News
Efficient low-contention parallel algorithms
SPAA '94 Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures
An optical simulation of shared memory
SPAA '94 Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures
O(log2 n) time efficient parallel factorization of dense, sparse separable, and banded matrices
SPAA '94 Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures
Parallel molecular computation
Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures
Computing faces in segment and simplex arrangements
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Work efficient parallel solution of Toeplitz systems and polynomial GCD
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Sorting on a parallel pointer machine with applications to set expression evaluation
Journal of the ACM (JACM)
ACM Computing Surveys (CSUR)
Communication-efficient parallel sorting (preliminary version)
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Can shared-memory model serve as a bridging model for parallel computation?
Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures
Is there an algebraic proof for P ≠ NC? (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Communication-optimal parallel minimum spanning tree algorithms (extended abstract)
Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures
Provably efficient scheduling for languages with fine-grained parallelism
Journal of the ACM (JACM)
Efficient parallel solutions of linear algebraic circuits
Proceedings of the eleventh annual ACM symposium on Parallel algorithms and architectures
Fixed-dimensional parallel linear programming via relative &egr;-approximations
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Randomized fully-scalable BSP techniques for multi-searching and convex hull construction
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
The QRQW PRAM: accounting for contention in parallel algorithms
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Parallel Solutions of Simple Indexed Recurrence Equations
IEEE Transactions on Parallel and Distributed Systems
Finding a Hamiltonian paths in tournaments on clusters - a provably communication-efficient approach
Proceedings of the 2001 ACM symposium on Applied computing
Grid-enabled parallel divide-and-conquer: theory and practice
Proceedings of the 2002 ACM symposium on Applied computing
NC coloring algorithms for permutation graphs
Nordic Journal of Computing
Mesh Algorithms for Multiplication and Division
HiPC '01 Proceedings of the 8th International Conference on High Performance Computing
HiPC '02 Proceedings of the 9th International Conference on High Performance Computing
Optimizing Parallel Bitonic Sort
IPPS '97 Proceedings of the 11th International Symposium on Parallel Processing
On External-Memory MST, SSSP, and Multi-way Planar Graph Separation
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
Average-Case Communication-Optimal Parallel Parenthesis Matching
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
Coloring Algorithms on Subcubic Graphs
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
Using PRAM Algorithms on a Uniform-Memory-Access Shared-Memory Architecture
WAE '01 Proceedings of the 5th International Workshop on Algorithm Engineering
Coarse Grained Parallel Algorithms for Detecting Convex Bipartite Graphs
WG '00 Proceedings of the 26th International Workshop on Graph-Theoretic Concepts in Computer Science
DNA '00 Revised Papers from the 6th International Workshop on DNA-Based Computers: DNA Computing
Challenges and Applications for Self-Assembled DNA Nanostructures
DNA '00 Revised Papers from the 6th International Workshop on DNA-Based Computers: DNA Computing
Coloring permutation graphs in parallel
Discrete Applied Mathematics - Sixth Twente Workshop on Graphs and Combinatorial Optimization
Algorithm engineering for parallel computation
Experimental algorithmics
An Improved Output-size Sensitive Parallel Algorithm for Hidden-Surface Removal for Terrains
IPPS '98 Proceedings of the 12th. International Parallel Processing Symposium on International Parallel Processing Symposium
Hundreds of impossibility results for distributed computing
Distributed Computing - Papers in celebration of the 20th anniversary of PODC
Parallel algorithms for Hamiltonian problems on quasi-threshold graphs
Journal of Parallel and Distributed Computing
Efficient parallel solutions of linear algebraic circuits
Journal of Parallel and Distributed Computing
Parallel algorithms for P4-comparability graphs
Journal of Algorithms
On external-memory MST, SSSP and multi-way planar graph separation
Journal of Algorithms
A Framework for Measuring Supercomputer Productivity
International Journal of High Performance Computing Applications
Discrete Applied Mathematics
Relationships between broadcast and shared memory in reliable anonymous distributed systems
Distributed Computing - Special issue: DISC 04
Efficient parallel recognition of cographs
Discrete Applied Mathematics - Special issue: Max-algebra
An optimal parallel solution for the path cover problem on P4-sparse graphs
Journal of Parallel and Distributed Computing
The Minmax Relative Regret Median Problem on Networks
INFORMS Journal on Computing
A simple and linear time randomized algorithm for computing sparse spanners in weighted graphs
Random Structures & Algorithms
On the parallel computation of the biconnected and strongly connected co-components of graphs
Discrete Applied Mathematics
Coarse grained parallel algorithms for graph matching
Parallel Computing
Fundamental parallel algorithms for private-cache chip multiprocessors
Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
Efficient Implementation of Tree Accumulations on Distributed-Memory Parallel Computers
ICCS '07 Proceedings of the 7th international conference on Computational Science, Part II
The third homomorphism theorem on trees: downward & upward lead to divide-and-conquer
Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A compositional framework for developing parallel programs on two-dimensional arrays
International Journal of Parallel Programming
Using Ontologies and Algebra of Algorithms for Formalized Development of Parallel Programs
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
What the parallel-processing community has (failed) to offer the multi/many-core generation
Journal of Parallel and Distributed Computing
Efficient parallel recognition of cographs
Discrete Applied Mathematics
Recursion and parallel algorithms in geometric modeling problems
Cybernetics and Systems Analysis
Decision versus evaluation in algebraic complexity
MCU'07 Proceedings of the 5th international conference on Machines, computations, and universality
Unified parallel encoding and decoding algorithms for Dandelion-like codes
Journal of Parallel and Distributed Computing
The system of common algorithmic space to create visual models of phenomena and processes
Proceedings of the International Conference on Applications of Computer and Information Sciences to Nature Research
Algorithms and theory of computation handbook
Parallel computation: models and complexity issues
Algorithms and theory of computation handbook
Automatic parallelization via matrix multiplication
Proceedings of the 32nd ACM SIGPLAN conference on Programming language design and implementation
Balanced trees inhabiting functional parallel programming
Proceedings of the 16th ACM SIGPLAN international conference on Functional programming
Parallel algorithms for encoding and decoding blob code
WALCOM'10 Proceedings of the 4th international conference on Algorithms and Computation
Automatic parallelization of recursive functions using quantifier elimination
FLOPS'10 Proceedings of the 10th international conference on Functional and Logic Programming
Macro tree transformations of linear size increase achieve cost-optimal parallelism
APLAS'11 Proceedings of the 9th Asian conference on Programming Languages and Systems
Using Ontologies and Algebra of Algorithms for Formalized Development of Parallel Programs
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
A fast parallel algorithm for minimum-cost small integral flows
Euro-Par'12 Proceedings of the 18th international conference on Parallel Processing
An O(n)-time algorithm for the paired domination problem on permutation graphs
European Journal of Combinatorics
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
A short cut to parallelization theorems
Proceedings of the 18th ACM SIGPLAN international conference on Functional programming
Time-efficient estimation of conditional mutual information for variable selection in classification
Computational Statistics & Data Analysis
| Hi-index | 0.00 |
From the Publisher:This landmark collaboration will enhance the knowledge and abilities of anyone interested in parallel algorithms and in developing programs for parallel computers. Many problems currently solved with sequential algorithms are themselves highly parallelizable when designers use the powerful parallel techniques now available. These thorough but introductory presentations demonstrate the most important algorithmic techniques and their use in exposing the hidden parallelism within problems. Beginning with familiar sequential algorithms, the authors provide a careful description of the fundamental problem, its solution, and analysis--complete with examples and exercises. Each of the 22 chapters then synthesizes a more sophisticated parallel algorithm using the simpler sequential and parallel techniques used to introduce the problem. The PRAM shared-memory model of computing provides a unifying framework. This model has been used extensively for designing parallel algorithms and can be efficiently simulated on many of the parallel architectures now in use. Applying the methods in this book will offer designers a substantial advantage when solving problems for parallel computation.