On Synchronous Parallel Computations with Independent Probabilistic Choice
From MaRDI portal
Publication:3347295
Recommendations
Cited in
(13)- Depth-first search is inherently sequential
- The probabilistic method yields deterministic parallel algorithms
- Simulating probabilistic by deterministic algebraic computation trees
- P-RAM vs. RP-RAM
- Randomized Gandy-Păun-Rozenberg machines
- scientific article; zbMATH DE number 4201596 (Why is no real title available?)
- scientific article; zbMATH DE number 3936481 (Why is no real title available?)
- Parallel computation for well-endowed rings and space-bounded probabilistic machines
- scientific article; zbMATH DE number 4057020 (Why is no real title available?)
- scientific article; zbMATH DE number 4062587 (Why is no real title available?)
- scientific article; zbMATH DE number 1262835 (Why is no real title available?)
- SEARCHING ALGORITHMS IMPLEMENTED ON PROBABILISTIC SYSTOLIC ARRAYS
- Optimal parallel algorithms on planar graphs
This page was built for publication: On Synchronous Parallel Computations with Independent Probabilistic Choice
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3347295)