-
constructing a
perfect hash
function is
described by Belazzougui,
Botelho &
Dietzfelbinger (2009) as "hash, displace, and compress". Here a first-level hash function...
- Mehlhorn,
Dietzfelbinger,
Dementiev 2019, p. 395 Sanders, Mehlhorn,
Dietzfelbinger,
Dementiev 2019, pp. 396-401 Sanders, Mehlhorn,
Dietzfelbinger, Dementiev...
- Vermont, ISBN 978-1-59477-255-9
Dietzfelbinger, K. (2005)
Rosicrucians through the ages (translation of
Dietzfelbinger, K. (1998)
Rozenkruisers toen en...
- 1142/s0129626407002843. ISSN 0129-6264. Sanders, Peter; Mehlhorn, Kurt;
Dietzfelbinger, Martin; Dementiev,
Roman (2019).
Sequential and
Parallel Algorithms...
- on
Bavarian History and Culture, 1989, pp. 26-28, here: p. 26
Eckart Dietzfelbinger,
Gerhard Liedke: Nürnberg - Ort der M****en. Das Reichsparteitagsgelände...
- primality". SIAM
Journal on Computing. 7 (1): 118. doi:10.1137/0207009.
Dietzfelbinger,
Martin (2004-06-29). "Primality
Testing in
Polynomial Time, From Randomized...
- hash functions, at
least half of
those functions have that property.
Dietzfelbinger et al.
present a
dynamic dictionary algorithm that, when a set of n...
-
discussion on why 'Example 2: n is not
Prime past Step 4' is missing.
Dietzfelbinger,
Martin (2004).
Primality testing in
polynomial time. From randomized...
- 657–675, doi:10.1137/0210049, MR 0635424 Sanders, Peter; Mehlhorn, Kurt;
Dietzfelbinger, Martin; Dementiev,
Roman (2019),
Sequential and
Parallel Algorithms...
-
Journal of the ACM (JACM) 59.3 (2012): 1-50. Aumüller, Martin,
Martin Dietzfelbinger, and
Philipp Woelfel. "Explicit and
efficient hash
families suffice...
