Dietzfelbinger, Martin;
Walzer, Stefan
Efficient Gauss elimination for near-quadratic matrices with one short random block per row, with applications. - In: 27th Annual European Symposium on Algorithms, (2019), S. 39:1-39:18
https://doi.org/10.4230/LIPIcs.ESA.2019.39
Efficient Gauss elimination for near-quadratic matrices with one short random block per row, with applications. - In: 27th Annual European Symposium on Algorithms, (2019), S. 39:1-39:18
https://doi.org/10.4230/LIPIcs.ESA.2019.39
Dietzfelbinger, Martin;
Walzer, Stefan
Dense peelable random uniform hypergraphs. - In: 27th Annual European Symposium on Algorithms, (2019), S. 38:1-38:16
https://doi.org/10.4230/LIPIcs.ESA.2019.38
Dense peelable random uniform hypergraphs. - In: 27th Annual European Symposium on Algorithms, (2019), S. 38:1-38:16
https://doi.org/10.4230/LIPIcs.ESA.2019.38
Dietzfelbinger, Martin;
Keller, Jörg
Determining minimum hash width for hash chains. - In: CECC 2019, (2019), article no. 18, 5 Seiten
https://doi.org/10.1145/3360664.3360682
Determining minimum hash width for hash chains. - In: CECC 2019, (2019), article no. 18, 5 Seiten
https://doi.org/10.1145/3360664.3360682
Sanders, Peter;
Mehlhorn, Kurt; Dietzfelbinger, Martin; Dementiev, Roman
Sequential and parallel algorithms and data structures : the basic toolbox. - Cham : Springer, 2019. - xv, 509 Seiten ISBN 978-3-030-25208-3
Literaturverzeichnis: Seite 467-485
Sequential and parallel algorithms and data structures : the basic toolbox. - Cham : Springer, 2019. - xv, 509 Seiten ISBN 978-3-030-25208-3
Literaturverzeichnis: Seite 467-485
Dietzfelbinger, Martin;
Walzer, Stefan
Constant-time retrieval with O(log m) extra bits. - In: 36th International Symposium on Theoretical Aspects of Computer Science, (2019), 24, S. 24:1-24:16
https://doi.org/10.4230/LIPIcs.STACS.2019.24
Constant-time retrieval with O(log m) extra bits. - In: 36th International Symposium on Theoretical Aspects of Computer Science, (2019), 24, S. 24:1-24:16
https://doi.org/10.4230/LIPIcs.STACS.2019.24
Aumüller, Martin;
Dietzfelbinger, Martin; Heuberger, Clemens; Krenn, Daniel; Prodinger, Helmut
Dual-Pivot quicksort: optimality, analysis and zeros of associated lattice paths. - In: Combinatorics, probability & computing, ISSN 1469-2163, Bd. 28 (2019), 4, S. 485-518
https://doi.org/10.1017/S096354831800041X
Dual-Pivot quicksort: optimality, analysis and zeros of associated lattice paths. - In: Combinatorics, probability & computing, ISSN 1469-2163, Bd. 28 (2019), 4, S. 485-518
https://doi.org/10.1017/S096354831800041X
Dietzfelbinger, Martin;
Schlag, Philipp; Walzer, Stefan
A subquadratic algorithm for 3XOR. - In: 43rd International Symposium on Mathematical Foundations of Computer Science, (2018), 59, insges. 15 S.
https://doi.org/10.4230/LIPIcs.MFCS.2018.59
A subquadratic algorithm for 3XOR. - In: 43rd International Symposium on Mathematical Foundations of Computer Science, (2018), 59, insges. 15 S.
https://doi.org/10.4230/LIPIcs.MFCS.2018.59
Dietzfelbinger, Martin;
Universal hashing via integer arithmetic without primes, revisited. - In: Adventures Between Lower Bounds and Higher Altitudes, (2018), S. 257-279
https://doi.org/10.1007/978-3-319-98355-4_15
Universal hashing via integer arithmetic without primes, revisited. - In: Adventures Between Lower Bounds and Higher Altitudes, (2018), S. 257-279
https://doi.org/10.1007/978-3-319-98355-4_15
Dietzfelbinger, Martin; Mitzenmacher, Michael; Pagh, Rasmus; Woodruff, David P.; Aumüller, Martin
Theory and applications of hashing : report from Dagstuhl Seminar 17181. - In: , ISSN 2192-5283, Bd. 7 (2017), 5, S. 1-21
http://dx.doi.org/10.4230/DagRep.7.5.1
Theory and applications of hashing : report from Dagstuhl Seminar 17181. - In: , ISSN 2192-5283, Bd. 7 (2017), 5, S. 1-21
http://dx.doi.org/10.4230/DagRep.7.5.1
Aumüller, Martin;
Dietzfelbinger, Martin; Klaue, Pascal
How good is Multi-Pivot Quicksort?. - In: ACM transactions on algorithms, ISSN 1549-6333, Bd. 13 (2016), 1, Article No. 8, insges. 47 S.
https://doi.org/10.1145/2963102
How good is Multi-Pivot Quicksort?. - In: ACM transactions on algorithms, ISSN 1549-6333, Bd. 13 (2016), 1, Article No. 8, insges. 47 S.
https://doi.org/10.1145/2963102