Packing polyominoes clumsily. - Stefan Walzer; Maria Axenovich; Torsten Ueckerdt (Comput. Geom., 2014)

Playing weighted Tron on trees. - Daniel Hoske; Jonathan Rollin; Torsten Ueckerdt; Stefan Walzer (Discret. Math., 2015)

Card-based Cryptographic Protocols Using a Minimal Number of Cards. - Alexander Koch 001; Stefan Walzer; Kevin Härtel (IACR Cryptol. ePrint Arch., 2015)

Foundations for Actively Secure Card-based Cryptography. - Alexander Koch 001; Stefan Walzer (IACR Cryptol. ePrint Arch., 2017)

The Minimum Number of Cards in Practical Card-based Protocols. - Julia Kastner; Alexander Koch 001; Stefan Walzer; Daiki Miyahara; Yu-ichi Hayashi; Takaaki Mizuki; Hideaki Sone (IACR Cryptol. ePrint Arch., 2017)

Boolean Lattices: Ramsey Properties and Embeddings. - Maria Axenovich; Stefan Walzer (Order, 2017)

A Subquadratic Algorithm for 3XOR. - Martin Dietzfelbinger; Philipp Schlag; Stefan Walzer (MFCS, 2018)

Load Thresholds for Cuckoo Hashing with Double Hashing. - Michael Mitzenmacher; Konstantinos Panagiotou; Stefan Walzer (SWAT, 2018)

Dense Peelable Random Uniform Hypergraphs. - Martin Dietzfelbinger; Stefan Walzer (ESA, 2019)

Efficient Gauss Elimination for Near-Quadratic Matrices with One Short Random Block per Row, with Applications. - Martin Dietzfelbinger; Stefan Walzer (ESA, 2019)

Constant-Time Retrieval with O(log m) Extra Bits. - Martin Dietzfelbinger; Stefan Walzer (STACS, 2019)

Dynamic Space Efficient Hashing. - Tobias Maier; Peter Sanders 001; Stefan Walzer (Algorithmica, 2019)

Random hypergraphs for hashing-based data structures. - Stefan Walzer (TU Ilmenau, 2020)

Zufällige Hypergraphen für Hashing-basierte Datenstrukturen. - Stefan Walzer (Ausgezeichnete Informatikdissertationen, 2020)

Peeling Close to the Orientability Threshold - Spatial Coupling in Hashing-Based Data Structures. - Stefan Walzer (SODA, 2021)

Ribbon filter: practically smaller than Bloom and Xor. - Peter C. Dillinger; Stefan Walzer (CoRR, 2021)

Approximate Membership Query Filters with a False Positive Free Set. - Pedro Reviriego; Alfonso Sánchez-Macián; Stefan Walzer; Peter C. Dillinger (CoRR, 2021)

A Sublinear Local Access Implementation for the Chinese Restaurant Process. - Peter Mörters; Christian Sohler; Stefan Walzer (APPROX/RANDOM, 2022)

Insertion Time of Random Walk Cuckoo Hashing below the Peeling Threshold. - Stefan Walzer (ESA, 2022)

Fast Succinct Retrieval and Approximate Membership Using Ribbon. - Peter C. Dillinger; Lorenz Hübschle-Schneider; Peter Sanders 001; Stefan Walzer (SEA, 2022)

Private Function Evaluation with Cards. - Alexander Koch 001; Stefan Walzer (New Gener. Comput., 2022)

SicHash - Small Irregular Cuckoo Tables for Perfect Hashing. - Hans-Peter Lehmann; Peter Sanders 001; Stefan Walzer (ALENEX, 2023)

Optimal Uncoordinated Unique IDs. - Peter C. Dillinger; Martin Farach-Colton; Guido Tagliavini; Stefan Walzer (PODS, 2023)

Simple Set Sketching. - Jakob Bæk Tejs Houen; Rasmus Pagh; Stefan Walzer (SOSA, 2023)

