In this paper, we show that there is no time-space tradeoff in incremental open addressing: there is an incremental open-addressed hash table that supports $O(1)$ worst-case expected time insertions, positive queries, and negative queries, at any load factor (even load factor $1$). As an intermediate result, we also re...
Martín Farach-Colton, A. Krapivin, William Kuszmaul· 0 citations
In this paper, we introduce braided cuckoo hashing, an open-addressed hash table that supports load factor up to $1 - \varepsilon$ (for some parameter $\varepsilon \in (0, 1)$), while supporting queries, insertions, and deletions in worst-case time $O(\log \varepsilon^{-1})$, with high probability. This result represen...
A defining feature of the linear-probing hash table is its spatial locality: at load factor $1 - \varepsilon$, the hash table can be implemented so that each operation scans a single contiguous region of expected size $O(1/\varepsilon)$ (this is known as the \emph{scan cost}). This guarantee, however, relies on all ite...
A. Conway, Hanna Komlós, William Kuszmaul· 0 citations
We show how to implement a dynamic array $A[1, n]$ with symbols from a fixed alphabet $\Sigma$, while supporting $O(1)$-time queries and updates, and using a total space of $$ \log \binom{|\Sigma|}{m} + \left(1 + O\left(\frac{\log \log n}{\log n}\right)\right) \cdot \left(\sum_{\sigma \in \Sigma} f_\sigma \log (n / f_\...
G. Blelloch, Yang Hu, William Kuszmaul et al.· 2 citations
There is a surprisingly strong ``power of two choices''phenomenon for linear-probing hash tables, allowing for a two-choice hash table to achieve significantly better bounds than what might at first seem to be possible.
Amir Azarmehr, Michael A. Bender, William Kuszmaul et al.· 0 citations
A dynamic dictionary is constructed that supports operations in $O(\log\varepsilon^{-1}/\log\log\varepsilon^{-1})$ expected amortized time and uses bits of space, and proves a matching lower bound, showing that the time-space tradeoff is optimal even in the \emph{static} case.
G. Blelloch, Yang Hu, William Kuszmaul et al.· 1 citation
This paper considers the following basic question: Does request fragmentation fundamentally change the problem of memory allocation, and if so, how, and finds that even using $k = 1 + o(1)$ request fragmentation, the optimal competitive ratiocollapses to $\Theta(\log M)$.
Michael A. Bender, A. Conway, Martín Farach-Colton et al.· 1 citation
It is shown that, for sufficiently large $p, the expected maximum loads in the modular and real settings are essentially the same, giving an alternative route to an $n^{1/3+o(1)}$ upper bound, and the Kakeya conjecture for upper Minkowski dimension is proved.
Ainesh Bakshi, A. Conway, Hanna Komlós et al.· 1 citation
First proposed in 1968, quadratic probing has stood for more than half a century as one of the simplest and most widely used hash-table designs in computer science. It is conjectured that, at load factor $1 - \epsilon$, the hash table achieves $O(\epsilon^{-1})$ expected insertion time. But even proving a bound of the...
Yang Hu, William Kuszmaul, Jingxun Liang et al.· 0 citations
This thesis surveys major algorithmic developments for computing treewidth and discusses the compression and improvement paradigm developed in the 1990s, especially in the work of Bodlaender and Kloks, and Bodlaender and Hagerup.
Taek-Yoon Kim, Chair Guy Blelloch, William Kuszmaul· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.