Sorting in c log n parallel steps
Combinatorica
A bridging model for parallel computation
Communications of the ACM
A guided tour of Chernoff bounds
Information Processing Letters
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Cubesort: A parallel algorithm for sorting N data items with S-sorters
Journal of Algorithms
LogP: towards a realistic model of parallel computation
PPOPP '93 Proceedings of the fourth ACM SIGPLAN symposium on Principles and practice of parallel programming
Optimal broadcast and summation in the LogP model
SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
General purpose parallel computing
Lectures on parallel computation
Deterministic on-line routing on area-universal networks
Journal of the ACM (JACM)
Accounting for memory bank contention and delay in high-bandwidth multiprocessors
Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures
Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures
Parallel sorting with limited bandwidth
Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures
Deterministic 1-k Routing on Meshes
STACS '94 Proceedings of the 11th Annual Symposium on Theoretical Aspects of Computer Science
A Combining Mechanism for Parallel Computers
Proceedings of the First Heinz Nixdorf Symposium on Parallel Architectures and Their Efficient Use
Bulk synchronous parallel computing-a paradigm for transportable software
HICSS '95 Proceedings of the 28th Hawaii International Conference on System Sciences
A complexity theory for VLSI
Models and languages for parallel computation
ACM Computing Surveys (CSUR)
Emulations between QSM, BSP, and LogP: a framework for general-purpose parallel algorithm design
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Portable and Efficient Parallel Computing Using the BSP Model
IEEE Transactions on Computers
Optimal Clustering of Tree-Sweep Computations for High-Latency Parallel Environments
IEEE Transactions on Parallel and Distributed Systems
Message passing without send-receive
Future Generation Computer Systems - Parallel computing technologies (PaCT-2001)
On the Effectiveness of D-BSP as a Bridging Model of Parallel Computation
ICCS '01 Proceedings of the International Conference on Computational Science-Part II
Parallel Algorithm Design with Coarse-Grained Synchronization
ICCS '01 Proceedings of the International Conference on Computational Science-Part II
Send-Recv Considered Harmful? Myths and Truths about Parallel Programming
PaCT '01 Proceedings of the 6th International Conference on Parallel Computing Technologies
SAT: a programming methodology with skeletons and collective operations
Patterns and skeletons for parallel and distributed computing
Send-receive considered harmful: Myths and realities of message passing
ACM Transactions on Programming Languages and Systems (TOPLAS)
Emulations between QSM, BSP and LogP: a framework for general-purpose parallel algorithm design
Journal of Parallel and Distributed Computing
Journal of Parallel and Distributed Computing
Mapping unstructured applications into nested parallelism
VECPAR'02 Proceedings of the 5th international conference on High performance computing for computational science
LogfP - a model for small messages in InfiniBand
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
| Hi-index | 0.00 |