2 citations · 5 across the 13 of their papers we have counts for
4 papers · 1 filter
Improved Space-Efficient Approximate Nearest Neighbor Search Using Function Inversion
Samuel McCauley
Approximate nearest neighbor search (ANN) data structures have widespread applications in machine learning, computational biology, and text processing. The goal of ANN is to prepro…
SPIDER: Improved Succinct Rank and Select Performance
Matthew D. Laws, Jocelyn Bliven, Kit Conklin +3
Rank and select data structures seek to preprocess a bit vector to quickly answer two kinds of queries: rank(i) gives the number of 1 bits in slots 0 through i, and select(j) gives…
Root-to-Leaf Scheduling in Write-Optimized Trees
Christopher Chung, William Jannen, Samuel McCauley +1
Write-optimized dictionaries are a class of cache-efficient data structures that buffer updates and apply them in batches to optimize the amortized cache misses per update. For exa…
Incremental Topological Ordering and Cycle Detection with Predictions
Samuel McCauley, Benjamin Moseley, Aidin Niaparast +1
This paper leverages the framework of algorithms-with-predictions to design data structures for two fundamental dynamic graph problems: incremental topological ordering and cycle d…