Deterministic Coin Tossing With Applications to Optimal Parallel List Ranking (Classic Reprint) - Hardcover
Synopsis
Excerpt from Deterministic Coin Tossing With Applications to Optimal Parallel List Ranking
The following problem is considered: given a linked list of length n, compute the distance from each element of the linked list to the end of the list. The problem has two standard deterministic algorithms: a linear time serial algorithm, and an 0(log n) time parallel algorithm using n processors. We present new deterministic parallel algorithms for the problem. Our strongest results are.
About the Publisher
Forgotten Books publishes hundreds of thousands of rare and classic books. Find more at www.forgottenbooks.com
This book is a reproduction of an important historical work. Forgotten Books uses state-of-the-art technology to digitally reconstruct the work, preserving the original format whilst repairing imperfections present in the aged copy. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in our edition. We do, however, repair the vast majority of imperfections successfully; any imperfections that remain are intentionally left to preserve the state of such historical works.
"synopsis" may belong to another edition of this title.
