On parallel hashing and integer sorting
- 11 December 2005
- book chapter
- Published by Springer Nature
- p. 729-743
- https://doi.org/10.1007/bfb0032070
Abstract
No abstract availableKeywords
This publication has 25 references indexed in Scilit:
- Efficient simulations between concurrent-read concurrent-write pram modelsPublished by Springer Nature ,2005
- Faster optimal parallel prefix sums and list rankingInformation and Computation, 1989
- An optimal parallel dictionaryPublished by Association for Computing Machinery (ACM) ,1989
- Parallel construction of a suffix tree with applicationsAlgorithmica, 1988
- Parallel Algorithmic Techniques For Combinational ComputationAnnual Review of Computer Science, 1988
- Approximate Parallel Scheduling. Part I: The Basic Technique with Applications to Optimal Parallel List Ranking in Logarithmic TimeSIAM Journal on Computing, 1988
- Approximate and exact parallel scheduling with applications to list, tree and graph problemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1986
- Parallel merge sortPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1986
- Storing a Sparse Table with 0 (1) Worst Case Access TimeJournal of the ACM, 1984
- The Parallel Evaluation of General Arithmetic ExpressionsJournal of the ACM, 1974