Synopsis
Step into the intriguing realm of hash functions with this comprehensive book, where the spotlight shines on oblivious k-probe functions. The author delves into the depths of oblivious search, a technique that relies solely on the search key rather than information gleaned from unsuccessful probes. This book challenges conventional wisdom by establishing a significant gap between oblivious and non-oblivious search. It provides nearly tight bounds on the spatial complexity of oblivious k-probe hash functions, illuminating their strengths and limitations. The author masterfully weaves together probabilistic constructions and theoretical analysis, offering a captivating exploration of a fascinating subject. Through insightful discussions and elegant proofs, this book deepens our understanding of hash functions and search algorithms. It not only enhances our theoretical knowledge but also provides practical insights into the design and implementation of efficient data structures for real-world applications.
"synopsis" may belong to another edition of this title.
Other Popular Editions of the Same Title
Search results for The Spatial Complexity of Oblivious K-Probe Hash Functions
Seller Image
The Spatial Complexity of Oblivious K-Probe Hash Functions (Classic Reprint)
Print on DemandSeller: Forgotten Books, London, United Kingdom
Seller rating 4 out of 5 stars
Paperback. Condition: New. Print on Demand. Step into the intriguing realm of hash functions with this comprehensive book, where the spotlight shines on oblivious k-probe functions. The author delves into the depths of oblivious search, a technique that relies solely on the search key rather than information gleaned from unsuccessful probes. This book challenges conventional wisdom by establishing a significant gap between oblivious and non-oblivious search. It provides nearly tight bounds on the spatial complexity of oblivious k-probe hash functions, illuminating their strengths and limitations. The author masterfully weaves together probabilistic constructions and theoretical analysis, offering a captivating exploration of a fascinating subject. Through insightful discussions and elegant proofs, this book deepens our understanding of hash functions and search algorithms. It not only enhances our theoretical knowledge but also provides practical insights into the design and implementation of efficient data structures for real-world applications. 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 # 9781333470692_0
Buy New
US$ 17.05
Free Shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: Over 20 available
Stock Image
The Spatial Complexity of Oblivious KProbe Hash Functions 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-9781333470692
Stock Image
The Spatial Complexity of Oblivious KProbe Hash Functions Classic Reprint
Seller: PBShop.store UK, Fairford, GLOS, United Kingdom
Seller rating 5 out of 5 stars
PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000. Seller Inventory # LW-9781333470692
Buy New
US$ 27.31
US$ 4.35 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: 15 available