Ideas & society2025 · shared on Hacker News
Optimal bounds for open addressed hash tables without reordering
Explore Optimal bounds for open addressed hash tables without reordering, its original source and Hacker News discussions. Discover community perspectives and save it to your reading list.
GO BEYOND THE ABSTRACT
The conversation around the idea.
Original Hacker News threads. Different perspectives, questions, and things worth thinking about.
Showing up to 100 related threads. A paper may appear in a comment rather than the original submission.
Links found in the discussion
Up to 50 recent source links, in HN item order.
YJhsto ·
Undergraduate shows that searches within hash tables can be much faster
1,304 points584 comments
Yrobin_reala ·
Undergraduate Disproves 40-Year-Old Conjecture, Invents New Kind of Hash Table
246 points112 comments
Yfanf2 ·
Optimal bounds for open addressed hash tables without reordering
4 points0 comments
Ygone35 ·
Optimal Bounds for Open Addressing Without Reordering
3 points0 comments
Ybikenaga ·
Speeding Up Hash Tables
2 points1 comments