Skip to main content
Search type Search syntax
Tags [tag]
Exact "words here"
Author user:1234
user:me (yours)
Score score:3 (3+)
score:0 (none)
Answers answers:3 (3+)
answers:0 (none)
isaccepted:yes
hasaccepted:no
inquestion:1234
Views views:250
Code code:"if (foo != bar)"
Sections title:apples
body:"apples oranges"
URL url:"*.example.com"
Saves in:saves
Status closed:yes
duplicate:no
migrated:no
wiki:no
Types is:question
is:answer
Exclude -[tag]
-apples
For more details on advanced search visit our help page
Results tagged with
Search options not deleted user 12623
3 votes
3 answers
1k views

What is the formal analysis with Simple Uniform Hashing that the load factor is $\alpha = \f...

Recall the definition of the load factor is the average number of elements in a chain for hashing for a table $T$ of size $m$ (with $n$ elements in consideration). … In this case the definition of the load factor should be: $$ \mathbb{E}[n_j] = \mathbb{E}[T[j]] = \alpha = \frac{n}{m}$$ I was wondering, why is the above statement correct under the Simple Uniform Hashing
Charlie Parker's user avatar
2 votes

What is the formal analysis with Simple Uniform Hashing that the load factor is $\alpha = \f...

We want to calculate the expected length of a chain using SUHA (evenly distributed keys). Denote the length of a specific slot $j$ to be $N_j$. The length of this chain depends on how many of the $n$ …
Charlie Parker's user avatar
1 vote
1 answer
281 views

Different probabilistic statement for Simple Uniform Hashing

I was trying to understand the Simple Uniform Hashing assumption that people and books describe in works and make them into equations and realize which of the different equations are equivalent and which … Those are the equations and maths expressions I would use to describe uniform hashing. …
Charlie Parker's user avatar