Fast rehashing in PRAM emulations
From MaRDI portal
Publication:672145
DOI10.1016/0304-3975(95)00292-8zbMATH Open0872.68063OpenAlexW2043495715MaRDI QIDQ672145FDOQ672145
Publication date: 27 February 1997
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(95)00292-8
Recommendations
- scientific article; zbMATH DE number 1543296
- Efficient PRAM simulation on a distributed memory machine
- Improved memory utilization in deterministic PRAM simulation
- Processor-time tradeoffs in PRAM simulations
- scientific article; zbMATH DE number 1848398
- Fast and optimal simulations between CRCW PRAMs
- Fast hashing on the Pentium
- Fast accumulated hashing
- Fast integer merging on the EREW PRAM
- Fast integer merging on the EREW PRAM
Analysis of algorithms and problem complexity (68Q25) Data structures (68P05) Distributed algorithms (68W15)
Cites Work
- Universal classes of hash functions
- Randomized and deterministic simulations of PRAMs by parallel machines with restricted granularity of parallel memories
- Title not available (Why is that?)
- Title not available (Why is that?)
- Parallelism in random access machines
- How to emulate shared memory
- Title not available (Why is that?)
- Clocked adversaries for hashing
- Title not available (Why is that?)
- Parallel hashing
This page was built for publication: Fast rehashing in PRAM emulations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q672145)