The original version of this story appeared in Quanta Magazine. Sometime in the fall of 2021, Andrew Krapivin, an undergraduate at Rutgers University, encountered a paper that would change his life.

Abstract: Building multiple hash tables serves as a very successful technique for gigantic data indexing, which can simultaneously guarantee both the search accuracy and efficiency. However, most of ...

It isn't often that a decades-old assumption underpinning modern technology is overturned, but a recent paper based on the work of an undergraduate and his two co-authors has done just that. That ...

Nested classes are classes that are declared as members of other classes or scopes. Nesting classes is one way to better organize your code. For example, say you have a non-nested class (also known as ...

A project of mine made some time ago. While tinkering about HashMaps I realized I could do a really simple auto-dynamically-allocating one. By using the properties of Chinese Remainder Theorem we can ...

Abstract: This paper considers the basic question of how strong of a probabilistic guarantee can a hash table, storing $n(1+\Theta(1))\log n$-bit key/value pairs ...

People have been working on perfecting hashing since computing's early days. The result has been an almost endless number of hashing methods and tables. Facebook has faced this problem as well. Within ...

This is just a brainstorming issue for concurrent hash tables. @Amanieu, do you think we could make hashbrown concurrent by having a lock per bucket? When resizing the table we'd probably have to lock ...