Algorithm Search⌘K

Theoremresearch

Yao's lower bound for open addressing

Also called Yao's bound on open addressing.

Gives lower bounds on expected probe counts for open addressing with uniform hashing.

Gives lower bounds on expected probe counts for open addressing with uniform hashing.

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.

LadderLevelWhat the next level needs
Human proofH0 no proof
  • add a proof in proofs/ (06.5)
LeanL0 no Lean part
  • name a Lean module in the lean field (07)
VisualV0 none
  • add viz/scene.ts or a figure (10)
WritingW0 stub
  • Statement
  • one source with a locator