Martin Dietzfelbinger

Martin Aumüller, Martin Dietzfelbinger: Optimal Partitioning for Dual Pivot Quicksort. CoRR abs/1303.5217 (2013)

Martin Dietzfelbinger, Michael Rink: Towards Optimal Degree-Distributions for Left-Perfect Matchings in Random Bipartite Graphs. CSR 2012: 99-111

Martin Aumüller, Martin Dietzfelbinger, Philipp Woelfel: Explicit and Efficient Hash Families Suffice for Cuckoo Hashing with a Stash. ESA 2012: 108-120

Martin Dietzfelbinger: On Randomness in Hash Functions (Invited Talk). STACS 2012: 25-28

Martin Dietzfelbinger, Hendrik Peilke, Michael Rink: A More Reliable Greedy Heuristic for Maximum Matchings in Sparse Random Graphs. SEA 2012: 148-159

Martin Dietzfelbinger, Michael Rink: Towards Optimal Degree-distributions for Left-perfect Matchings in Random Bipartite Graphs. CoRR abs/1203.1506 (2012)

Martin Dietzfelbinger, Hendrik Peilke, Michael Rink: A More Reliable Greedy Heuristic for Maximum Matchings in Sparse Random Graphs. CoRR abs/1203.4117 (2012)

Martin Aumüller, Martin Dietzfelbinger, Philipp Woelfel: Explicit and Efficient Hash Families Suffice for Cuckoo Hashing with a Stash. CoRR abs/1204.4431 (2012)

Berthold Vöcking, Helmut Alt, Martin Dietzfelbinger, Rüdiger Reischuk, Christian Scheideler, Heribert Vollmer, Dorothea Wagner (Eds.): Algorithms Unplugged. Springer 2011, isbn 978-3-642-15327-3

Martin Dietzfelbinger, Jonathan E. Rowe, Ingo Wegener, Philipp Woelfel: Precision, Local Search and Unimodal Functions. Algorithmica 59(3): 301-322 (2011)

Martin Dietzfelbinger: Fingerprinting. Algorithms Unplugged 2011: 181-193

Martin Dietzfelbinger, Michael Mitzenmacher, Michael Rink: Cuckoo Hashing with Pages. ESA 2011: 615-627

Martin Dietzfelbinger, Michael Mitzenmacher, Michael Rink: Cuckoo Hashing with Pages. CoRR abs/1104.5111 (2011)

Martin Dietzfelbinger, Jonathan E. Rowe, Ingo Wegener, Philipp Woelfel: Tight Bounds for Blind Search on the Integers and the Reals. Combinatorics, Probability & Computing 19(5-6): 711-728 (2010)

Martin Dietzfelbinger: Ingo Wegener: seine Bücher. Informatik Spektrum 33(5): 489-498 (2010)

Martin Dietzfelbinger, Andreas Goerdt, Michael Mitzenmacher, Andrea Montanari, Rasmus Pagh, Michael Rink: Tight Thresholds for Cuckoo Hashing via XORSAT. ICALP (1) 2010: 213-225

Martin Dietzfelbinger: In memoriam Prof. Dr. math. Ingo Wegener, 1950-2008. Theor. Comput. Sci. 410(44): 4446-4447 (2009)

Djamal Belazzougui, Fabiano C. Botelho, Martin Dietzfelbinger: Hash, Displace, and Compress. ESA 2009: 682-693

Martin Aumüller, Martin Dietzfelbinger, Michael Rink: Experimental Variations of a Theoretically Good Retrieval Data Structure. ESA 2009: 742-751

Martin Dietzfelbinger, Michael Rink: Applications of a Splitting Trick. ICALP (1) 2009: 354-365

Martin Dietzfelbinger, Stefan Edelkamp: Perfect Hashing for State Spaces in BDD Representation. KI 2009: 33-40

Martin Dietzfelbinger, Philipp Woelfel: Brief announcement: tight lower bounds for greedy routing in uniform small world rings. PODC 2009: 300-301

Martin Dietzfelbinger, Ulf Schellbach: On risks of using cuckoo hashing with simple universal hash classes. SODA 2009: 795-804

Martin Dietzfelbinger, Ulf Schellbach: Weaknesses of Cuckoo Hashing with a Simple Universal Hash Class: The Case of Large Universes. SOFSEM 2009: 217-228

Martin Dietzfelbinger, Philipp Woelfel: Tight lower bounds for greedy routing in uniform small world rings. STOC 2009: 591-600

Martin Dietzfelbinger, Andreas Goerdt, Michael Mitzenmacher, Andrea Montanari, Rasmus Pagh, Michael Rink: Tight Thresholds for Cuckoo Hashing via XORSAT. CoRR abs/0912.0287 (2009)

Berthold Vöcking, Helmut Alt, Martin Dietzfelbinger, Rüdiger Reischuk, Christian Scheideler, Heribert Vollmer, Dorothea Wagner (Eds.): Taschenbuch der Algorithmen. eXamen.press, Springer 2008, isbn 978-3-540-76393-2

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. Computer Science Review 2(2): 131-136 (2008)

