Optimal parallel randomized algorithms for sparse addition and identification

DOI10.1016/0890-5401(88)90039-9zbMath0645.68059OpenAlexW1988308630MaRDI QIDQ1103402

Paul G. Spirakis

Publication date: 1988

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0890-5401(88)90039-9

zbMATH Keywords

parallel computationmodel of computationCRCW PRAMprocessor identificationrandomized algorithm for parallel addition

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Theory of operating systems (68N25)

Related Items (2)

A Glimpse at Paul G. Spirakis ⋮ Improved deterministic parallel integer sorting

Cites Work

• Unnamed Item
• Unnamed Item
• Randomized and deterministic simulations of PRAMs by parallel machines with restricted granularity of parallel memories
• Symmetric Complementation
• A unified approach to models of synchronous parallel machines
• Parallelism in random access machines

This page was built for publication: Optimal parallel randomized algorithms for sparse addition and identification