Zobrazeno 1 - 10
of 99
pro vyhledávání: '"KUSZMAUL, WILLIAM"'
Retrieval data structures are data structures that answer key-value queries without paying the space overhead of explicitly storing keys. The problem can be formulated in four settings (static, value-dynamic, incremental, or dynamic), each of which o
Externí odkaz:
http://arxiv.org/abs/2410.10002
We introduce a classical open-addressed hash table, called rainbow hashing, that supports a load factor of up to $1 - \varepsilon$, while also supporting $O(1)$ expected-time queries, and $O(\log \log \varepsilon^{-1})$ expected-time insertions and d
Externí odkaz:
http://arxiv.org/abs/2409.11280
In the Memory Reallocation Problem a set of items of various sizes must be dynamically assigned to non-overlapping contiguous chunks of memory. It is guaranteed that the sum of the sizes of all items present at any time is at most a $(1-\varepsilon)$
Externí odkaz:
http://arxiv.org/abs/2405.12152
Autor:
Kuszmaul, William, Westover, Alek
This paper introduces the \emph{serial-parallel decision problem}. Consider an online scheduler that receives a series of tasks, where each task has both a parallel and a serial implementation. The parallel implementation has the advantage that it ca
Externí odkaz:
http://arxiv.org/abs/2405.11986
Autor:
Bender, Michael A., Conway, Alex, Farach-Colton, Martín, Komlós, Hanna, Koucký, Michal, Kuszmaul, William, Saks, Michael
The list-labeling problem captures the basic task of storing a dynamically changing set of up to $n$ elements in sorted order in an array of size $m = (1 + \Theta(1))n$. The goal is to support insertions and deletions while moving around elements wit
Externí odkaz:
http://arxiv.org/abs/2405.00807
The list-labeling problem is one of the most basic and well-studied algorithmic primitives in data structures, with an extensive literature spanning upper bounds, lower bounds, and data management applications. The classical algorithm for this proble
Externí odkaz:
http://arxiv.org/abs/2404.16623
Autor:
Kuszmaul, William
This thesis revisits some of the oldest and most basic questions in the theory of randomized data structures—questions such as: How efficient is a linear probing hash table? How fast can you maintain a sorted array of numbers? How big does a pointe
Externí odkaz:
https://hdl.handle.net/1721.1/155068
Autor:
Pandey, Prashant, Bender, Michael A., Conway, Alex, Farach-Colton, Martín, Kuszmaul, William, Tagliavini, Guido, Johnson, Rob
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 is especially important on PMEM, which is slower than DRAM and in whi
Externí odkaz:
http://arxiv.org/abs/2210.04068
In the $d$-dimensional cow-path problem, a cow living in $\mathbb{R}^d$ must locate a $(d - 1)$-dimensional hyperplane $H$ whose location is unknown. The only way that the cow can find $H$ is to roam $\mathbb{R}^d$ until it intersects $\mathcal{H}$.
Externí odkaz:
http://arxiv.org/abs/2209.08427
Autor:
Kuszmaul, William
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, offer? Past work on this question has been bottlenecked by limitations of the known familie
Externí odkaz:
http://arxiv.org/abs/2209.06038