default search action
Stefan Walzer
Person information
- affiliation: Cologne University, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j11]Pedro Reviriego
, Alfonso Sánchez-Macián
On the Privacy of Multi-Versioned Approximate Membership Check Filters. IEEE Trans. Dependable Secur. Comput. 21(4): 1981-1993 (2024) - [c21]Hans-Peter Lehmann
ShockHash: Towards Optimal-Space Minimal Perfect Hashing Beyond Brute-Force. ALENEX 2024: 194-206 - [c20]Stefan Hermann, Hans-Peter Lehmann
PHOBIC: Perfect Hashing With Optimized Bucket Sizes and Interleaved Coding. ESA 2024: 69:1-69:17 - [c19]Djamal Belazzougui, Gregory Kucherov, Stefan Walzer:
Better Space-Time-Robustness Trade-Offs for Set Reconciliation. ICALP 2024: 20:1-20:19 - [c18]Andrea Monterubbiano
Lightweight Acquisition and Ranging of Flows in the Data Plane. SIGMETRICS/Performance (Abstracts) 2024: 21-22 - [c17]William Kuszmaul
Space Lower Bounds for Dynamic Filters and Value-Dynamic Retrieval. STOC 2024: 1153-1164 - [i25]Stefan Walzer:
The Probability to Hit Every Bin with a Linear Number of Balls. CoRR abs/2403.00736 (2024) - [i24]Djamal Belazzougui, Gregory Kucherov, Stefan Walzer:
Better space-time-robustness trade-offs for set reconciliation. CoRR abs/2404.09607 (2024) - [i23]Stefan Hermann, Hans-Peter Lehmann, Giulio Ermanno Pibiri, Peter Sanders, Stefan Walzer:
PHOBIC: Perfect Hashing with Optimized Bucket Sizes and Interleaved Coding. CoRR abs/2404.18497 (2024) - [i22]Franziska Eberle, Felix Hommelsheim, Malin Rau, Stefan Walzer:
A Tight (3/2 + ε)-Approximation Algorithm for Demand Strip Packing. CoRR abs/2408.08627 (2024) - 2023
- [j10]Stefan Walzer:
What if we tried Less Power? Lessons from studying the power of choices in hashing-based data structures. Bull. EATCS 140 (2023) - [j9]Andrea Monterubbiano
Lightweight Acquisition and Ranging of Flows in the Data Plane. Proc. ACM Meas. Anal. Comput. Syst. 7(3): 44:1-44:24 (2023) - [j8]Stefan Walzer
Load Thresholds for Cuckoo Hashing with Overlapping Blocks. ACM Trans. Algorithms 19(3): 24:1-24:22 (2023) - [j7]Pedro Reviriego
On the Privacy of Counting Bloom Filters. IEEE Trans. Dependable Secur. Comput. 20(2): 1488-1499 (2023) - [j6]Sergio Galán
On the Privacy of Counting Bloom Filters Under a Black-Box Attacker. IEEE Trans. Dependable Secur. Comput. 20(5): 4434-4440 (2023) - [c16]Hans-Peter Lehmann
SicHash - Small Irregular Cuckoo Tables for Perfect Hashing. ALENEX 2023: 176-189 - [c15]Peter C. Dillinger
Optimal Uncoordinated Unique IDs. PODS 2023: 221-230 - [c14]Jakob Bæk Tejs Houen, Rasmus Pagh
Simple Set Sketching. SOSA 2023: 228-241 - [i21]Peter C. Dillinger, Martin Farach-Colton, Guido Tagliavini, Stefan Walzer:
Optimal Uncoordinated Unique IDs. CoRR abs/2304.07109 (2023) - [i20]Hans-Peter Lehmann, Peter Sanders, Stefan Walzer:
Sliding Block Hashing (Slick) - Basic Algorithmic Ideas. CoRR abs/2304.09283 (2023) - [i19]Stefan Walzer:
What if we tried Less Power? - Lessons from studying the power of choices in hashing-based data structures. CoRR abs/2307.00644 (2023) - [i18]Hans-Peter Lehmann, Peter Sanders, Stefan Walzer:
ShockHash: Towards Optimal-Space Minimal Perfect Hashing Beyond Brute-Force. CoRR abs/2308.09561 (2023) - [i17]Hans-Peter Lehmann, Peter Sanders, Stefan Walzer:
Bipartite ShockHash: Pruning ShockHash Search for Efficient Perfect Hashing. CoRR abs/2310.14959 (2023) - 2022
- [j5]Alexander Koch
Private Function Evaluation with Cards. New Gener. Comput. 40(1): 115-147 (2022) - [c13]Peter Mörters
A Sublinear Local Access Implementation for the Chinese Restaurant Process. APPROX/RANDOM 2022: 28:1-28:18 - [c12]Stefan Walzer:
Insertion Time of Random Walk Cuckoo Hashing below the Peeling Threshold. ESA 2022: 87:1-87:11 - [c11]Peter C. Dillinger, Lorenz Hübschle-Schneider, Peter Sanders, Stefan Walzer:
Fast Succinct Retrieval and Approximate Membership Using Ribbon. SEA 2022: 4:1-4:20 - [i16]Stefan Walzer:
Insertion Time of Random Walk Cuckoo Hashing below the Peeling Threshold. CoRR abs/2202.05546 (2022) - [i15]Hans-Peter Lehmann, Peter Sanders, Stefan Walzer:
SicHash - Small Irregular Cuckoo Tables for Perfect Hashing. CoRR abs/2210.01560 (2022) - [i14]Jakob Bæk Tejs Houen, Rasmus Pagh, Stefan Walzer:
Simple Set Sketching. CoRR abs/2211.03683 (2022) - 2021
- [c10]Alexander Koch
Foundations for Actively Secure Card-Based Cryptography. FUN 2021: 17:1-17:23 - [c9]Stefan Walzer:
Peeling Close to the Orientability Threshold - Spatial Coupling in Hashing-Based Data Structures. SODA 2021: 2194-2211 - [i13]Peter C. Dillinger, Stefan Walzer:
Ribbon filter: practically smaller than Bloom and Xor. CoRR abs/2103.02515 (2021) - [i12]Peter C. Dillinger, Lorenz Hübschle-Schneider, Peter Sanders, Stefan Walzer:
Fast Succinct Retrieval and Approximate Membership using Ribbon. CoRR abs/2109.01892 (2021) - [i11]Pedro Reviriego, Alfonso Sánchez-Macián, Stefan Walzer, Peter C. Dillinger:
Approximate Membership Query Filters with a False Positive Free Set. CoRR abs/2111.06856 (2021) - 2020
- [b1]Stefan Walzer:
Random hypergraphs for hashing-based data structures. Technische Universität Ilmenau, Germany, TU Ilmenau 2020 - [p1]Stefan Walzer:
Zufällige Hypergraphen für Hashing-basierte Datenstrukturen. Ausgezeichnete Informatikdissertationen 2020: 339-348 - [i10]Stefan Walzer:
Peeling Close to the Orientability Threshold: Spatial Coupling in Hashing-Based Data Structures. CoRR abs/2001.10500 (2020)
2010 – 2019
- 2019
- [j4]Tobias Maier
Dynamic Space Efficient Hashing. Algorithmica 81(8): 3162-3185 (2019) - [c8]Martin Dietzfelbinger
Dense Peelable Random Uniform Hypergraphs. ESA 2019: 38:1-38:16 - [c7]Martin Dietzfelbinger
Efficient Gauss Elimination for Near-Quadratic Matrices with One Short Random Block per Row, with Applications. ESA 2019: 39:1-39:18 - [c6]Martin Dietzfelbinger
Constant-Time Retrieval with O(log m) Extra Bits. STACS 2019: 24:1-24:16 - [i9]Martin Dietzfelbinger, Stefan Walzer:
Dense Peelable Random Uniform Hypergraphs. CoRR abs/1907.04749 (2019) - [i8]Martin Dietzfelbinger, Stefan Walzer:
Efficient Gauss Elimination for Near-Quadratic Matrices with One Short Random Block per Row, with Applications. CoRR abs/1907.04750 (2019) - 2018
- [c5]Stefan Walzer
Load Thresholds for Cuckoo Hashing with Overlapping Blocks. ICALP 2018: 102:1-102:10 - [c4]Martin Dietzfelbinger
A Subquadratic Algorithm for 3XOR. MFCS 2018: 59:1-59:15 - [c3]Michael Mitzenmacher, Konstantinos Panagiotou, Stefan Walzer
Load Thresholds for Cuckoo Hashing with Double Hashing. SWAT 2018: 29:1-29:9 - [i7]Martin Dietzfelbinger, Philipp Schlag, Stefan Walzer:
A Subquadratic Algorithm for 3XOR. CoRR abs/1804.11086 (2018) - [i6]Alexander Koch
Private Function Evaluation with Cards. IACR Cryptol. ePrint Arch. 2018: 1113 (2018) - 2017
- [j3]Maria Axenovich, Stefan Walzer
Boolean Lattices: Ramsey Properties and Embeddings. Order 34(2): 287-298 (2017) - [c2]Julia Kastner
The Minimum Number of Cards in Practical Card-Based Protocols. ASIACRYPT (3) 2017: 126-155 - [i5]Stefan Walzer:
Load Thresholds for Cuckoo Hashing with Overlapping Blocks. CoRR abs/1707.06855 (2017) - [i4]Alexander Koch, Stefan Walzer
Foundations for Actively Secure Card-based Cryptography. IACR Cryptol. ePrint Arch. 2017: 423 (2017) - [i3]Julia Kastner, Alexander Koch, Stefan Walzer
The Minimum Number of Cards in Practical Card-based Protocols. IACR Cryptol. ePrint Arch. 2017: 863 (2017) - 2015
- [j2]Daniel Hoske, Jonathan Rollin
Playing weighted Tron on trees. Discret. Math. 338(12): 2341-2347 (2015) - [c1]Alexander Koch
Card-Based Cryptographic Protocols Using a Minimal Number of Cards. ASIACRYPT (1) 2015: 783-807 - [i2]Alexander Koch, Stefan Walzer
Card-based Cryptographic Protocols Using a Minimal Number of Cards. IACR Cryptol. ePrint Arch. 2015: 865 (2015) - 2014
- [j1]Stefan Walzer
Packing polyominoes clumsily. Comput. Geom. 47(1): 52-60 (2014) - [i1]Daniel Hoske, Jonathan Rollin, Torsten Ueckerdt, Stefan Walzer:
Playing weighted Tron on Trees. CoRR abs/1412.4100 (2014)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: