4 citations · 9 across the 5 of their papers we have counts for
5 papers
High-Performance Filters For GPUs
Hunter McCoy, Steven Hofmeyr, Katherine Yelick +1
Filters approximately store a set of items while trading off accuracy for space-efficiency and can address the limited memory on accelerators, such as GPUs. However, there is a lac…
IcebergHT: High Performance PMEM Hash Tables Through Stability and Low Associativity
Prashant Pandey, Michael A. Bender, Alex Conway +4
Modern hash table designs strive to minimize space while maximizing speed. The most important factor in speed is the number of cache lines accessed during updates and queries. This…
The Online Event-Detection Problem
Michael A. Bender, Jonathan W. Berry, Martin Farach-Colton +5
Given a stream , a -heavy hitter is an item that occurs at least times in . The problem of finding heavy-hitters has been extensively stu…
Buffered Count-Min Sketch on SSD: Theory and Experiments
Mayank Goswami, Dzejla Medjedovic, Emina Mekic +1
Frequency estimation data structures such as the count-min sketch (CMS) have found numerous applications in databases, networking, computational biology and other domains. Many app…
A Fast x86 Implementation of Select
Prashant Pandey, Michael A. Bender, Rob Johnson
Rank and select are fundamental operations in succinct data structures, that is, data structures whose space consumption approaches the information-theoretic optimal. The performan…