Dietzfelbinger, Martin; Dillinger, Peter C.; Hübschle, Lorenz; Sanders, Peter; Walzer, Stefan:
Ribbon: fast succinct static retrieval and approximate membership
#!ilm_mods_00079664!#
In: Journal of the ACM: JACM, vol. 73 (2026), no. 1, art. 7
DOI: https://doi.org/10.1145/3785417
Dietzfelbinger, Martin; Keller, Jörg:
Determining minimum hash width for hash chains
#!ilm_mods_00016781!#
In: CECC 2019: proceedings of the third Central European Cybersecurity Conference, Munich, Germany, November 14-15, 2019 (ISBN 978-1-4503-7296-1), (2019), art. 18
DOI: https://doi.org/10.1145/3360664.3360682
Dietzfelbinger, Martin; Walzer, Stefan:
Dense peelable random uniform hypergraphs
#!ilm_mods_00016784!#
In: 27th Annual European Symposium on Algorithms: ESA 2019, September 9-11, 2019, Munich/Garching, Germany (ISBN 978-3-95977-124-5), (2019), art. 38
DOI: https://doi.org/10.4230/LIPIcs.ESA.2019.38
Dietzfelbinger, Martin; Walzer, Stefan:
Efficient Gauss elimination for near-quadratic matrices with one short random block per row, with applications
#!ilm_mods_00016785!#
In: 27th Annual European Symposium on Algorithms: ESA 2019, September 9-11, 2019, Munich/Garching, Germany (ISBN 978-3-95977-124-5), (2019), art. 39
DOI: https://doi.org/10.4230/LIPIcs.ESA.2019.39
Sanders, Peter; Mehlhorn, Kurt; Dietzfelbinger, Martin; Dementiev, Roman:
Sequential and parallel algorithms and data structures: the basic toolbox
#!ilm_mods_00012562!#
Cham : Springer, 2019. - ISBN 978-3-030-25208-3
DOI: https://doi.org/10.1007/978-3-030-25209-0
Aumüller, Martin; Dietzfelbinger, Martin; Heuberger, Clemens; Krenn, Daniel; Prodinger, Helmut:
Dual-Pivot quicksort: optimality, analysis and zeros of associated lattice paths
#!ilm_mods_00002769!#
In: Combinatorics, probability & computing: CPC, vol. 28 (2019), no. 4, pp. 485–518
[27. International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA) (Krakow, 04.-08.07.2016)]
DOI: https://doi.org/10.1017/S096354831800041X
Dietzfelbinger, Martin; Walzer, Stefan:
Constant-time retrieval with O(log m) extra bits
#!ilm_mods_00015836!#
In: 36th International Symposium on Theoretical Aspects of Computer Science: STACS 2019, March 13-16, 2019, Berlin, Germany (ISBN 978-3-95977-100-9), (2019), art. 24
DOI: https://doi.org/10.4230/LIPIcs.STACS.2019.24
Dietzfelbinger, Martin; Schlag, Philipp; Walzer, Stefan:
A subquadratic algorithm for 3XOR
#!ilm_mods_00019964!#
In: 43rd International Symposium on Mathematical Foundations of Computer Science: MFCS 2018, August 27-31, 2018, Liverpool, United Kingdom (ISBN 978-3-95977-086-6), (2018), art. 59
DOI: https://doi.org/10.4230/LIPIcs.MFCS.2018.59
Dietzfelbinger, Martin:
Universal hashing via integer arithmetic without primes, revisited
#!ilm_mods_00018060!#
In: Adventures between lower bounds and higher altitudes: essays dedicated to Juraj Hromkovič on the occasion of his 60th birthday. - Cham : Springer, 2018, pp. 257–279
DOI: https://doi.org/10.1007/978-3-319-98355-4_15
Dietzfelbinger, Martin; Mitzenmacher, Michael; Pagh, Rasmus; Woodruff, David P.; Aumüller, Martin (eds.):
Theory and applications of hashing: report from Dagstuhl Seminar 17181
#!ilm_mods_00030700!#
Wadern : Schloss Dagstuhl, 2017, pp. 1–21
[Dagstuhl Seminar 17181 “Theory and Applications of Hashing” (Wadern, 01.-05.05.2017)]
(Dagstuhl Reports: Dokumentationen zu Dagstuhl-Seminaren und Dagstuhl-Perspektiven-Workshops ; 7)
DOI: https://doi.org/10.4230/DagRep.7.5.1
Aumüller, Martin; Dietzfelbinger, Martin:
Optimal partitioning for dual-pivot quicksort
#!ilm_mods_00029499!#
In: ACM transactions on algorithms: TALG, vol. 12 (2016), no. 2, art. 18
DOI: https://doi.org/10.1145/2743020
Aumüller, Martin; Dietzfelbinger, Martin; Klaue, Pascal:
How good is Multi-Pivot Quicksort?
#!ilm_mods_00029659!#
In: ACM transactions on algorithms: TALG, vol. 13 (2016), no. 1, art. 8
DOI: https://doi.org/10.1145/2963102
Dietzfelbinger, Martin; Rink, Michael:
Towards optimal degree distributions for left-perfect matchings in random bipartite graphs
#!ilm_mods_00029993!#
In: Theory of computing systems, vol. 56 (2015), no. 4, pp. 593–611
DOI: https://doi.org/10.1007/s00224-014-9577-1
Dietzfelbinger, Martin; Jaberi, Raed:
On testing single connectedness in directed graphs and some related problems
#!ilm_mods_00029986!#
In: Information processing letters: devoted to the rapid publication of short contributions to information processing, vol. 115 (2015), no. 9, pp. 684–688
DOI: https://doi.org/10.1016/j.ipl.2015.04.008
Csuhaj-Varjú, Ersébet; Dietzfelbinger, Martin; Ésik, Zoltán (eds.):
Mathematical foundations of computer science 2014: 39th international symposium, MFCS 2014, Budapest, Hungary, August 25 - 29, 2014 ; proceedings
#!ilm_mods_00033889!#
Berlin [u.a.] : Springer, 2014
[39. International Symposium on Mathematical Foundations of Computer Science (Budapest, 25.-29.08.2014), 39. MFCS (Budapest, 25.-29.08.2014)]
(Lecture notes in computer science ; ..., Theoretical computer and general issues)
Dietzfelbinger, Martin; Wölfel, Philipp:
Tight lower bounds for greedy routing in higher-dimensional small-world grids
#!ilm_mods_00033974!#
In: Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms: [Portland, Oregon, USA, January 5 - 7, 2014], (2014), pp. 816–829
Aumüller, Martin; Dietzfelbinger, Martin; Wölfel, Philipp:
Explicit and efficient hash families suffice for cuckoo hashing with a stash
#!ilm_mods_00030205!#
In: Algorithmica: an international journal in computer science, vol. 70 (2014), no. 3, pp. 428–456
DOI: https://doi.org/10.1007/s00453-013-9840-x
Dietzfelbinger, Martin; Mehlhorn, Kurt; Sanders, Peter:
Algorithmen und Datenstrukturen: die Grundwerkzeuge
#!ilm_mods_00034561!#
Berlin, Heidelberg : Springer Vieweg, 2014. - ISBN 978-3-642-05471-6
(eXamen.press)
DOI: https://doi.org/10.1007/978-3-642-05472-3
Aumüller, Martin; Dietzfelbinger, Martin:
Optimal partitioning for dual pivot quicksort
#!ilm_mods_00036040!#
In: Automata, languages, and programming: 40th International Colloquium, ICALP 2013, Riga, Latvia, July 8-12, 2013 : proceedings, part I, (2013), pp. 33–44
DOI: https://doi.org/10.1007/978-3-642-39206-1_4
Aumüller, Martin; Dietzfelbinger, Martin; Wölfel, Philipp:
Explicit and efficient hash families suffice for cuckoo hashing with a stash
#!ilm_mods_00037872!#
In: Algorithms - ESA 2012: 20th Annual European Symposium, Ljubljana, Slovenia, September 10-12, 2012 : proceedings (ISBN 978-3-642-33089-6), (2012), pp. 108–120
DOI: https://doi.org/10.1007/978-3-642-33090-2_11
Dietzfelbinger, Martin; Peilke, Hendrik; Rink, Michael:
A more reliable greedy heuristic for maximum matchings in sparse random graphs
#!ilm_mods_00037884!#
In: Experimental Algorithms: 11th International Symposium, SEA 2012, Bordeaux, France, June 7-9, 2012. Proceedings, (2012), pp. 148–159
DOI: https://doi.org/10.1007/978-3-642-30850-5_14
Dietzfelbinger, Martin; Rink, Michael:
Towards optimal degree-distributions for left-perfect matchings in random bipartite graphs
#!ilm_mods_00037882!#
In: Computer Science – Theory and Applications: 7th International Computer Science Symposium in Russia, CSR 2012, Nizhny Novgorod, Russia, July 3-7, 2012. Proceedings, (2012), pp. 99–111
DOI: https://doi.org/10.1007/978-3-642-30642-6_11
Dietzfelbinger, Martin:
On randomness in Hash functions
#!ilm_mods_00037758!#
In: 29th International Symposium on Theoretical Aspects of Computer Science: STACS ’12, February 29th to March 3rd, 2012, Paris, France, (2012), pp. 25–28
DOI: https://doi.org/10.4230/LIPIcs.STACS.2012.25
Dietzfelbinger, Martin; Rowe, Jonathan E.; Wegener, Ingo; Wölfel, Philipp:
Precision, local search and unimodal functions
#!ilm_mods_00038505!#
In: Algorithmica: an international journal in computer science, vol. 59 (2011), no. 3, pp. 301–322
DOI: https://doi.org/10.1007/s00453-009-9352-x
Vöcking, Berthold; Alt, Helmut; Dietzfelbinger, Martin; Reischuk, Rüdiger; Scheideler, Christian; Vollmer, Heribert; Wagner, Dorothea (eds.):
Algorithms unplugged
#!ilm_mods_00038870!#
Berlin : Springer, 2011. - ISBN 978-3-642-15328-0
DOI: https://doi.org/10.1007/978-3-642-15328-0
Dietzfelbinger, Martin:
Fingerprinting
#!ilm_mods_00040100!#
In: Algorithms unplugged. - Berlin : Springer, 2011, pp. 181–193
DOI: https://doi.org/10.1007/978-3-642-15328-0_19
Dietzfelbinger, Martin; Mitzenmacher, Michael; Rink, Michael:
Cuckoo hashing with pages
#!ilm_mods_00039736!#
In: Algorithms - ESA 2011: 19th annual European symposium, Saarbrücken, Germany, September 5 - 9, 2011 ; proceedings, (2011), pp. 615–627
DOI: https://doi.org/10.1007/978-3-642-23719-5
Dietzfelbinger, Martin; Rowe, Jonathan E.; Wegener, Ingo; Wölfel, Philipp:
Tight bounds for blind search on the integers and the reals
#!ilm_mods_00002772!#
In: Combinatorics, probability & computing: CPC, vol. 19 (2010), no. 5/6, pp. 711–728
[Meeting on Combinatorics and Probability (Oberwolfach, 26.04.-02.05.2009)]
DOI: https://doi.org/10.1017/S0963548309990599
Dietzfelbinger, Martin; Goerdt, Andreas; Mitzenmacher, Michael; Montanari, Andrea; Pagh, Rasmus; Rink, Michael:
Tight thresholds for cuckoo hashing via XORSAT
#!ilm_mods_00042454!#
In: Automata, languages and programming: 37th international colloquium, ICALP 2010, Bordeaux, France, July 6 - 10, 2010 ; proceedings, part I, (2010), pp. 213–225
DOI: https://doi.org/10.1007/978-3-642-14165-2_19
Dietzfelbinger, Martin:
Ingo Wegener: seine Bücher
#!ilm_mods_00041348!#
In: Informatik-Spektrum: Organ der Gesellschaft für Informatik e.V. und mit ihr assoziierter Organisationen, vol. 33 (2010), no. 4, p. 485
DOI: https://doi.org/10.1007/s00287-010-0463-1
Dietzfelbinger, Martin; Wölfel, Philipp:
Brief announcement: tight lower bounds for greedy routing in uniform small world rings
#!ilm_mods_00045226!#
In: Proceedings of the 2009 ACM Symposium on Principles of Distributed Computing: August 10 - 12, 2009, Calgary, Alberta, Canada, (2009), pp. 300–301
Dietzfelbinger, Martin; Edelkamp, Stefan:
Perfect hashing for state spaces in BDD representation
#!ilm_mods_00045178!#
In: KI 2009: advances in artificial intelligence: 32nd Annual German Conference on AI, Paderborn, Germany, September 15 - 18, 2009 ; proceedings, (2009), pp. 33–40
DOI: https://doi.org/10.1007/978-3-642-04617-9_5
Belazzougui, Djamal; Botelho, Fabiano C.; Dietzfelbinger, Martin:
Hash, displace, and compress
#!ilm_mods_00045174!#
In: Algorithms - ESA 2009: 17th annual European symposium, Copenhagen, Denmark, September 7 - 9, 2009 ; proceedings, (2009), pp. 682–693
DOI: https://doi.org/10.1007/978-3-642-04128-0_61
Aumüller, Martin; Dietzfelbinger, Martin; Rink, Michael:
Experimental variations of a theoretically good retrieval data structure
#!ilm_mods_00045175!#
In: Algorithms - ESA 2009: 17th annual European symposium, Copenhagen, Denmark, September 7 - 9, 2009 ; proceedings, (2009), pp. 742–751
DOI: https://doi.org/10.1007/978-3-642-04128-0_66
Dietzfelbinger, Martin; Schellbach, Ulf:
Weaknesses of Cuckoo hashing with a simple universal hash class: the case of large universes
#!ilm_mods_00044943!#
In: SOFSEM 2009: theory and practice of computer science: 35th Conference on Current Trends in Theory and Practice of Computer Science, Špindler°uv Mlyń, Czech Republic, January 24 - 30, 2009 ; proceedings, (2009), pp. 217–228
DOI: https://doi.org/10.1007/978-3-540-95891-8_22
Dietzfelbinger, Martin; Schellbach, Ulf:
On risks of using cuckoo hashing with simple universal hash classes
#!ilm_mods_00044992!#
In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms: [New York, NY, January 4-6, 2009], (2009), pp. 795–804
Dietzfelbinger, Martin; Wölfel, Philipp:
Tight lower bounds for greedy routing in uniform small world rings
#!ilm_mods_00045070!#
In: Proceedings of the 2009 ACM International Symposium on Theory of Computing: Bethesda, Maryland, USA, May 31 - June 2, 2009, (2009), pp. 591–600
Dietzfelbinger, Martin; Rink, Michael:
Applications of a splitting trick
#!ilm_mods_00045081!#
In: Automata, languages and programming: 36th international colloquium, ICALP 2009, Rhodes, Greece, July 5 - 12, 2009 ; proceedings, part I, (2009), pp. 354–365
DOI: https://doi.org/10.1007/978-3-642-02927-1_30
Dietzfelbinger, Martin; Hühne, Martin; Weidling, Christoph:
A dictionary implementation based on dynamic perfect hashing
#!ilm_mods_00046833!#
In: Journal of experimental algorithmics: JEA, vol. 12 (2008)
URL: http://doi.acm.org/10.1145/1370596.1370602
Dietzfelbinger, Martin; Pagh, Rasmus:
Succinct data structures for retrieval and approximate membership (extended abstract)
#!ilm_mods_00047688!#
In: Automata, languages and programming: 35th international colloquium, ICALP 2008, Reykjavik, Iceland, July 7 - 11, 2008; proceedings ; Part 1 (ISBN 3-540-70574-0), (2008), pp. 385–396
DOI: https://doi.org/10.1007/978-3-540-70575-8_32
Dietzfelbinger, Martin; Rowe, Jonathan E.; Wegener, Ingo; Wölfel, Philipp:
Precision, local search and unimodal functions
#!ilm_mods_00047887!#
In: GECCO 2008: Genetic and Evolutionary Computation Conference ; Saturday - Wednesday ; July 12 - 16, 2008, Atlanta, Georgia, USA, (2008), pp. 771–778
Dietzfelbinger, Martin:
[Rezension von: Dasgupta, Sanjoy; Papadimitriou, Christos H.; Vazirani, Umesh Virkumar, Algorithms...]
#!ilm_mods_00048222!#
2008, pp. 131–136
DOI: https://doi.org/10.1016/j.cosrev.2008.03.001
Dietzfelbinger, Martin:
Tight bounds for blind search on the integers
#!ilm_mods_00048179!#
Dortmund : TU, Secretary of the SFB 531, 2008
(Reihe Computational intelligence: CI ; interne Berichte ; 240)
Dietzfelbinger, Martin; Rowe, Jonathan E.; Wegener, Ingo; Wölfel, Philipp:
Tight bounds for blind search on the integers
#!ilm_mods_00048119!#
In: 25th International Symposium on Theoretical Aspects of Computer Science: STACS 2008 ; February 21 - 23, 2008, Bordeaux, France (ISBN 978-3-939897-06-4), (2008), pp. 241–252
DOI: https://doi.org/10.4230/LIPIcs.STACS.2008
Vöcking, Berthold; Alt, Helmut; Dietzfelbinger, Martin; Reischuk, Rüdiger; Scheideler, Christian; Vollmer, Heribert; Wagner, Dorothea (eds.):
Taschenbuch der Algorithmen
#!ilm_mods_00048295!#
Berlin, Heidelberg : Springer-Verlag, 2008. - ISBN 978-3-540-76394-9
(eXamen.press)
DOI: https://doi.org/10.1007/978-3-540-76394-9
Dietzfelbinger, Martin:
Fingerprinting
#!ilm_mods_00048253!#
In: Taschenbuch der Algorithmen. - 2008, pp. 193–204
Dietzfelbinger, Martin; Teng, Shang-Hua; Vöcking, Berthold (eds.):
Probabilistic methods in the design and analysis of algorithms: 07391 abstracts collection - Dagstuhl seminar
#!ilm_mods_00018722!#
Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2007, pp. 1–18
[Dagstuhl Seminar 07391 “Probabilistic Methods in the Design and Analysis of Algorithms” (Wadern, 23.-27.09.2007)]
(Dagstuhl seminar proceedings ; 7391)
DOI: https://doi.org/10.4230/DagSemProc.07391.1
Dietzfelbinger, Martin; Weidling, Christoph:
Balanced allocation and dictionaries with tightly packed constant size bins
#!ilm_mods_00049129!#
In: Theoretical computer science, vol. 380 (2007), no. 1/2, pp. 47–68
DOI: https://doi.org/10.1016/j.tcs.2007.02.054
Dietzfelbinger, Martin; Wunderlich, Henning:
A characterization of average case communication complexity
#!ilm_mods_00049127!#
In: Information processing letters: devoted to the rapid publication of short contributions to information processing, vol. 101 (2007), no. 6, pp. 245–249
DOI: https://doi.org/10.1016/j.ipl.2006.10.006
Dietzfelbinger, Martin:
Design strategies for minimal perfect hash functions
#!ilm_mods_00049751!#
In: Stochastic algorithms: foundations and applications: 4th international symposium, SAGA 2007, Zurich, Switzerland, September 13 - 14, 2007 ; proceedings, (2007), pp. 2–17
DOI: https://doi.org/10.1007/978-3-540-74871-7
Dietzfelbinger, Martin; Weidling, Christoph:
Balanced allocation and dictionaries with tightly packed constant size bins
#!ilm_mods_00054132!#
In: Automata, languages and programming: 32nd international colloquium, ICALP 2005, Lisbon, Portugal, July 11-15, 2005 ; proceedings, (2005), pp. 166–178
DOI: https://doi.org/10.1007/11523468_14
Dietzfelbinger, Martin; Tamaki, Hisao:
On the probability of rendezvous in graphs
#!ilm_mods_00053300!#
In: Random structures & algorithms, vol. 26 (2005), no. 3, pp. 266–288
DOI: https://doi.org/10.1002/rsa.20032
Dietzfelbinger, Martin:
Gossiping and broadcasting versus computing functions in networks
#!ilm_mods_00002339!#
In: Discrete applied mathematics, vol. 137 (2004), no. 2, pp. 127–153
DOI: https://doi.org/10.1016/S0166-218X(03)00257-9
Dietzfelbinger, Martin:
Primality testing in polynomial time: from randomized algorithms to “PRIMES is in P”
#!ilm_mods_00056472!#
Berlin : Springer, 2004. - ISBN 978-3-540-25933-6
(Lecture notes in computer science ; 3000)
DOI: https://doi.org/10.1007/b12334
Dietzfelbinger, Martin; Kunde, Manfred:
A case against using Stirling’s formula
#!ilm_mods_00056629!#
In: Bulletin of the European Association for Theoretical Computer Science, EATCS, vol. 80 (2003), pp. 153–158
Dietzfelbinger, Martin; Naudts, Bart; Hoyweghen, Clarissa; Wegener, Ingo:
The analysis of a recombinative hill-climber on H-IFF
#!ilm_mods_00056654!#
In: IEEE transactions on evolutionary computation, vol. 7 (2003), no. 5, pp. 417–423
URL: https://ezb.ur.de/?2028087
Dietzfelbinger, Martin; Wölfel, Philipp:
Almost random graphs with simple hash functions
#!ilm_mods_00057008!#
In: Proceedings of the 35th Annual ACM Symposium on Theory of Computing: San Diego, California, USA, June 9 - 11, 2003 (ISBN 1-58113-674-9), (2003), pp. 629–638
Dietzfelbinger, Martin; Tamaki, Hisao:
On the probability of rendezvous in graphs
#!ilm_mods_00057408!#
Saarbrücken : Max-Planck-Inst. für Informatik, Bibliothek & Dokumentation, 2003
(Research report / MPII, Max-Planck-Institut Informatik ; 2003-1-006)
URL: https://www.mpi-inf.mpg.de/publications/research-reports
Dietzfelbinger, Martin; Wölfel, Philipp:
Almost random graphs with simple hash functions
#!ilm_mods_00057409!#
Saarbrücken : Max-Planck-Inst. für Informatik, Bibliothek & Dokumentation, 2003
(Research report / MPII, Max-Planck-Institut Informatik ; 2003-1-005)
URL: https://www.mpi-inf.mpg.de/publications/research-reports
Dietzfelbinger, Martin:
The probability of a rendezvous is minimal in complete graphs
#!ilm_mods_00058411!#
In: Algorithms and Computation: 13th International Symposium, ISAAC 2002 Vancouver, BC, Canada, November 21–23, 2002 Proceedings, (2002), pp. 55–66
DOI: https://doi.org/10.1007/3-540-36136-7_6
Dietzfelbinger, Martin:
The analysis of a recombinative hill climber on HIFF
#!ilm_mods_00058856!#
Dortmund : Secretary of the SFB 531, 2002
(Reihe Computational intelligence: CI ; interne Berichte ; 138)
Dietzfelbinger, Martin; Gambin, Anna; Lasota, Sławomir:
On different models for packet flow in multistage interconnection networks
#!ilm_mods_00059051!#
In: Fundamenta informaticae, vol. 46 (2001), no. 4, pp. 287–314
URL: https://ezb.ur.de/?2043974-X
Dietzfelbinger, Martin; Hagerup, Torben:
Simple minimal perfect hashing in less space
#!ilm_mods_00059344!#
In: Algorithms — ESA 2001: 9th Annual European Symposium Århus, Denmark, August 28–31, 2001 Proceedings (ISBN 978-3-540-42493-2), (2001), pp. 109–120
DOI: https://doi.org/10.1007/3-540-44676-1_9
Alon, Noga; Dietzfelbinger, Martin; Miltersen, Peter Bro; Petrank, Erez; Tardos, Gábor:
Linear hash functions
#!ilm_mods_00061044!#
In: Journal of the ACM: JACM, vol. 46 (1999), no. 5, pp. 667–683
DOI: https://doi.org/10.1145/324133.324179
