Sinossi
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.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
Altre edizioni note dello stesso titolo
Risultati della ricerca per Amortized Complexity of Data Structures, Vol. 255 (Classic...
Immagini fornite dal venditore
Amortized Complexity of Data Structures, Vol. 255 (Classic Reprint)
Print on DemandDa: Forgotten Books, London, Regno Unito
Valutazione del venditore 4 su 5 stelle
Paperback. Condizione: New. Print on Demand. This book delves into the topic of amortized complexity, a valuable framework for analyzing the performance of data structures. The author explores fundamental data structure problems, such as the Dictionary Problem, Splay Algorithms, and Set Equality Problem. Through a series of intricate and engaging examples, the author demonstrates the power of amortized analysis, enabling readers to make insightful estimations on the behavior of data structures under various usage patterns. The book contributes to the ongoing conversation on data structure complexity and provides fresh perspectives on devising and evaluating efficient data structures. This book is a reproduction of an important historical work, digitally reconstructed using state-of-the-art technology to preserve the original format. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in the book. print-on-demand item. Codice articolo 9781332099085_0
Compra nuovo
EUR 16,26
Spedizione gratuita
Spedito da Regno Unito a U.S.A.
Spedito da Regno Unito a U.S.A.
Quantità: Più di 20 disponibili
Foto dell'editore
Amortized Complexity of Data Structures, Vol 255 Classic Reprint
Da: PBShop.store US, Wood Dale, IL, U.S.A.
Valutazione del venditore 5 su 5 stelle
PAP. Condizione: New. New Book. Shipped from UK. Established seller since 2000. Codice articolo LW-9781332099085
Compra nuovo
EUR 22,82
Spedizione gratuita
Spedito in U.S.A.
Spedito in U.S.A.
Quantità: 15 disponibili
Foto dell'editore
Amortized Complexity of Data Structures, Vol 255 Classic Reprint
Da: PBShop.store UK, Fairford, GLOS, Regno Unito
Valutazione del venditore 4 su 5 stelle
PAP. Condizione: New. New Book. Shipped from UK. Established seller since 2000. Codice articolo LW-9781332099085
Compra nuovo
EUR 21,30
Spedizione EUR 3,77
Spedito da Regno Unito a U.S.A.
Spedito da Regno Unito a U.S.A.
Quantità: 15 disponibili