Optimal on-line load balancing
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
A parallel algorithm for computing minimum spanning trees
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
Fast deterministic approximate and exact parallel sorting
SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
Proceedings of the twelfth annual symposium on Computational geometry
Finding a k-Tree Core and a k-Tree Center of a Tree Network in Parallel
IEEE Transactions on Parallel and Distributed Systems
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
Improved fast interger sorting in linear space
Information and Computation
Sublogarithmic Deterministic Selection on Arrays with a Reconfigurable Optical Bus
IEEE Transactions on Computers
Parallel Implementations of the Selection Problem: A Case Study
International Journal of Parallel Programming
Work-Time Optimal k-Merge Algorithms on the PRAM
IEEE Transactions on Parallel and Distributed Systems
Improving the efficiency of parallel minimum spanning tree algorithms
Discrete Applied Mathematics - Special issue: Special issue devoted to the fifth annual international computing and combinatories conference (COCOON'99) Tokyo, Japan 26-28 July 1999
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Efficient Parallel Algorithms for Optimally Locating a k-Leaf Tree in a Tree Network
ICPP '97 Proceedings of the international Conference on Parallel Processing
Fast Integer Sorting in Linear Space
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Improved Deterministic Parallel Padded Sorting
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
Finding r-Dominating Sets and p-Centers of Trees in Parallel
IEEE Transactions on Parallel and Distributed Systems
ACM Transactions on Algorithms (TALG)
Short Communication: An efficient parallel algorithm for multiselection
Parallel Computing
Improving parallel computation with fast integer sorting
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
Efficient parallel algorithms for constructing a k-tree center and a k-tree core of a tree network
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
| Hi-index | 0.93 |