New Connectivity and MSF Algorithms for Shuffle-Exchange Network and PRAM
IEEE Transactions on Computers
Scans as Primitive Parallel Operations
IEEE Transactions on Computers
A bridging model for parallel computation
Communications of the ACM
LogP: towards a realistic model of parallel computation
PPOPP '93 Proceedings of the fourth ACM SIGPLAN symposium on Principles and practice of parallel programming
Scalable parallel geometric algorithms for coarse grained multicomputers
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
Direct bulk-synchronous parallel algorithms
Journal of Parallel and Distributed Computing
A randomized linear-time algorithm to find minimum spanning trees
Journal of the ACM (JACM)
Parallel sorting with limited bandwidth
Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures
A parallel algorithm for computing minimum spanning trees
Journal of Algorithms
Communication primitive for BSP computers
Information Processing Letters
Deterministic sorting and randomized median finding on the BSP model
Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures
Fully dynamic search trees for an extension of the BSP model
Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures
Finding minimum spanning forests in logarithmic time and linear work using random sampling
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
An optimal EREW PRAM algorithm for minimum spanning tree verification
Information Processing Letters
Truly efficient parallel algorithms: 1-optimal multisearch for an extension of the BSP model
ESA '95 Selected papers from the third European symposium on 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
Synthesis of Parallel Algorithms
Synthesis of Parallel Algorithms
Efficient Parallel Graph Algorithms For Coarse Grained Multicomputers and BSP
ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
A Randomized Linear Work EREW PRAM Algorithm to Find a Minimum Spanning Forest
ISAAC '97 Proceedings of the 8th International Symposium on Algorithms and Computation
Realistic Parallel Algorithms: Priority Queue Operations and Selection for the BSP Model
Euro-Par '96 Proceedings of the Second International Euro-Par Conference on Parallel Processing-Volume II
Some complexity questions related to distributive computing(Preliminary Report)
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
MST construction in O(log log n) communication rounds
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
1-Optimality of static BSP computations: scheduling independent chains as a case study
Theoretical Computer Science
Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs
Journal of Parallel and Distributed Computing
Fast PGAS Implementation of Distributed Graph Algorithms
Proceedings of the 2010 ACM/IEEE International Conference for High Performance Computing, Networking, Storage and Analysis
| Hi-index | 0.00 |