Author of the publication

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Constant-Time Retrieval with O(log m) Extra Bits., and . STACS, volume 126 of LIPIcs, page 24:1-24:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Dynamic Hashing in Real Time., and . Informatik, volume 1 of Teubner-Texte zur Informatik, Teubner / Springer, (1992)Tight Bounds for Blind Search on the Integers and the Reals., , , and . Comb. Probab. Comput., 19 (5-6): 711-728 (2010)Dual-Pivot Quicksort: Optimality, Analysis and Zeros of Associated Lattice Paths., , , , and . Comb. Probab. Comput., 28 (4): 485-518 (2019)Algorithmentheorie, Skript zur Vorlesung. SS 2006. (2006)Online verfügbar über: http://www.tu-ilmenau.de/fakia/fileadmin/template/startIA/ktea/Lehre/at/ss06/skript060321.pdf.Sequential and Parallel Algorithms and Data Structures - The Basic Toolbox, , , and . Springer, (2019)Algorithmen und Datenstrukturen, , and . eXamen.press Springer Vieweg, Berlin, (2014)Determining Minimum Hash Width for Hash Chains., and . CECC, page 18:1-18:5. ACM, (2019)Efficient Gauss Elimination for Near-Quadratic Matrices with One Short Random Block per Row, with Applications., and . ESA, volume 144 of LIPIcs, page 39:1-39:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Dense Peelable Random Uniform Hypergraphs., and . ESA, volume 144 of LIPIcs, page 38:1-38:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)