Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
etep
on July 18, 2015
|
parent
|
context
|
favorite
| on:
Counting hash collisions with the birthday paradox
I've faced similar questions and the work of Michael Mitzenmacher (at Harvard) has proved very valuable (e.g. modeling table load for d-left).
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search:
