• Title Lecture Notes on Bucket Algorithms
• Author(s) Luc Devroye
• Publisher: Birkhäuser; 1986th edition (February 28, 1986)
• Paperback 155 pages
• eBook PDF
• Language: English
• ISBN-10: 0817633286
• ISBN-13: 978-0817633288
• Share This:  

Book Description

Hashing algorithms scramble data and create pseudo-uniform data distributions. Bucket algorithms operate on raw untransformed data which are partitioned into groups according to membership in equal-sized d-dimensional hyperrectangles, called cells or buckets.

The bucket data structure is rather sensitive to the distribution of the data. In these lecture notes, we attempt to explain the connection between the expected time of various bucket algorithms and the distribution of the data.

The results are illustrated on standard searching, sorting and selection problems, as well as on a variety of problems In computational geometry and operations research. The notes grew partially from a graduate course on probability theory In computer science.

• N/A

• Amazon

• Algorithms and Data Structures
• Information Retrieval (IR) and Search Engines Design/Implementation
• Data Analysis and Data Mining, Big Data

• Lecture Notes on Bucket Algorithms (Luc Devroye)

• Algorithm Design (Jon Kleinberg, et al)
• Algorithms, 4th Edition, by Robert Sedgewick and Kevin Wayne
• Text Algorithms (Maxime Crochemore, et al)