Learning augmented binary search trees
H Lin, T Luo, D Woodruff - International Conference on …, 2022 - proceedings.mlr.press
A treap is a classic randomized binary search tree data structure that is easy to implement
and supports O (log n) expected time access. However, classic treaps do not take advantage …
and supports O (log n) expected time access. However, classic treaps do not take advantage …
Linear hashing is awesome
MBT Knudsen - 2016 IEEE 57th Annual Symposium on …, 2016 - ieeexplore.ieee.org
The most classic textbook hash function, eg taught in CLRS [MIT Press' 09], is h (x)=((ax+ b)
mod p) mod m,(◊) where x, a, b ε {0, 1,…, p–} and a, b are chosen uniformly at random. It is …
mod p) mod m,(◊) where x, a, b ε {0, 1,…, p–} and a, b are chosen uniformly at random. It is …
[PDF][PDF] Learning Augmented Binary Search Trees
T Luo - 2022 - reports-archive.adm.cs.cmu.edu
A treap is a classic randomized binary search tree data structure that is easy to implement
and supports O (log n) expected time access. However, classic treaps do not take advantage …
and supports O (log n) expected time access. However, classic treaps do not take advantage …
Randomized primitives for big data processing
M Stöckel - KI-Künstliche Intelligenz, 2018 - Springer
A basic question on two pieces of data is:“What is the similarity of the data?” In this extended
abstract we give an overview of new developments in randomized algorithms and data …
abstract we give an overview of new developments in randomized algorithms and data …