On parallel hashing and integer sorting
References (58)
- et al.
Faster optimal parallel prefix sums and list ranking
Informa. and Comput.
(1989) - et al.
Universal classes of hash functions
J. Comput. System Sci.
(1979) - et al.
Data structures and algorithms for approximate string matching
J. Complexity
(1988) Towards optimal parallel bucket sorting
Inform. and Comput.
(1987)On saving space in parallel computation
Inform. Process. Lett.
(1988)- et al.
A survey of the Hough transform
Comput. Vision Graphics Image Process.
(1988) Optimal parallel randomized algorithms for sparse addition and identification
Inform. and Comput.
(1988)- et al.
Finding the maximum, merging, and sorting in a parallel computation model
J. Algorithms
(1981) - et al.
An O(log n) parallel connectivity algorithm
J. Algorithms
(1982) - et al.
An O(n2log n) parallel Max-Flow algorithm
J. Algorithms
(1982)
The Design and Analysis of Computer Algorithms
(1974)
Parallel construction of a suffix tree
Algorithmica
(1988)
An O(n log n) sorting network
Optimal parallel algorithms for list ranking
The myriad virtues of subword trees
New connectivity and MSF algorithms for Ultracomputer and PRAM
Improved Deterministic Parallel Integer Sorting
A general sequential time-space trade-off for finding unique elements
Optimal bounds for decision problems on the CRCW PRAM
Optimal separations between concurrent-write parallel machines
The parallel evaluation of general arithmetic expressions
J. Assoc. Comput. Mach.
(1974)
Some Doubly Logarithmic Parallel Algorithms Based on Finding All Nearest Smaller Values
Efficient simulations between concurrent-read concurrent-write PRAM models
Parallel merge sort
Approximate and exact parallel scheduling with applications to list, tree, and graph problems
Approximate parallel scheduling. Part I. The basic technique with applications to optimal parallel list ranking in logarithmic time
SIAM J. Comput.
(1988)
An optimal parallel dictionary
Parallel algorithmic techniques for combinatorial computation
Ann. Rev. Comput. Sci.
(1988)
Storing a sparse table with O(1) worst case access time
J. Assoc. Comput. Mach.
(1984)
Cited by (37)
The Complexity of Parallel Prefix Problems on Small Domains
1997, Information and ComputationA Reliable Randomized Algorithm for the Closest-Pair Problem
1997, Journal of AlgorithmsImproved Parallel Integer Sorting without Concurrent Writing
1997, Information and ComputationWhen Can We Sort in o(n log n) Time?
1997, Journal of Computer and System SciencesOptical routing in meshes using the duplication model
1997, Journal of Parallel and Distributed ComputingEfficient low-contention parallel algorithms
1996, Journal of Computer and System Sciences
- ∗
Partially supported by NSF Grant CCR-890649 and ONR Grant N00014-85-0046.
Copyright © 1991 Published by Elsevier Inc.