Deterministic Coin Tossing With Applications to Optimal Parallel List Ranking (Classic Reprint) - Hardcover
Synopsis
A new deterministic coin tossing technique breaks symmetry to unlock near‑optimal speed-ups in parallel algorithms.
This book explores how careful use of binary representations and a structured approach to randomness can improve parallel computation. It connects a theoretical model of parallel memory to practical problems, such as ranking elements in linked lists, and shows how these ideas yield efficient deterministic algorithms that rival randomized methods.
- Learn how to break symmetrical situations without true randomness using deterministic coin tossing
- See how ruling sets and prefix sums enable fast, parallel list ranking and related problems
- Discover how to translate theoretical models into practical parallel algorithms on RAM/PRAM-like machines
- Understand the steps to achieve near-optimal speed-ups in time with a scalable number of processors
"synopsis" may belong to another edition of this title.
