On parallel hashing and integer sorting
- 31 December 1991
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 12 (4) , 573-606
- https://doi.org/10.1016/0196-6774(91)90034-v
Abstract
No abstract availableKeywords
This publication has 25 references indexed in Scilit:
- Faster optimal parallel prefix sums and list rankingInformation and Computation, 1989
- Parallel construction of a suffix tree with applicationsAlgorithmica, 1988
- Parallel Algorithmic Techniques For Combinational ComputationAnnual Review of Computer Science, 1988
- Data structures and algorithms for approximate string matchingJournal of Complexity, 1988
- Approximate Parallel Scheduling. Part I: The Basic Technique with Applications to Optimal Parallel List Ranking in Logarithmic TimeSIAM Journal on Computing, 1988
- Storing a Sparse Table with 0 (1) Worst Case Access TimeJournal of the ACM, 1984
- The NYU Ultracomputer—Designing an MIMD Shared Memory Parallel ComputerIEEE Transactions on Computers, 1983
- A universal interconnection pattern for parallel computersJournal of the ACM, 1982
- Universal classes of hash functionsJournal of Computer and System Sciences, 1979
- The Parallel Evaluation of General Arithmetic ExpressionsJournal of the ACM, 1974