Stop the war!
Остановите войну!
for scientists:
default search action
BibTeX records: Martin Dietzfelbinger
@inproceedings{DBLP:conf/esa/Dietzfelbinger23, author = {Martin Dietzfelbinger}, editor = {Inge Li G{\o}rtz and Martin Farach{-}Colton and Simon J. Puglisi and Grzegorz Herman}, title = {On Hashing by (Random) Equations (Invited Talk)}, booktitle = {31st Annual European Symposium on Algorithms, {ESA} 2023, September 4-6, 2023, Amsterdam, The Netherlands}, series = {LIPIcs}, volume = {274}, pages = {1:1--1:1}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2023}, url = {https://doi.org/10.4230/LIPIcs.ESA.2023.1}, doi = {10.4230/LIPICS.ESA.2023.1}, timestamp = {Wed, 30 Aug 2023 15:40:45 +0200}, biburl = {https://dblp.org/rec/conf/esa/Dietzfelbinger23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@book{DBLP:books/sp/SandersMDD19, author = {Peter Sanders and Kurt Mehlhorn and Martin Dietzfelbinger and Roman Dementiev}, title = {Sequential and Parallel Algorithms and Data Structures - The Basic Toolbox}, publisher = {Springer}, year = {2019}, url = {https://doi.org/10.1007/978-3-030-25209-0}, doi = {10.1007/978-3-030-25209-0}, isbn = {978-3-030-25208-3}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/books/sp/SandersMDD19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cpc/AumullerDHKP19, author = {Martin Aum{\"{u}}ller and Martin Dietzfelbinger and Clemens Heuberger and Daniel Krenn and Helmut Prodinger}, title = {Dual-Pivot Quicksort: Optimality, Analysis and Zeros of Associated Lattice Paths}, journal = {Comb. Probab. Comput.}, volume = {28}, number = {4}, pages = {485--518}, year = {2019}, url = {https://doi.org/10.1017/S096354831800041X}, doi = {10.1017/S096354831800041X}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/cpc/AumullerDHKP19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/cecc/DietzfelbingerK19, author = {Martin Dietzfelbinger and J{\"{o}}rg Keller}, title = {Determining Minimum Hash Width for Hash Chains}, booktitle = {Proceedings of the Third Central European Cybersecurity Conference, {CECC} 2019, Munich, Germany, November 14-15, 2019}, pages = {18:1--18:5}, publisher = {{ACM}}, year = {2019}, url = {https://doi.org/10.1145/3360664.3360682}, doi = {10.1145/3360664.3360682}, timestamp = {Thu, 31 Oct 2019 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/cecc/DietzfelbingerK19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/esa/DietzfelbingerW19, author = {Martin Dietzfelbinger and Stefan Walzer}, editor = {Michael A. Bender and Ola Svensson and Grzegorz Herman}, title = {Dense Peelable Random Uniform Hypergraphs}, booktitle = {27th Annual European Symposium on Algorithms, {ESA} 2019, September 9-11, 2019, Munich/Garching, Germany}, series = {LIPIcs}, volume = {144}, pages = {38:1--38:16}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2019}, url = {https://doi.org/10.4230/LIPIcs.ESA.2019.38}, doi = {10.4230/LIPICS.ESA.2019.38}, timestamp = {Mon, 23 Sep 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/esa/DietzfelbingerW19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/esa/DietzfelbingerW19a, author = {Martin Dietzfelbinger and Stefan Walzer}, editor = {Michael A. Bender and Ola Svensson and Grzegorz Herman}, title = {Efficient Gauss Elimination for Near-Quadratic Matrices with One Short Random Block per Row, with Applications}, booktitle = {27th Annual European Symposium on Algorithms, {ESA} 2019, September 9-11, 2019, Munich/Garching, Germany}, series = {LIPIcs}, volume = {144}, pages = {39:1--39:18}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2019}, url = {https://doi.org/10.4230/LIPIcs.ESA.2019.39}, doi = {10.4230/LIPICS.ESA.2019.39}, timestamp = {Mon, 23 Sep 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/esa/DietzfelbingerW19a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/DietzfelbingerW19, author = {Martin Dietzfelbinger and Stefan Walzer}, editor = {Rolf Niedermeier and Christophe Paul}, title = {Constant-Time Retrieval with O(log m) Extra Bits}, booktitle = {36th International Symposium on Theoretical Aspects of Computer Science, {STACS} 2019, March 13-16, 2019, Berlin, Germany}, series = {LIPIcs}, volume = {126}, pages = {24:1--24:16}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2019}, url = {https://doi.org/10.4230/LIPIcs.STACS.2019.24}, doi = {10.4230/LIPICS.STACS.2019.24}, timestamp = {Tue, 11 Feb 2020 15:52:14 +0100}, biburl = {https://dblp.org/rec/conf/stacs/DietzfelbingerW19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1907-04749, author = {Martin Dietzfelbinger and Stefan Walzer}, title = {Dense Peelable Random Uniform Hypergraphs}, journal = {CoRR}, volume = {abs/1907.04749}, year = {2019}, url = {http://arxiv.org/abs/1907.04749}, eprinttype = {arXiv}, eprint = {1907.04749}, timestamp = {Wed, 17 Jul 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1907-04749.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1907-04750, author = {Martin Dietzfelbinger and Stefan Walzer}, title = {Efficient Gauss Elimination for Near-Quadratic Matrices with One Short Random Block per Row, with Applications}, journal = {CoRR}, volume = {abs/1907.04750}, year = {2019}, url = {http://arxiv.org/abs/1907.04750}, eprinttype = {arXiv}, eprint = {1907.04750}, timestamp = {Wed, 17 Jul 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1907-04750.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/birthday/Dietzfelbinger18, author = {Martin Dietzfelbinger}, editor = {Hans{-}Joachim B{\"{o}}ckenhauer and Dennis Komm and Walter Unger}, title = {Universal Hashing via Integer Arithmetic Without Primes, Revisited}, booktitle = {Adventures Between Lower Bounds and Higher Altitudes - Essays Dedicated to Juraj Hromkovi{\v{c}} on the Occasion of His 60th Birthday}, series = {Lecture Notes in Computer Science}, volume = {11011}, pages = {257--279}, publisher = {Springer}, year = {2018}, url = {https://doi.org/10.1007/978-3-319-98355-4\_15}, doi = {10.1007/978-3-319-98355-4\_15}, timestamp = {Tue, 14 May 2019 10:00:52 +0200}, biburl = {https://dblp.org/rec/conf/birthday/Dietzfelbinger18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/mfcs/DietzfelbingerS18, author = {Martin Dietzfelbinger and Philipp Schlag and Stefan Walzer}, editor = {Igor Potapov and Paul G. Spirakis and James Worrell}, title = {A Subquadratic Algorithm for 3XOR}, booktitle = {43rd International Symposium on Mathematical Foundations of Computer Science, {MFCS} 2018, August 27-31, 2018, Liverpool, {UK}}, series = {LIPIcs}, volume = {117}, pages = {59:1--59:15}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2018}, url = {https://doi.org/10.4230/LIPIcs.MFCS.2018.59}, doi = {10.4230/LIPICS.MFCS.2018.59}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/mfcs/DietzfelbingerS18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1804-11086, author = {Martin Dietzfelbinger and Philipp Schlag and Stefan Walzer}, title = {A Subquadratic Algorithm for 3XOR}, journal = {CoRR}, volume = {abs/1804.11086}, year = {2018}, url = {http://arxiv.org/abs/1804.11086}, eprinttype = {arXiv}, eprint = {1804.11086}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1804-11086.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iandc/Dietzfelbinger17, author = {Martin Dietzfelbinger}, title = {Special issue for the 39th International Symposium on Mathematical Foundations of Computer Science, {MFCS} 2014, Budapest, Hungary}, journal = {Inf. Comput.}, volume = {256}, pages = {1}, year = {2017}, url = {https://doi.org/10.1016/j.ic.2017.04.003}, doi = {10.1016/J.IC.2017.04.003}, timestamp = {Fri, 06 Oct 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/iandc/Dietzfelbinger17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dagstuhl-reports/DietzfelbingerM17, author = {Martin Dietzfelbinger and Michael Mitzenmacher and Rasmus Pagh and David P. Woodruff and Martin Aum{\"{u}}ller}, title = {Theory and Applications of Hashing (Dagstuhl Seminar 17181)}, journal = {Dagstuhl Reports}, volume = {7}, number = {5}, pages = {1--21}, year = {2017}, url = {https://doi.org/10.4230/DagRep.7.5.1}, doi = {10.4230/DAGREP.7.5.1}, timestamp = {Tue, 19 Dec 2017 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dagstuhl-reports/DietzfelbingerM17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mst/MuschollD16, author = {Anca Muscholl and Martin Dietzfelbinger}, title = {Preface of {STACS} 2013 Special Issue}, journal = {Theory Comput. Syst.}, volume = {58}, number = {4}, pages = {503--505}, year = {2016}, url = {https://doi.org/10.1007/s00224-015-9654-0}, doi = {10.1007/S00224-015-9654-0}, timestamp = {Tue, 26 Jun 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mst/MuschollD16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/talg/AumullerD16, author = {Martin Aum{\"{u}}ller and Martin Dietzfelbinger}, title = {Optimal Partitioning for Dual-Pivot Quicksort}, journal = {{ACM} Trans. Algorithms}, volume = {12}, number = {2}, pages = {18:1--18:36}, year = {2016}, url = {https://doi.org/10.1145/2743020}, doi = {10.1145/2743020}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/talg/AumullerD16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/talg/AumullerDK16, author = {Martin Aum{\"{u}}ller and Martin Dietzfelbinger and Pascal Klaue}, title = {How Good Is Multi-Pivot Quicksort?}, journal = {{ACM} Trans. Algorithms}, volume = {13}, number = {1}, pages = {8:1--8:47}, year = {2016}, url = {https://doi.org/10.1145/2963102}, doi = {10.1145/2963102}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/talg/AumullerDK16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/AumullerDHKP16, author = {Martin Aum{\"{u}}ller and Martin Dietzfelbinger and Clemens Heuberger and Daniel Krenn and Helmut Prodinger}, title = {Counting Zeros in Random Walks on the Integers and Analysis of Optimal Dual-Pivot Quicksort}, journal = {CoRR}, volume = {abs/1602.04031}, year = {2016}, url = {http://arxiv.org/abs/1602.04031}, eprinttype = {arXiv}, eprint = {1602.04031}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/AumullerDHKP16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/AumullerDW16, author = {Martin Aum{\"{u}}ller and Martin Dietzfelbinger and Philipp Woelfel}, title = {A Simple Hash Class with Strong Randomness Properties in Graphs and Hypergraphs}, journal = {CoRR}, volume = {abs/1611.00029}, year = {2016}, url = {http://arxiv.org/abs/1611.00029}, eprinttype = {arXiv}, eprint = {1611.00029}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/AumullerDW16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/AumullerDHKP16a, author = {Martin Aum{\"{u}}ller and Martin Dietzfelbinger and Clemens Heuberger and Daniel Krenn and Helmut Prodinger}, title = {Dual-Pivot Quicksort: Optimality, Analysis and Zeros of Associated Lattice Paths}, journal = {CoRR}, volume = {abs/1611.00258}, year = {2016}, url = {http://arxiv.org/abs/1611.00258}, eprinttype = {arXiv}, eprint = {1611.00258}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/AumullerDHKP16a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/DietzfelbingerJ15, author = {Martin Dietzfelbinger and Raed Jaberi}, title = {On testing single connectedness in directed graphs and some related problems}, journal = {Inf. Process. Lett.}, volume = {115}, number = {9}, pages = {684--688}, year = {2015}, url = {https://doi.org/10.1016/j.ipl.2015.04.008}, doi = {10.1016/J.IPL.2015.04.008}, timestamp = {Wed, 14 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/DietzfelbingerJ15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mst/DietzfelbingerR15, author = {Martin Dietzfelbinger and Michael Rink}, title = {Towards Optimal Degree Distributions for Left-Perfect Matchings in Random Bipartite Graphs}, journal = {Theory Comput. Syst.}, volume = {56}, number = {4}, pages = {593--611}, year = {2015}, url = {https://doi.org/10.1007/s00224-014-9577-1}, doi = {10.1007/S00224-014-9577-1}, timestamp = {Wed, 14 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mst/DietzfelbingerR15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/AumullerDK15, author = {Martin Aum{\"{u}}ller and Martin Dietzfelbinger and Pascal Klaue}, title = {How Good is Multi-Pivot Quicksort?}, journal = {CoRR}, volume = {abs/1510.04676}, year = {2015}, url = {http://arxiv.org/abs/1510.04676}, eprinttype = {arXiv}, eprint = {1510.04676}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/AumullerDK15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@book{DBLP:books/daglib/0033948, author = {Martin Dietzfelbinger and Kurt Mehlhorn and Peter Sanders}, title = {Algorithmen und Datenstrukturen - die Grundwerkzeuge}, series = {eXamen.press}, publisher = {Springer}, year = {2014}, url = {https://doi.org/10.1007/978-3-642-05472-3}, doi = {10.1007/978-3-642-05472-3}, isbn = {978-3-642-05471-6}, timestamp = {Wed, 14 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/books/daglib/0033948.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/AumullerDW14, author = {Martin Aum{\"{u}}ller and Martin Dietzfelbinger and Philipp Woelfel}, title = {Explicit and Efficient Hash Families Suffice for Cuckoo Hashing with a Stash}, journal = {Algorithmica}, volume = {70}, number = {3}, pages = {428--456}, year = {2014}, url = {https://doi.org/10.1007/s00453-013-9840-x}, doi = {10.1007/S00453-013-9840-X}, timestamp = {Wed, 14 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/algorithmica/AumullerDW14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/DietzfelbingerW14, author = {Martin Dietzfelbinger and Philipp Woelfel}, editor = {Chandra Chekuri}, title = {Tight Lower Bounds for Greedy Routing in Higher-Dimensional Small-World Grids}, booktitle = {Proceedings of the Twenty-Fifth Annual {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2014, Portland, Oregon, USA, January 5-7, 2014}, pages = {816--829}, publisher = {{SIAM}}, year = {2014}, url = {https://doi.org/10.1137/1.9781611973402.60}, doi = {10.1137/1.9781611973402.60}, timestamp = {Tue, 02 Feb 2021 17:07:40 +0100}, biburl = {https://dblp.org/rec/conf/soda/DietzfelbingerW14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@proceedings{DBLP:conf/mfcs/2014-1, editor = {Erzs{\'{e}}bet Csuhaj{-}Varj{\'{u}} and Martin Dietzfelbinger and Zolt{\'{a}}n {\'{E}}sik}, title = {Mathematical Foundations of Computer Science 2014 - 39th International Symposium, {MFCS} 2014, Budapest, Hungary, August 25-29, 2014. Proceedings, Part {I}}, series = {Lecture Notes in Computer Science}, volume = {8634}, publisher = {Springer}, year = {2014}, url = {https://doi.org/10.1007/978-3-662-44522-8}, doi = {10.1007/978-3-662-44522-8}, isbn = {978-3-662-44521-1}, timestamp = {Tue, 14 May 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/mfcs/2014-1.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@proceedings{DBLP:conf/mfcs/2014-2, editor = {Erzs{\'{e}}bet Csuhaj{-}Varj{\'{u}} and Martin Dietzfelbinger and Zolt{\'{a}}n {\'{E}}sik}, title = {Mathematical Foundations of Computer Science 2014 - 39th International Symposium, {MFCS} 2014, Budapest, Hungary, August 25-29, 2014. Proceedings, Part {II}}, series = {Lecture Notes in Computer Science}, volume = {8635}, publisher = {Springer}, year = {2014}, url = {https://doi.org/10.1007/978-3-662-44465-8}, doi = {10.1007/978-3-662-44465-8}, isbn = {978-3-662-44464-1}, timestamp = {Tue, 14 May 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/mfcs/2014-2.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/AumullerD13, author = {Martin Aum{\"{u}}ller and Martin Dietzfelbinger}, editor = {Fedor V. Fomin and Rusins Freivalds and Marta Z. Kwiatkowska and David Peleg}, title = {Optimal Partitioning for Dual Pivot Quicksort - (Extended Abstract)}, booktitle = {Automata, Languages, and Programming - 40th International Colloquium, {ICALP} 2013, Riga, Latvia, July 8-12, 2013, Proceedings, Part {I}}, series = {Lecture Notes in Computer Science}, volume = {7965}, pages = {33--44}, publisher = {Springer}, year = {2013}, url = {https://doi.org/10.1007/978-3-642-39206-1\_4}, doi = {10.1007/978-3-642-39206-1\_4}, timestamp = {Tue, 14 May 2019 10:00:44 +0200}, biburl = {https://dblp.org/rec/conf/icalp/AumullerD13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1303-5217, author = {Martin Aum{\"{u}}ller and Martin Dietzfelbinger}, title = {Optimal Partitioning for Dual Pivot Quicksort}, journal = {CoRR}, volume = {abs/1303.5217}, year = {2013}, url = {http://arxiv.org/abs/1303.5217}, eprinttype = {arXiv}, eprint = {1303.5217}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1303-5217.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1305-1295, author = {Martin Dietzfelbinger and Philipp Woelfel}, title = {Tight Lower Bounds for Greedy Routing in Higher-Dimensional Small-World Grids}, journal = {CoRR}, volume = {abs/1305.1295}, year = {2013}, url = {http://arxiv.org/abs/1305.1295}, eprinttype = {arXiv}, eprint = {1305.1295}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1305-1295.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/csr/DietzfelbingerR12, author = {Martin Dietzfelbinger and Michael Rink}, editor = {Edward A. Hirsch and Juhani Karhum{\"{a}}ki and Arto Lepist{\"{o}} and Michail Kh. Prilutskii}, title = {Towards Optimal Degree-Distributions for Left-Perfect Matchings in Random Bipartite Graphs}, booktitle = {Computer Science - Theory and Applications - 7th International Computer Science Symposium in Russia, {CSR} 2012, Nizhny Novgorod, Russia, July 3-7, 2012. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7353}, pages = {99--111}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-30642-6\_11}, doi = {10.1007/978-3-642-30642-6\_11}, timestamp = {Tue, 14 May 2019 10:00:51 +0200}, biburl = {https://dblp.org/rec/conf/csr/DietzfelbingerR12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/esa/AumullerDW12, author = {Martin Aum{\"{u}}ller and Martin Dietzfelbinger and Philipp Woelfel}, editor = {Leah Epstein and Paolo Ferragina}, title = {Explicit and Efficient Hash Families Suffice for Cuckoo Hashing with a Stash}, booktitle = {Algorithms - {ESA} 2012 - 20th Annual European Symposium, Ljubljana, Slovenia, September 10-12, 2012. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7501}, pages = {108--120}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-33090-2\_11}, doi = {10.1007/978-3-642-33090-2\_11}, timestamp = {Tue, 14 May 2019 10:00:54 +0200}, biburl = {https://dblp.org/rec/conf/esa/AumullerDW12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/Dietzfelbinger12, author = {Martin Dietzfelbinger}, editor = {Christoph D{\"{u}}rr and Thomas Wilke}, title = {On Randomness in Hash Functions (Invited Talk)}, booktitle = {29th International Symposium on Theoretical Aspects of Computer Science, {STACS} 2012, February 29th - March 3rd, 2012, Paris, France}, series = {LIPIcs}, volume = {14}, pages = {25--28}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2012}, url = {https://doi.org/10.4230/LIPIcs.STACS.2012.25}, doi = {10.4230/LIPICS.STACS.2012.25}, timestamp = {Tue, 11 Feb 2020 15:52:14 +0100}, biburl = {https://dblp.org/rec/conf/stacs/Dietzfelbinger12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wea/DietzfelbingerPR12, author = {Martin Dietzfelbinger and Hendrik Peilke and Michael Rink}, editor = {Ralf Klasing}, title = {A More Reliable Greedy Heuristic for Maximum Matchings in Sparse Random Graphs}, booktitle = {Experimental Algorithms - 11th International Symposium, {SEA} 2012, Bordeaux, France, June 7-9, 2012. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7276}, pages = {148--159}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-30850-5\_14}, doi = {10.1007/978-3-642-30850-5\_14}, timestamp = {Tue, 14 May 2019 10:00:42 +0200}, biburl = {https://dblp.org/rec/conf/wea/DietzfelbingerPR12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1203-1506, author = {Martin Dietzfelbinger and Michael Rink}, title = {Towards Optimal Degree-distributions for Left-perfect Matchings in Random Bipartite Graphs}, journal = {CoRR}, volume = {abs/1203.1506}, year = {2012}, url = {http://arxiv.org/abs/1203.1506}, eprinttype = {arXiv}, eprint = {1203.1506}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1203-1506.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1203-4117, author = {Martin Dietzfelbinger and Hendrik Peilke and Michael Rink}, title = {A More Reliable Greedy Heuristic for Maximum Matchings in Sparse Random Graphs}, journal = {CoRR}, volume = {abs/1203.4117}, year = {2012}, url = {http://arxiv.org/abs/1203.4117}, eprinttype = {arXiv}, eprint = {1203.4117}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1203-4117.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1204-4431, author = {Martin Aum{\"{u}}ller and Martin Dietzfelbinger and Philipp Woelfel}, title = {Explicit and Efficient Hash Families Suffice for Cuckoo Hashing with a Stash}, journal = {CoRR}, volume = {abs/1204.4431}, year = {2012}, url = {http://arxiv.org/abs/1204.4431}, eprinttype = {arXiv}, eprint = {1204.4431}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1204-4431.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/DietzfelbingerRWW11, author = {Martin Dietzfelbinger and Jonathan E. Rowe and Ingo Wegener and Philipp Woelfel}, title = {Precision, Local Search and Unimodal Functions}, journal = {Algorithmica}, volume = {59}, number = {3}, pages = {301--322}, year = {2011}, url = {https://doi.org/10.1007/s00453-009-9352-x}, doi = {10.1007/S00453-009-9352-X}, timestamp = {Thu, 15 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/algorithmica/DietzfelbingerRWW11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/esa/DietzfelbingerMR11, author = {Martin Dietzfelbinger and Michael Mitzenmacher and Michael Rink}, editor = {Camil Demetrescu and Magn{\'{u}}s M. Halld{\'{o}}rsson}, title = {Cuckoo Hashing with Pages}, booktitle = {Algorithms - {ESA} 2011 - 19th Annual European Symposium, Saarbr{\"{u}}cken, Germany, September 5-9, 2011. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {6942}, pages = {615--627}, publisher = {Springer}, year = {2011}, url = {https://doi.org/10.1007/978-3-642-23719-5\_52}, doi = {10.1007/978-3-642-23719-5\_52}, timestamp = {Tue, 14 May 2019 10:00:54 +0200}, biburl = {https://dblp.org/rec/conf/esa/DietzfelbingerMR11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@incollection{DBLP:books/sp/voecking2011/Dietzfelbinger11, author = {Martin Dietzfelbinger}, editor = {Berthold V{\"{o}}cking and Helmut Alt and Martin Dietzfelbinger and R{\"{u}}diger Reischuk and Christian Scheideler and Heribert Vollmer and Dorothea Wagner}, title = {Fingerprinting}, booktitle = {Algorithms Unplugged}, pages = {181--193}, publisher = {Springer}, year = {2011}, url = {https://doi.org/10.1007/978-3-642-15328-0\_19}, doi = {10.1007/978-3-642-15328-0\_19}, timestamp = {Wed, 14 Jun 2017 20:29:01 +0200}, biburl = {https://dblp.org/rec/books/sp/voecking2011/Dietzfelbinger11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@book{DBLP:books/sp/voecking11, editor = {Berthold V{\"{o}}cking and Helmut Alt and Martin Dietzfelbinger and R{\"{u}}diger Reischuk and Christian Scheideler and Heribert Vollmer and Dorothea Wagner}, title = {Algorithms Unplugged}, publisher = {Springer}, year = {2011}, url = {https://doi.org/10.1007/978-3-642-15328-0}, doi = {10.1007/978-3-642-15328-0}, isbn = {978-3-642-15327-3}, timestamp = {Wed, 14 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/books/sp/voecking11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1104-5111, author = {Martin Dietzfelbinger and Michael Mitzenmacher and Michael Rink}, title = {Cuckoo Hashing with Pages}, journal = {CoRR}, volume = {abs/1104.5111}, year = {2011}, url = {http://arxiv.org/abs/1104.5111}, eprinttype = {arXiv}, eprint = {1104.5111}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1104-5111.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cpc/DietzfelbingerRWW10, author = {Martin Dietzfelbinger and Jonathan E. Rowe and Ingo Wegener and Philipp Woelfel}, title = {Tight Bounds for Blind Search on the Integers and the Reals}, journal = {Comb. Probab. Comput.}, volume = {19}, number = {5-6}, pages = {711--728}, year = {2010}, url = {https://doi.org/10.1017/S0963548309990599}, doi = {10.1017/S0963548309990599}, timestamp = {Thu, 12 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cpc/DietzfelbingerRWW10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/insk/Dietzfelbinger10, author = {Martin Dietzfelbinger}, title = {Ingo Wegener: seine B{\"{u}}cher}, journal = {Inform. Spektrum}, volume = {33}, number = {5}, pages = {489--498}, year = {2010}, url = {https://doi.org/10.1007/s00287-010-0463-1}, doi = {10.1007/S00287-010-0463-1}, timestamp = {Thu, 13 Aug 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/insk/Dietzfelbinger10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/DietzfelbingerGMMPR10, author = {Martin Dietzfelbinger and Andreas Goerdt and Michael Mitzenmacher and Andrea Montanari and Rasmus Pagh and Michael Rink}, editor = {Samson Abramsky and Cyril Gavoille and Claude Kirchner and Friedhelm Meyer auf der Heide and Paul G. Spirakis}, title = {Tight Thresholds for Cuckoo Hashing via {XORSAT}}, booktitle = {Automata, Languages and Programming, 37th International Colloquium, {ICALP} 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part {I}}, series = {Lecture Notes in Computer Science}, volume = {6198}, pages = {213--225}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-14165-2\_19}, doi = {10.1007/978-3-642-14165-2\_19}, timestamp = {Tue, 14 May 2019 10:00:44 +0200}, biburl = {https://dblp.org/rec/conf/icalp/DietzfelbingerGMMPR10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/Dietzfelbinger09, author = {Martin Dietzfelbinger}, title = {In memoriam Prof. Dr. math. Ingo Wegener, 1950-2008}, journal = {Theor. Comput. Sci.}, volume = {410}, number = {44}, pages = {4446--4447}, year = {2009}, url = {https://doi.org/10.1016/j.tcs.2009.07.048}, doi = {10.1016/J.TCS.2009.07.048}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/Dietzfelbinger09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/esa/BelazzouguiBD09, author = {Djamal Belazzougui and Fabiano C. Botelho and Martin Dietzfelbinger}, editor = {Amos Fiat and Peter Sanders}, title = {Hash, Displace, and Compress}, booktitle = {Algorithms - {ESA} 2009, 17th Annual European Symposium, Copenhagen, Denmark, September 7-9, 2009. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {5757}, pages = {682--693}, publisher = {Springer}, year = {2009}, url = {https://doi.org/10.1007/978-3-642-04128-0\_61}, doi = {10.1007/978-3-642-04128-0\_61}, timestamp = {Tue, 14 May 2019 10:00:54 +0200}, biburl = {https://dblp.org/rec/conf/esa/BelazzouguiBD09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/esa/AumullerDR09, author = {Martin Aum{\"{u}}ller and Martin Dietzfelbinger and Michael Rink}, editor = {Amos Fiat and Peter Sanders}, title = {Experimental Variations of a Theoretically Good Retrieval Data Structure}, booktitle = {Algorithms - {ESA} 2009, 17th Annual European Symposium, Copenhagen, Denmark, September 7-9, 2009. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {5757}, pages = {742--751}, publisher = {Springer}, year = {2009}, url = {https://doi.org/10.1007/978-3-642-04128-0\_66}, doi = {10.1007/978-3-642-04128-0\_66}, timestamp = {Mon, 04 Dec 2017 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/esa/AumullerDR09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/DietzfelbingerR09, author = {Martin Dietzfelbinger and Michael Rink}, editor = {Susanne Albers and Alberto Marchetti{-}Spaccamela and Yossi Matias and Sotiris E. Nikoletseas and Wolfgang Thomas}, title = {Applications of a Splitting Trick}, booktitle = {Automata, Languages and Programming, 36th International Colloquium, {ICALP} 2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part {I}}, series = {Lecture Notes in Computer Science}, volume = {5555}, pages = {354--365}, publisher = {Springer}, year = {2009}, url = {https://doi.org/10.1007/978-3-642-02927-1\_30}, doi = {10.1007/978-3-642-02927-1\_30}, timestamp = {Tue, 14 May 2019 10:00:44 +0200}, biburl = {https://dblp.org/rec/conf/icalp/DietzfelbingerR09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/ki/DietzfelbingerE09, author = {Martin Dietzfelbinger and Stefan Edelkamp}, editor = {B{\"{a}}rbel Mertsching and Marcus Hund and Muhammad Zaheer Aziz}, title = {Perfect Hashing for State Spaces in {BDD} Representation}, booktitle = {{KI} 2009: Advances in Artificial Intelligence, 32nd Annual German Conference on AI, Paderborn, Germany, September 15-18, 2009. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {5803}, pages = {33--40}, publisher = {Springer}, year = {2009}, url = {https://doi.org/10.1007/978-3-642-04617-9\_5}, doi = {10.1007/978-3-642-04617-9\_5}, timestamp = {Tue, 14 May 2019 10:00:49 +0200}, biburl = {https://dblp.org/rec/conf/ki/DietzfelbingerE09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/podc/DietzfelbingerW09, author = {Martin Dietzfelbinger and Philipp Woelfel}, editor = {Srikanta Tirthapura and Lorenzo Alvisi}, title = {Brief announcement: tight lower bounds for greedy routing in uniform small world rings}, booktitle = {Proceedings of the 28th Annual {ACM} Symposium on Principles of Distributed Computing, {PODC} 2009, Calgary, Alberta, Canada, August 10-12, 2009}, pages = {300--301}, publisher = {{ACM}}, year = {2009}, url = {https://doi.org/10.1145/1582716.1582776}, doi = {10.1145/1582716.1582776}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/podc/DietzfelbingerW09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/DietzfelbingerS09, author = {Martin Dietzfelbinger and Ulf Schellbach}, editor = {Claire Mathieu}, title = {On risks of using cuckoo hashing with simple universal hash classes}, booktitle = {Proceedings of the Twentieth Annual {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2009, New York, NY, USA, January 4-6, 2009}, pages = {795--804}, publisher = {{SIAM}}, year = {2009}, url = {https://doi.org/10.1137/1.9781611973068.87}, doi = {10.1137/1.9781611973068.87}, timestamp = {Mon, 12 Jun 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/soda/DietzfelbingerS09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/sofsem/DietzfelbingerS09, author = {Martin Dietzfelbinger and Ulf Schellbach}, editor = {Mogens Nielsen and Anton{\'{\i}}n Kucera and Peter Bro Miltersen and Catuscia Palamidessi and Petr Tuma and Frank D. Valencia}, title = {Weaknesses of Cuckoo Hashing with a Simple Universal Hash Class: The Case of Large Universes}, booktitle = {{SOFSEM} 2009: Theory and Practice of Computer Science, 35th Conference on Current Trends in Theory and Practice of Computer Science, Spindleruv Ml{\'{y}}n, Czech Republic, January 24-30, 2009. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {5404}, pages = {217--228}, publisher = {Springer}, year = {2009}, url = {https://doi.org/10.1007/978-3-540-95891-8\_22}, doi = {10.1007/978-3-540-95891-8\_22}, timestamp = {Fri, 30 Aug 2019 10:02:27 +0200}, biburl = {https://dblp.org/rec/conf/sofsem/DietzfelbingerS09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/DietzfelbingerW09, author = {Martin Dietzfelbinger and Philipp Woelfel}, editor = {Michael Mitzenmacher}, title = {Tight lower bounds for greedy routing in uniform small world rings}, booktitle = {Proceedings of the 41st Annual {ACM} Symposium on Theory of Computing, {STOC} 2009, Bethesda, MD, USA, May 31 - June 2, 2009}, pages = {591--600}, publisher = {{ACM}}, year = {2009}, url = {https://doi.org/10.1145/1536414.1536494}, doi = {10.1145/1536414.1536494}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/DietzfelbingerW09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-0912-0287, author = {Martin Dietzfelbinger and Andreas Goerdt and Michael Mitzenmacher and Andrea Montanari and Rasmus Pagh and Michael Rink}, title = {Tight Thresholds for Cuckoo Hashing via {XORSAT}}, journal = {CoRR}, volume = {abs/0912.0287}, year = {2009}, url = {http://arxiv.org/abs/0912.0287}, eprinttype = {arXiv}, eprint = {0912.0287}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-0912-0287.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/csr/Dietzfelbinger08, author = {Martin Dietzfelbinger}, title = {Sanjoy Dasgupta, Christos Papadimitriou and Umesh Vazirani, Algorithms, McGraw Hill, Boston {(2007)} {ISBN} 978-007352340-8, Jon Kleinberg and {\'{E}}va Tardos, Algorithm Design, Pearson/Addison Wesley, Boston {(2006)} {ISBN} 978-032129535-4}, journal = {Comput. Sci. Rev.}, volume = {2}, number = {2}, pages = {131--136}, year = {2008}, url = {https://doi.org/10.1016/j.cosrev.2008.03.001}, doi = {10.1016/J.COSREV.2008.03.001}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/csr/Dietzfelbinger08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jea/DietzfelbingerHW08, author = {Martin Dietzfelbinger and Martin H{\"{u}}hne and Christoph Weidling}, title = {A dictionary implementation based on dynamic perfect hashing}, journal = {{ACM} J. Exp. Algorithmics}, volume = {12}, pages = {1.11:1--1.11:25}, year = {2008}, url = {https://doi.org/10.1145/1227161.1370602}, doi = {10.1145/1227161.1370602}, timestamp = {Thu, 25 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jea/DietzfelbingerHW08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/gecco/DietzfelbingerRWW08, author = {Martin Dietzfelbinger and Jonathan E. Rowe and Ingo Wegener and Philipp Woelfel}, editor = {Conor Ryan and Maarten Keijzer}, title = {Precision, local search and unimodal functions}, booktitle = {Genetic and Evolutionary Computation Conference, {GECCO} 2008, Proceedings, Atlanta, GA, USA, July 12-16, 2008}, pages = {771--778}, publisher = {{ACM}}, year = {2008}, url = {https://doi.org/10.1145/1389095.1389249}, doi = {10.1145/1389095.1389249}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/gecco/DietzfelbingerRWW08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/DietzfelbingerP08, author = {Martin Dietzfelbinger and Rasmus Pagh}, editor = {Luca Aceto and Ivan Damg{\aa}rd and Leslie Ann Goldberg and Magn{\'{u}}s M. Halld{\'{o}}rsson and Anna Ing{\'{o}}lfsd{\'{o}}ttir and Igor Walukiewicz}, title = {Succinct Data Structures for Retrieval and Approximate Membership (Extended Abstract)}, booktitle = {Automata, Languages and Programming, 35th International Colloquium, {ICALP} 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part {I:} Tack {A:} Algorithms, Automata, Complexity, and Games}, series = {Lecture Notes in Computer Science}, volume = {5125}, pages = {385--396}, publisher = {Springer}, year = {2008}, url = {https://doi.org/10.1007/978-3-540-70575-8\_32}, doi = {10.1007/978-3-540-70575-8\_32}, timestamp = {Fri, 27 Mar 2020 09:02:59 +0100}, biburl = {https://dblp.org/rec/conf/icalp/DietzfelbingerP08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/DietzfelbingerRWW08, author = {Martin Dietzfelbinger and Jonathan E. Rowe and Ingo Wegener and Philipp Woelfel}, editor = {Susanne Albers and Pascal Weil}, title = {Tight Bounds for Blind Search on the Integers}, booktitle = {{STACS} 2008, 25th Annual Symposium on Theoretical Aspects of Computer Science, Bordeaux, France, February 21-23, 2008, Proceedings}, series = {LIPIcs}, volume = {1}, pages = {241--252}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik, Germany}, year = {2008}, url = {https://doi.org/10.4230/LIPIcs.STACS.2008.1348}, doi = {10.4230/LIPICS.STACS.2008.1348}, timestamp = {Tue, 22 Jun 2021 15:44:08 +0200}, biburl = {https://dblp.org/rec/conf/stacs/DietzfelbingerRWW08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@incollection{DBLP:reference/algo/Dietzfelbinger08, author = {Martin Dietzfelbinger}, editor = {Berthold V{\"{o}}cking and Helmut Alt and Martin Dietzfelbinger and R{\"{u}}diger Reischuk and Christian Scheideler and Heribert Vollmer and Dorothea Wagner}, title = {Fingerprinting}, booktitle = {Taschenbuch der Algorithmen}, series = {eXamen.press}, pages = {193--204}, publisher = {Springer}, year = {2008}, url = {https://doi.org/10.1007/978-3-540-76394-9\_19}, doi = {10.1007/978-3-540-76394-9\_19}, timestamp = {Tue, 16 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/reference/algo/Dietzfelbinger08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@book{DBLP:reference/algo/2008t, editor = {Berthold V{\"{o}}cking and Helmut Alt and Martin Dietzfelbinger and R{\"{u}}diger Reischuk and Christian Scheideler and Heribert Vollmer and Dorothea Wagner}, title = {Taschenbuch der Algorithmen}, series = {eXamen.press}, publisher = {Springer}, year = {2008}, isbn = {978-3-540-76393-2}, timestamp = {Fri, 25 Nov 2011 00:00:00 +0100}, biburl = {https://dblp.org/rec/reference/algo/2008t.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-0802-2852, author = {Martin Dietzfelbinger and Jonathan E. Rowe and Ingo Wegener and Philipp Woelfel}, title = {Tight Bounds for Blind Search on the Integers}, journal = {CoRR}, volume = {abs/0802.2852}, year = {2008}, url = {http://arxiv.org/abs/0802.2852}, eprinttype = {arXiv}, eprint = {0802.2852}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-0802-2852.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-0803-3693, author = {Martin Dietzfelbinger and Rasmus Pagh}, title = {Succinct Data Structures for Retrieval and Approximate Membership}, journal = {CoRR}, volume = {abs/0803.3693}, year = {2008}, url = {http://arxiv.org/abs/0803.3693}, eprinttype = {arXiv}, eprint = {0803.3693}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-0803-3693.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/DietzfelbingerW07, author = {Martin Dietzfelbinger and Henning Wunderlich}, title = {A characterization of average case communication complexity}, journal = {Inf. Process. Lett.}, volume = {101}, number = {6}, pages = {245--249}, year = {2007}, url = {https://doi.org/10.1016/j.ipl.2006.10.006}, doi = {10.1016/J.IPL.2006.10.006}, timestamp = {Wed, 14 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/DietzfelbingerW07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/DietzfelbingerW07, author = {Martin Dietzfelbinger and Christoph Weidling}, title = {Balanced allocation and dictionaries with tightly packed constant size bins}, journal = {Theor. Comput. Sci.}, volume = {380}, number = {1-2}, pages = {47--68}, year = {2007}, url = {https://doi.org/10.1016/j.tcs.2007.02.054}, doi = {10.1016/J.TCS.2007.02.054}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/DietzfelbingerW07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/saga/Dietzfelbinger07, author = {Martin Dietzfelbinger}, editor = {Juraj Hromkovic and Richard Kr{\'{a}}lovic and Marc Nunkesser and Peter Widmayer}, title = {Design Strategies for Minimal Perfect Hash Functions}, booktitle = {Stochastic Algorithms: Foundations and Applications, 4th International Symposium, {SAGA} 2007, Zurich, Switzerland, September 13-14, 2007, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {4665}, pages = {2--17}, publisher = {Springer}, year = {2007}, url = {https://doi.org/10.1007/978-3-540-74871-7\_2}, doi = {10.1007/978-3-540-74871-7\_2}, timestamp = {Tue, 14 May 2019 10:00:40 +0200}, biburl = {https://dblp.org/rec/conf/saga/Dietzfelbinger07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@proceedings{DBLP:conf/dagstuhl/2007P7391, editor = {Martin Dietzfelbinger and Shang{-}Hua Teng and Eli Upfal and Berthold V{\"{o}}cking}, title = {Probabilistic Methods in the Design and Analysis of Algorithms, 23.09. - 28.09.2007}, series = {Dagstuhl Seminar Proceedings}, volume = {07391}, publisher = {Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany}, year = {2007}, url = {http://drops.dagstuhl.de/portals/07391/}, timestamp = {Thu, 10 Jun 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/dagstuhl/2007P7391.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/dagstuhl/DietzfelbingerTUV07, author = {Martin Dietzfelbinger and Shang{-}Hua Teng and Eli Upfal and Berthold V{\"{o}}cking}, editor = {Martin Dietzfelbinger and Shang{-}Hua Teng and Eli Upfal and Berthold V{\"{o}}cking}, title = {07391 Abstracts Collection - Probabilistic Methods in the Design and Analysis of Algorithms}, booktitle = {Probabilistic Methods in the Design and Analysis of Algorithms, 23.09. - 28.09.2007}, series = {Dagstuhl Seminar Proceedings}, volume = {07391}, publisher = {Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany}, year = {2007}, url = {http://drops.dagstuhl.de/opus/volltexte/2007/1291}, timestamp = {Thu, 10 Jun 2021 13:02:08 +0200}, biburl = {https://dblp.org/rec/conf/dagstuhl/DietzfelbingerTUV07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/rsa/DietzfelbingerT05, author = {Martin Dietzfelbinger and Hisao Tamaki}, title = {On the probability of rendezvous in graphs}, journal = {Random Struct. Algorithms}, volume = {26}, number = {3}, pages = {266--288}, year = {2005}, url = {https://doi.org/10.1002/rsa.20032}, doi = {10.1002/RSA.20032}, timestamp = {Thu, 15 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/rsa/DietzfelbingerT05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/DietzfelbingerW05, author = {Martin Dietzfelbinger and Christoph Weidling}, editor = {Lu{\'{\i}}s Caires and Giuseppe F. Italiano and Lu{\'{\i}}s Monteiro and Catuscia Palamidessi and Moti Yung}, title = {Balanced Allocation and Dictionaries with Tightly Packed Constant Size Bins}, booktitle = {Automata, Languages and Programming, 32nd International Colloquium, {ICALP} 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3580}, pages = {166--178}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11523468\_14}, doi = {10.1007/11523468\_14}, timestamp = {Tue, 14 May 2019 10:00:44 +0200}, biburl = {https://dblp.org/rec/conf/icalp/DietzfelbingerW05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@book{DBLP:books/sp/Dietzfelbinger04, author = {Martin Dietzfelbinger}, title = {Primality Testing in Polynomial Time, From Randomized Algorithms to "PRIMES Is in P"}, series = {Lecture Notes in Computer Science}, volume = {3000}, publisher = {Springer}, year = {2004}, url = {https://doi.org/10.1007/b12334}, doi = {10.1007/B12334}, isbn = {3-540-40344-2}, timestamp = {Tue, 14 May 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/books/sp/Dietzfelbinger04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/Dietzfelbinger04, author = {Martin Dietzfelbinger}, title = {Gossiping and broadcasting versus computing functions in networks}, journal = {Discret. Appl. Math.}, volume = {137}, number = {2}, pages = {127--153}, year = {2004}, url = {https://doi.org/10.1016/S0166-218X(03)00257-9}, doi = {10.1016/S0166-218X(03)00257-9}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/Dietzfelbinger04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eatcs/DietzfelbingerK03, author = {Martin Dietzfelbinger and Manfred Kunde}, title = {A case against using Stirling's formula (unless you really need it)}, journal = {Bull. {EATCS}}, volume = {80}, pages = {153--158}, year = {2003}, timestamp = {Thu, 18 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eatcs/DietzfelbingerK03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tec/DietzfelbingerNHW03, author = {Martin Dietzfelbinger and Bart Naudts and Clarissa Van Hoyweghen and Ingo Wegener}, title = {The analysis of a recombinative hill-climber on {H-IFF}}, journal = {{IEEE} Trans. Evol. Comput.}, volume = {7}, number = {5}, pages = {417--423}, year = {2003}, url = {https://doi.org/10.1109/TEVC.2003.818192}, doi = {10.1109/TEVC.2003.818192}, timestamp = {Tue, 12 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tec/DietzfelbingerNHW03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/DietzfelbingerW03, author = {Martin Dietzfelbinger and Philipp Woelfel}, editor = {Lawrence L. Larmore and Michel X. Goemans}, title = {Almost random graphs with simple hash functions}, booktitle = {Proceedings of the 35th Annual {ACM} Symposium on Theory of Computing, June 9-11, 2003, San Diego, CA, {USA}}, pages = {629--638}, publisher = {{ACM}}, year = {2003}, url = {https://doi.org/10.1145/780542.780634}, doi = {10.1145/780542.780634}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/DietzfelbingerW03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/Dietzfelbinger02, author = {Martin Dietzfelbinger}, editor = {Prosenjit Bose and Pat Morin}, title = {The Probability of a Rendezvous is Minimal in Complete Graphs}, booktitle = {Algorithms and Computation, 13th International Symposium, {ISAAC} 2002 Vancouver, BC, Canada, November 21-23, 2002, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {2518}, pages = {55--66}, publisher = {Springer}, year = {2002}, url = {https://doi.org/10.1007/3-540-36136-7\_6}, doi = {10.1007/3-540-36136-7\_6}, timestamp = {Tue, 14 May 2019 10:00:50 +0200}, biburl = {https://dblp.org/rec/conf/isaac/Dietzfelbinger02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/fuin/DietzfelbingerGL01, author = {Martin Dietzfelbinger and Anna Gambin and Slawomir Lasota}, title = {On Different Models for Packet Flow in Multistage Interconnection Networks}, journal = {Fundam. Informaticae}, volume = {46}, number = {4}, pages = {287--314}, year = {2001}, url = {http://content.iospress.com/articles/fundamenta-informaticae/fi46-4-02}, timestamp = {Fri, 18 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/fuin/DietzfelbingerGL01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/esa/DietzfelbingerH01, author = {Martin Dietzfelbinger and Torben Hagerup}, editor = {Friedhelm Meyer auf der Heide}, title = {Simple Minimal Perfect Hashing in Less Space}, booktitle = {Algorithms - {ESA} 2001, 9th Annual European Symposium, Aarhus, Denmark, August 28-31, 2001, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {2161}, pages = {109--120}, publisher = {Springer}, year = {2001}, url = {https://doi.org/10.1007/3-540-44676-1\_9}, doi = {10.1007/3-540-44676-1\_9}, timestamp = {Tue, 14 May 2019 10:00:54 +0200}, biburl = {https://dblp.org/rec/conf/esa/DietzfelbingerH01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cc/DietzfelbingerH99, author = {Martin Dietzfelbinger and Martin H{\"{u}}hne}, title = {Matching upper and lower bounds for simulations of several linear tapes on one multidimensional tape}, journal = {Comput. Complex.}, volume = {8}, number = {4}, pages = {371--392}, year = {1999}, url = {https://doi.org/10.1007/s000370050006}, doi = {10.1007/S000370050006}, timestamp = {Sun, 15 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cc/DietzfelbingerH99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jacm/AlonDMPT99, author = {Noga Alon and Martin Dietzfelbinger and Peter Bro Miltersen and Erez Petrank and G{\'{a}}bor Tardos}, title = {Linear Hash Functions}, journal = {J. {ACM}}, volume = {46}, number = {5}, pages = {667--683}, year = {1999}, url = {https://doi.org/10.1145/324133.324179}, doi = {10.1145/324133.324179}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jacm/AlonDMPT99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jal/DietzfelbingerHKP97, author = {Martin Dietzfelbinger and Torben Hagerup and Jyrki Katajainen and Martti Penttonen}, title = {A Reliable Randomized Algorithm for the Closest-Pair Problem}, journal = {J. Algorithms}, volume = {25}, number = {1}, pages = {19--51}, year = {1997}, url = {https://doi.org/10.1006/jagm.1997.0873}, doi = {10.1006/JAGM.1997.0873}, timestamp = {Thu, 15 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jal/DietzfelbingerHKP97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/Dietzfelbinger97, author = {Martin Dietzfelbinger}, editor = {R{\"{u}}diger Reischuk and Michel Morvan}, title = {Gossiping and Broadcasting versus Computing Functions in Networks}, booktitle = {{STACS} 97, 14th Annual Symposium on Theoretical Aspects of Computer Science, L{\"{u}}beck, Germany, February 27 - March 1, 1997, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1200}, pages = {189--200}, publisher = {Springer}, year = {1997}, url = {https://doi.org/10.1007/BFb0023459}, doi = {10.1007/BFB0023459}, timestamp = {Tue, 14 May 2019 10:00:48 +0200}, biburl = {https://dblp.org/rec/conf/stacs/Dietzfelbinger97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/Dietzfelbinger97, author = {Martin Dietzfelbinger}, editor = {Frank Thomson Leighton and Peter W. Shor}, title = {The Linear-Array Problem in Communication Complexity Resolved}, booktitle = {Proceedings of the Twenty-Ninth Annual {ACM} Symposium on the Theory of Computing, El Paso, Texas, USA, May 4-6, 1997}, pages = {373--382}, publisher = {{ACM}}, year = {1997}, url = {https://doi.org/10.1145/258533.258622}, doi = {10.1145/258533.258622}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/Dietzfelbinger97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/AlonDMPT97, author = {Noga Alon and Martin Dietzfelbinger and Peter Bro Miltersen and Erez Petrank and G{\'{a}}bor Tardos}, editor = {Frank Thomson Leighton and Peter W. Shor}, title = {Is Linear Hashing Good?}, booktitle = {Proceedings of the Twenty-Ninth Annual {ACM} Symposium on the Theory of Computing, El Paso, Texas, USA, May 4-6, 1997}, pages = {465--474}, publisher = {{ACM}}, year = {1997}, url = {https://doi.org/10.1145/258533.258639}, doi = {10.1145/258533.258639}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/AlonDMPT97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/DietzfelbingerKR96, author = {Martin Dietzfelbinger and Miroslaw Kutylowski and R{\"{u}}diger Reischuk}, title = {Feasible Time-Optimal Algorithms for Boolean Functions on Exclusive-Write Parallel Random-Access Machines}, journal = {{SIAM} J. Comput.}, volume = {25}, number = {6}, pages = {1196--123}, year = {1996}, url = {https://doi.org/10.1137/S0097539791224285}, doi = {10.1137/S0097539791224285}, timestamp = {Wed, 14 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/DietzfelbingerKR96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/DietzfelbingerHS96, author = {Martin Dietzfelbinger and Juraj Hromkovic and Georg Schnitger}, title = {A Comparison of Two Lower-Bound Methods for Communication Complexity}, journal = {Theor. Comput. Sci.}, volume = {168}, number = {1}, pages = {39--51}, year = {1996}, url = {https://doi.org/10.1016/S0304-3975(96)00062-X}, doi = {10.1016/S0304-3975(96)00062-X}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/DietzfelbingerHS96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/Dietzfelbinger96, author = {Martin Dietzfelbinger}, editor = {Claude Puech and R{\"{u}}diger Reischuk}, title = {Universal Hashing and k-Wise Independent Random Variables via Integer Arithmetic without Primes}, booktitle = {{STACS} 96, 13th Annual Symposium on Theoretical Aspects of Computer Science, Grenoble, France, February 22-24, 1996, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1046}, pages = {569--580}, publisher = {Springer}, year = {1996}, url = {https://doi.org/10.1007/3-540-60922-9\_46}, doi = {10.1007/3-540-60922-9\_46}, timestamp = {Tue, 14 May 2019 10:00:48 +0200}, biburl = {https://dblp.org/rec/conf/stacs/Dietzfelbinger96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/ECCC-TR96-052, author = {Martin Dietzfelbinger}, title = {Gossiping and Broadcasting versus Computing Functions in Networks}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR96-052}}, year = {1996}, url = {https://eccc.weizmann.ac.il/eccc-reports/1996/TR96-052/index.html}, eprinttype = {ECCC}, eprint = {TR96-052}, timestamp = {Wed, 28 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR96-052.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/ECCC-TR96-063, author = {Martin Dietzfelbinger}, title = {The Linear-Array Problem in Communication Complexity Resolved}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR96-063}}, year = {1996}, url = {https://eccc.weizmann.ac.il/eccc-reports/1996/TR96-063/index.html}, eprinttype = {ECCC}, eprint = {TR96-063}, timestamp = {Wed, 28 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR96-063.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/ECCC-TR95-004, author = {Martin Dietzfelbinger and Miroslaw Kutylowski and R{\"{u}}diger Reischuk}, title = {Feasible Time-Optimal Algorithms for Boolean Functions on Exclusive-Write PRAMs}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR95-004}}, year = {1995}, url = {https://eccc.weizmann.ac.il/eccc-reports/1995/TR95-004/index.html}, eprinttype = {ECCC}, eprint = {TR95-004}, timestamp = {Wed, 28 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR95-004.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jcss/DietzfelbingerKR94, author = {Martin Dietzfelbinger and Miroslaw Kutylowski and R{\"{u}}diger Reischuk}, title = {Exact Lower Time Bounds for Computing Boolean Functions on {CREW} PRAMs}, journal = {J. Comput. Syst. Sci.}, volume = {48}, number = {2}, pages = {231--254}, year = {1994}, url = {https://doi.org/10.1016/S0022-0000(05)80003-0}, doi = {10.1016/S0022-0000(05)80003-0}, timestamp = {Tue, 16 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jcss/DietzfelbingerKR94.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/DietzfelbingerKMHRT94, author = {Martin Dietzfelbinger and Anna R. Karlin and Kurt Mehlhorn and Friedhelm Meyer auf der Heide and Hans Rohnert and Robert Endre Tarjan}, title = {Dynamic Perfect Hashing: Upper and Lower Bounds}, journal = {{SIAM} J. Comput.}, volume = {23}, number = {4}, pages = {738--761}, year = {1994}, url = {https://doi.org/10.1137/S0097539791194094}, doi = {10.1137/S0097539791194094}, timestamp = {Wed, 14 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/siamcomp/DietzfelbingerKMHRT94.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/fsttcs/DietzfelbingerH94, author = {Martin Dietzfelbinger and Martin H{\"{u}}hne}, editor = {P. S. Thiagarajan}, title = {Matching Upper and Lower Bounds for Simulation of Several Tapes on One Multidimensional Tape}, booktitle = {Foundations of Software Technology and Theoretical Computer Science, 14th Conference, Madras, India, December 15-17, 1994, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {880}, pages = {24--35}, publisher = {Springer}, year = {1994}, url = {https://doi.org/10.1007/3-540-58715-2\_111}, doi = {10.1007/3-540-58715-2\_111}, timestamp = {Tue, 14 May 2019 10:00:51 +0200}, biburl = {https://dblp.org/rec/conf/fsttcs/DietzfelbingerH94.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/mfcs/DietzfelbingerHS94, author = {Martin Dietzfelbinger and Juraj Hromkovic and Georg Schnitger}, editor = {Igor Pr{\'{\i}}vara and Branislav Rovan and Peter Ruzicka}, title = {A Comparison of Two Lower Bound Methods for Communication Complexity}, booktitle = {Mathematical Foundations of Computer Science 1994, 19th International Symposium, MFCS'94, Kosice, Slovakia, August 22 - 26, 1994, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {841}, pages = {326--335}, publisher = {Springer}, year = {1994}, url = {https://doi.org/10.1007/3-540-58338-6\_79}, doi = {10.1007/3-540-58338-6\_79}, timestamp = {Tue, 14 May 2019 10:00:37 +0200}, biburl = {https://dblp.org/rec/conf/mfcs/DietzfelbingerHS94.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iandc/DietzfelbingerH93, author = {Martin Dietzfelbinger and Friedhelm Meyer auf der Heide}, title = {An Optimal Parallel Dictionary}, journal = {Inf. Comput.}, volume = {102}, number = {2}, pages = {196--217}, year = {1993}, url = {https://doi.org/10.1006/inco.1993.1007}, doi = {10.1006/INCO.1993.1007}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/iandc/DietzfelbingerH93.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/DietzfelbingerM93, author = {Martin Dietzfelbinger and Wolfgang Maass}, title = {The Complexity of Matrix Transposition on One-Tape Off-Line Turing Machines with Output Tape}, journal = {Theor. Comput. Sci.}, volume = {108}, number = {2}, pages = {271--290}, year = {1993}, url = {https://doi.org/10.1016/0304-3975(93)90194-X}, doi = {10.1016/0304-3975(93)90194-X}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/DietzfelbingerM93.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/fct/Dietzfelbinger93, author = {Martin Dietzfelbinger}, editor = {Zolt{\'{a}}n {\'{E}}sik}, title = {Simulations Between Different Models of Parallel Computers}, booktitle = {Fundamentals of Computation Theory, 9th International Symposium, {FCT} '93, Szeged, Hungary, August 23-27, 1993, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {710}, pages = {16--30}, publisher = {Springer}, year = {1993}, url = {https://doi.org/10.1007/3-540-57163-9\_2}, doi = {10.1007/3-540-57163-9\_2}, timestamp = {Tue, 14 May 2019 10:00:53 +0200}, biburl = {https://dblp.org/rec/conf/fct/Dietzfelbinger93.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/spaa/DietzfelbingerH93, author = {Martin Dietzfelbinger and Friedhelm Meyer auf der Heide}, editor = {Lawrence Snyder}, title = {Simple, Efficient Shared Memory Simulations}, booktitle = {Proceedings of the 5th Annual {ACM} Symposium on Parallel Algorithms and Architectures, {SPAA} '93, Velen, Germany, June 30 - July 2, 1993}, pages = {110--119}, publisher = {{ACM}}, year = {1993}, url = {https://doi.org/10.1145/165231.165246}, doi = {10.1145/165231.165246}, timestamp = {Wed, 21 Nov 2018 12:27:44 +0100}, biburl = {https://dblp.org/rec/conf/spaa/DietzfelbingerH93.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/dfg/DietzfelbingerH92, author = {Martin Dietzfelbinger and Friedhelm Meyer auf der Heide}, editor = {Burkhard Monien and Thomas Ottmann}, title = {High Performance Universal Hashing, with Applications to Shared Memory Simulations}, booktitle = {Data Structures and Efficient Algorithms, Final Report on the {DFG} Special Joint Initiative}, series = {Lecture Notes in Computer Science}, volume = {594}, pages = {250--269}, publisher = {Springer}, year = {1992}, url = {https://doi.org/10.1007/3-540-55488-2\_31}, doi = {10.1007/3-540-55488-2\_31}, timestamp = {Fri, 17 Jul 2020 16:12:47 +0200}, biburl = {https://dblp.org/rec/conf/dfg/DietzfelbingerH92.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/DietzfelbingerGMP92, author = {Martin Dietzfelbinger and Joseph Gil and Yossi Matias and Nicholas Pippenger}, editor = {Werner Kuich}, title = {Polynomial Hash Functions Are Reliable (Extended Abstract)}, booktitle = {Automata, Languages and Programming, 19th International Colloquium, ICALP92, Vienna, Austria, July 13-17, 1992, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {623}, pages = {235--246}, publisher = {Springer}, year = {1992}, url = {https://doi.org/10.1007/3-540-55719-9\_77}, doi = {10.1007/3-540-55719-9\_77}, timestamp = {Tue, 14 May 2019 10:00:44 +0200}, biburl = {https://dblp.org/rec/conf/icalp/DietzfelbingerGMP92.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/mfcs/BastDH92, author = {Hannah Bast and Martin Dietzfelbinger and Torben Hagerup}, editor = {Ivan M. Havel and V{\'{a}}clav Koubek}, title = {A Perfect Parallel Dictionary}, booktitle = {Mathematical Foundations of Computer Science 1992, 17th International Symposium, MFCS'92, Prague, Czechoslovakia, August 24-28, 1992, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {629}, pages = {133--141}, publisher = {Springer}, year = {1992}, url = {https://doi.org/10.1007/3-540-55808-X\_11}, doi = {10.1007/3-540-55808-X\_11}, timestamp = {Mon, 14 Dec 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/mfcs/BastDH92.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@incollection{DBLP:books/sp/92/DietzfelbingerH92, author = {Martin Dietzfelbinger and Friedhelm Meyer auf der Heide}, editor = {Johannes Buchmann and Harald Ganzinger and Wolfgang J. Paul}, title = {Dynamic Hashing in Real Time}, booktitle = {Informatik, Festschrift zum 60. Geburtstag von G{\"{u}}nter Hotz}, series = {Teubner-Texte zur Informatik}, volume = {1}, pages = {95--119}, publisher = {Teubner / Springer}, year = {1992}, url = {https://doi.org/10.1007/978-3-322-95233-2\_7}, doi = {10.1007/978-3-322-95233-2\_7}, timestamp = {Tue, 16 Jul 2019 08:16:16 +0200}, biburl = {https://dblp.org/rec/books/sp/92/DietzfelbingerH92.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/DietzfelbingerMS91, author = {Martin Dietzfelbinger and Wolfgang Maass and Georg Schnitger}, title = {The Complexity of Matrix Transposition on One-Tape Off-Line Turing Machines}, journal = {Theor. Comput. Sci.}, volume = {82}, number = {1}, pages = {113--129}, year = {1991}, url = {https://doi.org/10.1016/0304-3975(91)90175-2}, doi = {10.1016/0304-3975(91)90175-2}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/DietzfelbingerMS91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/spdp/DietzfelbingerMS91, author = {Martin Dietzfelbinger and Seshu Madhavapeddy and Ivan Hal Sudborough}, title = {Three disjoint path paradigms in star networks}, booktitle = {Proceedings of the Third {IEEE} Symposium on Parallel and Distributed Processing, {SPDP} 1991, 2-5 December 1991, Dallas, Texas, {USA}}, pages = {400--406}, publisher = {{IEEE} Computer Society}, year = {1991}, url = {https://doi.org/10.1109/SPDP.1991.218213}, doi = {10.1109/SPDP.1991.218213}, timestamp = {Fri, 24 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/spdp/DietzfelbingerMS91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/DietzfelbingerH90, author = {Martin Dietzfelbinger and Friedhelm Meyer auf der Heide}, editor = {Mike Paterson}, title = {A New Universal Class of Hash Functions and Dynamic Hashing in Real Time}, booktitle = {Automata, Languages and Programming, 17th International Colloquium, ICALP90, Warwick University, England, UK, July 16-20, 1990, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {443}, pages = {6--19}, publisher = {Springer}, year = {1990}, url = {https://doi.org/10.1007/BFb0032018}, doi = {10.1007/BFB0032018}, timestamp = {Tue, 14 May 2019 10:00:44 +0200}, biburl = {https://dblp.org/rec/conf/icalp/DietzfelbingerH90.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/spaa/DietzfelbingerKR90, author = {Martin Dietzfelbinger and Miroslaw Kutylowski and R{\"{u}}diger Reischuk}, editor = {Frank Thomson Leighton}, title = {Exact Time Bounds for Computing Boolean Functions on PRAMs Without Simultaneous Writes}, booktitle = {Proceedings of the 2nd Annual {ACM} Symposium on Parallel Algorithms and Architectures, {SPAA} '90, Island of Crete, Greece, July 2-6, 1990}, pages = {125--135}, publisher = {{ACM}}, year = {1990}, url = {https://doi.org/10.1145/97444.97678}, doi = {10.1145/97444.97678}, timestamp = {Wed, 21 Nov 2018 12:27:44 +0100}, biburl = {https://dblp.org/rec/conf/spaa/DietzfelbingerKR90.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/DietzfelbingerH90, author = {Martin Dietzfelbinger and Friedhelm Meyer auf der Heide}, editor = {Harriet Ortiz}, title = {How to Distribute a Dictionary in a Complete Network}, booktitle = {Proceedings of the 22nd Annual {ACM} Symposium on Theory of Computing, May 13-17, 1990, Baltimore, Maryland, {USA}}, pages = {117--127}, publisher = {{ACM}}, year = {1990}, url = {https://doi.org/10.1145/100216.100229}, doi = {10.1145/100216.100229}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/DietzfelbingerH90.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/Dietzfelbinger89, author = {Martin Dietzfelbinger}, title = {The Speed of Copying on One-Tape Off-Line Turing Machines}, journal = {Inf. Process. Lett.}, volume = {33}, number = {2}, pages = {83--89}, year = {1989}, url = {https://doi.org/10.1016/0020-0190(89)90160-9}, doi = {10.1016/0020-0190(89)90160-9}, timestamp = {Wed, 14 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/Dietzfelbinger89.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/Dietzfelbinger89, author = {Martin Dietzfelbinger}, title = {Lower Bounds for Sorting of Sums}, journal = {Theor. Comput. Sci.}, volume = {66}, number = {2}, pages = {137--155}, year = {1989}, url = {https://doi.org/10.1016/0304-3975(89)90132-1}, doi = {10.1016/0304-3975(89)90132-1}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/Dietzfelbinger89.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/spaa/DietzfelbingerH89, author = {Martin Dietzfelbinger and Friedhelm Meyer auf der Heide}, editor = {Frank Thomson Leighton}, title = {An Optimal Parallel Dictionary}, booktitle = {Proceedings of the {ACM} Symposium on Parallel Algorithms and Architectures, {SPAA} '89, Santa Fe, New Mexico, USA, June 18-21, 1989}, pages = {360--368}, publisher = {{ACM}}, year = {1989}, url = {https://doi.org/10.1145/72935.72974}, doi = {10.1145/72935.72974}, timestamp = {Wed, 21 Nov 2018 12:27:44 +0100}, biburl = {https://dblp.org/rec/conf/spaa/DietzfelbingerH89.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jcss/DietzfelbingerM88, author = {Martin Dietzfelbinger and Wolfgang Maass}, title = {Lower Bound Arguments with "Inaccessible" Numbers}, journal = {J. Comput. Syst. Sci.}, volume = {36}, number = {3}, pages = {313--335}, year = {1988}, url = {https://doi.org/10.1016/0022-0000(88)90032-3}, doi = {10.1016/0022-0000(88)90032-3}, timestamp = {Tue, 16 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jcss/DietzfelbingerM88.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/focs/DietzfelbingerKMHRT88, author = {Martin Dietzfelbinger and Anna R. Karlin and Kurt Mehlhorn and Friedhelm Meyer auf der Heide and Hans Rohnert and Robert Endre Tarjan}, title = {Dynamic Perfect Hashing: Upper and Lower Bounds}, booktitle = {29th Annual Symposium on Foundations of Computer Science, White Plains, New York, USA, 24-26 October 1988}, pages = {524--531}, publisher = {{IEEE} Computer Society}, year = {1988}, url = {https://doi.org/10.1109/SFCS.1988.21968}, doi = {10.1109/SFCS.1988.21968}, timestamp = {Thu, 23 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/focs/DietzfelbingerKMHRT88.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/DietzfelbingerM88, author = {Martin Dietzfelbinger and Wolfgang Maass}, editor = {Timo Lepist{\"{o}} and Arto Salomaa}, title = {The Complexity of Matrix Transposition on One-Tape Off-Line Turing Machines with Output Tape}, booktitle = {Automata, Languages and Programming, 15th International Colloquium, ICALP88, Tampere, Finland, July 11-15, 1988, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {317}, pages = {188--200}, publisher = {Springer}, year = {1988}, url = {https://doi.org/10.1007/3-540-19488-6\_116}, doi = {10.1007/3-540-19488-6\_116}, timestamp = {Tue, 14 May 2019 10:00:44 +0200}, biburl = {https://dblp.org/rec/conf/icalp/DietzfelbingerM88.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/swat/DietzfelbingerMHR88, author = {Martin Dietzfelbinger and Kurt Mehlhorn and Friedhelm Meyer auf der Heide and Hans Rohnert}, editor = {Rolf G. Karlsson and Andrzej Lingas}, title = {Upper and Lower Bounds for the Dictionary Problem (Abstract)}, booktitle = {{SWAT} 88, 1st Scandinavian Workshop on Algorithm Theory, Halmstad, Sweden, July 5-8, 1988, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {318}, pages = {214--215}, publisher = {Springer}, year = {1988}, url = {https://doi.org/10.1007/3-540-19487-8\_24}, doi = {10.1007/3-540-19487-8\_24}, timestamp = {Tue, 14 May 2019 10:00:39 +0200}, biburl = {https://dblp.org/rec/conf/swat/DietzfelbingerMHR88.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@phdthesis{DBLP:phd/dnb/Dietzfelbinger87, author = {Martin Dietzfelbinger}, title = {Lower bounds on computation time for various models in computational complexity theory}, school = {University of Illinois at Chicago, IL, {USA}}, year = {1987}, url = {https://d-nb.info/890451338}, timestamp = {Sat, 17 Jul 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/phd/dnb/Dietzfelbinger87.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/Dietzfelbinger87, author = {Martin Dietzfelbinger}, editor = {Thomas Ottmann}, title = {Lower Bounds for Sorting of Sums}, booktitle = {Automata, Languages and Programming, 14th International Colloquium, ICALP87, Karlsruhe, Germany, July 13-17, 1987, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {267}, pages = {457--466}, publisher = {Springer}, year = {1987}, url = {https://doi.org/10.1007/3-540-18088-5\_39}, doi = {10.1007/3-540-18088-5\_39}, timestamp = {Tue, 14 May 2019 10:00:44 +0200}, biburl = {https://dblp.org/rec/conf/icalp/Dietzfelbinger87.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/coco/DietzfelbingerM86, author = {Martin Dietzfelbinger and Wolfgang Maass}, editor = {Alan L. Selman}, title = {two Lower Bound Arguments with "Inaccessible" Numbers}, booktitle = {Structure in Complexity Theory, Proceedings of the Conference hold at the University of California, Berkeley, California, USA, June 2-5, 1986}, series = {Lecture Notes in Computer Science}, volume = {223}, pages = {163--183}, publisher = {Springer}, year = {1986}, url = {https://doi.org/10.1007/3-540-16486-3\_96}, doi = {10.1007/3-540-16486-3\_96}, timestamp = {Thu, 02 Feb 2023 13:27:01 +0100}, biburl = {https://dblp.org/rec/conf/coco/DietzfelbingerM86.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.