Synopsis
Understand how amortized analysis shapes data structure design and limits
This book examines the amortized complexity of fundamental data structure problems. It explains how a carefully chosen potential function helps analyze sequences of operations and reveals why some problems resist fast constant-time solutions. The work surveys topics like the Dictionary Problem, hashing models, and the Deque Conjecture, with new approaches to upper and lower bounds. It also presents fresh proofs related to the Scanning Theorem, and discusses how lower bounds in this area relate to practical data structure performance.
- How amortized costs are defined and measured across operation sequences
- Different hashing models and their impact on dictionary operations
- New bounds and insights on rotations in binary trees and deque behavior
- Connections between theory and practical data-structure design choices
Amortized Complexity of Data Structures, Vol. 255 offers a focused look at foundational problems and the methods used to approach them in this field.
"synopsis" may belong to another edition of this title.
Other Popular Editions of the Same Title
Search results for Amortized Complexity of Data Structures, Vol. 255 (Classic...
Seller Image
Amortized Complexity of Data Structures, Vol. 255 (Classic Reprint)
Print on DemandSeller: Forgotten Books, London, United Kingdom
Seller rating 4 out of 5 stars
Paperback. Condition: 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. Seller Inventory # 9781332099085_0
Buy New
US$ 18.35
Free Shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: Over 20 available
Stock Image
Amortized Complexity of Data Structures, Vol 255 Classic Reprint
Seller: PBShop.store US, Wood Dale, IL, U.S.A.
Seller rating 5 out of 5 stars
PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000. Seller Inventory # LW-9781332099085
Stock Image
Amortized Complexity of Data Structures, Vol 255 Classic Reprint
Seller: PBShop.store UK, Fairford, GLOS, United Kingdom
Seller rating 4 out of 5 stars
PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000. Seller Inventory # LW-9781332099085
Buy New
US$ 24.88
US$ 4.41 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: 15 available