On: Undergraduate shows that searches within hash tables can be much faster

[isaacfrond]

The paper is here: https://arxiv.org/pdf/2111.12800

Curiously, Andrew Krapivin, the genious undergrad in the article, is not one of the authors.

[sd9 → isaacfrond]

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

[rurban → isaacfrond]

Did anyone see the code? I didn't find anything on gitlab nor github.

Edit: Elastic Hashing found https://github.com/MWARDUNI/ElasticHashing

Want to find out if it's only academic or also realistic, and esp. within which bounds.

[jtbetz22 → isaacfrond]

Krapivin's work was a result of his study of the Tiny Pointers paper; his paper has already been linked in another response.