Theoremcore
Expected chain length under universal hashing
Also called universal hashing analysis, expected chain length bound.
With a universal family, expected search cost in a chained table with load factor alpha is O(1 + alpha) for any key set.
With a universal family, expected search cost in a chained table with load factor alpha is O(1 + alpha) for any key set.
About this page
The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.
| Ladder | Level | What the next level needs |
|---|---|---|
| Human proof | H0 no proof |
|
| Lean | L0 no Lean part |
|
| Visual | V0 none |
|
| Writing | W0 stub |
|
Tag 68DH25 Edit this page History Report an error