8 documents found

Dissertation
All rights reserved
2020-11-27

Random hypergraphs for hashing-based data structures

This thesis concerns dictionaries and related data structures that rely on providing several random possibilities for storing each key. Imagine information on a set S of m = |S| keys should be stored in n memory locations, indexed by [n] = {1,…,n}. Each object x [ELEMENT OF] S is assigned a small set...
Article / Chapter
CC BY 3.0
2019-09

Efficient Gauss elimination for near-quadratic matrices with one short...

Saarbrücken/Wadern, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH, Dagstuhl Publishing, 2019-09
Article / Chapter
CC BY 3.0
2019-09

Dense peelable random uniform hypergraphs

Saarbrücken/Wadern, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH, Dagstuhl Publishing, 2019-09
Article / Chapter
CC BY 3.0
2019-03

Constant-time retrieval with O(log m) extra bits

Saarbrücken/Wadern, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH, Dagstuhl Publishing, 2019-03
Article / Chapter
CC BY 3.0
2018-08

A subquadratic algorithm for 3XOR

Saarbrücken/Wadern, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH, Dagstuhl Publishing, 2018-08
Article / Chapter
CC BY 3.0
2018-07

Load thresholds for cuckoo hashing with overlapping blocks

Saarbrücken/Wadern, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH, Dagstuhl Publishing, 2018-07
Article / Chapter
CC BY 3.0
2018-06

Load thresholds for cuckoo hashing with double hashing

Saarbrücken/Wadern, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH, Dagstuhl Publishing, 2018-06
Book chapter
CC BY 3.0
2017-12-19

Cuckoo hashing with overlapping buckets

Wadern: Schloss Dagstuhl, 2017-12-19