Martin Dietzfelbinger, Martin Hühne, Christoph Weidling: A dictionary implementation based on dynamic perfect hashing. ACM Journal of Experimental Algorithmics 12 (2008)

Martin Dietzfelbinger, Jonathan E. Rowe, Ingo Wegener, Philipp Woelfel: Precision, local search and unimodal functions. GECCO 2008: 771-778

Martin Dietzfelbinger, Rasmus Pagh: Succinct Data Structures for Retrieval and Approximate Membership (Extended Abstract). ICALP (1) 2008: 385-396

Martin Dietzfelbinger, Jonathan E. Rowe, Ingo Wegener, Philipp Woelfel: Tight Bounds for Blind Search on the Integers. STACS 2008: 241-252

Martin Dietzfelbinger: Fingerprinting. Taschenbuch der Algorithmen 2008: 193-204

Martin Dietzfelbinger, Jonathan E. Rowe, Ingo Wegener, Philipp Woelfel: Tight Bounds for Blind Search on the Integers. CoRR abs/0802.2852 (2008)

Martin Dietzfelbinger, Rasmus Pagh: Succinct Data Structures for Retrieval and Approximate Membership. CoRR abs/0803.3693 (2008)

Martin Dietzfelbinger, Henning Wunderlich: A characterization of average case communication complexity. Inf. Process. Lett. 101(6): 245-249 (2007)

Martin Dietzfelbinger, Christoph Weidling: Balanced allocation and dictionaries with tightly packed constant size bins. Theor. Comput. Sci. 380(1-2): 47-68 (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: 2-17

Martin Dietzfelbinger, Shang-Hua Teng, Eli Upfal, Berthold Vöcking (Eds.): Probabilistic Methods in the Design and Analysis of Algorithms, 23.09. - 28.09.2007. Dagstuhl Seminar Proceedings 07391, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2007

Martin Dietzfelbinger, Hisao Tamaki: On the probability of rendezvous in graphs. Random Struct. Algorithms 26(3): 266-288 (2005)

Martin Dietzfelbinger, Christoph Weidling: Balanced Allocation and Dictionaries with Tightly Packed Constant Size Bins. ICALP 2005: 166-178

Martin Dietzfelbinger: Primality Testing in Polynomial Time, From Randomized Algorithms to "PRIMES Is in P". Lecture Notes in Computer Science 3000, Springer 2004, isbn 3-540-40344-2

Martin Dietzfelbinger: Gossiping and broadcasting versus computing functions in networks. Discrete Applied Mathematics 137(2): 127-153 (2004)

Martin Dietzfelbinger, Manfred Kunde: A case against using Stirling's formula (unless you really need it). Bulletin of the EATCS 80: 153-158 (2003)

Martin Dietzfelbinger, Bart Naudts, Clarissa Van Hoyweghen, Ingo Wegener: The analysis of a recombinative hill-climber on H-IFF. IEEE Trans. Evolutionary Computation 7(5): 417-423 (2003)

Martin Dietzfelbinger, Philipp Woelfel: Almost random graphs with simple hash functions. STOC 2003: 629-638

Martin Dietzfelbinger: The Probability of a Rendezvous is Minimal in Complete Graphs. ISAAC 2002: 55-66

Martin Dietzfelbinger, Anna Gambin, Slawomir Lasota: On Different Models for Packet Flow in Multistage Interconnection Networks. Fundam. Inform. 46(4): 287-314 (2001)

Martin Dietzfelbinger, Torben Hagerup: Simple Minimal Perfect Hashing in Less Space. ESA 2001: 109-120

Martin Dietzfelbinger, Martin Hühne: Matching upper and lower bounds for simulations of several linear tapes on one multidimensional tape. Computational Complexity 8(4): 371-392 (1999)

Noga Alon, Martin Dietzfelbinger, Peter Bro Miltersen, Erez Petrank, Gábor Tardos: Linear Hash Functions. J. ACM 46(5): 667-683 (1999)

Martin Dietzfelbinger, Torben Hagerup, Jyrki Katajainen, Martti Penttonen: A Reliable Randomized Algorithm for the Closest-Pair Problem. J. Algorithms 25(1): 19-51 (1997)

Martin Dietzfelbinger: Gossiping and Broadcasting versus Computing Functions in Networks. STACS 1997: 189-200

Martin Dietzfelbinger: The Linear-Array Problem in Communication Complexity Resolved. STOC 1997: 373-382

Noga Alon, Martin Dietzfelbinger, Peter Bro Miltersen, Erez Petrank, Gábor Tardos: Is Linear Hashing Good? STOC 1997: 465-474

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): 1196-123 (1996)

Martin Dietzfelbinger, Juraj Hromkovic, Georg Schnitger: A Comparison of Two Lower-Bound Methods for Communication Complexity. Theor. Comput. Sci. 168(1): 39-51 (1996)

Martin Dietzfelbinger: Universal Hashing and k-Wise Independent Random Variables via Integer Arithmetic without Primes. STACS 1996: 569-580

