Stefan Walzer - RankMe

74 papers A* 6A 12B 2Misc 1Journal 46Unranked 5

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Learned Static Function Data Structures. Proc. VLDB Endow. Stefan Hermann, Hans-Peter Lehmann, Giorgio Vinciguerra, Stefan Walzer
2026	J	`jnl`	Ribbon: Fast Succinct Static Retrieval and Approximate Membership. J. ACM Martin Dietzfelbinger, Peter C. Dillinger, Lorenz Hübschle-Schneider, Peter Sanders, Stefan Walzer
2025	A	`conf`	A Simple yet Exact Analysis of the MultiQueue. ESA Stefan Walzer, Marvin Williams
2025	A*	`conf`	A Tight (3/2 + SODA Franziska Eberle, Felix Hommelsheim, Malin Rau, Stefan Walzer
2025	A	`conf`	Combined Search and Encoding for Seeds, with an Application to Minimal Perfect Hashing. ESA Hans-Peter Lehmann, Peter Sanders, Stefan Walzer, Jonatan Ziegler
2025	J	`jnl`	Combined Search and Encoding for Seeds, with an Application to Minimal Perfect Hashing. CoRR Hans-Peter Lehmann, Peter Sanders, Stefan Walzer, Jonatan Ziegler
2025	A	`conf`	Engineering Minimal k-Perfect Hash Functions. ESA Stefan Hermann, Sebastian Kirmayer, Hans-Peter Lehmann, Peter Sanders, Stefan Walzer
2025	J	`jnl`	Engineering Minimal k-Perfect Hash Functions. CoRR Stefan Hermann, Sebastian Kirmayer, Hans-Peter Lehmann, Peter Sanders, Stefan Walzer
2025	J	`jnl`	Learned Static Function Data Structures. CoRR Stefan Hermann, Hans-Peter Lehmann, Giorgio Vinciguerra, Stefan Walzer
2025	J	`jnl`	Modern Minimal Perfect Hashing: A Survey. CoRR Hans-Peter Lehmann, Thomas Mueller, Rasmus Pagh, Giulio Ermanno Pibiri, Peter Sanders, Sebastiano Vigna, Stefan Walzer
2025	J	`jnl`	Peeling Close to the Orientability Threshold Spatial Coupling in Hashing-Based Data Structures. ACM Trans. Algorithms Stefan Walzer
2025	J	`jnl`	ShockHash: Near Optimal-Space Minimal Perfect Hashing Beyond Brute-Force. Algorithmica Hans-Peter Lehmann, Peter Sanders, Stefan Walzer
2025	A	`conf`	Testing Depth First Search Numbering. ESA Artur Czumaj, Christian Sohler, Stefan Walzer
2025	J	`jnl`	Testing Depth First Search Numbering. CoRR Artur Czumaj, Christian Sohler, Stefan Walzer
2024	J	`jnl`	A Simple yet Exact Analysis of the MultiQueue. CoRR Stefan Walzer, Marvin Williams
2024	J	`jnl`	A Tight (3/2 + ε)-Approximation Algorithm for Demand Strip Packing. CoRR Franziska Eberle, Felix Hommelsheim, Malin Rau, Stefan Walzer
2024	A*	`conf`	Better Space-Time-Robustness Trade-Offs for Set Reconciliation. ICALP Djamal Belazzougui, Gregory Kucherov, Stefan Walzer
2024	J	`jnl`	Better space-time-robustness trade-offs for set reconciliation. CoRR Djamal Belazzougui, Gregory Kucherov, Stefan Walzer
2024	—	`conf`	Lightweight Acquisition and Ranging of Flows in the Data Plane. SIGMETRICS/Performance (Abstracts) Andrea Monterubbiano, Jonatan Langlet, Stefan Walzer, Gianni Antichi, Pedro Reviriego, Salvatore Pontarelli
2024	J	`jnl`	On the Privacy of Multi-Versioned Approximate Membership Check Filters. IEEE Trans. Dependable Secur. Comput. Pedro Reviriego, Alfonso Sánchez-Macián, Peter C. Dillinger, Stefan Walzer
2024	A	`conf`	PHOBIC: Perfect Hashing With Optimized Bucket Sizes and Interleaved Coding. ESA Stefan Hermann, Hans-Peter Lehmann, Giulio Ermanno Pibiri, Peter Sanders, Stefan Walzer
2024	J	`jnl`	PHOBIC: Perfect Hashing with Optimized Bucket Sizes and Interleaved Coding. CoRR Stefan Hermann, Hans-Peter Lehmann, Giulio Ermanno Pibiri, Peter Sanders, Stefan Walzer
2024	A	`conf`	ShockHash: Towards Optimal-Space Minimal Perfect Hashing Beyond Brute-Force. ALENEX Hans-Peter Lehmann, Peter Sanders, Stefan Walzer
2024	A*	`conf`	Space Lower Bounds for Dynamic Filters and Value-Dynamic Retrieval. STOC William Kuszmaul, Stefan Walzer
2024	J	`jnl`	The Probability to Hit Every Bin with a Linear Number of Balls. CoRR Stefan Walzer
2023	J	`jnl`	Bipartite ShockHash: Pruning ShockHash Search for Efficient Perfect Hashing. CoRR Hans-Peter Lehmann, Peter Sanders, Stefan Walzer
2023	J	`jnl`	Lightweight Acquisition and Ranging of Flows in the Data Plane. Proc. ACM Meas. Anal. Comput. Syst. Andrea Monterubbiano, Jonatan Langlet, Stefan Walzer, Gianni Antichi, Pedro Reviriego, Salvatore Pontarelli
2023	J	`jnl`	Load Thresholds for Cuckoo Hashing with Overlapping Blocks. ACM Trans. Algorithms Stefan Walzer
2023	J	`jnl`	On the Privacy of Counting Bloom Filters Under a Black-Box Attacker. IEEE Trans. Dependable Secur. Comput. Sergio Galán, Pedro Reviriego, Stefan Walzer, Alfonso Sánchez-Macián, Shanshan Liu, Fabrizio Lombardi
2023	J	`jnl`	On the Privacy of Counting Bloom Filters. IEEE Trans. Dependable Secur. Comput. Pedro Reviriego, Alfonso Sánchez-Macián, Stefan Walzer, Elena Merino Gómez, Shanshan Liu, Fabrizio Lombardi
2023	A*	`conf`	Optimal Uncoordinated Unique IDs. PODS Peter C. Dillinger, Martin Farach-Colton, Guido Tagliavini, Stefan Walzer
2023	J	`jnl`	Optimal Uncoordinated Unique IDs. CoRR Peter C. Dillinger, Martin Farach-Colton, Guido Tagliavini, Stefan Walzer
2023	J	`jnl`	ShockHash: Towards Optimal-Space Minimal Perfect Hashing Beyond Brute-Force. CoRR Hans-Peter Lehmann, Peter Sanders, Stefan Walzer
2023	A	`conf`	SicHash - Small Irregular Cuckoo Tables for Perfect Hashing. ALENEX Hans-Peter Lehmann, Peter Sanders, Stefan Walzer
2023	—	`conf`	Simple Set Sketching. SOSA Jakob Bæk Tejs Houen, Rasmus Pagh, Stefan Walzer
2023	J	`jnl`	Sliding Block Hashing (Slick) - Basic Algorithmic Ideas. CoRR Hans-Peter Lehmann, Peter Sanders, Stefan Walzer
2023	J	`jnl`	What if we tried Less Power? - Lessons from studying the power of choices in hashing-based data structures. CoRR Stefan Walzer
2023	J	`jnl`	What if we tried Less Power? Lessons from studying the power of choices in hashing-based data structures. Bull. EATCS Stefan Walzer
2022	A	`conf`	A Sublinear Local Access Implementation for the Chinese Restaurant Process. APPROX/RANDOM Peter Mörters, Christian Sohler, Stefan Walzer
2022	B	`conf`	Fast Succinct Retrieval and Approximate Membership Using Ribbon. SEA Peter C. Dillinger, Lorenz Hübschle-Schneider, Peter Sanders, Stefan Walzer
2022	A	`conf`	Insertion Time of Random Walk Cuckoo Hashing below the Peeling Threshold. ESA Stefan Walzer
2022	J	`jnl`	Insertion Time of Random Walk Cuckoo Hashing below the Peeling Threshold. CoRR Stefan Walzer
2022	J	`jnl`	Private Function Evaluation with Cards. New Gener. Comput. Alexander Koch, Stefan Walzer
2022	J	`jnl`	SicHash - Small Irregular Cuckoo Tables for Perfect Hashing. CoRR Hans-Peter Lehmann, Peter Sanders, Stefan Walzer
2022	J	`jnl`	Simple Set Sketching. CoRR Jakob Bæk Tejs Houen, Rasmus Pagh, Stefan Walzer
2021	J	`jnl`	Approximate Membership Query Filters with a False Positive Free Set. CoRR Pedro Reviriego, Alfonso Sánchez-Macián, Stefan Walzer, Peter C. Dillinger
2021	J	`jnl`	Fast Succinct Retrieval and Approximate Membership using Ribbon. CoRR Peter C. Dillinger, Lorenz Hübschle-Schneider, Peter Sanders, Stefan Walzer
2021	Misc	`conf`	Foundations for Actively Secure Card-Based Cryptography. FUN Alexander Koch, Stefan Walzer
2021	A*	`conf`	Peeling Close to the Orientability Threshold - Spatial Coupling in Hashing-Based Data Structures. SODA Stefan Walzer
2021	J	`jnl`	Ribbon filter: practically smaller than Bloom and Xor. CoRR Peter C. Dillinger, Stefan Walzer
2020	J	`jnl`	Peeling Close to the Orientability Threshold: Spatial Coupling in Hashing-Based Data Structures. CoRR Stefan Walzer
2020	—	`—`	Random hypergraphs for hashing-based data structures. Stefan Walzer
2020	—	`ch.`	Zufällige Hypergraphen für Hashing-basierte Datenstrukturen. Ausgezeichnete Informatikdissertationen Stefan Walzer
2019	A	`conf`	Constant-Time Retrieval with O(log m) Extra Bits. STACS Martin Dietzfelbinger, Stefan Walzer
2019	A	`conf`	Dense Peelable Random Uniform Hypergraphs. ESA Martin Dietzfelbinger, Stefan Walzer
2019	J	`jnl`	Dense Peelable Random Uniform Hypergraphs. CoRR Martin Dietzfelbinger, Stefan Walzer
2019	J	`jnl`	Dynamic Space Efficient Hashing. Algorithmica Tobias Maier, Peter Sanders, Stefan Walzer
2019	A	`conf`	Efficient Gauss Elimination for Near-Quadratic Matrices with One Short Random Block per Row, with Applications. ESA Martin Dietzfelbinger, Stefan Walzer
2019	J	`jnl`	Efficient Gauss Elimination for Near-Quadratic Matrices with One Short Random Block per Row, with Applications. CoRR Martin Dietzfelbinger, Stefan Walzer
2018	B	`conf`	A Subquadratic Algorithm for 3XOR. MFCS Martin Dietzfelbinger, Philipp Schlag, Stefan Walzer
2018	J	`jnl`	A Subquadratic Algorithm for 3XOR. CoRR Martin Dietzfelbinger, Philipp Schlag, Stefan Walzer
2018	—	`conf`	Load Thresholds for Cuckoo Hashing with Double Hashing. SWAT Michael Mitzenmacher, Konstantinos Panagiotou, Stefan Walzer
2018	A*	`conf`	Load Thresholds for Cuckoo Hashing with Overlapping Blocks. ICALP Stefan Walzer
2018	J	`jnl`	Private Function Evaluation with Cards. IACR Cryptol. ePrint Arch. Alexander Koch, Stefan Walzer
2017	J	`jnl`	Boolean Lattices: Ramsey Properties and Embeddings. Order Maria Axenovich, Stefan Walzer
2017	J	`jnl`	Foundations for Actively Secure Card-based Cryptography. IACR Cryptol. ePrint Arch. Alexander Koch, Stefan Walzer
2017	J	`jnl`	Load Thresholds for Cuckoo Hashing with Overlapping Blocks. CoRR Stefan Walzer
2017	—	`conf`	The Minimum Number of Cards in Practical Card-Based Protocols. ASIACRYPT (3) Julia Kastner, Alexander Koch, Stefan Walzer, Daiki Miyahara, Yu-ichi Hayashi, Takaaki Mizuki, Hideaki Sone
2017	J	`jnl`	The Minimum Number of Cards in Practical Card-based Protocols. IACR Cryptol. ePrint Arch. Julia Kastner, Alexander Koch, Stefan Walzer, Daiki Miyahara, Yu-ichi Hayashi, Takaaki Mizuki, Hideaki Sone
2015	—	`conf`	Card-Based Cryptographic Protocols Using a Minimal Number of Cards. ASIACRYPT (1) Alexander Koch, Stefan Walzer, Kevin Härtel
2015	J	`jnl`	Card-based Cryptographic Protocols Using a Minimal Number of Cards. IACR Cryptol. ePrint Arch. Alexander Koch, Stefan Walzer, Kevin Härtel
2015	J	`jnl`	Playing weighted Tron on trees. Discret. Math. Daniel Hoske, Jonathan Rollin, Torsten Ueckerdt, Stefan Walzer
2014	J	`jnl`	Packing polyominoes clumsily. Comput. Geom. Stefan Walzer, Maria Axenovich, Torsten Ueckerdt
2014	J	`jnl`	Playing weighted Tron on Trees. CoRR Daniel Hoske, Jonathan Rollin, Torsten Ueckerdt, Stefan Walzer