Abstract: Hash Tables are important data structures for a wide range of data intensive applications in various domains. They offer compact storage for sparse data, but their performance has ...

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.

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 ...

Abstract: We design and implement a fully concurrent dynamic hash table for GPUs with comparable performance to the state of the art static hash tables. We propose a warp-cooperative work sharing ...

"Great little Deli shop! We stumbled across it while waiting to check into our condo. Fantastically friendly service and yummy food! Accommodated 4 adults and 5 kids in a pinch and was beyond kind!

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 ...