Optimal Bounds for Open Addressing Without Reordering · HackerPapers discussions

Optimal Bounds for Open Addressing Without Reordering — mentioned by bikenaga

Thu, 04 Dec 2025 16:13:24 GMT

Original article: "Optimal Bounds for Open Addressing Without Reordering" - https://arxiv.org/abs/2501.02305

Paper and discussion history. A mention is not an endorsement.

Optimal Bounds for Open Addressing Without Reordering — HN submission

Sun, 18 May 2025 11:42:02 GMT

Optimal bounds for open addressed hash tables without reordering

4 points; 0 discussion replies on HN. Paper and source history. A submission is not an endorsement.

Optimal Bounds for Open Addressing Without Reordering — mentioned by mNovak

Mon, 17 Mar 2025 16:17:47 GMT

I was hoping they'd have a discussion of the algorithm itself. Quanta is usually good about making these sorts of things approachable. In any case, the full paper is here [1] if you don't want to scroll through the Wired article. [1] https://arxiv.org/abs/2501.02305

Paper and discussion history. A mention is not an endorsement.

Optimal Bounds for Open Addressing Without Reordering — HN submission

Tue, 11 Feb 2025 16:52:59 GMT

Optimal Bounds for Open Addressing Without Reordering

3 points; 0 discussion replies on HN. Paper and source history. A submission is not an endorsement.

Optimal Bounds for Open Addressing Without Reordering — mentioned by kaathewise

Tue, 11 Feb 2025 11:10:49 GMT

The dereference table allows allocations to fail: https://arxiv.org/pdf/2501.02305#:~:text=If%20both%20buckets... (the text fragment doesn't seem to work in a PDF, it's the 12th page, first paragraph)

Paper and discussion history. A mention is not an endorsement.

Optimal Bounds for Open Addressing Without Reordering — mentioned by sd9

Tue, 11 Feb 2025 09:32:33 GMT

This is the actual paper: https://arxiv.org/abs/2501.02305

Paper and discussion history. A mention is not an endorsement.

Optimal Bounds for Open Addressing Without Reordering — mentioned by gield

Tue, 11 Feb 2025 08:50:28 GMT

That is the paper Krapivin read in ~2023 and inspired him. The actual paper with the breakthrough is from January 2025: https://arxiv.org/abs/2501.02305.

Paper and discussion history. A mention is not an endorsement.

Optimal Bounds for Open Addressing Without Reordering — mentioned by orlp

Mon, 10 Feb 2025 20:37:31 GMT

Skimming the paper [1], the key difference they used is that their hash table insertion algorithm will probe further than the first empty slot, instead of greedily filling the first empty slot it finds. They combine this with a clever probing sequence which provably finds empty slots efficiently, even if the table is very full. This means insertions when the hash table is less full are slower, but you avoid the worst-case scenario where you're probing for the last (few) remaining open slot(s) without any idea as to where they are. [1]: https://arxiv.org/pdf/2501.02305 --- An interesting…

Paper and discussion history. A mention is not an endorsement.

Optimal Bounds for Open Addressing Without Reordering — mentioned by something98

Mon, 10 Feb 2025 20:07:52 GMT

This is the correct (2025) paper. https://arxiv.org/abs/2501.02305

Paper and discussion history. A mention is not an endorsement.