ON THE POWER OF SOME PRAM MODELS

DOI10.1080/01495739908947372zbMath0928.68131OpenAlexW1986237363MaRDI QIDQ4242705

Selim G. Akl, Lin Chen

Publication date: 12 January 2000

Published in: Parallel Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/01495739908947372

zbMATH Keywords

sortingsimulationPRAM

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Computer system organization (68M99)

Related Items

An Improved Parallel Prefix Sums Algorithm ⋮ Optimal computation of shortest paths on doubly convex bipartite graphs ⋮ Computing with Spikes: The Advantage of Fine-Grained Timing

Cites Work

• Efficient parallel recognition of some circular arc graphs. II
• Simulations among concurrent-write PRAMs
• Optimal parallel time bounds for the maximum clique problem on intervals
• Faster optimal parallel prefix sums and list ranking
• Parallel Merge Sort
• Parallel Prefix Computation
• Finding the maximum, merging, and sorting in a parallel computation model
• The Parallel Evaluation of General Arithmetic Expressions
• Optimal bounds for decision problems on the CRCW PRAM