Optimal parallel randomized algorithms for sparse addition and identification

DOI10.1016/0890-5401(88)90039-9MaRDI QIDQ1103402zbMATH OpenOpenAlexFDO

Authors P. 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)

Recommendations

• scientific article; zbMATH DE number 3978375
• scientific article; zbMATH DE number 18297
• scientific article; zbMATH DE number 4184919
• Parallel Algorithms for Sparse Linear Systems
• Parallel algorithms for the iterative solution of sparse least-squares problems
• scientific article; zbMATH DE number 1302200
• scientific article; zbMATH DE number 139775
• scientific article; zbMATH DE number 1163095
• Easily Parallelizable and Distributable Class of Algorithms for Structured Sparsity, with Optimal Acceleration
• Parallel iterative methods for sparse linear systems

Cites work

• scientific article; zbMATH DE number 3763293 (Why is no real title available?)
• scientific article; zbMATH DE number 3450155 (Why is no real title available?)
• A unified approach to models of synchronous parallel machines
• Parallelism in random access machines
• Randomized and deterministic simulations of PRAMs by parallel machines with restricted granularity of parallel memories
• Symmetric Complementation

Cited in

(3)

• Improved deterministic parallel integer sorting
• A glimpse at Paul G. Spirakis
• scientific article; zbMATH DE number 3978375 (Why is no real title available?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1103402)