Sinossi
Excerpt from The Spatial Complexity of Oblivious K-Probe Hash Functions
By letting V be selected at random, we may imagine an honest intermediary who conveys, as answers to queries by our (partial) matching algorithm, precise (minimal amounts of) information about the items selected.
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 The Spatial Complexity of Oblivious K-Probe Hash Functions...
Immagini fornite dal venditore
The Spatial Complexity of Oblivious K-Probe Hash Functions (Classic Reprint)
Print on DemandDa: Forgotten Books, London, Regno Unito
Valutazione del venditore 4 su 5 stelle
Paperback. Condizione: 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. Codice articolo 9781333470692_0
Compra nuovo
EUR 15,32
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
The Spatial Complexity of Oblivious KProbe Hash Functions 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-9781333470692
Compra nuovo
EUR 24,40
Spedizione gratuita
Spedito in U.S.A.
Spedito in U.S.A.
Quantità: 15 disponibili
Foto dell'editore
The Spatial Complexity of Oblivious KProbe Hash Functions Classic Reprint
Da: PBShop.store UK, Fairford, GLOS, Regno Unito
Valutazione del venditore 5 su 5 stelle
PAP. Condizione: New. New Book. Shipped from UK. Established seller since 2000. Codice articolo LW-9781333470692
Compra nuovo
EUR 23,83
Spedizione EUR 3,79
Spedito da Regno Unito a U.S.A.
Spedito da Regno Unito a U.S.A.
Quantità: 15 disponibili