Martin Dietzfelbinger: Gossiping and Broadcasting versus Computing Functions in Networks. Electronic Colloquium on Computational Complexity (ECCC) 3(52) (1996)

Martin Dietzfelbinger: The Linear-Array Problem in Communication Complexity Resolved. Electronic Colloquium on Computational Complexity (ECCC) 3(63) (1996)

Martin Dietzfelbinger, Miroslaw Kutylowski, Rüdiger Reischuk: Feasible Time-Optimal Algorithms for Boolean Functions on Exclusive-Write PRAMs. Electronic Colloquium on Computational Complexity (ECCC) 2(4) (1995)

Martin Dietzfelbinger, Miroslaw Kutylowski, Rüdiger Reischuk: Exact Lower Time Bounds for Computing Boolean Functions on CREW PRAMs. J. Comput. Syst. Sci. 48(2): 231-254 (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): 738-761 (1994)

Martin Dietzfelbinger, Martin Hühne: Matching Upper and Lower Bounds for Simulation of Several Tapes on One Multidimensional Tape. FSTTCS 1994: 24-35

Martin Dietzfelbinger, Juraj Hromkovic, Georg Schnitger: A Comparison of Two Lower Bound Methods for Communication Complexity. MFCS 1994: 326-335

Martin Dietzfelbinger, Friedhelm Meyer auf der Heide: An Optimal Parallel Dictionary. Inf. Comput. 102(2): 196-217 (1993)

Martin Dietzfelbinger, Wolfgang Maass: The Complexity of Matrix Transposition on One-Tape Off-Line Turing Machines with Output Tape. Theor. Comput. Sci. 108(2): 271-290 (1993)

Martin Dietzfelbinger: Simulations Between Different Models of Parallel Computers. FCT 1993: 16-30

Martin Dietzfelbinger, Friedhelm Meyer auf der Heide: Simple, Efficient Shared Memory Simulations. SPAA 1993: 110-119

Martin Dietzfelbinger, Friedhelm Meyer auf der Heide: High Performance Universal Hashing, with Applications to Shared Memory Simulations. Data Structures and Efficient Algorithms 1992: 250-269

Martin Dietzfelbinger, Joseph Gil, Yossi Matias, Nicholas Pippenger: Polynomial Hash Functions Are Reliable (Extended Abstract). ICALP 1992: 235-246

Holger Bast, Martin Dietzfelbinger, Torben Hagerup: A Perfect Parallel Dictionary. MFCS 1992: 133-141

Martin Dietzfelbinger, Wolfgang Maass, Georg Schnitger: The Complexity of Matrix Transposition on One-Tape Off-Line Turing Machines. Theor. Comput. Sci. 82(1): 113-129 (1991)

Martin Dietzfelbinger, Seshu Madhavapeddy, Ivan Hal Sudborough: Three disjoint path paradigms in star networks. SPDP 1991: 400-406

Martin Dietzfelbinger, Friedhelm Meyer auf der Heide: A New Universal Class of Hash Functions and Dynamic Hashing in Real Time. ICALP 1990: 6-19

Martin Dietzfelbinger, Miroslaw Kutylowski, Rüdiger Reischuk: Exact Time Bounds for Computing Boolean Functions on PRAMs Without Simultaneous Writes. SPAA 1990: 125-135

Martin Dietzfelbinger, Friedhelm Meyer auf der Heide: How to Distribute a Dictionary in a Complete Network. STOC 1990: 117-127

Martin Dietzfelbinger: The Speed of Copying on One-Tape Off-Line Turing Machines. Inf. Process. Lett. 33(2): 83-89 (1989)

Martin Dietzfelbinger: Lower Bounds for Sorting of Sums. Theor. Comput. Sci. 66(2): 137-155 (1989)

Martin Dietzfelbinger, Friedhelm Meyer auf der Heide: An Optimal Parallel Dictionary. SPAA 1989: 360-368

Martin Dietzfelbinger, Wolfgang Maass: Lower Bound Arguments with "Inaccessible" Numbers. J. Comput. Syst. Sci. 36(3): 313-335 (1988)

Martin Dietzfelbinger, Anna R. Karlin, Kurt Mehlhorn, Friedhelm Meyer auf der Heide, Hans Rohnert, Robert Endre Tarjan: Dynamic Perfect Hashing: Upper and Lower Bounds. FOCS 1988: 524-531

Martin Dietzfelbinger, Wolfgang Maass: The Complexity of Matrix Transposition on One-Tape Off-Line Turing Machines with Output Tape. ICALP 1988: 188-200

Martin Dietzfelbinger, Kurt Mehlhorn, Friedhelm Meyer auf der Heide, Hans Rohnert: Upper and Lower Bounds for the Dictionary Problem (Abstract). SWAT 1988: 214-215

Martin Dietzfelbinger: Lower Bounds for Sorting of Sums. ICALP 1987: 457-466

Martin Dietzfelbinger, Wolfgang Maass: two Lower Bound Arguments with "Inaccessible" Numbers. Structure in Complexity Theory Conference 1986: 163-183