Approximate Parallel Scheduling, Vol. 1: The Basic Technique With Applications to Optimal Parallel List Ranking in Logarithmic Time (Classic Reprint) - Softcover

Inhaltsangabe

Excerpt from Approximate Parallel Scheduling, Vol. 1: The Basic Technique With Applications to Optimal Parallel List Ranking in Logarithmic Time

Input: A linked list of length n. It is given in an array of length n, not necessarily in the order of the linked list. Each of the n elements (except the last element in the linked list) has the array index of its successor in the linked list.

The problem: For each element, compute the number of elements following it in the linked list.

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.

Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.