Randomized parallel algorithms

MaRDI QIDQ4251082zbMATH OpenFDO

Authors José Rolim

Publication date 17 June 1999

zbMATH Keywords

parallel randomized algorithmsrandomized techniques

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Parallel algorithms in computer science (68W10)

Cited in

(17)

• The complexity of parallel search
• The probabilistic method yields deterministic parallel algorithms
• Randomization for efficient dynamic graph algorithms (invited talk)
• From randomizing polynomials to parallel algorithms
• Probabilistic Parallel Algorithms for Sorting and Selection
• scientific article; zbMATH DE number 4047072 (Why is no real title available?)
• A randomized parallel backtracking algorithm
• scientific article; zbMATH DE number 176073 (Why is no real title available?)
• scientific article; zbMATH DE number 1302200 (Why is no real title available?)
• The Random Adversary: A Lower-Bound Technique for Randomized Parallel Algorithms
• Time-Randomness Trade-offs in Parallel Computation
• scientific article; zbMATH DE number 934538 (Why is no real title available?)
• scientific article; zbMATH DE number 1419212 (Why is no real title available?)
• scientific article; zbMATH DE number 1419214 (Why is no real title available?)
• scientific article; zbMATH DE number 5198953 (Why is no real title available?)
• Parallel output-sensitive algorithms for combinatorial and linear algebra problems
• Randomized parallel algorithms

This page was built for publication: Randomized parallel algorithms

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