\(O (\log^* n)\) algorithms on a Sum-CRCW PRAM

DOI10.1007/s00607-006-0214-yzbMath1111.68145OpenAlexW2144841199MaRDI QIDQ873150

Stanley C. Eisenstat

Publication date: 28 March 2007

Published in: Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00607-006-0214-y

zbMATH Keywords

parallel random access machinelinear integer sortingparallel prefix sums

Mathematics Subject Classification ID

Searching and sorting (68P10) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Parallel algorithms in computer science (68W10)

Related Items (2)

An Improved Parallel Prefix Sums Algorithm ⋮ Computing with Spikes: The Advantage of Fine-Grained Timing

This page was built for publication: \(O (\log^* n)\) algorithms on a Sum-CRCW PRAM