On Synchronous Parallel Computations with Independent Probabilistic Choice

From MaRDI portal

Revision as of 14:29, 4 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3347295

Jump to:navigation, search

DOI10.1137/0213004zbMath0558.68038OpenAlexW2021452188MaRDI QIDQ3347295

John H. Reif

Publication date: 1984

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0213004

zbMATH Keywords

probabilistic algorithms randomized algorithm perfect matching probabilistic choice probabilistic computation parallel RAM parallel speedup probabilistic RAM synchronous parallel machines

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Algorithms in computer science (68W99)

Related Items (6)

Unnamed Item ⋮ SEARCHING ALGORITHMS IMPLEMENTED ON PROBABILISTIC SYSTOLIC ARRAYS ⋮ Optimal parallel algorithms on planar graphs ⋮ Simulating probabilistic by deterministic algebraic computation trees ⋮ Depth-first search is inherently sequential ⋮ Unnamed Item

This page was built for publication: On Synchronous Parallel Computations with Independent Probabilistic Choice

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3347295&oldid=16598346"