On parallel hashing and integer sorting

DOI10.1016/0196-6774(91)90034-VzbMath0767.68051MaRDI QIDQ3988822

Yossi Matias, Uzi Vishkin

Publication date: 28 June 1992

Published in: Journal of Algorithms (Search for Journal in Brave)

zbMATH Keywords

parallel sortingCRCW PRAMoptimal speedupparallel hashingparallel string matchingrandomized algorithm for integer sorting

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Theory of data (68P99) Distributed algorithms (68W15)

Related Items (8)

Parallel integer sorting using small operations ⋮ When can we sort in \(o(n\log n)\) time? ⋮ Retrieval of scattered information by EREW, CREW, and CRCW PRAMs ⋮ Improved parallel integer sorting without concurrent writing ⋮ The complexity of parallel prefix problems on small domains ⋮ A perfect parallel dictionary ⋮ Unnamed Item ⋮ Simple fast parallel hashing

This page was built for publication: On parallel hashing and integer sorting