No. Title Author Year
1 Constant-Time Retrieval with O(log m) Extra Bits Dietzfelbinger, Martin et al. 2019
2 Dense Peelable Random Uniform Hypergraphs Dietzfelbinger, Martin et al. 2019
3 Efficient Gauss Elimination for Near-Quadratic Matrices with One Short Random Block per Row, with Applications Dietzfelbinger, Martin et al. 2019
4 A Subquadratic Algorithm for 3XOR Dietzfelbinger, Martin et al. 2018
5 Theory and Applications of Hashing (Dagstuhl Seminar 17181) Dietzfelbinger, Martin et al. 2017
6 On Randomness in Hash Functions (Invited Talk) Dietzfelbinger, Martin 2012
7 Tight Bounds for Blind Search on the Integers Dietzfelbinger, Martin et al. 2008
8 07391 Abstracts Collection -- Probabilistic Methods in the Design and Analysis of Algorithms Dietzfelbinger, Martin et al. 2007
Current Page :
Number of result pages: 1
Number of documents: 8


DROPS-Home | Imprint | Privacy Published by LZI