| 2023 | ESA | On Hashing by (Random) Equations (Invited Talk). | Martin Dietzfelbinger |
| 2019 | ESA | Dense Peelable Random Uniform Hypergraphs. | Martin Dietzfelbinger, Stefan Walzer |
| 2019 | ESA | Efficient Gauss Elimination for Near-Quadratic Matrices with One Short Random Block per Row, with Applications. | Martin Dietzfelbinger, Stefan Walzer |
| 2019 | STACS | Constant-Time Retrieval with O(log m) Extra Bits. | Martin Dietzfelbinger, Stefan Walzer |
| 2018 | MFCS | A Subquadratic Algorithm for 3XOR. | Martin Dietzfelbinger, Philipp Schlag, Stefan Walzer |
| 2014 | SODA | Tight Lower Bounds for Greedy Routing in Higher-Dimensional Small-World Grids. | Martin Dietzfelbinger, Philipp Woelfel |
| 2013 | ICALP | Optimal Partitioning for Dual Pivot Quicksort - (Extended Abstract). | Martin Aumller, Martin Dietzfelbinger |
| 2012 | CSR | Towards Optimal Degree-Distributions for Left-Perfect Matchings in Random Bipartite Graphs. | Martin Dietzfelbinger, Michael Rink |
| 2012 | ESA | Explicit and Efficient Hash Families Suffice for Cuckoo Hashing with a Stash. | Martin Aumller, Martin Dietzfelbinger, Philipp Woelfel |
| 2012 | STACS | On Randomness in Hash Functions (Invited Talk). | Martin Dietzfelbinger |
| 2011 | ESA | Cuckoo Hashing with Pages. | Martin Dietzfelbinger, Michael Mitzenmacher, Michael Rink |
| 2010 | ICALP | Tight Thresholds for Cuckoo Hashing via XORSAT. | Martin Dietzfelbinger, Andreas Goerdt, Michael Mitzenmacher, Andrea Montanari, Rasmus Pagh, Michael Rink |
| 2009 | ESA | Experimental Variations of a Theoretically Good Retrieval Data Structure. | Martin Aumller, Martin Dietzfelbinger, Michael Rink |
| 2009 | ESA | Hash, Displace, and Compress. | Djamal Belazzougui, Fabiano C. Botelho, Martin Dietzfelbinger |
| 2009 | ICALP | Applications of a Splitting Trick. | Martin Dietzfelbinger, Michael Rink |
| 2009 | KI | Perfect Hashing for State Spaces in BDD Representation. | Martin Dietzfelbinger, Stefan Edelkamp |
| 2009 | PODC | Brief announcement: tight lower bounds for greedy routing in uniform small world rings. | Martin Dietzfelbinger, Philipp Woelfel |
| 2009 | SODA | On risks of using cuckoo hashing with simple universal hash classes. | Martin Dietzfelbinger, Ulf Schellbach |
| 2009 | STOC | Tight lower bounds for greedy routing in uniform small world rings. | Martin Dietzfelbinger, Philipp Woelfel |
| 2009 | SOFSEM | Weaknesses of Cuckoo Hashing with a Simple Universal Hash Class: The Case of Large Universes. | Martin Dietzfelbinger, Ulf Schellbach |
| 2008 | GECCO | Precision, local search and unimodal functions. | Martin Dietzfelbinger, Jonathan E. Rowe, Ingo Wegener, Philipp Woelfel |
| 2008 | ICALP | Succinct Data Structures for Retrieval and Approximate Membership (Extended Abstract). | Martin Dietzfelbinger, Rasmus Pagh |
| 2008 | STACS | Tight Bounds for Blind Search on the Integers. | Martin Dietzfelbinger, Jonathan E. Rowe, Ingo Wegener, Philipp Woelfel |
| 2005 | ICALP | Balanced Allocation and Dictionaries with Tightly Packed Constant Size Bins. | Martin Dietzfelbinger, Christoph Weidling |
| 2003 | STOC | Almost random graphs with simple hash functions. | Martin Dietzfelbinger, Philipp Woelfel |
| 2002 | ISAAC | The Probability of a Rendezvous is Minimal in Complete Graphs. | Martin Dietzfelbinger |
| 2001 | ESA | Simple Minimal Perfect Hashing in Less Space. | Martin Dietzfelbinger, Torben Hagerup |
| 1997 | STOC | Is Linear Hashing Good? | Noga Alon, Martin Dietzfelbinger, Peter Bro Miltersen, Erez Petrank, Gbor Tardos |
| 1997 | STOC | The Linear-Array Problem in Communication Complexity Resolved. | Martin Dietzfelbinger |
| 1997 | STACS | Gossiping and Broadcasting versus Computing Functions in Networks. | Martin Dietzfelbinger |
| 1996 | STACS | Universal Hashing and k-Wise Independent Random Variables via Integer Arithmetic without Primes. | Martin Dietzfelbinger |
| 1994 | MFCS | A Comparison of Two Lower Bound Methods for Communication Complexity. | Martin Dietzfelbinger, Juraj Hromkovic, Georg Schnitger |
| 1993 | FCT | Simulations Between Different Models of Parallel Computers. | Martin Dietzfelbinger |
| 1993 | SPAA | Simple, Efficient Shared Memory Simulations. | Martin Dietzfelbinger, Friedhelm Meyer auf der Heide |
| 1992 | ICALP | Polynomial Hash Functions Are Reliable (Extended Abstract). | Martin Dietzfelbinger, Joseph Gil, Yossi Matias, Nicholas Pippenger |
| 1992 | MFCS | A Perfect Parallel Dictionary. | Hannah Bast, Martin Dietzfelbinger, Torben Hagerup |
| 1990 | ICALP | A New Universal Class of Hash Functions and Dynamic Hashing in Real Time. | Martin Dietzfelbinger, Friedhelm Meyer auf der Heide |
| 1990 | STOC | How to Distribute a Dictionary in a Complete Network | Martin Dietzfelbinger, Friedhelm Meyer auf der Heide |
| 1990 | SPAA | Exact Time Bounds for Computing Boolean Functions on PRAMs Without Simultaneous Writes. | Martin Dietzfelbinger, Miroslaw Kutylowski, Rdiger Reischuk |
| 1989 | SPAA | An Optimal Parallel Dictionary. | Martin Dietzfelbinger, Friedhelm Meyer auf der Heide |
| 1988 | FOCS | Dynamic Perfect Hashing: Upper and Lower Bounds | Martin Dietzfelbinger, Anna R. Karlin, Kurt Mehlhorn, Friedhelm Meyer auf der Heide, Hans Rohnert, Robert Endre Tarjan |
| 1988 | ICALP | The Complexity of Matrix Transposition on One-Tape Off-Line Turing Machines with Output Tape. | Martin Dietzfelbinger, Wolfgang Maass |
| 1987 | ICALP | Lower Bounds for Sorting of Sums. | Martin Dietzfelbinger |