Amortized Complexity of Data Structures, Vol. 255 (Classic Reprint) - Softcover

Inhaltsangabe

Excerpt from Amortized Complexity of Data Structures, Vol. 255

Introduction Single-level Hashing Model Uniform Hash Functions and Worst-case Complexity Nonuniform Hash Functions Amortization Multilevel Hashing Model Partial Hashing Model Adversary Two Random Sampling Lemmas The Worst-case Lower Bound Amortization.

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.