6 citations · 6 across the 1 of their papers we have counts for
3 papers
cs.DS2019
Concurrent Expandable AMQs on the Basis of Quotient Filters
Tobias Maier, Peter Sanders, Robert Williger
A quotient filter is a cache efficient AMQ data structure. Depending on the fill degree of the filter most insertions and queries only need to access one or two consecutive cache l…
cs.DS2017
Dynamic Space Efficient Hashing
Tobias Maier, Peter Sanders
We consider space efficient hash tables that can grow and shrink dynamically and are always highly space efficient, i.e., their space consumption is always close to the lower bound…
cs.DS2016★ 6 cited
Concurrent Hash Tables: Fast and General?(!)
Tobias Maier, Peter Sanders, Roman Dementiev
Concurrent hash tables are one of the most important concurrent data structures with numerous applications. Since hash table accesses can dominate the execution time of the overall…