Stefan Walzer

Orcid: 0000-0002-6477-0106

Affiliations:
  • Cologne University, Germany


According to our database1, Stefan Walzer authored at least 33 papers between 2014 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
The Probability to Hit Every Bin with a Linear Number of Balls.
CoRR, 2024

2023
Lightweight Acquisition and Ranging of Flows in the Data Plane.
Proc. ACM Meas. Anal. Comput. Syst., December, 2023

Load Thresholds for Cuckoo Hashing with Overlapping Blocks.
ACM Trans. Algorithms, July, 2023

On the Privacy of Counting Bloom Filters.
IEEE Trans. Dependable Secur. Comput., 2023

On the Privacy of Counting Bloom Filters Under a Black-Box Attacker.
IEEE Trans. Dependable Secur. Comput., 2023

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

Bipartite ShockHash: Pruning ShockHash Search for Efficient Perfect Hashing.
CoRR, 2023

ShockHash: Towards Optimal-Space Minimal Perfect Hashing Beyond Brute-Force.
CoRR, 2023

Sliding Block Hashing (Slick) - Basic Algorithmic Ideas.
CoRR, 2023

Simple Set Sketching.
Proceedings of the 2023 Symposium on Simplicity in Algorithms, 2023

Optimal Uncoordinated Unique IDs.
Proceedings of the 42nd ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2023

SicHash - Small Irregular Cuckoo Tables for Perfect Hashing.
Proceedings of the Symposium on Algorithm Engineering and Experiments, 2023

2022
Private Function Evaluation with Cards.
New Gener. Comput., 2022

Fast Succinct Retrieval and Approximate Membership Using Ribbon.
Proceedings of the 20th International Symposium on Experimental Algorithms, 2022

Insertion Time of Random Walk Cuckoo Hashing below the Peeling Threshold.
Proceedings of the 30th Annual European Symposium on Algorithms, 2022

A Sublinear Local Access Implementation for the Chinese Restaurant Process.
Proceedings of the Approximation, 2022

2021
Approximate Membership Query Filters with a False Positive Free Set.
CoRR, 2021

Ribbon filter: practically smaller than Bloom and Xor.
CoRR, 2021

Peeling Close to the Orientability Threshold - Spatial Coupling in Hashing-Based Data Structures.
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

2020
Zufällige Hypergraphen für Hashing-basierte Datenstrukturen.
Proceedings of the Ausgezeichnete Informatikdissertationen 2020., 2020

Random hypergraphs for hashing-based data structures.
PhD thesis, 2020

2019
Dynamic Space Efficient Hashing.
Algorithmica, 2019

Constant-Time Retrieval with O(log m) Extra Bits.
Proceedings of the 36th International Symposium on Theoretical Aspects of Computer Science, 2019

Efficient Gauss Elimination for Near-Quadratic Matrices with One Short Random Block per Row, with Applications.
Proceedings of the 27th Annual European Symposium on Algorithms, 2019

Dense Peelable Random Uniform Hypergraphs.
Proceedings of the 27th Annual European Symposium on Algorithms, 2019

2018
Load Thresholds for Cuckoo Hashing with Double Hashing.
Proceedings of the 16th Scandinavian Symposium and Workshops on Algorithm Theory, 2018

A Subquadratic Algorithm for 3XOR.
Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science, 2018

2017
Boolean Lattices: Ramsey Properties and Embeddings.
Order, 2017

The Minimum Number of Cards in Practical Card-based Protocols.
IACR Cryptol. ePrint Arch., 2017

Foundations for Actively Secure Card-based Cryptography.
IACR Cryptol. ePrint Arch., 2017

2015
Card-based Cryptographic Protocols Using a Minimal Number of Cards.
IACR Cryptol. ePrint Arch., 2015

Playing weighted Tron on trees.
Discret. Math., 2015

2014
Packing polyominoes clumsily.
Comput. Geom., 2014


  Loading...