Upper and lower time bounds for parallel random access machines without simultaneous writes
SIAM Journal on Computing
Optimal bounds for decision problems on the CRCW PRAM
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Towards optimal parallel bucket sorting
Information and Computation
Parallel symmetry-breaking in sparse graphs
SIAM Journal on Discrete Mathematics
Sorting in c log n parallel steps
Combinatorica
Tight bounds on the complexity of parallel sorting
IEEE Transactions on Computers
SIAM Journal on Computing
Optimal and sublogarithmic time randomized parallel sorting algorithms
SIAM Journal on Computing
Matching partition a linked list and its optimization
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
An optimal linked list prefix algorithms on a local memory computer
CSC '89 Proceedings of the 17th conference on ACM Annual Computer Science Conference
A complexity theory of efficient parallel algorithms
Theoretical Computer Science - Special issue: Fifteenth international colloquium on automata, languages and programming, Tampere, Finland, July 1988
Improved nonconservative sequential and parallel integer sorting
Information Processing Letters
Improved deterministic parallel integer sorting
Information and Computation
An introduction to parallel algorithms
An introduction to parallel algorithms
Acta Informatica
Surpassing the information theoretic bound with fusion trees
Journal of Computer and System Sciences - Special issue: papers from the 22nd ACM symposium on the theory of computing, May 14–16, 1990
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Improved parallel integer sorting without concurrent writing
Information and Computation
Improved bounds for integer sorting in the EREW PRAM model
Journal of Parallel and Distributed Computing
Conservative Algorithms for Parallel and Sequential Integer Sorting
COCOON '95 Proceedings of the First Annual International Conference on Computing and Combinatorics
The Complexity of Parallel Computations
The Complexity of Parallel Computations
Faster deterministic sorting and searching in linear space
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Improved fast integer sorting in linear space
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Improved fast interger sorting in linear space
Information and Computation
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
Fast Integer Sorting in Linear Space
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Improving parallel computation with fast integer sorting
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
| Hi-index | 0.00 |