A bridging model for parallel computation
Communications of the ACM
Tight bounds for oblivious routing in the hypercube
SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
Efficient parallel algorithms on restartable fail-stop processors
PODC '91 Proceedings of the tenth annual ACM symposium on Principles of distributed computing
The efficiency of greedy routing in hypercubes and butterflies
SPAA '91 Proceedings of the third annual ACM symposium on Parallel algorithms and architectures
Methods for message routing in parallel machines
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Simple algorithms for routing on butterfly networks with bounded queues
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Efficient PRAM simulation on a distributed memory machine
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Simple path selection for optimal routing on processor arrays
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
Dense edge-disjoint embedding of binary trees in the mesh
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
Supereffective slow-down of parallel computations
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
Experiences with a model for parallel computation
PODC '93 Proceedings of the twelfth annual ACM symposium on Principles of distributed computing
Simple, efficient shared memory simulations
SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
Supporting sets of arbitrary connections on iWarp through communication context switches
SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
A survey of PRAM simulation techniques
ACM Computing Surveys (CSUR)
An Ω(√ log log n) lower bound for routing in optical networks
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
On contention resolution protocols and associated probabilistic phenomena
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Provably efficient scheduling for languages with fine-grained parallelism
Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures
An optimal randomized planar convex hull algorithm with good empirical performance
Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures
A randomized parallel 3D convex hull algorithm for coarse grained multicomputers
Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures
Accounting for memory bank contention and delay in high-bandwidth multiprocessors
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
Upper time bounds for executing PRAM-programs on the LogP-machine
ICS '95 Proceedings of the 9th international conference on Supercomputing
Bounds on the separation of two parallel disk models
Proceedings of the fourth workshop on I/O in parallel and distributed systems: part of the federated computing research conference
Towards efficiency and portability: programming with the BSP model
Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures
On multiprocessor system scheduling
Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures
Deterministic sorting and randomized median finding on the BSP model
Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures
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
Efficient computations on fault-prone BSP machines
Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures
Modeling parallel bandwidth: local vs. global restrictions
Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures
Sorting, Selection, and Routing on the Array with Reconfigurable Optical Buses
IEEE Transactions on Parallel and Distributed Systems
On contention resolution protocols and associated probabilistic phenomena
Journal of the ACM (JACM)
“Dynamic-fault-prone BSP”: a paradigm for robust computations in changing environments
Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures
Models and languages for parallel computation
ACM Computing Surveys (CSUR)
Provably efficient scheduling for languages with fine-grained parallelism
Journal of the ACM (JACM)
BOS is boss: a case for bulk-synchronous object systems
Proceedings of the eleventh annual ACM symposium on Parallel algorithms and architectures
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
Portable and Efficient Parallel Computing Using the BSP Model
IEEE Transactions on Computers
Average-case analysis of greedy packet scheduling (extended astract)
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
Task Allocation on a Network of Processors
IEEE Transactions on Computers
Performance Metrics for Embedded Parallel Pipelines
IEEE Transactions on Parallel and Distributed Systems
Towards practical deteministic write-all algorithms
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
Almost optimal permutation routing on hypercubes
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Efficient selection algorithms on distributed memory computers
SC '98 Proceedings of the 1998 ACM/IEEE conference on Supercomputing
3D in the Pines and on the Plains
SC '98 Proceedings of the 1998 ACM/IEEE conference on Supercomputing
Optimal organizations for pipelined hierarchical memories
Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures
Concurrent Iterative Algorithm for Toeplitz-like Linear Systems
IEEE Transactions on Parallel and Distributed Systems
Message passing without send-receive
Future Generation Computer Systems - Parallel computing technologies (PaCT-2001)
Bounded fan-out multimessage multicasting
Nordic Journal of Computing
Parallel Algorithm Design with Coarse-Grained Synchronization
ICCS '01 Proceedings of the International Conference on Computational Science-Part II
The Vega Grid and Grid-Based Education
ICWL '02 Proceedings of the First International Conference on Advances in Web-Based Learning
A Randomized Algorithm for Voronoi Diagram of Line Segments on Coarse-Grained Multiprocessors
IPPS '96 Proceedings of the 10th International Parallel Processing Symposium
Interoperability of Data Parallel Runtime Libraries
IPPS '97 Proceedings of the 11th International Symposium on Parallel Processing
A 2-D Parallel Convex Hull Algorithm with Optimal Communication Phases
IPPS '97 Proceedings of the 11th International Symposium on Parallel Processing
The Power of SIMDs in Real-Time Scheduling
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
A Randomized Sorting Algorithm on the BSP model
IPPS '97 Proceedings of the 11th International Symposium on Parallel Processing
The Heterogeneous Bulk Synchronous Parallel Model
IPDPS '00 Proceedings of the 15 IPDPS 2000 Workshops on Parallel and Distributed Processing
Send-Recv Considered Harmful? Myths and Truths about Parallel Programming
PaCT '01 Proceedings of the 6th International Conference on Parallel Computing Technologies
Parallel Algorithms for Grounded Range Search and Applications
Euro-Par '99 Proceedings of the 5th International Euro-Par Conference on Parallel Processing
Euro-Par '02 Proceedings of the 8th International Euro-Par Conference on Parallel Processing
Parallel Geometric Algorithms in Coarse-Grain Network Models
COCOON '98 Proceedings of the 4th Annual International Conference on Computing and Combinatorics
Delta-Stepping: A Parallel Single Source Shortest Path Algorithm
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
Architecture Independent Analysis of Parallel Programs
ICCS '01 Proceedings of the International Conference on Computational Science-Part II
Portable and architecture independent parallel performance tuning using BSP
Parallel Computing
SAT: a programming methodology with skeletons and collective operations
Patterns and skeletons for parallel and distributed computing
A3: a simple and asymptotically accurate model for parallel computation
FRONTIERS '96 Proceedings of the 6th Symposium on the Frontiers of Massively Parallel Computation
On finding optimal clusterings of task graphs
PAS '95 Proceedings of the First Aizu International Symposium on Parallel Algorithms/Architecture Synthesis
A journey into multicomputer routing algorithms
PAS '95 Proceedings of the First Aizu International Symposium on Parallel Algorithms/Architecture Synthesis
Architecture independent parallel selection with applications to parallel priority queues
Theoretical Computer Science
Parallel I/O scheduling using randomized, distributed edge coloring algorithms
Journal of Parallel and Distributed Computing
Deterministic computations on a PRAM with static processor and memory faults
Fundamenta Informaticae
Send-receive considered harmful: Myths and realities of message passing
ACM Transactions on Programming Languages and Systems (TOPLAS)
Packet routing and selection on the POPS network
Journal of Parallel and Distributed Computing
Coarse grained parallel algorithms for graph matching
Parallel Computing
The Journal of Supercomputing
Efficient automatic simulation of parallel computation on networks of workstations
Discrete Applied Mathematics
Work-optimal routing in wavelength-division multiplexed three-dimensional dense optical tori
Proceedings of the 11th International Conference on Computer Systems and Technologies and Workshop for PhD Students in Computing on International Conference on Computer Systems and Technologies
Towards programming on the moving threads architecture
Proceedings of the 11th International Conference on Computer Systems and Technologies and Workshop for PhD Students in Computing on International Conference on Computer Systems and Technologies
Algorithms and theory of computation handbook
Parallel computation: models and complexity issues
Algorithms and theory of computation handbook
Path planning for altruistically negotiating processes
CTS'05 Proceedings of the 2005 international conference on Collaborative technologies and systems
The parallel cellular programming model
EURO-PDP'00 Proceedings of the 8th Euromicro conference on Parallel and distributed processing
Algorithm engineering: bridging the gap between algorithm theory and practice
Algorithm engineering: bridging the gap between algorithm theory and practice
A layout for sparse cube-connected-cycles network
Proceedings of the 12th International Conference on Computer Systems and Technologies
Systolic routing in an optical fat tree
ISPA'05 Proceedings of the Third international conference on Parallel and Distributed Processing and Applications
ISPA'05 Proceedings of the Third international conference on Parallel and Distributed Processing and Applications
Systolic routing in an optical butterfly
PaCT'05 Proceedings of the 8th international conference on Parallel Computing Technologies
Communication and energy efficient routing protocols for single-hop radio networks
Journal of Parallel and Distributed Computing
Spinning fast iterative data flows
Proceedings of the VLDB Endowment
Deterministic Computations on a PRAM with Static Processor and Memory Faults
Fundamenta Informaticae
Relative Cost Random Access Machines
Fundamenta Informaticae
Address-free all-to-all routing in sparse torus
PaCT'07 Proceedings of the 9th international conference on Parallel Computing Technologies
A Randomized Parallel Three-Dimensional Convex Hull Algorithm for Coarse-Grained Multicomputers
Theory of Computing Systems
Hi-index | 0.02 |