Abstract
It is not a secret that methods based upon the truncation of data have good expected time performance. For example, for nice distributions of the data, searching is often better done via a hashing data structure instead of via a search tree. The speed one observes in practice is due to the fact that the truncation operation is a constant time operation.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1986 Springer Science+Business Media New York
About this chapter
Cite this chapter
Devroye, L. (1986). Introduction. In: Lecture Notes on Bucket Algorithms. Progress in Computer Science, vol 6. Birkhäuser, Boston, MA. https://doi.org/10.1007/978-1-4899-3531-1_1
Download citation
DOI: https://doi.org/10.1007/978-1-4899-3531-1_1
Publisher Name: Birkhäuser, Boston, MA
Print ISBN: 978-0-8176-3328-8
Online ISBN: 978-1-4899-3531-1
eBook Packages: Springer Book Archive