Zobrazeno 1 - 10
of 57
pro vyhledávání: '"CONWAY, ALEX"'
Autor:
Wen, Richard, McCoy, Hunter, Tench, David, Tagliavini, Guido, Bender, Michael A., Conway, Alex, Farach-Colton, Martin, Johnson, Rob, Pandey, Prashant
Adaptive filters, such as telescoping and adaptive cuckoo filters, update their representation upon detecting a false positive to avoid repeating the same error in the future. Adaptive filters require an auxiliary structure, typically much larger tha
Externí odkaz:
http://arxiv.org/abs/2405.10253
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:
BENDER, MICHAEL A.1 bender@cs.stonybrook.edu, CONWAY, ALEX2 ajc473@cornell.edu, FARACH-COLTON, MARTÍN3 martin@farach-colton.com, KUSZMAUL, WILLIAM4 kuszmaul@mit.edu, TAGLIAVINI, GUIDO5 guido.tagliavini@snowflake.com
Publikováno v:
Journal of the ACM. Dec2023, Vol. 70 Issue 6, p1-51. 51p.
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
Autor:
Bender, Michael A., Conway, Alex, Farach-Colton, Martín, Komlós, Hanna, Kuszmaul, William, Wein, Nicole
The online list labeling problem is an algorithmic primitive with a large literature of upper bounds, lower bounds, and applications. The goal is to store a dynamically-changing set of $n$ items in an array of $m$ slots, while maintaining the invaria
Externí odkaz:
http://arxiv.org/abs/2203.02763
Autor:
Bender, Michael A., Conway, Alex, Farach-Colton, Martín, Kuszmaul, William, Tagliavini, Guido
This paper introduces a new data-structural object that we call the tiny pointer. In many applications, traditional $\log n $-bit pointers can be replaced with $o (\log n )$-bit tiny pointers at the cost of only a constant-factor time overhead. We de
Externí odkaz:
http://arxiv.org/abs/2111.12800
Autor:
Bender, Michael A., Conway, Alex, Farach-Colton, Martín, Kuszmaul, William, Tagliavini, Guido
Despite being one of the oldest data structures in computer science, hash tables continue to be the focus of a great deal of both theoretical and empirical research. A central reason for this is that many of the fundamental properties that one desire
Externí odkaz:
http://arxiv.org/abs/2109.04548
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.