On parallel hashing and integer sorting
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 177852
- On parallel integer sorting
- More efficient parallel integer sorting
- More Efficient Parallel Integer Sorting
- scientific article; zbMATH DE number 88973
- Parallel hashing
- Improved deterministic parallel integer sorting
- ANALYSIS AND IMPLEMENTATION OF PARALLEL UNIFORM HASHING
- scientific article; zbMATH DE number 1003255
Cited in
(15)- scientific article; zbMATH DE number 177852 (Why is no real title available?)
- Fast parallel space allocation, estimation, and integer sorting
- Parallel Hashing via List Recoverability
- scientific article; zbMATH DE number 7651141 (Why is no real title available?)
- Concurrency and trie hashing
- The complexity of parallel prefix problems on small domains
- Improved parallel integer sorting without concurrent writing
- An optimal parallel algorithm for sorting multisets
- Simple fast parallel hashing
- Retrieval of scattered information by EREW, CREW, and CRCW PRAMs
- A perfect parallel dictionary
- PARALLEL SORT-HASH OBJECT-ORIENTED COLLECTION JOIN ALGORITHMS FOR SHARED-MEMORY MACHINES
- Parallel integer sorting using small operations
- When can we sort in o(n n) time?
- Parallel d-Pipeline: A Cuckoo Hashing Implementation for Increased Throughput
This page was built for publication: On parallel hashing and integer sorting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3988822)
