Anders Aamand

activity

20182024

collaborators

Showing 2018Show all

2 papers · 1 filter

cs.DS2018

Non-Empty Bins with Simple Tabulation Hashing

Anders Aamand, Mikkel Thorup

We consider the hashing of a set $X \subseteq U$ with $∣ X ∣ = m$ using a simple tabulation hash function $h : U \to [n] = {0, \dots, n - 1}$ and analyse the number of non-empty bins, that is,…

cs.DS2018

Power of $d$ Choices with Simple Tabulation

Anders Aamand, Mathias Bæk Tejs Knudsen, Mikkel Thorup

Suppose that we are to place $m$ balls into $n$ bins sequentially using the $d$ -choice paradigm: For each ball we are given a choice of $d$ bins, according to $d$ hash functions $h…

Non-Empty Bins with Simple Tabulation Hashing

Power of d Choices with Simple Tabulation

Power of $d$ Choices with Simple Tabulation