Sliding Block Hashing (Slick) - Basic Algorithmic Ideas. - Hans-Peter Lehmann; Peter Sanders 001; Stefan Walzer (CoRR, 2023)

Bipartite ShockHash: Pruning ShockHash Search for Efficient Perfect Hashing. - Hans-Peter Lehmann; Peter Sanders 001; Stefan Walzer (CoRR, 2023)

What if we tried Less Power? Lessons from studying the power of choices in hashing-based data structures. - Stefan Walzer (Bull. EATCS, 2023)

On the Privacy of Counting Bloom Filters Under a Black-Box Attacker. - Sergio Galán; Pedro Reviriego; Stefan Walzer; Alfonso Sánchez-Macián; Shanshan Liu 001; Fabrizio Lombardi (IEEE Trans. Dependable Secur. Comput., 2023)

On the Privacy of Counting Bloom Filters. - Pedro Reviriego; Alfonso Sánchez-Macián; Stefan Walzer; Elena Merino Gómez; Shanshan Liu 001; Fabrizio Lombardi (IEEE Trans. Dependable Secur. Comput., 2023)

Load Thresholds for Cuckoo Hashing with Overlapping Blocks. - Stefan Walzer (ACM Trans. Algorithms, 2023)

Lightweight Acquisition and Ranging of Flows in the Data Plane. - Andrea Monterubbiano; Jonatan Langlet; Stefan Walzer; Gianni Antichi; Pedro Reviriego; Salvatore Pontarelli (Proc. ACM Meas. Anal. Comput. Syst., 2023)

ShockHash: Towards Optimal-Space Minimal Perfect Hashing Beyond Brute-Force. - Hans-Peter Lehmann; Peter Sanders 001; Stefan Walzer (ALENEX, 2024)

PHOBIC: Perfect Hashing With Optimized Bucket Sizes and Interleaved Coding. - Stefan Hermann; Hans-Peter Lehmann; Giulio Ermanno Pibiri; Peter Sanders 001; Stefan Walzer (ESA, 2024)

Better Space-Time-Robustness Trade-Offs for Set Reconciliation. - Djamal Belazzougui; Gregory Kucherov; Stefan Walzer (ICALP, 2024)

Space Lower Bounds for Dynamic Filters and Value-Dynamic Retrieval. - William Kuszmaul; Stefan Walzer (STOC, 2024)

The Probability to Hit Every Bin with a Linear Number of Balls. - Stefan Walzer (CoRR, 2024)

A Tight (3/2 + ε)-Approximation Algorithm for Demand Strip Packing. - Franziska Eberle; Felix Hommelsheim; Malin Rau; Stefan Walzer (CoRR, 2024)

A Simple yet Exact Analysis of the MultiQueue. - Stefan Walzer; Marvin Williams (CoRR, 2024)

On the Privacy of Multi-Versioned Approximate Membership Check Filters. - Pedro Reviriego; Alfonso Sánchez-Macián; Peter C. Dillinger; Stefan Walzer (IEEE Trans. Dependable Secur. Comput., 2024)

A Tight (3/2 + ∈ )-Approximation Algorithm for Demand Strip Packing. - Franziska Eberle; Felix Hommelsheim; Malin Rau; Stefan Walzer (SODA, 2025)

Combined Search and Encoding for Seeds, with an Application to Minimal Perfect Hashing. - Hans-Peter Lehmann; Peter Sanders 001; Stefan Walzer; Jonatan Ziegler (CoRR, 2025)

Engineering Minimal k-Perfect Hash Functions. - Stefan Hermann; Sebastian Kirmayer; Hans-Peter Lehmann; Peter Sanders 001; Stefan Walzer (CoRR, 2025)

Modern Minimal Perfect Hashing: A Survey. - Hans-Peter Lehmann; Thomas Mueller; Rasmus Pagh; Giulio Ermanno Pibiri; Peter Sanders 001; Sebastiano Vigna; Stefan Walzer (CoRR, 2025)