arXiv (All)
open access
Linear Hashing Is Poissonesque
The Poisson approximation theorem states that when $m$ balls are tossed uniformly and randomly into $n$ bins, the distribution of the bin loads can sometimes be approximated by $n$ independent Poisson random variables of mean $m/n$. We show that when the balls are tossed via a random $\mathbb{F}_2$-
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- On the phase transition for the number of collisions on comb graphs#972273
- Improved bounds for the lazy cops and robbers on generalized hypercubes#927470
- On the Tightness of Omura's Strong Converse Exponent and Critical Rates Above Capacity#1201804
- Order-Optimal Coded Caching With File and Demand Privacy#1216080
- Analysis of the asymmetric shelf shuffle#987713
Record · ID 1457904
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive