Follow
Stefan Walzer
Stefan Walzer
Verified email at cs.uni-koeln.de - Homepage
Title
Cited by
Cited by
Year
Card-based cryptographic protocols using a minimal number of cards
A Koch, S Walzer, K Härtel
Advances in Cryptology--ASIACRYPT 2015: 21st International Conference on the …, 2016
882016
Foundations for actively secure card-based cryptography
A Koch, S Walzer
Cryptology ePrint Archive, 2017
512017
The minimum number of cards in practical card-based protocols
J Kastner, A Koch, S Walzer, D Miyahara, Y Hayashi, T Mizuki, H Sone
ASIACRYPT - International Conference on the Theory and Application of …, 2017
462017
Ribbon filter: practically smaller than Bloom and Xor
PC Dillinger, S Walzer
arXiv preprint arXiv:2103.02515, 2021
152021
Dynamic space efficient hashing
T Maier, P Sanders, S Walzer
Algorithmica 81 (8), 3162-3185, 2019
152019
Boolean lattices: Ramsey properties and embeddings
M Axenovich, S Walzer
Order 34, 287-298, 2017
152017
Private function evaluation with cards
A Koch, S Walzer
New Generation Computing 40 (1), 115-147, 2022
142022
Peeling close to the orientability threshold–spatial coupling in hashing-based data structures
S Walzer
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA …, 2021
122021
Constant-time retrieval with O(log m) extra bits
M Dietzfelbinger, S Walzer
36th International Symposium on Theoretical Aspects of Computer Science …, 2019
112019
Load thresholds for cuckoo hashing with overlapping blocks
S Walzer
45th International Colloquium on Automata, Languages, and Programming (ICALP …, 2018
92018
Load thresholds for cuckoo hashing with double hashing
M Mitzenmacher, K Panagiotou, S Walzer
16th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2018), 2018
82018
Ramsey variant of the 2-dimension of posets
S Walzer
Master thesis, 2015
82015
Dense peelable random uniform hypergraphs
M Dietzfelbinger, S Walzer
27th Annual European Symposium on Algorithms (ESA), 38:1--38:16, 2019
72019
A Subquadratic Algorithm for 3XOR
M Dietzfelbinger, P Schlag, S Walzer
MFCS – 43rd International Symposium on Mathematical Foundations of Computer …, 2018
72018
Random hypergraphs for hashing-based data structures
S Walzer
Technische Universität Ilmenau, 2020
62020
Fast succinct retrieval and approximate membership using ribbon
PC Dillinger, L Hübschle-Schneider, P Sanders, S Walzer
arXiv preprint arXiv:2109.01892, 2021
52021
Efficient Gauss Elimination for Near-Quadratic Matrices with One Short Random Block per Row, with Applications
M Dietzfelbinger, S Walzer
27th Annual European Symposium on Algorithms (ESA), 39:1--39:18, 2019
52019
Packing polyominoes clumsily
S Walzer, M Axenovich, T Ueckerdt
Computational Geometry 47 (1), 52-60, 2014
32014
Clumsy packings in the grid
S Walzer
Bachelor’s Thesis, Karlsruhe Institute of Technology, Germany, 2012
32012
Insertion time of random walk cuckoo hashing below the peeling threshold
S Walzer
arXiv preprint arXiv:2202.05546, 2022
22022
The system can't perform the operation now. Try again later.
Articles 1–20