Dr. Daniel Allendorf

Photo

Publications

1
Lukas Geis, Daniel Allendorf, Thomas Bläsius, Alexander Leonhardt, Ulrich Meyer, Manuel Penschuck, and Hung Tran. Efficient Uniform Negative Edge Weights. In Philip Bille, Seth Pettie, and Sabine Storandt, editors, 34th Annual European Symposium on Algorithms (ESA 2026), volume 388 of Leibniz International Proceedings in Informatics (LIPIcs), 18:1–18:19. Dagstuhl, Germany, 2026. Schloss Dagstuhl – Leibniz-Zentrum für Informatik. View Online doi:10.4230/LIPIcs.ESA.2026.18 @inproceedings{geis_et_al:LIPIcs.ESA.2026.18, author = {Geis, Lukas and Allendorf, Daniel and Bl\"{a}sius, Thomas and Leonhardt, Alexander and Meyer, Ulrich and Penschuck, Manuel and Tran, Hung}, editor = "Bille, Philip and Pettie, Seth and Storandt, Sabine", title = "{Efficient Uniform Negative Edge Weights}", booktitle = "34th Annual European Symposium on Algorithms (ESA 2026)", pages = "18:1--18:19", series = "Leibniz International Proceedings in Informatics (LIPIcs)", ISBN = "978-3-95977-445-1", ISSN = "1868-8969", year = "2026", volume = "388", publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = "Dagstuhl, Germany", URL = "https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2026.18", URN = "urn:nbn:de:0030-drops-271542", doi = "10.4230/LIPIcs.ESA.2026.18", annote = "Keywords: Random Graphs, Shortest Path, Random Edge Weights, Negative Cycles" }
2
Daniel Allendorf. Maintaining discrete probability distributions in practice. In 2024 Proceedings of the Symposium on Algorithm Engineering and Experiments (ALENEX), 182–193. SIAM, 2024. View Online doi:10.1137/1.9781611977929.14 @inproceedings{allendorf2024maintaining, author = "Allendorf, Daniel", title = "Maintaining Discrete Probability Distributions in Practice", booktitle = "2024 Proceedings of the Symposium on Algorithm Engineering and Experiments (ALENEX)", pages = "182--193", year = "2024", organization = "SIAM", doi = "10.1137/1.9781611977929.14", url = "https://doi.org/10.1137/1.9781611977929.14" }
3
Daniel Allendorf. Uniform generation of graphs and non-linear preferential attachment. PhD thesis, Goethe University Frankfurt, Germany, 2024. doi:10.21248/gups.87551 @phdthesis{allendorf2024, author = "Allendorf, Daniel", title = "Uniform generation of graphs and non-linear preferential attachment", type = "doctoralthesis", pages = "194", school = "Goethe University Frankfurt, Germany", doi = "10.21248/gups.87551", year = "2024" }
4
Daniel Allendorf, Ulrich Meyer, Manuel Penschuck, and Hung Tran. Parallel and I/O-efficient algorithms for non-linear preferential attachment. In Gonzalo Navarro and Julian Shun, editors, Proceedings of the Symposium on Algorithm Engineering and Experiments, ALENEX 2023, Florence, Italy, January 22-23, 2023, 65–76. SIAM, 2023. View Online doi:10.1137/1.9781611977561.ch6 @inproceedings{DBLP:conf/alenex/Allendorf0PT23, author = "Allendorf, Daniel and Meyer, Ulrich and Penschuck, Manuel and Tran, Hung", editor = "Navarro, Gonzalo and Shun, Julian", title = "Parallel and {I/O}-Efficient Algorithms for Non-Linear Preferential Attachment", doi = "10.1137/1.9781611977561.ch6", url = "https://doi.org/10.1137/1.9781611977561.ch6", booktitle = "Proceedings of the Symposium on Algorithm Engineering and Experiments, {ALENEX} 2023, Florence, Italy, January 22-23, 2023", pages = "65--76", publisher = "{SIAM}", year = "2023" }
5
Daniel Allendorf, Ulrich Meyer, Manuel Penschuck, and Hung Tran. Parallel global edge switching for the uniform sampling of simple graphs with prescribed degrees. J. Parallel Distributed Comput., 174:118–129, 2023. View Online doi:10.1016/j.jpdc.2022.12.010 @article{DBLP:journals/jpdc/AllendorfMPT23, author = "Allendorf, Daniel and Meyer, Ulrich and Penschuck, Manuel and Tran, Hung", title = "Parallel global edge switching for the uniform sampling of simple graphs with prescribed degrees", doi = "10.1016/j.jpdc.2022.12.010", url = "https://doi.org/10.1016/j.jpdc.2022.12.010", journal = "J. Parallel Distributed Comput.", volume = "174", pages = "118--129", year = "2023" }
6
Daniel Allendorf. Uniform generation of temporal graphs with given degrees. In International Conference on Complex Networks and Their Applications, 408–420. Springer, 2023. View Online doi:10.1007/978-3-031-53499-7_33 @inproceedings{allendorf2023uniform, author = "Allendorf, Daniel", title = "Uniform Generation of Temporal Graphs with Given Degrees", booktitle = "International Conference on Complex Networks and Their Applications", pages = "408--420", year = "2023", organization = "Springer", doi = "10.1007/978-3-031-53499-7\_33", url = "https://doi.org/10.1007/978-3-031-53499-7\_33" }
7
Daniel Allendorf, Ulrich Meyer, Manuel Penschuck, Hung Tran, and Nick Wormald. Engineering uniform sampling of graphs with a prescribed power-law degree sequence. In 2022 Proceedings of the Symposium on Algorithm Engineering and Experiments (ALENEX), 27–40. SIAM, 2022. View Online doi:10.1137/1.9781611977042.3 @inproceedings{allendorf2022engineering, author = "Allendorf, Daniel and Meyer, Ulrich and Penschuck, Manuel and Tran, Hung and Wormald, Nick", title = "Engineering Uniform Sampling of Graphs with a Prescribed Power-law Degree Sequence", booktitle = "2022 Proceedings of the Symposium on Algorithm Engineering and Experiments (ALENEX)", pages = "27--40", year = "2022", organization = "SIAM", url = "https://doi.org/10.1137/1.9781611977042.3", doi = "10.1137/1.9781611977042.3" }
8
Daniel Allendorf, Ulrich Meyer, Manuel Penschuck, and Hung Tran. Parallel global edge switching for the uniform sampling of simple graphs with prescribed degrees. In 2022 IEEE International Parallel and Distributed Processing Symposium (IPDPS), volume, 269–279. Los Alamitos, CA, USA, jun 2022. IEEE Computer Society. View Online doi:10.1109/IPDPS53621.2022.00034 @inproceedings{allendorf2022parallel, author = "Allendorf, Daniel and Meyer, Ulrich and Penschuck, Manuel and Tran, Hung", booktitle = "2022 IEEE International Parallel and Distributed Processing Symposium (IPDPS)", title = "Parallel Global Edge Switching for the Uniform Sampling of Simple Graphs with Prescribed Degrees", year = "2022", volume = "", issn = "", pages = "269-279", keywords = "distributed processing;runtime;scalability;switches;markov processes;data structures;generators", doi = "10.1109/IPDPS53621.2022.00034", url = "https://doi.ieeecomputersociety.org/10.1109/IPDPS53621.2022.00034", publisher = "IEEE Computer Society", address = "Los Alamitos, CA, USA", month = "jun" }