Martin Dietzfelbinger

ORCID

Publication Activity (10 Years)

Years Active: 1986-2023
Publications (10 Years): 19

Top Venues

CoRR

ESA

Theory Comput. Syst.

ACM Trans. Algorithms

University of Illinois at Chicago, IL, USA (PHD)

Education History

University of Illinois at Chicago, IL, USA

PHD

Publications

Martin Dietzfelbinger
On Hashing by (Random) Equations (Invited Talk). ESA (2023)
Martin Dietzfelbinger, Stefan Walzer
Dense Peelable Random Uniform Hypergraphs. ESA (2019)
Martin Dietzfelbinger, Jörg Keller
Determining Minimum Hash Width for Hash Chains. CECC (2019)
Martin Dietzfelbinger, Stefan Walzer
Dense Peelable Random Uniform Hypergraphs. CoRR (2019)
Martin Dietzfelbinger, Stefan Walzer
Efficient Gauss Elimination for Near-Quadratic Matrices with One Short Random Block per Row, with Applications. CoRR (2019)
Martin Aumüller, Martin Dietzfelbinger, Clemens Heuberger, Daniel Krenn, Helmut Prodinger
Dual-Pivot Quicksort: Optimality, Analysis and Zeros of Associated Lattice Paths. Comb. Probab. Comput. 28 (4) (2019)
Martin Dietzfelbinger, Stefan Walzer
Efficient Gauss Elimination for Near-Quadratic Matrices with One Short Random Block per Row, with Applications. ESA (2019)
Martin Dietzfelbinger, Stefan Walzer
Constant-Time Retrieval with O(log m) Extra Bits. STACS (2019)
Martin Dietzfelbinger, Philipp Schlag, Stefan Walzer
A Subquadratic Algorithm for 3XOR. MFCS (2018)
Martin Dietzfelbinger, Philipp Schlag, Stefan Walzer
A Subquadratic Algorithm for 3XOR. CoRR (2018)
Martin Dietzfelbinger
Universal Hashing via Integer Arithmetic Without Primes, Revisited. Adventures Between Lower Bounds and Higher Altitudes (2018)
Martin Dietzfelbinger, Michael Mitzenmacher, Rasmus Pagh, David P. Woodruff, Martin Aumüller
Theory and Applications of Hashing (Dagstuhl Seminar 17181). Dagstuhl Reports 7 (5) (2017)
Martin Dietzfelbinger
Special issue for the 39th International Symposium on Mathematical Foundations of Computer Science, MFCS 2014, Budapest, Hungary. Inf. Comput. 256 (2017)
Martin Aumüller, Martin Dietzfelbinger
Optimal Partitioning for Dual-Pivot Quicksort. ACM Trans. Algorithms 12 (2) (2016)
Martin Aumüller, Martin Dietzfelbinger, Philipp Woelfel
A Simple Hash Class with Strong Randomness Properties in Graphs and Hypergraphs. CoRR (2016)
Martin Aumüller, Martin Dietzfelbinger, Clemens Heuberger, Daniel Krenn, Helmut Prodinger
Dual-Pivot Quicksort: Optimality, Analysis and Zeros of Associated Lattice Paths. CoRR (2016)
Martin Aumüller, Martin Dietzfelbinger, Pascal Klaue
How Good Is Multi-Pivot Quicksort? ACM Trans. Algorithms 13 (1) (2016)
Anca Muscholl, Martin Dietzfelbinger
Preface of STACS 2013 Special Issue. Theory Comput. Syst. 58 (4) (2016)
Martin Aumüller, Martin Dietzfelbinger, Clemens Heuberger, Daniel Krenn, Helmut Prodinger
Counting Zeros in Random Walks on the Integers and Analysis of Optimal Dual-Pivot Quicksort. CoRR (2016)
Martin Aumüller, Martin Dietzfelbinger, Pascal Klaue
How Good is Multi-Pivot Quicksort? CoRR (2015)
Martin Dietzfelbinger, Michael Rink
Towards Optimal Degree Distributions for Left-Perfect Matchings in Random Bipartite Graphs. Theory Comput. Syst. 56 (4) (2015)
Martin Dietzfelbinger, Raed Jaberi
On testing single connectedness in directed graphs and some related problems. Inf. Process. Lett. 115 (9) (2015)
Martin Aumüller, Martin Dietzfelbinger, Philipp Woelfel
Explicit and Efficient Hash Families Suffice for Cuckoo Hashing with a Stash. Algorithmica 70 (3) (2014)
Martin Dietzfelbinger, Philipp Woelfel
Tight Lower Bounds for Greedy Routing in Higher-Dimensional Small-World Grids. SODA (2014)
Martin Aumüller, Martin Dietzfelbinger
Optimal Partitioning for Dual Pivot Quicksort CoRR (2013)
Martin Dietzfelbinger, Philipp Woelfel
Tight Lower Bounds for Greedy Routing in Higher-Dimensional Small-World Grids CoRR (2013)
Martin Aumüller, Martin Dietzfelbinger
Optimal Partitioning for Dual Pivot Quicksort - (Extended Abstract). ICALP (1) (2013)
Martin Dietzfelbinger, Michael Rink
Towards Optimal Degree-Distributions for Left-Perfect Matchings in Random Bipartite Graphs. CSR (2012)
Martin Dietzfelbinger, Hendrik Peilke, Michael Rink
A More Reliable Greedy Heuristic for Maximum Matchings in Sparse Random Graphs. SEA (2012)
Martin Dietzfelbinger
On Randomness in Hash Functions (Invited Talk). STACS (2012)
Martin Dietzfelbinger, Michael Rink
Towards Optimal Degree-distributions for Left-perfect Matchings in Random Bipartite Graphs CoRR (2012)
Martin Dietzfelbinger, Hendrik Peilke, Michael Rink
A More Reliable Greedy Heuristic for Maximum Matchings in Sparse Random Graphs CoRR (2012)
Martin Aumüller, Martin Dietzfelbinger, Philipp Woelfel
Explicit and Efficient Hash Families Suffice for Cuckoo Hashing with a Stash. ESA (2012)
Martin Aumüller, Martin Dietzfelbinger, Philipp Woelfel
Explicit and Efficient Hash Families Suffice for Cuckoo Hashing with a Stash CoRR (2012)
Martin Dietzfelbinger, Jonathan E. Rowe, Ingo Wegener, Philipp Woelfel
Precision, Local Search and Unimodal Functions. Algorithmica 59 (3) (2011)
Martin Dietzfelbinger, Michael Mitzenmacher, Michael Rink
Cuckoo Hashing with Pages. ESA (2011)
Martin Dietzfelbinger, Michael Mitzenmacher, Michael Rink
Cuckoo Hashing with Pages CoRR (2011)
Martin Dietzfelbinger, Jonathan E. Rowe, Ingo Wegener, Philipp Woelfel
Tight Bounds for Blind Search on the Integers and the Reals. Comb. Probab. Comput. 19 (5-6) (2010)
Martin Dietzfelbinger, Andreas Goerdt, Michael Mitzenmacher, Andrea Montanari, Rasmus Pagh, Michael Rink
Tight Thresholds for Cuckoo Hashing via XORSAT. ICALP (1) (2010)
Martin Dietzfelbinger
Ingo Wegener: seine Bücher. Inform. Spektrum 33 (5) (2010)
Martin Dietzfelbinger, Philipp Woelfel
Tight lower bounds for greedy routing in uniform small world rings. STOC (2009)
Martin Aumüller, Martin Dietzfelbinger, Michael Rink
Experimental Variations of a Theoretically Good Retrieval Data Structure. ESA (2009)
Martin Dietzfelbinger, Andreas Goerdt, Michael Mitzenmacher, Andrea Montanari, Rasmus Pagh, Michael Rink
Tight Thresholds for Cuckoo Hashing via XORSAT CoRR (2009)
Martin Dietzfelbinger, Michael Rink
Applications of a Splitting Trick. ICALP (1) (2009)
Martin Dietzfelbinger, Ulf Schellbach
Weaknesses of Cuckoo Hashing with a Simple Universal Hash Class: The Case of Large Universes. SOFSEM (2009)
Djamal Belazzougui, Fabiano C. Botelho, Martin Dietzfelbinger
Hash, Displace, and Compress. ESA (2009)
Martin Dietzfelbinger, Ulf Schellbach
On risks of using cuckoo hashing with simple universal hash classes. SODA (2009)
Martin Dietzfelbinger, Philipp Woelfel
Brief announcement: tight lower bounds for greedy routing in uniform small world rings. PODC (2009)
Martin Dietzfelbinger, Stefan Edelkamp
Perfect Hashing for State Spaces in BDD Representation. KI (2009)
Martin Dietzfelbinger
In memoriam Prof. Dr. math. Ingo Wegener, 1950-2008. Theor. Comput. Sci. 410 (44) (2009)
Martin Dietzfelbinger, Jonathan E. Rowe, Ingo Wegener, Philipp Woelfel
Tight Bounds for Blind Search on the Integers CoRR (2008)
Martin Dietzfelbinger, Rasmus Pagh
Succinct Data Structures for Retrieval and Approximate Membership CoRR (2008)
Martin Dietzfelbinger, Martin Hühne, Christoph Weidling
A dictionary implementation based on dynamic perfect hashing. ACM J. Exp. Algorithmics 12 (2008)
Martin Dietzfelbinger, Jonathan E. Rowe, Ingo Wegener, Philipp Woelfel
Precision, local search and unimodal functions. GECCO (2008)
Martin Dietzfelbinger
Sanjoy Dasgupta, Christos Papadimitriou and Umesh Vazirani, Algorithms, McGraw Hill, Boston (2007) ISBN 978-007352340-8, Jon Kleinberg and Éva Tardos, Algorithm Design, Pearson/Addison Wesley, Boston (2006) ISBN 978-032129535-4. Comput. Sci. Rev. 2 (2) (2008)
Martin Dietzfelbinger, Rasmus Pagh
Succinct Data Structures for Retrieval and Approximate Membership (Extended Abstract). ICALP (1) (2008)
Martin Dietzfelbinger, Jonathan E. Rowe, Ingo Wegener, Philipp Woelfel
Tight Bounds for Blind Search on the Integers. STACS (2008)
Martin Dietzfelbinger, Henning Wunderlich
A characterization of average case communication complexity. Inf. Process. Lett. 101 (6) (2007)
Martin Dietzfelbinger, Shang-Hua Teng, Eli Upfal, Berthold Vöcking
07391 Abstracts Collection - Probabilistic Methods in the Design and Analysis of Algorithms. Probabilistic Methods in the Design and Analysis of Algorithms (2007)
Martin Dietzfelbinger
Design Strategies for Minimal Perfect Hash Functions. SAGA (2007)
Martin Dietzfelbinger, Christoph Weidling
Balanced allocation and dictionaries with tightly packed constant size bins. Theor. Comput. Sci. 380 (1-2) (2007)
Martin Dietzfelbinger, Christoph Weidling
Balanced Allocation and Dictionaries with Tightly Packed Constant Size Bins. ICALP (2005)
Martin Dietzfelbinger, Hisao Tamaki
On the probability of rendezvous in graphs. Random Struct. Algorithms 26 (3) (2005)
Martin Dietzfelbinger
Gossiping and broadcasting versus computing functions in networks. Discret. Appl. Math. 137 (2) (2004)
Martin Dietzfelbinger, Philipp Woelfel
Almost random graphs with simple hash functions. STOC (2003)
Martin Dietzfelbinger, Manfred Kunde
A case against using Stirling's formula (unless you really need it). Bull. EATCS 80 (2003)
Martin Dietzfelbinger, Bart Naudts, Clarissa Van Hoyweghen, Ingo Wegener
The analysis of a recombinative hill-climber on H-IFF. IEEE Trans. Evol. Comput. 7 (5) (2003)
Martin Dietzfelbinger
The Probability of a Rendezvous is Minimal in Complete Graphs. ISAAC (2002)
Martin Dietzfelbinger, Torben Hagerup
Simple Minimal Perfect Hashing in Less Space. ESA (2001)
Martin Dietzfelbinger, Anna Gambin, Slawomir Lasota
On Different Models for Packet Flow in Multistage Interconnection Networks. Fundam. Informaticae 46 (4) (2001)
Martin Dietzfelbinger, Martin Hühne
Matching upper and lower bounds for simulations of several linear tapes on one multidimensional tape. Comput. Complex. 8 (4) (1999)
Noga Alon, Martin Dietzfelbinger, Peter Bro Miltersen, Erez Petrank, Gábor Tardos
Linear Hash Functions. J. ACM 46 (5) (1999)
Noga Alon, Martin Dietzfelbinger, Peter Bro Miltersen, Erez Petrank, Gábor Tardos
Is Linear Hashing Good? STOC (1997)
Martin Dietzfelbinger, Torben Hagerup, Jyrki Katajainen, Martti Penttonen
A Reliable Randomized Algorithm for the Closest-Pair Problem. J. Algorithms 25 (1) (1997)
Martin Dietzfelbinger
Gossiping and Broadcasting versus Computing Functions in Networks. STACS (1997)
Martin Dietzfelbinger
The Linear-Array Problem in Communication Complexity Resolved. STOC (1997)
Martin Dietzfelbinger
Gossiping and Broadcasting versus Computing Functions in Networks Electron. Colloquium Comput. Complex. 3 (52) (1996)
Martin Dietzfelbinger
The Linear-Array Problem in Communication Complexity Resolved Electron. Colloquium Comput. Complex. 3 (63) (1996)
Martin Dietzfelbinger
Universal Hashing and k-Wise Independent Random Variables via Integer Arithmetic without Primes. STACS (1996)
Martin Dietzfelbinger, Juraj Hromkovic, Georg Schnitger
A Comparison of Two Lower-Bound Methods for Communication Complexity. Theor. Comput. Sci. 168 (1) (1996)
Martin Dietzfelbinger, Miroslaw Kutylowski, Rüdiger Reischuk
Feasible Time-Optimal Algorithms for Boolean Functions on Exclusive-Write Parallel Random-Access Machines. SIAM J. Comput. 25 (6) (1996)
Martin Dietzfelbinger, Miroslaw Kutylowski, Rüdiger Reischuk
Feasible Time-Optimal Algorithms for Boolean Functions on Exclusive-Write PRAMs Electron. Colloquium Comput. Complex. 2 (4) (1995)
Martin Dietzfelbinger, Juraj Hromkovic, Georg Schnitger
A Comparison of Two Lower Bound Methods for Communication Complexity. MFCS (1994)
Martin Dietzfelbinger, Miroslaw Kutylowski, Rüdiger Reischuk
Exact Lower Time Bounds for Computing Boolean Functions on CREW PRAMs. J. Comput. Syst. Sci. 48 (2) (1994)
Martin Dietzfelbinger, Anna R. Karlin, Kurt Mehlhorn, Friedhelm Meyer auf der Heide, Hans Rohnert, Robert Endre Tarjan
Dynamic Perfect Hashing: Upper and Lower Bounds. SIAM J. Comput. 23 (4) (1994)
Martin Dietzfelbinger, Martin Hühne
Matching Upper and Lower Bounds for Simulation of Several Tapes on One Multidimensional Tape. FSTTCS (1994)
Martin Dietzfelbinger, Wolfgang Maass
The Complexity of Matrix Transposition on One-Tape Off-Line Turing Machines with Output Tape. Theor. Comput. Sci. 108 (2) (1993)
Martin Dietzfelbinger, Friedhelm Meyer auf der Heide
Simple, Efficient Shared Memory Simulations. SPAA (1993)
Martin Dietzfelbinger
Simulations Between Different Models of Parallel Computers. FCT (1993)
Martin Dietzfelbinger, Friedhelm Meyer auf der Heide
An Optimal Parallel Dictionary Inf. Comput. 102 (2) (1993)
Martin Dietzfelbinger, Friedhelm Meyer auf der Heide
High Performance Universal Hashing, with Applications to Shared Memory Simulations. Data Structures and Efficient Algorithms (1992)
Martin Dietzfelbinger, Joseph Gil, Yossi Matias, Nicholas Pippenger
Polynomial Hash Functions Are Reliable (Extended Abstract). ICALP (1992)
Hannah Bast, Martin Dietzfelbinger, Torben Hagerup
A Perfect Parallel Dictionary. MFCS (1992)
Martin Dietzfelbinger, Seshu Madhavapeddy, Ivan Hal Sudborough
Three disjoint path paradigms in star networks. SPDP (1991)
Martin Dietzfelbinger, Wolfgang Maass, Georg Schnitger
The Complexity of Matrix Transposition on One-Tape Off-Line Turing Machines. Theor. Comput. Sci. 82 (1) (1991)
Martin Dietzfelbinger, Friedhelm Meyer auf der Heide
A New Universal Class of Hash Functions and Dynamic Hashing in Real Time. ICALP (1990)
Martin Dietzfelbinger, Friedhelm Meyer auf der Heide
How to Distribute a Dictionary in a Complete Network STOC (1990)
Martin Dietzfelbinger, Miroslaw Kutylowski, Rüdiger Reischuk
Exact Time Bounds for Computing Boolean Functions on PRAMs Without Simultaneous Writes. SPAA (1990)
Martin Dietzfelbinger
The Speed of Copying on One-Tape Off-Line Turing Machines. Inf. Process. Lett. 33 (2) (1989)
Martin Dietzfelbinger
Lower Bounds for Sorting of Sums. Theor. Comput. Sci. 66 (2) (1989)

Martin Dietzfelbinger.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Martin Dietzfelbinger