Simple fast parallel hashing
From MaRDI portal
Recommendations
- Simple Fast Parallel Hashing by Oblivious Execution
- Parallel hashing
- Fast accumulated hashing
- scientific article; zbMATH DE number 177852
- On parallel hashing and integer sorting
- ANALYSIS AND IMPLEMENTATION OF PARALLEL UNIFORM HASHING
- Fast and simple compact hashing via bucketing
- Fast and simple compact hashing via bucketing
Cites work
- scientific article; zbMATH DE number 432828 (Why is no real title available?)
- scientific article; zbMATH DE number 107951 (Why is no real title available?)
- scientific article; zbMATH DE number 177800 (Why is no real title available?)
- scientific article; zbMATH DE number 177852 (Why is no real title available?)
- scientific article; zbMATH DE number 194009 (Why is no real title available?)
- An optimal parallel dictionary
- Dynamic Perfect Hashing: Upper and Lower Bounds
- Efficient low-contention parallel algorithms
- On parallel hashing and integer sorting
- On the power of two-point based sampling
- Polynomial hash functions are reliable (extended abstract)
- Relations between Concurrent-Write Models of Parallel Computation
- Storing a Sparse Table with 0 (1) Worst Case Access Time
- Universal classes of hash functions
Cited in
(6)
This page was built for publication: Simple fast parallel hashing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4632430)