| Publication | Date of Publication | Type |
|---|
| On hashing by (random) equations (invited talk) | 2025-01-06 | Paper |
| Universal Hashing via Integer Arithmetic Without Primes, Revisited | 2023-06-30 | Paper |
| Gossiping and broadcasting versus computing functions in networks | 2022-11-09 | Paper |
| A comparison of two lower bound methods for communication complexity | 2022-08-18 | Paper |
| A perfect parallel dictionary | 2022-08-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5090472 | 2022-07-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5075777 | 2022-05-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5075778 | 2022-05-11 | Paper |
| A subquadratic algorithm for 3XOR | 2021-08-04 | Paper |
| Dual-Pivot Quicksort: Optimality, Analysis and Zeros of Associated Lattice Paths | 2020-03-11 | Paper |
| Polynomial hash functions are reliable | 2019-12-04 | Paper |
| Sequential and Parallel Algorithms and Data Structures | 2019-09-05 | Paper |
| Tight Lower Bounds for Greedy Routing in Higher-Dimensional Small-World Grids | 2019-06-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4633892 | 2019-05-06 | Paper |
| Counting Zeros in Random Walks on the Integers and Analysis of Optimal Dual-Pivot Quicksort | 2019-04-29 | Paper |
| How Good Is Multi-Pivot Quicksort? | 2018-11-05 | Paper |
| Optimal Partitioning for Dual-Pivot Quicksort | 2018-10-30 | Paper |
| Universal hashing and k-wise independent random variables via integer arithmetic without primes | 2017-11-16 | Paper |
| A dictionary implementation based on dynamic perfect hashing | 2017-06-15 | Paper |
| Towards optimal degree distributions for left-perfect matchings in random bipartite graphs | 2015-07-20 | Paper |
| On testing single connectedness in directed graphs and some related problems | 2015-06-02 | Paper |
| Tight lower bounds for greedy routing in uniform small world rings | 2015-02-04 | Paper |
| Explicit and efficient hash families suffice for cuckoo hashing with a stash | 2015-01-19 | Paper |
| Optimal Partitioning for Dual Pivot Quicksort | 2013-08-06 | Paper |
| Tight bounds for blind search on the integers | 2013-03-19 | Paper |
| Tight Bounds for Blind Search on the Integers and the Reals | 2013-03-13 | Paper |
| Explicit and efficient hash families suffice for cuckoo hashing with a stash | 2012-09-25 | Paper |
| Towards optimal degree distributions for left-perfect matchings in random bipartite graphs | 2012-09-10 | Paper |
| Cuckoo Hashing with Pages | 2011-09-16 | Paper |
| Precision, local search and unimodal functions | 2011-03-30 | Paper |
| Tight Thresholds for Cuckoo Hashing via XORSAT | 2010-09-07 | Paper |
| Almost random graphs with simple hash functions | 2010-08-16 | Paper |
| Algorithmen und Datenstrukturen | 2010-07-19 | Paper |
| A characterization of average case communication complexity | 2010-01-29 | Paper |
| In memoriam Prof. Dr. math. Ingo Wegener, 1950-2008 | 2009-11-04 | Paper |
| Hash, Displace, and Compress | 2009-10-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3395970 | 2009-09-15 | Paper |
| Applications of a Splitting Trick | 2009-07-14 | Paper |
| Design Strategies for Minimal Perfect Hash Functions | 2009-03-05 | Paper |
| Weaknesses of Cuckoo Hashing with a Simple Universal Hash Class: The Case of Large Universes | 2009-02-03 | Paper |
| Succinct Data Structures for Retrieval and Approximate Membership (Extended Abstract) | 2008-08-28 | Paper |
| Balanced allocation and dictionaries with tightly packed constant size bins | 2007-07-16 | Paper |
| Automata, Languages and Programming | 2006-01-10 | Paper |
| On the probability of rendezvous in graphs | 2005-06-01 | Paper |
| Linear hash functions | 2005-01-25 | Paper |
| Primality testing in polynomial time. From randomized algorithms to ``PRIMES is in P. | 2004-10-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4470489 | 2004-07-01 | Paper |
| Gossiping and broadcasting versus computing functions in networks. | 2004-03-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4425940 | 2003-09-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4796170 | 2003-03-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4527005 | 2001-02-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4527014 | 2001-02-28 | Paper |
| On different models for packet flow in multistage interconnection networks | 2001-01-01 | Paper |
| Matching upper and lower bounds for simulations of several linear tapes on one multidimensional tape | 2000-11-20 | Paper |
| A Reliable Randomized Algorithm for the Closest-Pair Problem | 1997-11-25 | Paper |
| Feasible Time-Optimal Algorithms for Boolean Functions on Exclusive-Write Parallel Random-Access Machines | 1997-06-09 | Paper |
| A comparison of two lower-bound methods for communication complexity | 1997-02-27 | Paper |
| Dynamic Perfect Hashing: Upper and Lower Bounds | 1994-10-17 | Paper |
| Exact lower time bounds for computing Boolean functions on CREW PRAMs | 1994-06-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4284226 | 1994-03-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4038677 | 1993-05-18 | Paper |
| An optimal parallel dictionary | 1993-05-16 | Paper |
| The complexity of matrix transposition on one-tape off-line Turing machines with output tape | 1993-05-16 | Paper |
| The complexity of matrix transposition on one-tape off-line Turing machines | 1991-01-01 | Paper |
| The speed of copying on one-tape off-line turing machines | 1989-01-01 | Paper |
| Lower bounds for sorting of sums | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3795216 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3796788 | 1988-01-01 | Paper |
| Lower bound arguments with ``inaccessible numbers | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3777463 | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3751008 | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3715103 | 1985-01-01 | Paper |
