Martin Dietzfelbinger

120 papers A* 14A 14B 10Misc 2Journal 55Unranked 13

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