<?xml version="1.0"?>
<dblpperson name="Peter Sanders 0001" pid="s/PeterSanders" n="469">
<person key="homepages/s/PeterSanders" mdate="2025-10-08">
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<url>https://ae.iti.kit.edu/english/sanders.php</url>
<url>https://scholar.google.com/citations?user=0xWltyAAAAAJ</url>
<url>https://dl.acm.org/profile/81100534206</url>
<url>https://zbmath.org/authors/?q=ai:sanders.peter</url>
<url>https://mathgenealogy.org/id.php?id=185579</url>
<url>https://en.wikipedia.org/wiki/Peter_Sanders_(computer_scientist)</url>
<url>https://orcid.org/0000-0003-3330-9349</url>
<url>https://www.wikidata.org/entity/Q2078004</url>
<url>http://isni.org/isni/0000000114765088</url>
<url>https://viaf.org/viaf/85371202</url>
<url>https://id.loc.gov/authorities/names/n2003003044</url>
<url>https://d-nb.info/gnd/136120113</url>
<url>https://www.wikidata.org/entity/Q130806391</url>
<note type="affiliation">Karlsruhe Institute of Technology, Department of Informatics</note>
<note type="affiliation">Max Planck Institute for Informatics</note>
<note label="2012" type="award">Gottfried Wilhelm Leibniz Prize</note>
<cite>tr/ka/50</cite>
</person>
<homonyms n="3">
<h f="s/Sanders:Peter"><name>Peter Sanders</name>
</h>
<h f="s/Sanders_0002:Peter"><person key="homepages/74/6190-2" mdate="2017-01-06">
<author pid="74/6190-2">Peter Sanders 0002</author>
<note type="affiliation">Maxeler Technologies</note>
</person>
</h>
<h f="s/Sanders_0003:Peter"><person key="homepages/268/8947" mdate="2020-07-17">
<author pid="268/8947">Peter Sanders 0003</author>
<note type="affiliation">One2many, Deventer, CL, The Netherlands</note>
<url>https://orcid.org/0000-0002-6344-5221</url>
</person>
</h>
</homonyms>
<r><article key="journals/jacm/DietzfelbingerDHSW26" mdate="2026-03-31">
<author orcid="0000-0001-5484-3474" pid="d/MartinDietzfelbinger">Martin Dietzfelbinger</author>
<author orcid="0009-0000-2662-2607" pid="37/2340">Peter C. Dillinger</author>
<author orcid="0000-0002-4315-3264" pid="151/1543">Lorenz H&#252;bschle-Schneider</author>
<author orcid="0000-0003-3330-9349" pid="s/PeterSanders">Peter Sanders 0001</author>
<author orcid="0000-0002-6477-0106" pid="139/7331">Stefan Walzer</author>
<title>Ribbon: Fast Succinct Static Retrieval and Approximate Membership.</title>
<year>2026</year>
<month>February</month>
<pages>7:1-7:45</pages>
<volume>73</volume>
<journal>J. ACM</journal>
<number>1</number>
<ee>https://doi.org/10.1145/3785417</ee>
<url>db/journals/jacm/jacm73.html#DietzfelbingerDHSW26</url>
<stream>streams/journals/jacm</stream>
</article>
</r>
<r><inproceedings key="conf/alenex/Beling026" mdate="2026-04-07">
<author orcid="0000-0003-3048-3704" pid="119/5115">Piotr Beling</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>PHast - Perfect Hashing made fast.</title>
<pages>1-14</pages>
<year>2026</year>
<booktitle>ALENEX</booktitle>
<ee>https://doi.org/10.1137/1.9781611978957.1</ee>
<crossref>conf/alenex/2026</crossref>
<url>db/conf/alenex/alenex2026.html#Beling026</url>
</inproceedings>
</r>
<r><inproceedings key="conf/alenex/00040W26" mdate="2026-03-04">
<author pid="65/6404-4">Stefan Koch 0004</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="296/3808">Marvin Williams</author>
<title>BlockFIFO &#38; MultiFIFO: Scalable Relaxed Queues.</title>
<pages>31-43</pages>
<year>2026</year>
<booktitle>ALENEX</booktitle>
<ee>https://doi.org/10.1137/1.9781611978957.3</ee>
<crossref>conf/alenex/2026</crossref>
<url>db/conf/alenex/alenex2026.html#00040W26</url>
</inproceedings>
</r>
<r><article key="journals/algorithmica/FunkeHSST25" mdate="2025-09-06">
<author pid="06/8509">Daniel Funke</author>
<author pid="205/2346">Demian Hespe</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="74/9877">Sabine Storandt</author>
<author orcid="0009-0009-7582-7209" pid="355/3125">Carina Truschel</author>
<title>Pareto Sums of Pareto Sets: Lower Bounds and Algorithms.</title>
<pages>1111-1144</pages>
<year>2025</year>
<month>August</month>
<volume>87</volume>
<journal>Algorithmica</journal>
<number>8</number>
<ee>https://doi.org/10.1007/s00453-025-01314-y</ee>
<url>db/journals/algorithmica/algorithmica87.html#FunkeHSST25</url>
<stream>streams/journals/algorithmica</stream>
</article>
</r>
<r><article key="journals/algorithmica/LehmannSW25" mdate="2025-10-04">
<author orcid="0000-0002-0474-1805" pid="295/9136">Hans-Peter Lehmann</author>
<author orcid="0000-0003-3330-9349" pid="s/PeterSanders">Peter Sanders 0001</author>
<author orcid="0000-0002-6477-0106" pid="139/7331">Stefan Walzer</author>
<title>ShockHash: Near Optimal-Space Minimal Perfect Hashing Beyond Brute-Force.</title>
<pages>1620-1668</pages>
<year>2025</year>
<month>November</month>
<volume>87</volume>
<journal>Algorithmica</journal>
<number>11</number>
<ee>https://doi.org/10.1007/s00453-025-01321-z</ee>
<url>db/journals/algorithmica/algorithmica87.html#LehmannSW25</url>
<stream>streams/journals/algorithmica</stream>
</article>
</r>
<r><article key="journals/pvldb/FarhanKWWLS25" mdate="2025-12-24">
<author pid="62/10825">Muhammad Farhan</author>
<author pid="13/2962">Henning Koehler</author>
<author pid="97/6505-2">Qing Wang 0002</author>
<author pid="135/8997">Jiawen Wang</author>
<author orcid="0009-0001-1193-3477" pid="347/1309">Moritz Laupichler</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>Customization Meets 2-Hop Labeling: Efficient Routing in Road Networks.</title>
<pages>3326-3338</pages>
<year>2025</year>
<month>June</month>
<volume>18</volume>
<journal>Proc. VLDB Endow.</journal>
<number>10</number>
<ee type="oa">https://www.vldb.org/pvldb/vol18/p3326-farhan.pdf</ee>
<ee>https://doi.org/10.14778/3748191.3748198</ee>
<url>db/journals/pvldb/pvldb18.html#FarhanKWWLS25</url>
<stream>streams/journals/pvldb</stream>
</article>
</r>
<r><inproceedings key="conf/alenex/AkramM0025" mdate="2025-12-07">
<author pid="329/5057">Matthew Akram</author>
<author orcid="0009-0002-6959-417X" pid="284/8160">Nikolai Maas</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author orcid="0000-0002-4185-1851" pid="178/3095-1">Dominik Schreiber 0001</author>
<title>Engineering Optimal Parallel Task Scheduling.</title>
<pages>168-180</pages>
<year>2025</year>
<booktitle>ALENEX</booktitle>
<ee>https://doi.org/10.1137/1.9781611978339.14</ee>
<crossref>conf/alenex/2025</crossref>
<url>db/conf/alenex/alenex2025.html#AkramM0025</url>
</inproceedings>
</r>
<r><inproceedings key="conf/bcb/Kumar0025" mdate="2026-03-31">
<author orcid="0000-0002-9722-5649" pid="85/4670">Ajay Kumar</author>
<author orcid="0000-0002-1859-0438" pid="69/9203">Praveen Rao 0001</author>
<author orcid="0000-0003-3330-9349" pid="s/PeterSanders">Peter Sanders 0001</author>
<title>Optimizing the Variant Calling Pipeline Execution on Human Genomes Using GPU-Enabled Machines.</title>
<pages>2:1-2:10</pages>
<year>2025</year>
<booktitle>BCB Companion</booktitle>
<ee>https://doi.org/10.1145/3768322.3769016</ee>
<crossref>conf/bcb/2025c</crossref>
<url>db/conf/bcb/bcb2025c.html#Kumar0025</url>
</inproceedings>
</r>
<r><inproceedings key="conf/esa/GottesburenMR0S25" mdate="2025-12-25">
<author pid="243/6884">Lars Gottesb&#252;ren</author>
<author orcid="0009-0002-6959-417X" pid="284/8160">Nikolai Maas</author>
<author orcid="0009-0008-1292-0353" pid="405/5825">Dominik Rosch</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="225/5422">Daniel Seemaier</author>
<title>Linear-Time Multilevel Graph Partitioning via Edge Sparsification.</title>
<pages>32:1-32:20</pages>
<year>2025</year>
<booktitle>ESA</booktitle>
<ee type="oa">https://doi.org/10.4230/LIPIcs.ESA.2025.32</ee>
<crossref>conf/esa/2025</crossref>
<url>db/conf/esa/esa2025.html#GottesburenMR0S25</url>
</inproceedings>
</r>
<r><inproceedings key="conf/esa/HaagK0S25" mdate="2025-10-02">
<author pid="395/3476">Manuel Haag</author>
<author pid="163/4161">Florian Kurpicz</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="256/9438">Matthias Schimek</author>
<title>Fast and Lightweight Distributed Suffix Array Construction.</title>
<pages>47:1-47:18</pages>
<year>2025</year>
<booktitle>ESA</booktitle>
<ee type="oa">https://doi.org/10.4230/LIPIcs.ESA.2025.47</ee>
<crossref>conf/esa/2025</crossref>
<url>db/conf/esa/esa2025.html#HaagK0S25</url>
</inproceedings>
</r>
<r><inproceedings key="conf/esa/HermannKL0W25" mdate="2025-11-15">
<author orcid="0000-0001-9183-2926" pid="05/1398">Stefan Hermann</author>
<author pid="405/7608">Sebastian Kirmayer</author>
<author pid="295/9136">Hans-Peter Lehmann</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author orcid="0000-0002-6477-0106" pid="139/7331">Stefan Walzer</author>
<title>Engineering Minimal k-Perfect Hash Functions.</title>
<pages>99:1-99:18</pages>
<year>2025</year>
<booktitle>ESA</booktitle>
<ee type="oa">https://doi.org/10.4230/LIPIcs.ESA.2025.99</ee>
<crossref>conf/esa/2025</crossref>
<url>db/conf/esa/esa2025.html#HermannKL0W25</url>
</inproceedings>
</r>
<r><inproceedings key="conf/esa/Lehmann0WZ25" mdate="2026-03-24">
<author orcid="0000-0002-0474-1805" pid="295/9136">Hans-Peter Lehmann</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author orcid="0000-0002-6477-0106" pid="139/7331">Stefan Walzer</author>
<author orcid="0009-0009-8507-1724" pid="399/6935">Jonatan Ziegler</author>
<title>Combined Search and Encoding for Seeds, with an Application to Minimal Perfect Hashing.</title>
<pages>109:1-109:18</pages>
<year>2025</year>
<booktitle>ESA</booktitle>
<ee type="oa">https://doi.org/10.4230/LIPIcs.ESA.2025.109</ee>
<crossref>conf/esa/2025</crossref>
<url>db/conf/esa/esa2025.html#Lehmann0WZ25</url>
</inproceedings>
</r>
<r><inproceedings key="conf/ifaamas/BlasiusFJL0Z25" mdate="2025-07-29">
<author pid="74/9125">Thomas Bl&#228;sius</author>
<author pid="340/4024">Adrian Feilhauer</author>
<author pid="05/3449">Markus Jung</author>
<author pid="347/1309">Moritz Laupichler</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="278/0964">Michael Z&#252;ndorf</author>
<title>Synergistic Traffic Assignment.</title>
<pages>352-360</pages>
<year>2025</year>
<booktitle>AAMAS</booktitle>
<ee>https://dl.acm.org/doi/10.5555/3709347.3743549</ee>
<crossref>conf/ifaamas/2025</crossref>
<url>db/conf/ifaamas/aamas2025.html#BlasiusFJL0Z25</url>
</inproceedings>
</r>
<r><inproceedings key="conf/ipps/SalwasserSG025" mdate="2025-07-28">
<author pid="391/5845">Daniel Salwasser</author>
<author pid="225/5422">Daniel Seemaier</author>
<author pid="243/6884">Lars Gottesb&#252;ren</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>Tera-Scale Multilevel Graph Partitioning.</title>
<pages>285-296</pages>
<year>2025</year>
<booktitle>IPDPS</booktitle>
<ee>https://doi.org/10.1109/IPDPS64566.2025.00033</ee>
<crossref>conf/ipps/2025</crossref>
<url>db/conf/ipps/ipdps2025.html#SalwasserSG025</url>
</inproceedings>
</r>
<r><data key="data/11/GottesburenMRSS25" mdate="2025-12-11">
<author orcid="0000-0003-1895-5828" pid="243/6884">Lars Gottesb&#252;ren</author>
<author orcid="0009-0002-6959-417X" pid="284/8160">Nikolai Maas</author>
<author orcid="0009-0008-1292-0353" pid="405/5825">Dominik Rosch</author>
<author orcid="0000-0003-3330-9349" pid="s/PeterSanders">Peter Sanders 0001</author>
<author orcid="0000-0002-1997-1304" pid="225/5422">Daniel Seemaier</author>
<title>KaMinPar.</title>
<year>2025</year>
<month>October</month>
<ee type="oa">https://doi.org/10.4230/artifacts.24666</ee>
<publisher>DROPS Artifacts</publisher>
<stream>streams/repo/drops</stream>
</data>
</r>
<r><data key="data/11/LehmannSWZ25" mdate="2025-12-11">
<author orcid="0000-0002-0474-1805" pid="295/9136">Hans-Peter Lehmann</author>
<author orcid="0000-0003-3330-9349" pid="s/PeterSanders">Peter Sanders 0001</author>
<author orcid="0000-0002-6477-0106" pid="139/7331">Stefan Walzer</author>
<author orcid="0009-0009-8507-1724" pid="399/6935">Jonatan Ziegler</author>
<title>ByteHamster/ConsensusRecSplit.</title>
<year>2025</year>
<month>October</month>
<ee type="oa">https://doi.org/10.4230/artifacts.23789</ee>
<publisher>DROPS Artifacts</publisher>
<stream>streams/repo/drops</stream>
</data>
</r>
<r><data publtype="version" key="data/12/KochSW25" mdate="2026-03-26">
<author orcid="0009-0004-8665-0449" pid="65/6404-4">Stefan Koch 0004</author>
<author orcid="0000-0003-3330-9349" pid="s/PeterSanders">Peter Sanders 0001</author>
<author orcid="0000-0002-1990-0899" pid="296/3808">Marvin Williams</author>
<title>BlockFIFO &#38; MultiFIFO: Scalable Relaxed Queues - Code Artifacts.</title>
<publisher>Zenodo</publisher>
<year>2025</year>
<month>September</month>
<ee type="oa">https://doi.org/10.5281/zenodo.17130400</ee>
<stream>streams/repo/zenodo</stream>
<rel sort="1" label="Version alenex-ae" uri="https://doi.org/10.5281/zenodo.17130399" type="versionOf">data/12/KochSW25b</rel>
</data>
</r>
<r><data publtype="version" key="data/12/KochSW25a" mdate="2026-03-26">
<author orcid="0009-0004-8665-0449" pid="65/6404-4">Stefan Koch 0004</author>
<author orcid="0000-0003-3330-9349" pid="s/PeterSanders">Peter Sanders 0001</author>
<author orcid="0000-0002-1990-0899" pid="296/3808">Marvin Williams</author>
<title>BlockFIFO &#38; MultiFIFO: Scalable Relaxed Queues - Code Artifacts.</title>
<publisher>Zenodo</publisher>
<year>2025</year>
<month>October</month>
<ee type="oa">https://doi.org/10.5281/zenodo.17293832</ee>
<stream>streams/repo/zenodo</stream>
<rel sort="3" label="Version alenex-final" uri="https://doi.org/10.5281/zenodo.17130399" type="versionOf">data/12/KochSW25b</rel>
</data>
</r>
<r><article publtype="informal" key="journals/corr/abs-2502-04343" mdate="2025-03-14">
<author pid="74/9125">Thomas Bl&#228;sius</author>
<author pid="340/4024">Adrian Feilhauer</author>
<author pid="05/3449">Markus Jung</author>
<author pid="347/1309">Moritz Laupichler</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="278/0964">Michael Z&#252;ndorf</author>
<title>Synergistic Traffic Assignment.</title>
<year>2025</year>
<month>February</month>
<volume>abs/2502.04343</volume>
<journal>CoRR</journal>
<ee type="oa">https://doi.org/10.48550/arXiv.2502.04343</ee>
<url>db/journals/corr/corr2502.html#abs-2502-04343</url>
<stream>streams/journals/corr</stream>
</article>
</r>
<r><article publtype="informal" key="journals/corr/abs-2502-05613" mdate="2025-03-12">
<author pid="295/9136">Hans-Peter Lehmann</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="139/7331">Stefan Walzer</author>
<author pid="399/6935">Jonatan Ziegler</author>
<title>Combined Search and Encoding for Seeds, with an Application to Minimal Perfect Hashing.</title>
<year>2025</year>
<month>February</month>
<volume>abs/2502.05613</volume>
<journal>CoRR</journal>
<ee type="oa">https://doi.org/10.48550/arXiv.2502.05613</ee>
<url>db/journals/corr/corr2502.html#abs-2502-05613</url>
<stream>streams/journals/corr</stream>
</article>
</r>
<r><article publtype="informal" key="journals/corr/abs-2504-11652" mdate="2025-05-21">
<author pid="296/3808">Marvin Williams</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>Engineering MultiQueues: Fast Relaxed Concurrent Priority Queues.</title>
<year>2025</year>
<month>April</month>
<volume>abs/2504.11652</volume>
<journal>CoRR</journal>
<ee type="oa">https://doi.org/10.48550/arXiv.2504.11652</ee>
<url>db/journals/corr/corr2504.html#abs-2504-11652</url>
<stream>streams/journals/corr</stream>
</article>
</r>
<r><article publtype="informal" key="journals/corr/abs-2504-17615" mdate="2025-05-23">
<author pid="243/6884">Lars Gottesb&#252;ren</author>
<author pid="284/8160">Nikolai Maas</author>
<author pid="405/5825">Dominik Rosch</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="225/5422">Daniel Seemaier</author>
<title>Linear-Time Multilevel Graph Partitioning via Edge Sparsification.</title>
<year>2025</year>
<month>April</month>
<volume>abs/2504.17615</volume>
<journal>CoRR</journal>
<ee type="oa">https://doi.org/10.48550/arXiv.2504.17615</ee>
<url>db/journals/corr/corr2504.html#abs-2504-17615</url>
<stream>streams/journals/corr</stream>
</article>
</r>
<r><article publtype="informal" key="journals/corr/abs-2504-17918" mdate="2025-05-23">
<author pid="119/5115">Piotr Beling</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>PHast - Perfect Hashing with fast evaluation.</title>
<year>2025</year>
<month>April</month>
<volume>abs/2504.17918</volume>
<journal>CoRR</journal>
<ee type="oa">https://doi.org/10.48550/arXiv.2504.17918</ee>
<url>db/journals/corr/corr2504.html#abs-2504-17918</url>
<stream>streams/journals/corr</stream>
</article>
</r>
<r><article publtype="informal" key="journals/corr/abs-2504-20001" mdate="2025-05-31">
<author orcid="0000-0001-9183-2926" pid="05/1398">Stefan Hermann</author>
<author pid="405/7608">Sebastian Kirmayer</author>
<author pid="295/9136">Hans-Peter Lehmann</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="139/7331">Stefan Walzer</author>
<title>Engineering Minimal k-Perfect Hash Functions.</title>
<year>2025</year>
<month>April</month>
<volume>abs/2504.20001</volume>
<journal>CoRR</journal>
<ee type="oa">https://doi.org/10.48550/arXiv.2504.20001</ee>
<url>db/journals/corr/corr2504.html#abs-2504-20001</url>
<stream>streams/journals/corr</stream>
</article>
</r>
<r><article publtype="informal" key="journals/corr/abs-2506-06536" mdate="2025-07-07">
<author pid="295/9136">Hans-Peter Lehmann</author>
<author pid="91/7068">Thomas Mueller</author>
<author pid="p/RasmusPagh">Rasmus Pagh</author>
<author pid="204/0111">Giulio Ermanno Pibiri</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="27/6106">Sebastiano Vigna</author>
<author pid="139/7331">Stefan Walzer</author>
<title>Modern Minimal Perfect Hashing: A Survey.</title>
<year>2025</year>
<month>June</month>
<volume>abs/2506.06536</volume>
<journal>CoRR</journal>
<ee type="oa">https://doi.org/10.48550/arXiv.2506.06536</ee>
<url>db/journals/corr/corr2506.html#abs-2506-06536</url>
<stream>streams/journals/corr</stream>
</article>
</r>
<r><article publtype="informal" key="journals/corr/abs-2507-22764" mdate="2026-02-20">
<author pid="65/6404-4">Stefan Koch 0004</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author orcid="0000-0002-1990-0899" pid="296/3808">Marvin Williams</author>
<title>BlockFIFO &#38; MultiFIFO: Scalable Relaxed Queues.</title>
<year>2025</year>
<month>July</month>
<volume>abs/2507.22764</volume>
<journal>CoRR</journal>
<ee type="oa">https://doi.org/10.48550/arXiv.2507.22764</ee>
<url>db/journals/corr/corr2507.html#abs-2507-22764</url>
<stream>streams/journals/corr</stream>
</article>
</r>
<r><article publtype="informal" key="journals/corr/abs-2509-09058" mdate="2025-10-20">
<author pid="85/4670">Ajay Kumar</author>
<author pid="69/9203">Praveen Rao 0001</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>Optimizing the Variant Calling Pipeline Execution on Human Genomes Using GPU-Enabled Machines.</title>
<year>2025</year>
<month>September</month>
<volume>abs/2509.09058</volume>
<journal>CoRR</journal>
<ee type="oa">https://doi.org/10.48550/arXiv.2509.09058</ee>
<url>db/journals/corr/corr2509.html#abs-2509-09058</url>
<stream>streams/journals/corr</stream>
</article>
</r>
<r><article publtype="informal" key="journals/corr/abs-2509-17819" mdate="2025-10-18">
<author pid="163/4161">Florian Kurpicz</author>
<author pid="413/4050">Niccol&#242; Rigi-Luperti</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>Theory Meets Practice for Bit Vectors Supporting Rank and Select.</title>
<year>2025</year>
<month>September</month>
<volume>abs/2509.17819</volume>
<journal>CoRR</journal>
<ee type="oa">https://doi.org/10.48550/arXiv.2509.17819</ee>
<url>db/journals/corr/corr2509.html#abs-2509-17819</url>
<stream>streams/journals/corr</stream>
</article>
</r>
<r><article key="journals/jair/SchreiberS24" mdate="2025-01-19">
<author orcid="0000-0002-4185-1851" pid="178/3095-1">Dominik Schreiber 0001</author>
<author orcid="0000-0003-3330-9349" pid="s/PeterSanders">Peter Sanders 0001</author>
<title>MallobSat: Scalable SAT Solving by Clause Sharing.</title>
<pages>1437-1495</pages>
<year>2024</year>
<volume>80</volume>
<journal>J. Artif. Intell. Res.</journal>
<ee type="oa">https://doi.org/10.1613/jair.1.15827</ee>
<ee>https://www.wikidata.org/entity/Q130972112</ee>
<url>db/journals/jair/jair80.html#SchreiberS24</url>
<stream>streams/journals/jair</stream>
</article>
</r>
<r><article key="journals/talg/GottesburenHMSS24" mdate="2024-02-29">
<author orcid="0000-0003-1895-5828" pid="243/6884">Lars Gottesb&#252;ren</author>
<author orcid="0000-0002-5399-0496" pid="172/1146">Tobias Heuer</author>
<author orcid="0009-0002-6959-417X" pid="284/8160">Nikolai Maas</author>
<author orcid="0000-0003-3330-9349" pid="s/PeterSanders">Peter Sanders 0001</author>
<author orcid="0000-0003-1550-882X" pid="139/4269">Sebastian Schlag</author>
<title>Scalable High-Quality Hypergraph Partitioning.</title>
<pages>9:1-9:54</pages>
<year>2024</year>
<month>January</month>
<volume>20</volume>
<journal>ACM Trans. Algorithms</journal>
<number>1</number>
<ee>https://doi.org/10.1145/3626527</ee>
<url>db/journals/talg/talg20.html#GottesburenHMSS24</url>
</article>
</r>
<r><inproceedings key="conf/alenex/Laupichler024" mdate="2025-10-14">
<author orcid="0009-0001-1193-3477" pid="347/1309">Moritz Laupichler</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>Fast Many-to-Many Routing for Dynamic Taxi Sharing with Meeting Points.</title>
<pages>74-90</pages>
<year>2024</year>
<booktitle>ALENEX</booktitle>
<ee>https://doi.org/10.1137/1.9781611977929.6</ee>
<crossref>conf/alenex/2024</crossref>
<url>db/conf/alenex/alenex2024.html#Laupichler024</url>
</inproceedings>
</r>
<r><inproceedings key="conf/alenex/Lehmann0W24" mdate="2024-10-06">
<author orcid="0000-0002-0474-1805" pid="295/9136">Hans-Peter Lehmann</author>
<author orcid="0000-0003-3330-9349" pid="s/PeterSanders">Peter Sanders 0001</author>
<author orcid="0000-0002-6477-0106" pid="139/7331">Stefan Walzer</author>
<title>ShockHash: Towards Optimal-Space Minimal Perfect Hashing Beyond Brute-Force.</title>
<pages>194-206</pages>
<year>2024</year>
<booktitle>ALENEX</booktitle>
<ee>https://doi.org/10.1137/1.9781611977929.15</ee>
<crossref>conf/alenex/2024</crossref>
<url>db/conf/alenex/alenex2024.html#Lehmann0W24</url>
</inproceedings>
</r>
<r><inproceedings key="conf/esa/HermannLP0W24" mdate="2025-11-15">
<author orcid="0000-0001-9183-2926" pid="05/1398">Stefan Hermann</author>
<author orcid="0000-0002-0474-1805" pid="295/9136">Hans-Peter Lehmann</author>
<author pid="204/0111">Giulio Ermanno Pibiri</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author orcid="0000-0002-6477-0106" pid="139/7331">Stefan Walzer</author>
<title>PHOBIC: Perfect Hashing With Optimized Bucket Sizes and Interleaved Coding.</title>
<pages>69:1-69:17</pages>
<year>2024</year>
<booktitle>ESA</booktitle>
<ee type="oa">https://doi.org/10.4230/LIPIcs.ESA.2024.69</ee>
<crossref>conf/esa/2024</crossref>
<url>db/conf/esa/esa2024.html#HermannLP0W24</url>
</inproceedings>
</r>
<r><inproceedings key="conf/esa/KurpiczM0S24" mdate="2025-03-03">
<author orcid="0000-0002-2379-9455" pid="163/4161">Florian Kurpicz</author>
<author pid="376/8711">Pascal Mehnert</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author orcid="0009-0002-6402-9016" pid="256/9438">Matthias Schimek</author>
<title>Scalable Distributed String Sorting.</title>
<pages>83:1-83:17</pages>
<year>2024</year>
<booktitle>ESA</booktitle>
<ee type="oa">https://doi.org/10.4230/LIPIcs.ESA.2024.83</ee>
<crossref>conf/esa/2024</crossref>
<url>db/conf/esa/esa2024.html#KurpiczM0S24</url>
</inproceedings>
</r>
<r><inproceedings key="conf/hopc/GottesburenM0S24" mdate="2025-01-19">
<author orcid="0000-0003-1895-5828" pid="243/6884">Lars Gottesb&#252;ren</author>
<author orcid="0009-0002-6959-417X" pid="284/8160">Nikolai Maas</author>
<author orcid="0000-0003-3330-9349" pid="s/PeterSanders">Peter Sanders 0001</author>
<author orcid="0000-0002-1997-1304" pid="225/5422">Daniel Seemaier</author>
<title>Modern Software Libraries for Graph Partitioning (Abstract).</title>
<year>2024</year>
<booktitle>HOPC@SPAA</booktitle>
<ee>https://doi.org/10.1145/3670684.3673417</ee>
<ee>https://www.wikidata.org/entity/Q130843085</ee>
<crossref>conf/hopc/2024</crossref>
<url>db/conf/hopc/hopc2024.html#GottesburenM0S24</url>
</inproceedings>
</r>
<r><inproceedings key="conf/hopc/Schreiber024" mdate="2025-01-19">
<author orcid="0000-0002-4185-1851" pid="178/3095-1">Dominik Schreiber 0001</author>
<author orcid="0000-0003-3330-9349" pid="s/PeterSanders">Peter Sanders 0001</author>
<title>Scalable SAT Solving on Demand (Abstract).</title>
<year>2024</year>
<booktitle>HOPC@SPAA</booktitle>
<ee>https://doi.org/10.1145/3670684.3673414</ee>
<ee>https://www.wikidata.org/entity/Q130976096</ee>
<crossref>conf/hopc/2024</crossref>
<url>db/conf/hopc/hopc2024.html#Schreiber024</url>
</inproceedings>
</r>
<r><inproceedings key="conf/sc/UhlSHHKSS024" mdate="2026-03-28">
<author orcid="0000-0001-9295-1388" pid="243/7018">Tim Niklas Uhl</author>
<author pid="256/9438">Matthias Schimek</author>
<author orcid="0000-0001-9213-7597" pid="246/0570">Lukas H&#252;bner</author>
<author pid="205/2346">Demian Hespe</author>
<author pid="163/4161">Florian Kurpicz</author>
<author pid="225/5422">Daniel Seemaier</author>
<author orcid="0009-0004-7980-1202" pid="375/1725">Christoph Stelz</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>KaMPIng: Flexible and (Near) Zero-Overhead C++ Bindings for MPI.</title>
<publnr>44</publnr>
<year>2024</year>
<booktitle>SC</booktitle>
<ee>https://doi.org/10.1109/SC41406.2024.00050</ee>
<ee>https://dl.acm.org/doi/10.1109/SC41406.2024.00050</ee>
<crossref>conf/sc/2024</crossref>
<url>db/conf/sc/sc2024.html#UhlSHHKSS024</url>
</inproceedings>
</r>
<r><inproceedings key="conf/spaa/HespeHK0SSU24" mdate="2025-01-19">
<author orcid="0000-0001-6232-2951" pid="205/2346">Demian Hespe</author>
<author orcid="0000-0001-9213-7597" pid="246/0570">Lukas H&#252;bner</author>
<author orcid="0000-0002-2379-9455" pid="163/4161">Florian Kurpicz</author>
<author orcid="0000-0003-3330-9349" pid="s/PeterSanders">Peter Sanders 0001</author>
<author orcid="0009-0002-6402-9016" pid="256/9438">Matthias Schimek</author>
<author orcid="0000-0002-1997-1304" pid="225/5422">Daniel Seemaier</author>
<author orcid="0000-0001-9295-1388" pid="243/7018">Tim Niklas Uhl</author>
<title>Brief Announcement: (Near) Zero-Overhead C++ Bindings for MPI.</title>
<pages>289-291</pages>
<year>2024</year>
<booktitle>SPAA</booktitle>
<ee>https://doi.org/10.1145/3626183.3660260</ee>
<ee>https://www.wikidata.org/entity/Q130961127</ee>
<crossref>conf/spaa/2024</crossref>
<url>db/conf/spaa/spaa2024.html#HespeHK0SSU24</url>
</inproceedings>
</r>
<r><inproceedings key="conf/spaa/KurpiczM0S24" mdate="2025-01-19">
<author orcid="0000-0002-2379-9455" pid="163/4161">Florian Kurpicz</author>
<author orcid="0009-0002-2370-7503" pid="376/8711">Pascal Mehnert</author>
<author orcid="0000-0003-3330-9349" pid="s/PeterSanders">Peter Sanders 0001</author>
<author orcid="0009-0002-6402-9016" pid="256/9438">Matthias Schimek</author>
<title>Brief Announcement: Scalable Distributed String Sorting.</title>
<pages>375-377</pages>
<year>2024</year>
<booktitle>SPAA</booktitle>
<ee>https://doi.org/10.1145/3626183.3660256</ee>
<ee>https://www.wikidata.org/entity/Q130806393</ee>
<crossref>conf/spaa/2024</crossref>
<url>db/conf/spaa/spaa2024.html#KurpiczM0S24</url>
</inproceedings>
</r>
<r><inproceedings key="conf/spaa/0001S24" mdate="2025-01-19">
<author orcid="0000-0003-3330-9349" pid="s/PeterSanders">Peter Sanders 0001</author>
<author orcid="0000-0002-1997-1304" pid="225/5422">Daniel Seemaier</author>
<title>Brief Announcement: Distributed Unconstrained Local Search for Multilevel Graph Partitioning.</title>
<pages>443-445</pages>
<year>2024</year>
<booktitle>SPAA</booktitle>
<ee>https://doi.org/10.1145/3626183.3660257</ee>
<ee>https://www.wikidata.org/entity/Q130808111</ee>
<crossref>conf/spaa/2024</crossref>
<url>db/conf/spaa/spaa2024.html#0001S24</url>
</inproceedings>
</r>
<r><inproceedings key="conf/tacas/BeckertSUWW24" mdate="2024-06-08">
<author orcid="0000-0002-9672-3291" pid="b/BBeckert">Bernhard Beckert</author>
<author orcid="0000-0003-3330-9349" pid="s/PeterSanders">Peter Sanders 0001</author>
<author orcid="0000-0002-2350-1831" pid="73/9580">Mattias Ulbrich</author>
<author pid="372/5592">Julian Wiesler</author>
<author orcid="0000-0002-7867-3200" pid="161/9821">Sascha Witt</author>
<title>Formally Verifying an Efficient Sorter.</title>
<pages>268-287</pages>
<year>2024</year>
<booktitle>TACAS (1)</booktitle>
<ee type="oa">https://doi.org/10.1007/978-3-031-57246-3_15</ee>
<crossref>conf/tacas/2024-1</crossref>
<url>db/conf/tacas/tacas2024-1.html#BeckertSUWW24</url>
</inproceedings>
</r>
<r><inproceedings key="conf/wea/LangedalH024" mdate="2024-10-06">
<author orcid="0009-0001-6838-4640" pid="324/0624">Kenneth Langedal</author>
<author pid="205/2346">Demian Hespe</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>Targeted Branching for the Maximum Independent Set Problem Using Graph Neural Networks.</title>
<pages>20:1-20:21</pages>
<year>2024</year>
<booktitle>SEA</booktitle>
<ee type="oa">https://doi.org/10.4230/LIPIcs.SEA.2024.20</ee>
<crossref>conf/wea/2024</crossref>
<url>db/conf/wea/sea2024.html#LangedalH024</url>
</inproceedings>
</r>
<r><article publtype="informal" key="journals/corr/abs-2404-05610" mdate="2025-03-03">
<author pid="205/2346">Demian Hespe</author>
<author orcid="0000-0001-9213-7597" pid="246/0570">Lukas H&#252;bner</author>
<author pid="163/4161">Florian Kurpicz</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="256/9438">Matthias Schimek</author>
<author pid="225/5422">Daniel Seemaier</author>
<author pid="375/1725">Christoph Stelz</author>
<author orcid="0000-0001-9295-1388" pid="243/7018">Tim Niklas Uhl</author>
<title>KaMPIng: Flexible and (Near) Zero-overhead C++ Bindings for MPI.</title>
<year>2024</year>
<volume>abs/2404.05610</volume>
<journal>CoRR</journal>
<ee type="oa">https://doi.org/10.48550/arXiv.2404.05610</ee>
<url>db/journals/corr/corr2404.html#abs-2404-05610</url>
</article>
</r>
<r><article publtype="informal" key="journals/corr/abs-2404-16517" mdate="2024-06-03">
<author pid="163/4161">Florian Kurpicz</author>
<author pid="376/8711">Pascal Mehnert</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="256/9438">Matthias Schimek</author>
<title>Scalable Distributed String Sorting.</title>
<year>2024</year>
<volume>abs/2404.16517</volume>
<journal>CoRR</journal>
<ee type="oa">https://doi.org/10.48550/arXiv.2404.16517</ee>
<url>db/journals/corr/corr2404.html#abs-2404-16517</url>
</article>
</r>
<r><article publtype="informal" key="journals/corr/abs-2404-18497" mdate="2024-05-27">
<author pid="05/1398">Stefan Hermann</author>
<author pid="295/9136">Hans-Peter Lehmann</author>
<author pid="204/0111">Giulio Ermanno Pibiri</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="139/7331">Stefan Walzer</author>
<title>PHOBIC: Perfect Hashing with Optimized Bucket Sizes and Interleaved Coding.</title>
<year>2024</year>
<volume>abs/2404.18497</volume>
<journal>CoRR</journal>
<ee type="oa">https://doi.org/10.48550/arXiv.2404.18497</ee>
<url>db/journals/corr/corr2404.html#abs-2404-18497</url>
</article>
</r>
<r><article publtype="informal" key="journals/corr/abs-2405-15371" mdate="2024-08-13">
<author pid="329/5057">Matthew Akram</author>
<author pid="284/8160">Nikolai Maas</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="178/3095-1">Dominik Schreiber 0001</author>
<title>Engineering Optimal Parallel Task Scheduling.</title>
<year>2024</year>
<volume>abs/2405.15371</volume>
<journal>CoRR</journal>
<ee type="oa">https://doi.org/10.48550/arXiv.2405.15371</ee>
<url>db/journals/corr/corr2405.html#abs-2405-15371</url>
</article>
</r>
<r><article publtype="informal" key="journals/corr/abs-2406-03169" mdate="2024-07-05">
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="225/5422">Daniel Seemaier</author>
<title>Brief Announcement: Distributed Unconstrained Local Search for Multilevel Graph Partitioning.</title>
<year>2024</year>
<volume>abs/2406.03169</volume>
<journal>CoRR</journal>
<ee type="oa">https://doi.org/10.48550/arXiv.2406.03169</ee>
<url>db/journals/corr/corr2406.html#abs-2406-03169</url>
</article>
</r>
<r><article publtype="informal" key="journals/corr/abs-2409-10232" mdate="2025-03-03">
<author pid="06/8509">Daniel Funke</author>
<author pid="205/2346">Demian Hespe</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="74/9877">Sabine Storandt</author>
<author orcid="0009-0009-7582-7209" pid="355/3125">Carina Truschel</author>
<title>Pareto Sums of Pareto Sets: Lower Bounds and Algorithms.</title>
<year>2024</year>
<volume>abs/2409.10232</volume>
<journal>CoRR</journal>
<ee type="oa">https://doi.org/10.48550/arXiv.2409.10232</ee>
<url>db/journals/corr/corr2409.html#abs-2409-10232</url>
<stream>streams/journals/corr</stream>
</article>
</r>
<r><article publtype="informal" key="journals/corr/abs-2410-19119" mdate="2024-11-28">
<author pid="391/5845">Daniel Salwasser</author>
<author pid="225/5422">Daniel Seemaier</author>
<author pid="243/6884">Lars Gottesb&#252;ren</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>Tera-Scale Multilevel Graph Partitioning.</title>
<year>2024</year>
<volume>abs/2410.19119</volume>
<journal>CoRR</journal>
<ee type="oa">https://doi.org/10.48550/arXiv.2410.19119</ee>
<url>db/journals/corr/corr2410.html#abs-2410-19119</url>
<stream>streams/journals/corr</stream>
</article>
</r>
<r><article publtype="informal" key="journals/corr/abs-2411-12365" mdate="2025-02-01">
<author pid="396/2603">Matthias Becht</author>
<author pid="295/9136">Hans-Peter Lehmann</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>Brief Announcement: Parallel Construction of Bumped Ribbon Retrieval.</title>
<year>2024</year>
<volume>abs/2411.12365</volume>
<journal>CoRR</journal>
<ee type="oa">https://doi.org/10.48550/arXiv.2411.12365</ee>
<url>db/journals/corr/corr2411.html#abs-2411-12365</url>
<stream>streams/journals/corr</stream>
</article>
</r>
<r><article publtype="informal" key="journals/corr/abs-2411-16255" mdate="2025-01-01">
<author pid="205/2346">Demian Hespe</author>
<author pid="246/0570">Lukas H&#252;bner</author>
<author pid="393/3265">Charel Mercatoris</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>Scalable Fault-Tolerant MapReduce.</title>
<year>2024</year>
<volume>abs/2411.16255</volume>
<journal>CoRR</journal>
<ee type="oa">https://doi.org/10.48550/arXiv.2411.16255</ee>
<url>db/journals/corr/corr2411.html#abs-2411-16255</url>
<stream>streams/journals/corr</stream>
</article>
</r>
<r><article publtype="informal" key="journals/corr/abs-2412-10160" mdate="2025-01-20">
<author pid="395/3476">Manuel Haag</author>
<author pid="163/4161">Florian Kurpicz</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="256/9438">Matthias Schimek</author>
<title>Fast and Lightweight Distributed Suffix Array Construction - First Results.</title>
<year>2024</year>
<volume>abs/2412.10160</volume>
<journal>CoRR</journal>
<ee type="oa">https://doi.org/10.48550/arXiv.2412.10160</ee>
<url>db/journals/corr/corr2412.html#abs-2412-10160</url>
<stream>streams/journals/corr</stream>
</article>
</r>
<r><article key="journals/comgeo/HeldNS23" mdate="2023-01-20">
<author pid="06/1785">Martin Held</author>
<author pid="41/4420">Martin N&#246;llenburg</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>Editorial.</title>
<pages>101950</pages>
<year>2023</year>
<volume>110</volume>
<journal>Comput. Geom.</journal>
<ee>https://doi.org/10.1016/j.comgeo.2022.101950</ee>
<url>db/journals/comgeo/comgeo110.html#HeldNS23</url>
</article>
</r>
<r><article key="journals/csur/CatalyurekDFGHMSSSSW23" mdate="2025-01-19">
<author orcid="0000-0002-5625-3758" pid="c/UmitVCatalyurek">&#220;mit V. &#199;ataly&#252;rek</author>
<author orcid="0000-0001-9335-4665" pid="d/KarenDDevine">Karen D. Devine</author>
<author orcid="0000-0001-7100-236X" pid="191/0315">Marcelo Fonseca Faraj</author>
<author orcid="0000-0003-1895-5828" pid="243/6884">Lars Gottesb&#252;ren</author>
<author orcid="0000-0002-5399-0496" pid="172/1146">Tobias Heuer</author>
<author orcid="0000-0002-7769-726X" pid="55/3065">Henning Meyerhenke</author>
<author orcid="0000-0003-3330-9349" pid="s/PeterSanders">Peter Sanders 0001</author>
<author orcid="0000-0003-1550-882X" pid="139/4269">Sebastian Schlag</author>
<author orcid="0000-0002-2823-3506" pid="10/1388-3">Christian Schulz 0003</author>
<author orcid="0000-0002-1997-1304" pid="225/5422">Daniel Seemaier</author>
<author orcid="0000-0002-9141-7076" pid="w/DorotheaWagner">Dorothea Wagner</author>
<title>More Recent Advances in (Hyper)Graph Partitioning.</title>
<pages>253:1-253:38</pages>
<year>2023</year>
<month>December</month>
<volume>55</volume>
<journal>ACM Comput. Surv.</journal>
<number>12</number>
<ee>https://doi.org/10.1145/3571808</ee>
<ee>https://www.wikidata.org/entity/Q130941176</ee>
<url>db/journals/csur/csur55.html#CatalyurekDFGHMSSSSW23</url>
</article>
</r>
<r><inproceedings key="conf/alenex/KurpiczL023" mdate="2024-10-06">
<author orcid="0000-0002-2379-9455" pid="163/4161">Florian Kurpicz</author>
<author orcid="0000-0002-0474-1805" pid="295/9136">Hans-Peter Lehmann</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>PaCHash: Packed and Compressed Hash Tables.</title>
<pages>162-175</pages>
<year>2023</year>
<booktitle>ALENEX</booktitle>
<ee>https://doi.org/10.1137/1.9781611977561.ch14</ee>
<crossref>conf/alenex/2023</crossref>
<url>db/conf/alenex/alenex2023.html#KurpiczL023</url>
</inproceedings>
</r>
<r><inproceedings key="conf/alenex/Lehmann0W23" mdate="2025-11-15">
<author orcid="0000-0002-0474-1805" pid="295/9136">Hans-Peter Lehmann</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author orcid="0000-0002-6477-0106" pid="139/7331">Stefan Walzer</author>
<title>SicHash - Small Irregular Cuckoo Tables for Perfect Hashing.</title>
<pages>176-189</pages>
<year>2023</year>
<booktitle>ALENEX</booktitle>
<ee>https://doi.org/10.1137/1.9781611977561.ch15</ee>
<crossref>conf/alenex/2023</crossref>
<url>db/conf/alenex/alenex2023.html#Lehmann0W23</url>
</inproceedings>
</r>
<r><inproceedings key="conf/esa/BezKL023" mdate="2024-10-06">
<author pid="336/4850">Dominik Bez</author>
<author orcid="0000-0002-2379-9455" pid="163/4161">Florian Kurpicz</author>
<author orcid="0000-0002-0474-1805" pid="295/9136">Hans-Peter Lehmann</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>High Performance Construction of RecSplit Based Minimal Perfect Hash Functions.</title>
<pages>19:1-19:16</pages>
<year>2023</year>
<booktitle>ESA</booktitle>
<ee type="oa">https://doi.org/10.4230/LIPIcs.ESA.2023.19</ee>
<crossref>conf/esa/2023</crossref>
<url>db/conf/esa/esa2023.html#BezKL023</url>
</inproceedings>
</r>
<r><inproceedings key="conf/esa/FerraginaL0V23" mdate="2024-10-06">
<author pid="f/PaoloFerragina">Paolo Ferragina</author>
<author orcid="0000-0002-0474-1805" pid="295/9136">Hans-Peter Lehmann</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="237/9641">Giorgio Vinciguerra</author>
<title>Learned Monotone Minimal Perfect Hashing.</title>
<pages>46:1-46:17</pages>
<year>2023</year>
<booktitle>ESA</booktitle>
<ee type="oa">https://doi.org/10.4230/LIPIcs.ESA.2023.46</ee>
<crossref>conf/esa/2023</crossref>
<url>db/conf/esa/esa2023.html#FerraginaL0V23</url>
</inproceedings>
</r>
<r><inproceedings key="conf/esa/FunkeH023" mdate="2023-08-30">
<author pid="06/8509">Daniel Funke</author>
<author pid="347/2570">Nicolai H&#252;ning</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>A Sweep-Plane Algorithm for Calculating the Isolation of Mountains.</title>
<pages>51:1-51:17</pages>
<year>2023</year>
<booktitle>ESA</booktitle>
<ee type="oa">https://doi.org/10.4230/LIPIcs.ESA.2023.51</ee>
<crossref>conf/esa/2023</crossref>
<url>db/conf/esa/esa2023.html#FunkeH023</url>
</inproceedings>
</r>
<r><inproceedings key="conf/esa/Hespe0ST23" mdate="2024-10-06">
<author pid="205/2346">Demian Hespe</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="74/9877">Sabine Storandt</author>
<author orcid="0009-0009-7582-7209" pid="355/3125">Carina Truschel</author>
<title>Pareto Sums of Pareto Sets.</title>
<pages>60:1-60:17</pages>
<year>2023</year>
<booktitle>ESA</booktitle>
<ee type="oa">https://doi.org/10.4230/LIPIcs.ESA.2023.60</ee>
<crossref>conf/esa/2023</crossref>
<url>db/conf/esa/esa2023.html#Hespe0ST23</url>
</inproceedings>
</r>
<r><inproceedings key="conf/europar/SandersS23" mdate="2023-09-12">
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="225/5422">Daniel Seemaier</author>
<title>Distributed Deep Multilevel Graph Partitioning.</title>
<pages>443-457</pages>
<year>2023</year>
<booktitle>Euro-Par</booktitle>
<ee type="oa">https://doi.org/10.1007/978-3-031-39698-4_30</ee>
<crossref>conf/europar/2023</crossref>
<url>db/conf/europar/europar2023.html#SandersS23</url>
</inproceedings>
</r>
<r><inproceedings key="conf/ipps/SandersS23" mdate="2024-08-04">
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author orcid="0009-0002-6402-9016" pid="256/9438">Matthias Schimek</author>
<title>Engineering Massively Parallel MST Algorithms.</title>
<pages>691-701</pages>
<year>2023</year>
<booktitle>IPDPS</booktitle>
<ee>https://doi.org/10.1109/IPDPS54959.2023.00075</ee>
<crossref>conf/ipps/2023</crossref>
<url>db/conf/ipps/ipdps2023.html#SandersS23</url>
</inproceedings>
</r>
<r><inproceedings key="conf/ipps/SandersU23" mdate="2023-11-12">
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author orcid="0000-0001-9295-1388" pid="243/7018">Tim Niklas Uhl</author>
<title>Engineering a Distributed-Memory Triangle Counting Algorithm.</title>
<pages>702-712</pages>
<year>2023</year>
<booktitle>IPDPS</booktitle>
<ee>https://doi.org/10.1109/IPDPS54959.2023.00076</ee>
<crossref>conf/ipps/2023</crossref>
<url>db/conf/ipps/ipdps2023.html#SandersU23</url>
</inproceedings>
</r>
<r><inproceedings key="conf/wea/Funke023" mdate="2023-07-20">
<author pid="06/8509">Daniel Funke</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>Efficient Yao Graph Construction.</title>
<pages>20:1-20:20</pages>
<year>2023</year>
<booktitle>SEA</booktitle>
<ee type="oa">https://doi.org/10.4230/LIPIcs.SEA.2023.20</ee>
<crossref>conf/wea/2023</crossref>
<url>db/conf/wea/sea2023.html#Funke023</url>
</inproceedings>
</r>
<r><data key="data/10/BeckertSUWW23" mdate="2024-06-18">
<author orcid="0000-0002-9672-3291" pid="b/BBeckert">Bernhard Beckert</author>
<author orcid="0000-0003-3330-9349" pid="s/PeterSanders">Peter Sanders 0001</author>
<author orcid="0000-0002-2350-1831" pid="73/9580">Mattias Ulbrich</author>
<author pid="372/5592">Julian Wiesler</author>
<author orcid="0000-0002-7867-3200" pid="161/9821">Sascha Witt</author>
<title>Formally Verifying an Efficient Sorter - Verification and Benchmarking Artifact.</title>
<year>2023</year>
<month>December</month>
<ee type="oa">https://doi.org/10.5281/zenodo.10445579</ee>
<publisher>Zenodo</publisher>
<rel sort="1" label="Version 2" uri="https://doi.org/10.5281/zenodo.8436535" type="versionOf"></rel>
<stream>streams/repo/zenodo</stream>
</data>
</r>
<r><article publtype="informal" key="journals/corr/abs-2302-11443" mdate="2023-03-21">
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author orcid="0000-0001-9295-1388" pid="243/7018">Tim Niklas Uhl</author>
<title>Engineering a Distributed-Memory Triangle Counting Algorithm.</title>
<year>2023</year>
<volume>abs/2302.11443</volume>
<journal>CoRR</journal>
<ee type="oa">https://doi.org/10.48550/arXiv.2302.11443</ee>
<url>db/journals/corr/corr2302.html#abs-2302-11443</url>
</article>
</r>
<r><article publtype="informal" key="journals/corr/abs-2302-12199" mdate="2023-02-28">
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="256/9438">Matthias Schimek</author>
<title>Engineering Massively Parallel MST Algorithms.</title>
<year>2023</year>
<volume>abs/2302.12199</volume>
<journal>CoRR</journal>
<ee type="oa">https://doi.org/10.48550/arXiv.2302.12199</ee>
<url>db/journals/corr/corr2302.html#abs-2302-12199</url>
</article>
</r>
<r><article publtype="informal" key="journals/corr/abs-2303-01417" mdate="2023-03-06">
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="225/5422">Daniel Seemaier</author>
<title>Distributed Deep Multilevel Graph Partitioning.</title>
<year>2023</year>
<volume>abs/2303.01417</volume>
<journal>CoRR</journal>
<ee type="oa">https://doi.org/10.48550/arXiv.2303.01417</ee>
<url>db/journals/corr/corr2303.html#abs-2303-01417</url>
</article>
</r>
<r><article publtype="informal" key="journals/corr/abs-2303-07858" mdate="2023-03-20">
<author pid="06/8509">Daniel Funke</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>Efficient Yao Graph Construction.</title>
<year>2023</year>
<volume>abs/2303.07858</volume>
<journal>CoRR</journal>
<ee type="oa">https://doi.org/10.48550/arXiv.2303.07858</ee>
<url>db/journals/corr/corr2303.html#abs-2303-07858</url>
</article>
</r>
<r><article publtype="informal" key="journals/corr/abs-2303-17679" mdate="2023-09-30">
<author pid="243/6884">Lars Gottesb&#252;ren</author>
<author pid="172/1146">Tobias Heuer</author>
<author orcid="0009-0002-6959-417X" pid="284/8160">Nikolai Maas</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="139/4269">Sebastian Schlag</author>
<title>Scalable High-Quality Hypergraph Partitioning.</title>
<year>2023</year>
<volume>abs/2303.17679</volume>
<journal>CoRR</journal>
<ee type="oa">https://doi.org/10.48550/arXiv.2303.17679</ee>
<url>db/journals/corr/corr2303.html#abs-2303-17679</url>
</article>
</r>
<r><article publtype="informal" key="journals/corr/abs-2304-09283" mdate="2023-04-24">
<author pid="295/9136">Hans-Peter Lehmann</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="139/7331">Stefan Walzer</author>
<title>Sliding Block Hashing (Slick) - Basic Algorithmic Ideas.</title>
<year>2023</year>
<volume>abs/2304.09283</volume>
<journal>CoRR</journal>
<ee type="oa">https://doi.org/10.48550/arXiv.2304.09283</ee>
<url>db/journals/corr/corr2304.html#abs-2304-09283</url>
</article>
</r>
<r><article publtype="informal" key="journals/corr/abs-2304-11012" mdate="2023-05-02">
<author pid="f/PaoloFerragina">Paolo Ferragina</author>
<author pid="295/9136">Hans-Peter Lehmann</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="237/9641">Giorgio Vinciguerra</author>
<title>Learned Monotone Minimal Perfect Hashing.</title>
<year>2023</year>
<volume>abs/2304.11012</volume>
<journal>CoRR</journal>
<ee type="oa">https://doi.org/10.48550/arXiv.2304.11012</ee>
<url>db/journals/corr/corr2304.html#abs-2304-11012</url>
</article>
</r>
<r><article publtype="informal" key="journals/corr/abs-2305-05417" mdate="2023-05-17">
<author pid="347/1309">Moritz Laupichler</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>Fast Many-to-Many Routing for Ridesharing with Multiple Pickup and Dropoff Locations.</title>
<year>2023</year>
<volume>abs/2305.05417</volume>
<journal>CoRR</journal>
<ee type="oa">https://doi.org/10.48550/arXiv.2305.05417</ee>
<url>db/journals/corr/corr2305.html#abs-2305-05417</url>
</article>
</r>
<r><article publtype="informal" key="journals/corr/abs-2305-08470" mdate="2023-05-17">
<author pid="06/8509">Daniel Funke</author>
<author pid="347/2570">Nicolai H&#252;ning</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>A Sweep-plane Algorithm for Calculating the Isolation of Mountains.</title>
<year>2023</year>
<volume>abs/2305.08470</volume>
<journal>CoRR</journal>
<ee type="oa">https://doi.org/10.48550/arXiv.2305.08470</ee>
<url>db/journals/corr/corr2305.html#abs-2305-08470</url>
</article>
</r>
<r><article publtype="informal" key="journals/corr/abs-2308-09561" mdate="2023-08-25">
<author pid="295/9136">Hans-Peter Lehmann</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="139/7331">Stefan Walzer</author>
<title>ShockHash: Towards Optimal-Space Minimal Perfect Hashing Beyond Brute-Force.</title>
<year>2023</year>
<volume>abs/2308.09561</volume>
<journal>CoRR</journal>
<ee type="oa">https://doi.org/10.48550/arXiv.2308.09561</ee>
<url>db/journals/corr/corr2308.html#abs-2308-09561</url>
</article>
</r>
<r><article publtype="informal" key="journals/corr/abs-2310-14959" mdate="2023-10-30">
<author pid="295/9136">Hans-Peter Lehmann</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="139/7331">Stefan Walzer</author>
<title>Bipartite ShockHash: Pruning ShockHash Search for Efficient Perfect Hashing.</title>
<year>2023</year>
<volume>abs/2310.14959</volume>
<journal>CoRR</journal>
<ee type="oa">https://doi.org/10.48550/arXiv.2310.14959</ee>
<url>db/journals/corr/corr2310.html#abs-2310-14959</url>
</article>
</r>
<r><article publtype="informal" key="journals/corr/abs-2311-01581" mdate="2024-10-06">
<author orcid="0009-0001-1193-3477" pid="347/1309">Moritz Laupichler</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>Fast Many-to-Many Routing for Dynamic Taxi Sharing with Meeting Points.</title>
<year>2023</year>
<volume>abs/2311.01581</volume>
<journal>CoRR</journal>
<ee type="oa">https://doi.org/10.48550/arXiv.2311.01581</ee>
<url>db/journals/corr/corr2311.html#abs-2311-01581</url>
</article>
</r>
<r><article key="journals/jea/SchlagHGASS22" mdate="2023-03-11">
<author orcid="0000-0003-1550-882X" pid="139/4269">Sebastian Schlag</author>
<author orcid="0000-0003-1635-8747" pid="172/1146">Tobias Heuer</author>
<author orcid="0000-0003-1895-5828" pid="243/6884">Lars Gottesb&#252;ren</author>
<author orcid="0000-0002-3195-6326" pid="144/7382">Yaroslav Akhremtsev</author>
<author orcid="0000-0002-2823-3506" pid="10/1388-3">Christian Schulz 0003</author>
<author orcid="0000-0003-3330-9349" pid="s/PeterSanders">Peter Sanders 0001</author>
<title>High-Quality Hypergraph Partitioning.</title>
<pages>1.9:1-1.9:39</pages>
<year>2022</year>
<month>December</month>
<volume>27</volume>
<journal>ACM J. Exp. Algorithmics</journal>
<ee>https://doi.org/10.1145/3529090</ee>
<url>db/journals/jea/jea27.html#SchlagHGASS22</url>
</article>
</r>
<r><article publtype="software" key="journals/jossw/SandersS22" mdate="2024-08-13">
<author orcid="0000-0003-3330-9349" pid="s/PeterSanders">Peter Sanders 0001</author>
<author orcid="0000-0002-4185-1851" pid="178/3095-1">Dominik Schreiber 0001</author>
<title>Mallob: Scalable SAT Solving On Demand With Decentralized Job Scheduling.</title>
<pages>4591</pages>
<year>2022</year>
<volume>7</volume>
<journal>J. Open Source Softw.</journal>
<number>77</number>
<ee type="oa">https://doi.org/10.21105/joss.04591</ee>
<url>db/journals/jossw/jossw7.html#SandersS22</url>
</article>
</r>
<r><article key="journals/spe/WassenbergBGS22" mdate="2024-08-04">
<author pid="44/7407">Jan Wassenberg</author>
<author orcid="0009-0007-2009-7996" pid="277/9082">Mark Blacher</author>
<author pid="30/3504">Joachim Giesen</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>Vectorized and performance-portable quicksort.</title>
<pages>2684-2699</pages>
<year>2022</year>
<volume>52</volume>
<journal>Softw. Pract. Exp.</journal>
<number>12</number>
<ee>https://doi.org/10.1002/spe.3142</ee>
<url>db/journals/spe/spe52.html#WassenbergBGS22</url>
</article>
</r>
<r><article key="journals/toms/Hubschle-Schneider22" mdate="2023-08-28">
<author orcid="0000-0002-4315-3264" pid="151/1543">Lorenz H&#252;bschle-Schneider</author>
<author orcid="0000-0003-3330-9349" pid="s/PeterSanders">Peter Sanders 0001</author>
<title>Parallel Weighted Random Sampling.</title>
<pages>29:1-29:40</pages>
<year>2022</year>
<volume>48</volume>
<journal>ACM Trans. Math. Softw.</journal>
<number>3</number>
<ee>https://doi.org/10.1145/3549934</ee>
<ee>https://www.wikidata.org/entity/Q113309821</ee>
<url>db/journals/toms/toms48.html#Hubschle-Schneider22</url>
</article>
</r>
<r><article key="journals/topc/AxtmannWFS22" mdate="2025-01-19">
<author orcid="0000-0002-0686-0138" pid="153/2031">Michael Axtmann</author>
<author orcid="0000-0002-7867-3200" pid="161/9821">Sascha Witt</author>
<author orcid="0000-0002-9450-8619" pid="176/5263">Daniel Ferizovic</author>
<author orcid="0000-0003-3330-9349" pid="s/PeterSanders">Peter Sanders 0001</author>
<title>Engineering In-place (Shared-memory) Sorting Algorithms.</title>
<pages>2:1-2:62</pages>
<year>2022</year>
<volume>9</volume>
<journal>ACM Trans. Parallel Comput.</journal>
<number>1</number>
<ee>https://doi.org/10.1145/3505286</ee>
<ee>https://www.wikidata.org/entity/Q130968455</ee>
<url>db/journals/topc/topc9.html#AxtmannWFS22</url>
</article>
</r>
<r><inproceedings key="conf/alenex/GottesburenH0S22" mdate="2023-06-26">
<author pid="243/6884">Lars Gottesb&#252;ren</author>
<author orcid="0000-0002-5399-0496" pid="172/1146">Tobias Heuer</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="139/4269">Sebastian Schlag</author>
<title>Shared-Memory n-level Hypergraph Partitioning.</title>
<pages>131-144</pages>
<year>2022</year>
<booktitle>ALENEX</booktitle>
<ee>https://doi.org/10.1137/1.9781611977042.11</ee>
<crossref>conf/alenex/2022</crossref>
<url>db/conf/alenex/alenex2022.html#GottesburenH0S22</url>
</inproceedings>
</r>
<r><inproceedings key="conf/europar/SandersS22" mdate="2024-08-13">
<author orcid="0000-0003-3330-9349" pid="s/PeterSanders">Peter Sanders 0001</author>
<author orcid="0000-0002-4185-1851" pid="178/3095-1">Dominik Schreiber 0001</author>
<title>Decentralized Online Scheduling of Malleable NP-hard Jobs.</title>
<pages>119-135</pages>
<year>2022</year>
<booktitle>Euro-Par</booktitle>
<ee>https://doi.org/10.1007/978-3-031-12597-3_8</ee>
<crossref>conf/europar/2022</crossref>
<url>db/conf/europar/europar2022.html#SandersS22</url>
</inproceedings>
</r>
<r><inproceedings key="conf/ftxs/HubnerHSS22" mdate="2025-03-03">
<author orcid="0000-0001-9213-7597" pid="246/0570">Lukas H&#252;bner</author>
<author orcid="0000-0001-6232-2951" pid="205/2346">Demian Hespe</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author orcid="0000-0003-0353-0691" pid="01/501">Alexandros Stamatakis</author>
<title>ReStore: In-Memory REplicated STORagE for Rapid Recovery in Fault-Tolerant Algorithms.</title>
<pages>24-35</pages>
<year>2022</year>
<booktitle>FTXS@SC</booktitle>
<ee>https://doi.org/10.1109/FTXS56515.2022.00008</ee>
<crossref>conf/ftxs/2022</crossref>
<url>db/conf/ftxs/ftxs2022.html#HubnerHSS22</url>
</inproceedings>
</r>
<r><inproceedings key="conf/ipps/Lamm022" mdate="2022-07-22">
<author pid="159/1660">Sebastian Lamm</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>Communication-efficient Massively Distributed Connected Components.</title>
<pages>302-312</pages>
<year>2022</year>
<booktitle>IPDPS</booktitle>
<ee>https://doi.org/10.1109/IPDPS53621.2022.00037</ee>
<crossref>conf/ipps/2022</crossref>
<url>db/conf/ipps/ipdps2022.html#Lamm022</url>
</inproceedings>
</r>
<r><inproceedings key="conf/wea/DillingerH0W22" mdate="2025-11-15">
<author pid="37/2340">Peter C. Dillinger</author>
<author pid="151/1543">Lorenz H&#252;bschle-Schneider</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author orcid="0000-0002-6477-0106" pid="139/7331">Stefan Walzer</author>
<title>Fast Succinct Retrieval and Approximate Membership Using Ribbon.</title>
<pages>4:1-4:20</pages>
<year>2022</year>
<booktitle>SEA</booktitle>
<ee type="oa">https://doi.org/10.4230/LIPIcs.SEA.2022.4</ee>
<crossref>conf/wea/2022</crossref>
<url>db/conf/wea/sea2022.html#DillingerH0W22</url>
</inproceedings>
</r>
<r><inproceedings key="conf/wea/GottesburenH022" mdate="2023-06-26">
<author pid="243/6884">Lars Gottesb&#252;ren</author>
<author orcid="0000-0002-5399-0496" pid="172/1146">Tobias Heuer</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>Parallel Flow-Based Hypergraph Partitioning.</title>
<pages>5:1-5:21</pages>
<year>2022</year>
<booktitle>SEA</booktitle>
<ee type="oa">https://doi.org/10.4230/LIPIcs.SEA.2022.5</ee>
<crossref>conf/wea/2022</crossref>
<url>db/conf/wea/sea2022.html#GottesburenH022</url>
</inproceedings>
</r>
<r><incollection key="books/crc/22/ErbKM022" mdate="2023-11-22">
<author pid="146/6104">Stephan Erb</author>
<author pid="65/8409">Moritz Kobitzsch</author>
<author pid="m/LawrenceMandow">Lawrence Mandow</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>Multi-Objective Shortest Paths.</title>
<pages>35-59</pages>
<year>2022</year>
<booktitle>Massive Graph Analytics</booktitle>
<ee>https://doi.org/10.1201/9781003033707-3</ee>
<crossref>books/crc/22/B2022</crossref>
<url>db/books/collections/B2022.html#ErbKM022</url>
</incollection>
</r>
<r><incollection key="books/crc/22/PenschuckBHL0S0022" mdate="2025-05-31">
<author orcid="0000-0003-2630-7548" pid="173/4727">Manuel Penschuck</author>
<author pid="b/UlrikBrandes">Ulrik Brandes</author>
<author pid="128/3534">Michael Hamann</author>
<author pid="159/1660">Sebastian Lamm</author>
<author pid="m/UlrichMeyer-1">Ulrich Meyer 0001</author>
<author pid="64/5096">Ilya Safro</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="10/1388-3">Christian Schulz 0003</author>
<title>Recent Advances in Scalable Network Generation1.</title>
<pages>333-376</pages>
<year>2022</year>
<booktitle>Massive Graph Analytics</booktitle>
<ee>https://doi.org/10.1201/9781003033707-16</ee>
<crossref>books/crc/22/B2022</crossref>
<url>db/books/collections/B2022.html#PenschuckBHL0S0022</url>
</incollection>
</r>
<r><incollection key="books/sp/22/BingmannD0KO022" mdate="2025-10-14">
<author pid="129/6546">Timo Bingmann</author>
<author orcid="0000-0002-2004-6781" pid="195/6001">Patrick Dinklage</author>
<author pid="90/834-1">Johannes Fischer 0001</author>
<author orcid="0000-0002-2379-9455" pid="163/4161">Florian Kurpicz</author>
<author pid="o/EnnoOhlebusch">Enno Ohlebusch</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>Scalable Text Index Construction.</title>
<pages>252-284</pages>
<year>2022</year>
<booktitle>Algorithms for Big Data</booktitle>
<ee type="oa">https://doi.org/10.1007/978-3-031-21534-6_14</ee>
<crossref>books/sp/22/2022BKMP</crossref>
<url>db/books/collections/BKMP2022.html#BingmannD0KO022</url>
</incollection>
</r>
<r><data key="data/10/SchreiberS22" mdate="2024-08-13">
<author orcid="0000-0002-4185-1851" pid="178/3095-1">Dominik Schreiber 0001</author>
<author orcid="0000-0003-3330-9349" pid="s/PeterSanders">Peter Sanders 0001</author>
<title>Mallob: Scalable SAT Solving On Demand With Decentralized Job Scheduling.</title>
<year>2022</year>
<month>July</month>
<ee type="oa">https://doi.org/10.5281/zenodo.6890240</ee>
<publisher>Zenodo</publisher>
<rel sort="0" label="Version 1.1.0" uri="https://doi.org/10.5281/zenodo.6890239" type="versionOf"></rel>
<stream>streams/repo/zenodo</stream>
</data>
</r>
<r><article publtype="informal" key="journals/corr/abs-2201-01556" mdate="2022-01-10">
<author pid="243/6884">Lars Gottesb&#252;ren</author>
<author pid="172/1146">Tobias Heuer</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>Parallel Flow-Based Hypergraph Partitioning.</title>
<year>2022</year>
<volume>abs/2201.01556</volume>
<journal>CoRR</journal>
<ee type="oa">https://arxiv.org/abs/2201.01556</ee>
<url>db/journals/corr/corr2201.html#abs-2201-01556</url>
</article>
</r>
<r><article publtype="informal" key="journals/corr/abs-2203-01107" mdate="2022-03-16">
<author pid="205/2346">Demian Hespe</author>
<author pid="246/0570">Lukas H&#252;bner</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="01/501">Alexandros Stamatakis</author>
<title>ReStore: In-Memory REplicated STORagE for Rapid Recovery in Fault-Tolerant Algorithms.</title>
<year>2022</year>
<volume>abs/2203.01107</volume>
<journal>CoRR</journal>
<ee type="oa">https://doi.org/10.48550/arXiv.2203.01107</ee>
<url>db/journals/corr/corr2203.html#abs-2203-01107</url>
</article>
</r>
<r><article publtype="informal" key="journals/corr/abs-2205-04745" mdate="2022-05-11">
<author pid="163/4161">Florian Kurpicz</author>
<author pid="295/9136">Hans-Peter Lehmann</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>PaCHash: Packed and Compressed Hash Tables.</title>
<year>2022</year>
<volume>abs/2205.04745</volume>
<journal>CoRR</journal>
<ee type="oa">https://doi.org/10.48550/arXiv.2205.04745</ee>
<url>db/journals/corr/corr2205.html#abs-2205-04745</url>
</article>
</r>
<r><article publtype="informal" key="journals/corr/abs-2205-05982" mdate="2024-08-04">
<author orcid="0009-0007-2009-7996" pid="277/9082">Mark Blacher</author>
<author pid="30/3504">Joachim Giesen</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="44/7407">Jan Wassenberg</author>
<title>Vectorized and performance-portable Quicksort.</title>
<year>2022</year>
<volume>abs/2205.05982</volume>
<journal>CoRR</journal>
<ee type="oa">https://doi.org/10.48550/arXiv.2205.05982</ee>
<url>db/journals/corr/corr2205.html#abs-2205-05982</url>
</article>
</r>
<r><article publtype="informal" key="journals/corr/abs-2205-06590" mdate="2024-08-13">
<author pid="178/3095-1">Dominik Schreiber 0001</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>Scalable SAT Solving in the Cloud.</title>
<year>2022</year>
<volume>abs/2205.06590</volume>
<journal>CoRR</journal>
<ee type="oa">https://doi.org/10.48550/arXiv.2205.06590</ee>
<url>db/journals/corr/corr2205.html#abs-2205-06590</url>
</article>
</r>
<r><article publtype="informal" key="journals/corr/abs-2205-13202" mdate="2022-05-31">
<author pid="c/UmitVCatalyurek">&#220;mit V. &#199;ataly&#252;rek</author>
<author pid="d/KarenDDevine">Karen D. Devine</author>
<author pid="191/0315">Marcelo Fonseca Faraj</author>
<author pid="243/6884">Lars Gottesb&#252;ren</author>
<author pid="172/1146">Tobias Heuer</author>
<author pid="55/3065">Henning Meyerhenke</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="139/4269">Sebastian Schlag</author>
<author pid="10/1388-3">Christian Schulz 0003</author>
<author pid="225/5422">Daniel Seemaier</author>
<author pid="w/DorotheaWagner">Dorothea Wagner</author>
<title>More Recent Advances in (Hyper)Graph Partitioning.</title>
<year>2022</year>
<volume>abs/2205.13202</volume>
<journal>CoRR</journal>
<ee type="oa">https://doi.org/10.48550/arXiv.2205.13202</ee>
<url>db/journals/corr/corr2205.html#abs-2205-13202</url>
</article>
</r>
<r><article publtype="informal" key="journals/corr/abs-2210-01560" mdate="2022-10-07">
<author pid="295/9136">Hans-Peter Lehmann</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="139/7331">Stefan Walzer</author>
<title>SicHash - Small Irregular Cuckoo Tables for Perfect Hashing.</title>
<year>2022</year>
<volume>abs/2210.01560</volume>
<journal>CoRR</journal>
<ee type="oa">https://doi.org/10.48550/arXiv.2210.01560</ee>
<url>db/journals/corr/corr2210.html#abs-2210-01560</url>
</article>
</r>
<r><article publtype="informal" key="journals/corr/abs-2212-09562" mdate="2023-01-03">
<author pid="336/4850">Dominik Bez</author>
<author pid="163/4161">Florian Kurpicz</author>
<author pid="295/9136">Hans-Peter Lehmann</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>High Performance Construction of RecSplit Based Minimal Perfect Hash Functions.</title>
<year>2022</year>
<volume>abs/2212.09562</volume>
<journal>CoRR</journal>
<ee type="oa">https://doi.org/10.48550/arXiv.2212.09562</ee>
<url>db/journals/corr/corr2212.html#abs-2212-09562</url>
</article>
</r>
<r><article key="journals/bioinformatics/HubnerKHSS21" mdate="2023-09-12">
<author orcid="0000-0001-9213-7597" pid="246/0570">Lukas H&#252;bner</author>
<author orcid="0000-0001-7394-2718" pid="155/5457">Alexey M. Kozlov</author>
<author orcid="0000-0001-6232-2951" pid="205/2346">Demian Hespe</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author orcid="0000-0003-0353-0691" pid="01/501">Alexandros Stamatakis</author>
<title>Exploring parallel MPI fault tolerance mechanisms for phylogenetic inference with RAxML-NG.</title>
<pages>4056-4063</pages>
<year>2021</year>
<month>November</month>
<volume>37</volume>
<journal>Bioinform.</journal>
<number>22</number>
<ee type="oa">https://doi.org/10.1093/bioinformatics/btab399</ee>
<url>db/journals/bioinformatics/bioinformatics37.html#HubnerKHSS21</url>
</article>
</r>
<r><article key="journals/spe/BingmannMS21" mdate="2021-05-14">
<author orcid="0000-0003-0529-0097" pid="129/6546">Timo Bingmann</author>
<author pid="247/5980">Jasper Marianczuk</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>Engineering faster sorters for small sets of items.</title>
<pages>965-1004</pages>
<year>2021</year>
<volume>51</volume>
<journal>Softw. Pract. Exp.</journal>
<number>5</number>
<ee type="oa">https://doi.org/10.1002/spe.2922</ee>
<url>db/journals/spe/spe51.html#BingmannMS21</url>
</article>
</r>
<r><inproceedings key="conf/alenex/GottesburenHSS21" mdate="2021-03-17">
<author pid="243/6884">Lars Gottesb&#252;ren</author>
<author pid="172/1146">Tobias Heuer</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="139/4269">Sebastian Schlag</author>
<title>Scalable Shared-Memory Hypergraph Partitioning.</title>
<pages>16-30</pages>
<year>2021</year>
<booktitle>ALENEX</booktitle>
<ee>https://doi.org/10.1137/1.9781611976472.2</ee>
<crossref>conf/alenex/2021</crossref>
<url>db/conf/alenex/alenex2021.html#GottesburenHSS21</url>
</inproceedings>
</r>
<r><inproceedings key="conf/alenex/BuchholdSW21" mdate="2021-03-17">
<author pid="173/5447">Valentin Buchhold</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="w/DorotheaWagner">Dorothea Wagner</author>
<title>Fast, Exact and Scalable Dynamic Ridesharing.</title>
<pages>98-112</pages>
<year>2021</year>
<booktitle>ALENEX</booktitle>
<ee>https://doi.org/10.1137/1.9781611976472.8</ee>
<crossref>conf/alenex/2021</crossref>
<url>db/conf/alenex/alenex2021.html#BuchholdSW21</url>
</inproceedings>
</r>
<r><inproceedings key="conf/esa/GottesburenH00S21" mdate="2021-08-31">
<author pid="243/6884">Lars Gottesb&#252;ren</author>
<author pid="172/1146">Tobias Heuer</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="10/1388-3">Christian Schulz 0003</author>
<author pid="225/5422">Daniel Seemaier</author>
<title>Deep Multilevel Graph Partitioning.</title>
<pages>48:1-48:17</pages>
<year>2021</year>
<booktitle>ESA</booktitle>
<ee type="oa">https://doi.org/10.4230/LIPIcs.ESA.2021.48</ee>
<crossref>conf/esa/2021</crossref>
<url>db/conf/esa/esa2021.html#GottesburenH00S21</url>
</inproceedings>
</r>
<r><inproceedings key="conf/esa/Williams0D21" mdate="2023-09-30">
<author orcid="0000-0002-1990-0899" pid="296/3808">Marvin Williams</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="d/RomanDementiev">Roman Dementiev</author>
<title>Engineering MultiQueues: Fast Relaxed Concurrent Priority Queues.</title>
<pages>81:1-81:17</pages>
<year>2021</year>
<booktitle>ESA</booktitle>
<ee type="oa">https://doi.org/10.4230/LIPIcs.ESA.2021.81</ee>
<crossref>conf/esa/2021</crossref>
<url>db/conf/esa/esa2021.html#Williams0D21</url>
</inproceedings>
</r>
<r><inproceedings key="conf/sat/SchreiberS21" mdate="2024-08-13">
<author orcid="0000-0002-4185-1851" pid="178/3095-1">Dominik Schreiber 0001</author>
<author orcid="0000-0003-3330-9349" pid="s/PeterSanders">Peter Sanders 0001</author>
<title>Scalable SAT Solving in the Cloud.</title>
<pages>518-534</pages>
<year>2021</year>
<booktitle>SAT</booktitle>
<ee>https://doi.org/10.1007/978-3-030-80223-3_35</ee>
<crossref>conf/sat/2021</crossref>
<url>db/conf/sat/sat2021.html#SchreiberS21</url>
</inproceedings>
</r>
<r><article publtype="informal" key="journals/corr/abs-2104-08107" mdate="2021-04-19">
<author pid="243/6884">Lars Gottesb&#252;ren</author>
<author pid="172/1146">Tobias Heuer</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="139/4269">Sebastian Schlag</author>
<title>Shared-Memory n-level Hypergraph Partitioning.</title>
<year>2021</year>
<volume>abs/2104.08107</volume>
<journal>CoRR</journal>
<ee type="oa">https://arxiv.org/abs/2104.08107</ee>
<url>db/journals/corr/corr2104.html#abs-2104-08107</url>
</article>
</r>
<r><article publtype="informal" key="journals/corr/abs-2105-02022" mdate="2021-05-12">
<author pid="243/6884">Lars Gottesb&#252;ren</author>
<author pid="172/1146">Tobias Heuer</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="10/1388-3">Christian Schulz 0003</author>
<author pid="225/5422">Daniel Seemaier</author>
<title>Deep Multilevel Graph Partitioning.</title>
<year>2021</year>
<volume>abs/2105.02022</volume>
<journal>CoRR</journal>
<ee type="oa">https://arxiv.org/abs/2105.02022</ee>
<url>db/journals/corr/corr2105.html#abs-2105-02022</url>
</article>
</r>
<r><article publtype="informal" key="journals/corr/abs-2106-08696" mdate="2021-06-29">
<author pid="139/4269">Sebastian Schlag</author>
<author pid="172/1146">Tobias Heuer</author>
<author pid="243/6884">Lars Gottesb&#252;ren</author>
<author pid="144/7382">Yaroslav Akhremtsev</author>
<author pid="10/1388-3">Christian Schulz 0003</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>High-Quality Hypergraph Partitioning.</title>
<year>2021</year>
<volume>abs/2106.08696</volume>
<journal>CoRR</journal>
<ee type="oa">https://arxiv.org/abs/2106.08696</ee>
<url>db/journals/corr/corr2106.html#abs-2106-08696</url>
</article>
</r>
<r><article publtype="informal" key="journals/corr/abs-2106-12270" mdate="2021-06-30">
<author pid="295/9136">Hans-Peter Lehmann</author>
<author pid="151/1543">Lorenz H&#252;bschle-Schneider</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>Weighted Random Sampling on GPUs.</title>
<year>2021</year>
<volume>abs/2106.12270</volume>
<journal>CoRR</journal>
<ee type="oa">https://arxiv.org/abs/2106.12270</ee>
<url>db/journals/corr/corr2106.html#abs-2106-12270</url>
</article>
</r>
<r><article publtype="informal" key="journals/corr/abs-2107-01350" mdate="2025-11-15">
<author orcid="0000-0002-1990-0899" pid="296/3808">Marvin Williams</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="d/RomanDementiev">Roman Dementiev</author>
<title>Engineering MultiQueues: Fast Relaxed Concurrent Priority Queues.</title>
<year>2021</year>
<volume>abs/2107.01350</volume>
<journal>CoRR</journal>
<ee type="oa">https://arxiv.org/abs/2107.01350</ee>
<url>db/journals/corr/corr2107.html#abs-2107-01350</url>
</article>
</r>
<r><article publtype="informal" key="journals/corr/abs-2109-01892" mdate="2021-09-20">
<author pid="37/2340">Peter C. Dillinger</author>
<author pid="151/1543">Lorenz H&#252;bschle-Schneider</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="139/7331">Stefan Walzer</author>
<title>Fast Succinct Retrieval and Approximate Membership using Ribbon.</title>
<year>2021</year>
<volume>abs/2109.01892</volume>
<journal>CoRR</journal>
<ee type="oa">https://arxiv.org/abs/2109.01892</ee>
<url>db/journals/corr/corr2109.html#abs-2109-01892</url>
</article>
</r>
<r><article key="journals/netsci/Hubschle-Schneider20" mdate="2021-05-14">
<author orcid="0000-0002-4315-3264" pid="151/1543">Lorenz H&#252;bschle-Schneider</author>
<author orcid="0000-0003-3330-9349" pid="s/PeterSanders">Peter Sanders 0001</author>
<title>Linear work generation of R-MAT graphs.</title>
<pages>543-550</pages>
<year>2020</year>
<volume>8</volume>
<journal>Netw. Sci.</journal>
<number>4</number>
<ee type="oa">https://doi.org/10.1017/nws.2020.21</ee>
<url>db/journals/netsci/netsci8.html#Hubschle-Schneider20</url>
</article>
</r>
<r><article key="journals/tpds/AkhremtsevSS20" mdate="2020-10-02">
<author pid="144/7382">Yaroslav Akhremtsev</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author orcid="0000-0002-2823-3506" pid="10/1388-3">Christian Schulz 0003</author>
<title>High-Quality Shared-Memory Graph Partitioning.</title>
<pages>2710-2722</pages>
<year>2020</year>
<volume>31</volume>
<journal>IEEE Trans. Parallel Distributed Syst.</journal>
<number>11</number>
<ee>https://doi.org/10.1109/TPDS.2020.3001645</ee>
<url>db/journals/tpds/tpds31.html#AkhremtsevSS20</url>
</article>
</r>
<r><inproceedings key="conf/bigdataconf/Sanders20" mdate="2021-04-12">
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>Connecting MapReduce Computations to Realistic Machine Models.</title>
<pages>84-93</pages>
<year>2020</year>
<booktitle>IEEE BigData</booktitle>
<ee>https://doi.org/10.1109/BigData50022.2020.9378039</ee>
<crossref>conf/bigdataconf/2020</crossref>
<url>db/conf/bigdataconf/bigdataconf2020.html#Sanders20</url>
</inproceedings>
</r>
<r><inproceedings key="conf/ipps/Bingmann0S20" mdate="2024-08-04">
<author pid="129/6546">Timo Bingmann</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author orcid="0009-0002-6402-9016" pid="256/9438">Matthias Schimek</author>
<title>Communication-Efficient String Sorting.</title>
<pages>137-147</pages>
<year>2020</year>
<booktitle>IPDPS</booktitle>
<ee>https://doi.org/10.1109/IPDPS47924.2020.00024</ee>
<crossref>conf/ipps/2020</crossref>
<url>db/conf/ipps/ipdps2020.html#Bingmann0S20</url>
</inproceedings>
</r>
<r><inproceedings key="conf/spaa/Hubschle-Schneider20" mdate="2020-07-12">
<author pid="151/1543">Lorenz H&#252;bschle-Schneider</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>Communication-Efficient Weighted Reservoir Sampling from Fully Distributed Data Streams.</title>
<pages>543-545</pages>
<year>2020</year>
<booktitle>SPAA</booktitle>
<ee>https://doi.org/10.1145/3350755.3400287</ee>
<crossref>conf/spaa/2020</crossref>
<url>db/conf/spaa/spaa2020.html#Hubschle-Schneider20</url>
</inproceedings>
</r>
<r><inproceedings key="conf/wea/Maier0W20" mdate="2020-06-16">
<author orcid="0000-0001-9598-3609" pid="81/910">Tobias Maier</author>
<author orcid="0000-0003-3330-9349" pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="195/5540">Robert Williger</author>
<title>Concurrent Expandable AMQs on the Basis of Quotient Filters.</title>
<pages>15:1-15:13</pages>
<year>2020</year>
<booktitle>SEA</booktitle>
<ee type="oa">https://doi.org/10.4230/LIPIcs.SEA.2020.15</ee>
<crossref>conf/wea/2020</crossref>
<url>db/conf/wea/sea2020.html#Maier0W20</url>
</inproceedings>
</r>
<r><proceedings key="conf/esa/2020" mdate="2025-11-21">
<editor orcid="0000-0002-9676-4931" pid="g/FGrandoni">Fabrizio Grandoni 0001</editor>
<editor orcid="0000-0001-6855-8316" pid="76/1969">Grzegorz Herman</editor>
<editor orcid="0000-0003-3330-9349" pid="s/PeterSanders">Peter Sanders 0001</editor>
<title>28th Annual European Symposium on Algorithms, ESA 2020, Pisa, Italy (Virtual Conference), September 7-9, 2020</title>
<booktitle>ESA</booktitle>
<publisher>Schloss Dagstuhl - Leibniz-Zentrum f&#252;r Informatik</publisher>
<year>2020</year>
<series href="db/series/lipics/index.html">LIPIcs</series>
<volume>173</volume>
<isbn>978-3-95977-162-7</isbn>
<ee type="oa">https://www.dagstuhl.de/dagpub/978-3-95977-162-7</ee>
<url>db/conf/esa/esa2020.html</url>
</proceedings>
</r>
<r><article publtype="informal" key="journals/corr/abs-2001-08516" mdate="2020-01-24">
<author pid="129/6546">Timo Bingmann</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="256/9438">Matthias Schimek</author>
<title>Communication-Efficient String Sorting.</title>
<year>2020</year>
<volume>abs/2001.08516</volume>
<journal>CoRR</journal>
<ee type="oa">https://arxiv.org/abs/2001.08516</ee>
<url>db/journals/corr/corr2001.html#abs-2001-08516</url>
</article>
</r>
<r><article publtype="informal" key="journals/corr/abs-2002-05599" mdate="2020-02-14">
<author pid="129/6546">Timo Bingmann</author>
<author pid="247/5980">Jasper Marianczuk</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>Engineering Faster Sorters for Small Sets of Items.</title>
<year>2020</year>
<volume>abs/2002.05599</volume>
<journal>CoRR</journal>
<ee type="oa">https://arxiv.org/abs/2002.05599</ee>
<url>db/journals/corr/corr2002.html#abs-2002-05599</url>
</article>
</r>
<r><article publtype="informal" key="journals/corr/abs-2002-07553" mdate="2020-03-05">
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>Connecting MapReduce Computations to Realistic Machine Models.</title>
<year>2020</year>
<volume>abs/2002.07553</volume>
<journal>CoRR</journal>
<ee type="oa">https://arxiv.org/abs/2002.07553</ee>
<url>db/journals/corr/corr2002.html#abs-2002-07553</url>
</article>
</r>
<r><article publtype="informal" key="journals/corr/abs-2003-00736" mdate="2021-10-14">
<author orcid="0000-0003-2630-7548" pid="173/4727">Manuel Penschuck</author>
<author pid="b/UlrikBrandes">Ulrik Brandes</author>
<author pid="128/3534">Michael Hamann</author>
<author pid="159/1660">Sebastian Lamm</author>
<author pid="m/UlrichMeyer-1">Ulrich Meyer 0001</author>
<author pid="64/5096">Ilya Safro</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="10/1388-3">Christian Schulz 0003</author>
<title>Recent Advances in Scalable Network Generation.</title>
<year>2020</year>
<volume>abs/2003.00736</volume>
<journal>CoRR</journal>
<ee type="oa">https://arxiv.org/abs/2003.00736</ee>
<url>db/journals/corr/corr2003.html#abs-2003-00736</url>
</article>
</r>
<r><article publtype="informal" key="journals/corr/abs-2009-13569" mdate="2020-09-30">
<author pid="153/2031">Michael Axtmann</author>
<author pid="161/9821">Sascha Witt</author>
<author pid="176/5263">Daniel Ferizovic</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>Engineering In-place (Shared-memory) Sorting Algorithms.</title>
<year>2020</year>
<volume>abs/2009.13569</volume>
<journal>CoRR</journal>
<ee type="oa">https://arxiv.org/abs/2009.13569</ee>
<url>db/journals/corr/corr2009.html#abs-2009-13569</url>
</article>
</r>
<r><article publtype="informal" key="journals/corr/abs-2010-10272" mdate="2020-10-26">
<author pid="243/6884">Lars Gottesb&#252;ren</author>
<author pid="172/1146">Tobias Heuer</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="139/4269">Sebastian Schlag</author>
<title>Scalable Shared-Memory Hypergraph Partitioning.</title>
<year>2020</year>
<volume>abs/2010.10272</volume>
<journal>CoRR</journal>
<ee type="oa">https://arxiv.org/abs/2010.10272</ee>
<url>db/journals/corr/corr2010.html#abs-2010-10272</url>
</article>
</r>
<r><article publtype="informal" key="journals/corr/abs-2011-02601" mdate="2020-11-09">
<author pid="173/5447">Valentin Buchhold</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="w/DorotheaWagner">Dorothea Wagner</author>
<title>Fast, Exact and Scalable Dynamic Ridesharing.</title>
<year>2020</year>
<volume>abs/2011.02601</volume>
<journal>CoRR</journal>
<ee type="oa">https://arxiv.org/abs/2011.02601</ee>
<url>db/journals/corr/corr2011.html#abs-2011-02601</url>
</article>
</r>
<r><book key="books/sp/SandersMDD19" mdate="2023-09-30">
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="m/KurtMehlhorn">Kurt Mehlhorn</author>
<author orcid="0000-0001-5484-3474" pid="d/MartinDietzfelbinger">Martin Dietzfelbinger</author>
<author pid="d/RomanDementiev">Roman Dementiev</author>
<title>Sequential and Parallel Algorithms and Data Structures - The Basic Toolbox</title>
<publisher>Springer</publisher>
<year>2019</year>
<pages>1-434</pages>
<isbn>978-3-030-25208-3</isbn>
<ee>https://doi.org/10.1007/978-3-030-25209-0</ee>
</book>
</r>
<r><article key="journals/algorithmica/Maier0W19" mdate="2025-01-19">
<author orcid="0000-0001-9598-3609" pid="81/910">Tobias Maier</author>
<author orcid="0000-0003-3330-9349" pid="s/PeterSanders">Peter Sanders 0001</author>
<author orcid="0000-0002-6477-0106" pid="139/7331">Stefan Walzer</author>
<title>Dynamic Space Efficient Hashing.</title>
<pages>3162-3185</pages>
<year>2019</year>
<volume>81</volume>
<journal>Algorithmica</journal>
<number>8</number>
<ee>https://doi.org/10.1007/s00453-019-00572-x</ee>
<ee>https://www.wikidata.org/entity/Q127663787</ee>
<url>db/journals/algorithmica/algorithmica81.html#Maier0W19</url>
</article>
</r>
<r><article key="journals/dase/AlamPS19" mdate="2025-01-19">
<author orcid="0000-0002-4941-463X" pid="20/5978">Md. Maksudul Alam</author>
<author orcid="0000-0002-7458-0832" pid="15/4026">Kalyan S. Perumalla</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>Novel Parallel Algorithms for Fast Multi-GPU-Based Generation of Massive Scale-Free Networks.</title>
<pages>61-75</pages>
<year>2019</year>
<volume>4</volume>
<journal>Data Sci. Eng.</journal>
<number>1</number>
<ee type="oa">https://doi.org/10.1007/s41019-019-0088-6</ee>
<ee>https://www.wikidata.org/entity/Q128125899</ee>
<url>db/journals/dase/dase4.html#AlamPS19</url>
</article>
</r>
<r><article key="journals/jea/Buchhold0W19" mdate="2025-01-19">
<author pid="173/5447">Valentin Buchhold</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="w/DorotheaWagner">Dorothea Wagner</author>
<title>Real-time Traffic Assignment Using Engineered Customizable Contraction Hierarchies.</title>
<pages>2.4:1-2.4:28</pages>
<year>2019</year>
<volume>24</volume>
<journal>ACM J. Exp. Algorithmics</journal>
<number>1</number>
<ee>https://doi.org/10.1145/3362693</ee>
<ee>https://www.wikidata.org/entity/Q126585545</ee>
<url>db/journals/jea/jea24.html#Buchhold0W19</url>
</article>
</r>
<r><article key="journals/jea/Heuer0S19" mdate="2020-06-25">
<author pid="172/1146">Tobias Heuer</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author orcid="0000-0003-1550-882X" pid="139/4269">Sebastian Schlag</author>
<title>Network Flow-Based Refinement for Multilevel Hypergraph Partitioning.</title>
<pages>2.3:1-2.3:36</pages>
<year>2019</year>
<volume>24</volume>
<journal>ACM J. Exp. Algorithmics</journal>
<number>1</number>
<ee>https://doi.org/10.1145/3329872</ee>
<url>db/journals/jea/jea24.html#Heuer0S19</url>
</article>
</r>
<r><article key="journals/jpdc/FunkeLMPSSSL19" mdate="2025-11-15">
<author pid="06/8509">Daniel Funke</author>
<author pid="159/1660">Sebastian Lamm</author>
<author pid="m/UlrichMeyer-1">Ulrich Meyer 0001</author>
<author orcid="0000-0003-2630-7548" pid="173/4727">Manuel Penschuck</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author orcid="0000-0002-2823-3506" pid="10/1388-3">Christian Schulz 0003</author>
<author orcid="0000-0001-7095-8749" pid="18/3295">Darren Strash</author>
<author pid="157/8455">Moritz von Looz</author>
<title>Communication-free massively distributed graph generation.</title>
<pages>200-217</pages>
<year>2019</year>
<volume>131</volume>
<journal>J. Parallel Distributed Comput.</journal>
<ee>https://doi.org/10.1016/j.jpdc.2019.03.011</ee>
<ee>https://www.wikidata.org/entity/Q127823926</ee>
<url>db/journals/jpdc/jpdc131.html#FunkeLMPSSSL19</url>
</article>
</r>
<r><article key="journals/topc/MaierSD19" mdate="2020-07-28">
<author pid="81/910">Tobias Maier</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="d/RomanDementiev">Roman Dementiev</author>
<title>Concurrent Hash Tables: Fast and General(?)!</title>
<pages>16:1-16:32</pages>
<year>2019</year>
<volume>5</volume>
<journal>ACM Trans. Parallel Comput.</journal>
<number>4</number>
<ee>https://doi.org/10.1145/3309206</ee>
<ee>https://www.wikidata.org/entity/Q62608894</ee>
<url>db/journals/topc/topc5.html#MaierSD19</url>
</article>
</r>
<r><inproceedings key="conf/atmos/Hespe019" mdate="2021-10-14">
<author orcid="0000-0001-6232-2951" pid="205/2346">Demian Hespe</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>More Hierarchy in Route Planning Using Edge Hierarchies.</title>
<pages>10:1-10:14</pages>
<year>2019</year>
<booktitle>ATMOS</booktitle>
<ee type="oa">https://doi.org/10.4230/OASIcs.ATMOS.2019.10</ee>
<crossref>conf/atmos/2019</crossref>
<url>db/conf/atmos/atmos2019.html#Hespe019</url>
</inproceedings>
</r>
<r><inproceedings key="conf/esa/Hubschle-Schneider19" mdate="2020-10-25">
<author orcid="0000-0002-4315-3264" pid="151/1543">Lorenz H&#252;bschle-Schneider</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>Parallel Weighted Random Sampling.</title>
<pages>59:1-59:24</pages>
<year>2019</year>
<booktitle>ESA</booktitle>
<ee type="oa">https://doi.org/10.4230/LIPIcs.ESA.2019.59</ee>
<crossref>conf/esa/2019</crossref>
<url>db/conf/esa/esa2019.html#Hubschle-Schneider19</url>
</inproceedings>
</r>
<r><inproceedings key="conf/europar/Funke0W19" mdate="2019-08-19">
<author pid="06/8509">Daniel Funke</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="236/4836">Vincent Winkler</author>
<title>Load-Balancing for Parallel Delaunay Triangulations.</title>
<pages>156-169</pages>
<year>2019</year>
<booktitle>Euro-Par</booktitle>
<ee>https://doi.org/10.1007/978-3-030-29400-7_12</ee>
<crossref>conf/europar/2019</crossref>
<url>db/conf/europar/europar2019.html#Funke0W19</url>
</inproceedings>
</r>
<r><inproceedings key="conf/gis/Buchhold0W19" mdate="2025-01-19">
<author pid="173/5447">Valentin Buchhold</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="w/DorotheaWagner">Dorothea Wagner</author>
<title>Efficient Calculation of Microscopic Travel Demand Data with Low Calibration Effort.</title>
<pages>379-388</pages>
<year>2019</year>
<booktitle>SIGSPATIAL/GIS</booktitle>
<ee>https://doi.org/10.1145/3347146.3359361</ee>
<ee>https://www.wikidata.org/entity/Q130904789</ee>
<crossref>conf/gis/2019</crossref>
<url>db/conf/gis/gis2019.html#Buchhold0W19</url>
</inproceedings>
</r>
<r><article publtype="informal" key="journals/corr/abs-1902-07554" mdate="2019-05-21">
<author pid="06/8509">Daniel Funke</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="236/4836">Vincent Winkler</author>
<title>Load-Balancing for Parallel Delaunay Triangulations.</title>
<year>2019</year>
<volume>abs/1902.07554</volume>
<journal>CoRR</journal>
<ee type="oa">http://arxiv.org/abs/1902.07554</ee>
<url>db/journals/corr/corr1902.html#abs-1902-07554</url>
</article>
</r>
<r><article publtype="informal" key="journals/corr/abs-1903-00227" mdate="2019-03-30">
<author pid="151/1543">Lorenz H&#252;bschle-Schneider</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>Parallel Weighted Random Sampling.</title>
<year>2019</year>
<volume>abs/1903.00227</volume>
<journal>CoRR</journal>
<ee type="oa">http://arxiv.org/abs/1903.00227</ee>
<url>db/journals/corr/corr1903.html#abs-1903-00227</url>
</article>
</r>
<r><article publtype="informal" key="journals/corr/abs-1905-03525" mdate="2021-01-23">
<author orcid="0000-0002-4315-3264" pid="151/1543">Lorenz H&#252;bschle-Schneider</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>Linear Work Generation of R-MAT Graphs.</title>
<year>2019</year>
<volume>abs/1905.03525</volume>
<journal>CoRR</journal>
<ee type="oa">http://arxiv.org/abs/1905.03525</ee>
<url>db/journals/corr/corr1905.html#abs-1905-03525</url>
</article>
</r>
<r><article publtype="informal" key="journals/corr/abs-1907-03535" mdate="2019-07-17">
<author pid="205/2346">Demian Hespe</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>More Hierarchy in Route Planning Using Edge Hierarchies.</title>
<year>2019</year>
<volume>abs/1907.03535</volume>
<journal>CoRR</journal>
<ee type="oa">http://arxiv.org/abs/1907.03535</ee>
<url>db/journals/corr/corr1907.html#abs-1907-03535</url>
</article>
</r>
<r><article publtype="informal" key="journals/corr/abs-1910-11069" mdate="2021-01-23">
<author orcid="0000-0002-4315-3264" pid="151/1543">Lorenz H&#252;bschle-Schneider</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>Communication-Efficient (Weighted) Reservoir Sampling.</title>
<year>2019</year>
<volume>abs/1910.11069</volume>
<journal>CoRR</journal>
<ee type="oa">http://arxiv.org/abs/1910.11069</ee>
<url>db/journals/corr/corr1910.html#abs-1910-11069</url>
</article>
</r>
<r><article publtype="informal" key="journals/corr/abs-1911-08374" mdate="2019-12-02">
<author pid="81/910">Tobias Maier</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="195/5540">Robert Williger</author>
<title>Concurrent Expandable AMQs on the Basis of Quotient Filters.</title>
<year>2019</year>
<volume>abs/1911.08374</volume>
<journal>CoRR</journal>
<ee type="oa">http://arxiv.org/abs/1911.08374</ee>
<url>db/journals/corr/corr1911.html#abs-1911-08374</url>
</article>
</r>
<r><article key="journals/toms/SandersLHSD18" mdate="2025-03-03">
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="159/1660">Sebastian Lamm</author>
<author orcid="0000-0002-4315-3264" pid="151/1543">Lorenz H&#252;bschle-Schneider</author>
<author orcid="0000-0002-2985-8188" pid="183/8759">Emanuel Schrade</author>
<author pid="22/4239">Carsten Dachsbacher</author>
<title>Efficient Parallel Random Sampling - Vectorized, Cache-Efficient, and Online.</title>
<pages>29:1-29:14</pages>
<year>2018</year>
<volume>44</volume>
<journal>ACM Trans. Math. Softw.</journal>
<number>3</number>
<ee>https://doi.org/10.1145/3157734</ee>
<ee>https://www.wikidata.org/entity/Q113310096</ee>
<url>db/journals/toms/toms44.html#SandersLHSD18</url>
</article>
</r>
<r><inproceedings key="conf/ccnc/Breitbach0S18" mdate="2018-03-20">
<author pid="33/2920">Thomas Breitbach</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="31/3154">Dominik Schultes</author>
<title>Optimizing energy consumption and user experience in a mobile video streaming scenario.</title>
<pages>1-9</pages>
<year>2018</year>
<booktitle>CCNC</booktitle>
<ee>https://doi.org/10.1109/CCNC.2018.8319166</ee>
<crossref>conf/ccnc/2018</crossref>
<url>db/conf/ccnc/ccnc2018.html#Breitbach0S18</url>
</inproceedings>
</r>
<r><inproceedings key="conf/ecsa/Koziolek0W18" mdate="2018-11-21">
<author pid="51/1757">Anne Koziolek</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="w/DorotheaWagner">Dorothea Wagner</author>
<title>An equal opportunity concept for the coordinated research effort AESC.</title>
<pages>16:1-16:4</pages>
<year>2018</year>
<booktitle>ECSA (Companion)</booktitle>
<ee>https://doi.org/10.1145/3241403.3241421</ee>
<crossref>conf/ecsa/2018c</crossref>
<url>db/conf/ecsa/ecsa2018c.html#Koziolek0W18</url>
</inproceedings>
</r>
<r><inproceedings key="conf/europar/Akhremtsev0018" mdate="2019-12-27">
<author pid="144/7382">Yaroslav Akhremtsev</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author orcid="0000-0002-2823-3506" pid="10/1388-3">Christian Schulz 0003</author>
<title>High-Quality Shared-Memory Graph Partitioning.</title>
<pages>659-671</pages>
<year>2018</year>
<booktitle>Euro-Par</booktitle>
<ee>https://doi.org/10.1007/978-3-319-96983-1_47</ee>
<crossref>conf/europar/2018</crossref>
<url>db/conf/europar/europar2018.html#Akhremtsev0018</url>
</inproceedings>
</r>
<r><inproceedings key="conf/ipps/AxtmannW018" mdate="2023-03-24">
<author pid="153/2031">Michael Axtmann</author>
<author pid="207/8283">Armin Wiebigke</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>Lightweight MPI Communicators with Applications to Perfectly Balanced Quicksort.</title>
<pages>254-265</pages>
<year>2018</year>
<booktitle>IPDPS</booktitle>
<ee>https://doi.org/10.1109/IPDPS.2018.00035</ee>
<ee>https://doi.ieeecomputersociety.org/10.1109/IPDPS.2018.00035</ee>
<crossref>conf/ipps/2018</crossref>
<url>db/conf/ipps/ipdps2018.html#AxtmannW018</url>
</inproceedings>
</r>
<r><inproceedings key="conf/ipps/FunkeL00SL18" mdate="2023-03-24">
<author pid="06/8509">Daniel Funke</author>
<author pid="159/1660">Sebastian Lamm</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author orcid="0000-0002-2823-3506" pid="10/1388-3">Christian Schulz 0003</author>
<author orcid="0000-0001-7095-8749" pid="18/3295">Darren Strash</author>
<author pid="157/8455">Moritz von Looz</author>
<title>Communication-Free Massively Distributed Graph Generation.</title>
<pages>336-347</pages>
<year>2018</year>
<booktitle>IPDPS</booktitle>
<ee>https://doi.org/10.1109/IPDPS.2018.00043</ee>
<ee>https://doi.ieeecomputersociety.org/10.1109/IPDPS.2018.00043</ee>
<crossref>conf/ipps/2018</crossref>
<url>db/conf/ipps/ipdps2018.html#FunkeL00SL18</url>
</inproceedings>
</r>
<r><inproceedings key="conf/ipps/Hubschle-Schneider18" mdate="2023-03-24">
<author orcid="0000-0002-4315-3264" pid="151/1543">Lorenz H&#252;bschle-Schneider</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>Communication Efficient Checking of Big Data Operations.</title>
<pages>650-659</pages>
<year>2018</year>
<booktitle>IPDPS</booktitle>
<ee>https://doi.org/10.1109/IPDPS.2018.00074</ee>
<ee>https://doi.ieeecomputersociety.org/10.1109/IPDPS.2018.00074</ee>
<crossref>conf/ipps/2018</crossref>
<url>db/conf/ipps/ipdps2018.html#Hubschle-Schneider18</url>
</inproceedings>
</r>
<r><inproceedings key="conf/vstte/BeckertBK0UW18" mdate="2023-06-26">
<author orcid="0000-0002-9672-3291" pid="b/BBeckert">Bernhard Beckert</author>
<author pid="129/6546">Timo Bingmann</author>
<author pid="189/1087">Moritz Kiefer</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author orcid="0000-0002-2350-1831" pid="73/9580">Mattias Ulbrich</author>
<author orcid="0000-0001-8446-4598" pid="170/0399">Alexander Weigl</author>
<title>Relational Equivalence Proofs Between Imperative and MapReduce Algorithms.</title>
<pages>248-266</pages>
<year>2018</year>
<booktitle>VSTTE</booktitle>
<ee>https://doi.org/10.1007/978-3-030-03592-1_14</ee>
<crossref>conf/vstte/2018</crossref>
<url>db/conf/vstte/vstte2018.html#BeckertBK0UW18</url>
</inproceedings>
</r>
<r><inproceedings key="conf/wea/Heuer0S18" mdate="2018-11-30">
<author pid="172/1146">Tobias Heuer</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author orcid="0000-0003-1550-882X" pid="139/4269">Sebastian Schlag</author>
<title>Network Flow-Based Refinement for Multilevel Hypergraph Partitioning.</title>
<pages>1:1-1:19</pages>
<year>2018</year>
<booktitle>SEA</booktitle>
<ee type="oa">https://doi.org/10.4230/LIPIcs.SEA.2018.1</ee>
<crossref>conf/wea/2018</crossref>
<url>db/conf/wea/sea2018.html#Heuer0S18</url>
</inproceedings>
</r>
<r><inproceedings key="conf/wea/Buchhold0W18" mdate="2018-08-23">
<author pid="173/5447">Valentin Buchhold</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="w/DorotheaWagner">Dorothea Wagner</author>
<title>Real-Time Traffic Assignment Using Fast Queries in Customizable Contraction Hierarchies.</title>
<pages>27:1-27:15</pages>
<year>2018</year>
<booktitle>SEA</booktitle>
<ee type="oa">https://doi.org/10.4230/LIPIcs.SEA.2018.27</ee>
<crossref>conf/wea/2018</crossref>
<url>db/conf/wea/sea2018.html#Buchhold0W18</url>
</inproceedings>
</r>
<r><inproceedings key="journals/corr/abs-1803-10328" mdate="2026-01-05">
<author orcid="0000-0002-9672-3291" pid="b/BBeckert">Bernhard Beckert</author>
<author pid="129/6546">Timo Bingmann</author>
<author pid="189/1087">Moritz Kiefer</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author orcid="0000-0002-2350-1831" pid="73/9580">Mattias Ulbrich</author>
<author orcid="0000-0001-8446-4598" pid="170/0399">Alexander Weigl</author>
<title>Proving Equivalence Between Imperative and MapReduce Implementations Using Program Transformations.</title>
<booktitle>MARS/VPT</booktitle>
<year>2018</year>
<pages>185-199</pages>
<crossref>journals/corr/abs-1803-08668</crossref>
<ee type="oa">https://doi.org/10.4204/EPTCS.268.7</ee>
<ee type="oa">http://arxiv.org/abs/1803.10328</ee>
<url>db/series/eptcs/eptcs268.html#abs-1803-10328</url>
</inproceedings>
</r>
<r><proceedings key="conf/siamcsc/2018" mdate="2019-10-29">
<editor pid="m/FredrikManne">Fredrik Manne</editor>
<editor pid="s/PeterSanders">Peter Sanders 0001</editor>
<editor pid="33/6491">Sivan Toledo</editor>
<title>Proceedings of the Eighth SIAM Workshop on Combinatorial Scientific Computing, CSC 2018, Bergen, Norway, June 6-8, 2018.</title>
<booktitle>CSC</booktitle>
<publisher>SIAM</publisher>
<year>2018</year>
<isbn>978-1-61197-521-5</isbn>
<ee>https://doi.org/10.1137/1.9781611975215</ee>
<url>db/conf/siamcsc/siamcsc2018.html</url>
</proceedings>
</r>
<r><incollection publtype="encyclopedia" key="reference/snam/BaderKM00W18" mdate="2019-10-19">
<author orcid="0000-0002-7380-5876" pid="41/3005">David A. Bader</author>
<author pid="128/4179">Andrea Kappes</author>
<author pid="55/3065">Henning Meyerhenke</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="10/1388-3">Christian Schulz 0003</author>
<author pid="w/DorotheaWagner">Dorothea Wagner</author>
<title>Benchmarking for Graph Clustering and Partitioning.</title>
<year>2018</year>
<booktitle>Encyclopedia of Social Network Analysis and Mining. 2nd Ed.</booktitle>
<ee>https://doi.org/10.1007/978-1-4939-7131-2_23</ee>
<crossref>reference/snam/2018</crossref>
<url>db/reference/snam/snam2018.html#BaderKM00W18</url>
</incollection>
</r>
<r><article publtype="informal" key="journals/corr/abs-1801-08766" mdate="2018-08-13">
<author pid="b/BBeckert">Bernhard Beckert</author>
<author pid="129/6546">Timo Bingmann</author>
<author pid="189/1087">Moritz Kiefer</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="73/9580">Mattias Ulbrich</author>
<author pid="170/0399">Alexander Weigl</author>
<title>Relational Equivalence Proofs Between Imperative and MapReduce Algorithms.</title>
<year>2018</year>
<volume>abs/1801.08766</volume>
<journal>CoRR</journal>
<ee type="oa">http://arxiv.org/abs/1801.08766</ee>
<url>db/journals/corr/corr1801.html#abs-1801-08766</url>
</article>
</r>
<r><article publtype="informal" key="journals/corr/abs-1802-03587" mdate="2018-08-13">
<author pid="172/1146">Tobias Heuer</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="139/4269">Sebastian Schlag</author>
<title>Network Flow-Based Refinement for Multilevel Hypergraph Partitioning.</title>
<year>2018</year>
<volume>abs/1802.03587</volume>
<journal>CoRR</journal>
<ee type="oa">http://arxiv.org/abs/1802.03587</ee>
<url>db/journals/corr/corr1802.html#abs-1802-03587</url>
</article>
</r>
<r><article publtype="informal" key="journals/corr/abs-1808-04602" mdate="2018-09-02">
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>Hashing with Linear Probing and Referential Integrity.</title>
<year>2018</year>
<volume>abs/1808.04602</volume>
<journal>CoRR</journal>
<ee type="oa">http://arxiv.org/abs/1808.04602</ee>
<url>db/journals/corr/corr1808.html#abs-1808-04602</url>
</article>
</r>
<r><article key="journals/algorithmica/BingmannES17" mdate="2017-05-17">
<author pid="129/6546">Timo Bingmann</author>
<author pid="143/7185">Andreas Eberle</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>Engineering Parallel String Sorting.</title>
<pages>235-286</pages>
<year>2017</year>
<volume>77</volume>
<journal>Algorithmica</journal>
<number>1</number>
<ee>https://doi.org/10.1007/s00453-015-0071-1</ee>
<url>db/journals/algorithmica/algorithmica77.html#BingmannES17</url>
</article>
</r>
<r><article key="journals/heuristics/LammSSSW17" mdate="2019-12-27">
<author pid="159/1660">Sebastian Lamm</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author orcid="0000-0002-2823-3506" pid="10/1388-3">Christian Schulz 0003</author>
<author orcid="0000-0001-7095-8749" pid="18/3295">Darren Strash</author>
<author pid="63/3747">Renato F. Werneck</author>
<title>Finding near-optimal independent sets at scale.</title>
<pages>207-229</pages>
<year>2017</year>
<volume>23</volume>
<journal>J. Heuristics</journal>
<number>4</number>
<ee>https://doi.org/10.1007/s10732-017-9337-x</ee>
<url>db/journals/heuristics/heuristics23.html#LammSSSW17</url>
</article>
</r>
<r><article key="journals/tpds/MeyerhenkeSS17" mdate="2020-10-02">
<author orcid="0000-0002-7769-726X" pid="55/3065">Henning Meyerhenke</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author orcid="0000-0002-2823-3506" pid="10/1388-3">Christian Schulz 0003</author>
<title>Parallel Graph Partitioning for Complex Networks.</title>
<pages>2625-2638</pages>
<year>2017</year>
<volume>28</volume>
<journal>IEEE Trans. Parallel Distributed Syst.</journal>
<number>9</number>
<ee>https://doi.org/10.1109/TPDS.2017.2671868</ee>
<ee>http://doi.ieeecomputersociety.org/10.1109/TPDS.2017.2671868</ee>
<url>db/journals/tpds/tpds28.html#MeyerhenkeSS17</url>
</article>
</r>
<r><inproceedings key="conf/alenex/AkhremtsevH0S17" mdate="2019-06-02">
<author pid="144/7382">Yaroslav Akhremtsev</author>
<author pid="172/1146">Tobias Heuer</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="139/4269">Sebastian Schlag</author>
<title>Engineering a direct <i>k</i>-way Hypergraph Partitioning Algorithm.</title>
<pages>28-42</pages>
<year>2017</year>
<booktitle>ALENEX</booktitle>
<ee>https://doi.org/10.1137/1.9781611974768.3</ee>
<ee>https://www.wikidata.org/entity/Q60043532</ee>
<crossref>conf/alenex/2017</crossref>
<url>db/conf/alenex/alenex2017.html#AkhremtsevH0S17</url>
</inproceedings>
</r>
<r><inproceedings key="conf/alenex/Axtmann017" mdate="2017-05-19">
<author pid="153/2031">Michael Axtmann</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>Robust Massively Parallel Sorting.</title>
<pages>83-97</pages>
<year>2017</year>
<booktitle>ALENEX</booktitle>
<ee>https://doi.org/10.1137/1.9781611974768.7</ee>
<crossref>conf/alenex/2017</crossref>
<url>db/conf/alenex/alenex2017.html#Axtmann017</url>
</inproceedings>
</r>
<r><inproceedings key="conf/alenex/0001K017" mdate="2020-10-25">
<author pid="90/834-1">Johannes Fischer 0001</author>
<author orcid="0000-0002-2379-9455" pid="163/4161">Florian Kurpicz</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>Engineering a Distributed Full-Text Index.</title>
<pages>120-134</pages>
<year>2017</year>
<booktitle>ALENEX</booktitle>
<ee>https://doi.org/10.1137/1.9781611974768.10</ee>
<crossref>conf/alenex/2017</crossref>
<url>db/conf/alenex/alenex2017.html#0001K017</url>
</inproceedings>
</r>
<r><inproceedings key="conf/alenex/FunkeS17" mdate="2017-05-19">
<author pid="06/8509">Daniel Funke</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>Parallel <i>d</i>-D Delaunay Triangulations in Shared and Distributed Memory.</title>
<pages>207-217</pages>
<year>2017</year>
<booktitle>ALENEX</booktitle>
<ee>https://doi.org/10.1137/1.9781611974768.17</ee>
<crossref>conf/alenex/2017</crossref>
<url>db/conf/alenex/alenex2017.html#FunkeS17</url>
</inproceedings>
</r>
<r><inproceedings key="conf/esa/AxtmannWF017" mdate="2018-08-23">
<author pid="153/2031">Michael Axtmann</author>
<author pid="161/9821">Sascha Witt</author>
<author pid="176/5263">Daniel Ferizovic</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>In-Place Parallel Super Scalar Samplesort (IPSSSSo).</title>
<pages>9:1-9:14</pages>
<year>2017</year>
<booktitle>ESA</booktitle>
<ee type="oa">https://doi.org/10.4230/LIPIcs.ESA.2017.9</ee>
<crossref>conf/esa/2017</crossref>
<url>db/conf/esa/esa2017.html#AxtmannWF017</url>
</inproceedings>
</r>
<r><inproceedings key="conf/esa/Maier017" mdate="2018-08-23">
<author pid="81/910">Tobias Maier</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>Dynamic Space Efficient Hashing.</title>
<pages>58:1-58:14</pages>
<year>2017</year>
<booktitle>ESA</booktitle>
<ee type="oa">https://doi.org/10.4230/LIPIcs.ESA.2017.58</ee>
<crossref>conf/esa/2017</crossref>
<url>db/conf/esa/esa2017.html#Maier017</url>
</inproceedings>
</r>
<r><inproceedings key="conf/gecco/00010SW17" mdate="2019-12-27">
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author orcid="0000-0002-2823-3506" pid="10/1388-3">Christian Schulz 0003</author>
<author orcid="0000-0001-7095-8749" pid="18/3295">Darren Strash</author>
<author pid="195/5540">Robert Williger</author>
<title>Distributed evolutionary <i>k</i>-way node separators.</title>
<pages>345-352</pages>
<year>2017</year>
<booktitle>GECCO</booktitle>
<ee>https://doi.org/10.1145/3071178.3071204</ee>
<crossref>conf/gecco/2017</crossref>
<url>db/conf/gecco/gecco2017.html#00010SW17</url>
</inproceedings>
</r>
<r><article publtype="informal" key="journals/corr/00010SW17" mdate="2018-08-13">
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="10/1388-3">Christian Schulz 0003</author>
<author pid="18/3295">Darren Strash</author>
<author pid="195/5540">Robert Williger</author>
<title>Distributed Evolutionary k-way Node Separators.</title>
<year>2017</year>
<volume>abs/1702.01692</volume>
<journal>CoRR</journal>
<ee type="oa">http://arxiv.org/abs/1702.01692</ee>
<url>db/journals/corr/corr1702.html#00010SW17</url>
</article>
</r>
<r><article publtype="informal" key="journals/corr/Arz0SM17" mdate="2018-08-13">
<author pid="126/4652">Julian Arz</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="142/5460">Johannes Stegmaier</author>
<author pid="82/4675">Ralf Mikut</author>
<title>3D Cell Nuclei Segmentation with Balanced Graph Partitioning.</title>
<year>2017</year>
<volume>abs/1702.05413</volume>
<journal>CoRR</journal>
<ee type="oa">http://arxiv.org/abs/1702.05413</ee>
<url>db/journals/corr/corr1702.html#Arz0SM17</url>
</article>
</r>
<r><article publtype="informal" key="journals/corr/MehlhornN017" mdate="2018-08-13">
<author pid="m/KurtMehlhorn">Kurt Mehlhorn</author>
<author pid="n/StefanNaher">Stefan N&#228;her</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>Engineering DFS-Based Graph Algorithms.</title>
<year>2017</year>
<volume>abs/1703.10023</volume>
<journal>CoRR</journal>
<ee type="oa">http://arxiv.org/abs/1703.10023</ee>
<url>db/journals/corr/corr1703.html#MehlhornN017</url>
</article>
</r>
<r><article publtype="informal" key="journals/corr/Maier017" mdate="2018-08-13">
<author pid="81/910">Tobias Maier</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>Dynamic Space Efficient Hashing.</title>
<year>2017</year>
<volume>abs/1705.00997</volume>
<journal>CoRR</journal>
<ee type="oa">http://arxiv.org/abs/1705.00997</ee>
<url>db/journals/corr/corr1705.html#Maier017</url>
</article>
</r>
<r><article publtype="informal" key="journals/corr/AxtmannWF017" mdate="2018-08-13">
<author pid="153/2031">Michael Axtmann</author>
<author pid="161/9821">Sascha Witt</author>
<author pid="176/5263">Daniel Ferizovic</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>In-place Parallel Super Scalar Samplesort (IPSSSSo).</title>
<year>2017</year>
<volume>abs/1705.02257</volume>
<journal>CoRR</journal>
<ee type="oa">http://arxiv.org/abs/1705.02257</ee>
<url>db/journals/corr/corr1705.html#AxtmannWF017</url>
</article>
</r>
<r><article publtype="informal" key="journals/corr/abs-1709-05183" mdate="2018-08-13">
<author pid="205/2346">Demian Hespe</author>
<author pid="134/4153">Martin Weidner</author>
<author pid="90/7867">Jonathan Dees</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>Fast OLAP Query Execution in Main Memory on Large Data in a Cluster.</title>
<year>2017</year>
<volume>abs/1709.05183</volume>
<journal>CoRR</journal>
<ee type="oa">http://arxiv.org/abs/1709.05183</ee>
<url>db/journals/corr/corr1709.html#abs-1709-05183</url>
</article>
</r>
<r><article publtype="informal" key="journals/corr/abs-1710-07565" mdate="2018-08-13">
<author pid="06/8509">Daniel Funke</author>
<author pid="159/1660">Sebastian Lamm</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="10/1388-3">Christian Schulz 0003</author>
<author pid="18/3295">Darren Strash</author>
<author pid="157/8455">Moritz von Looz</author>
<title>Communication-free Massively Distributed Graph Generation.</title>
<year>2017</year>
<volume>abs/1710.07565</volume>
<journal>CoRR</journal>
<ee type="oa">http://arxiv.org/abs/1710.07565</ee>
<url>db/journals/corr/corr1710.html#abs-1710-07565</url>
</article>
</r>
<r><article publtype="informal" key="journals/corr/abs-1710-08027" mdate="2018-08-13">
<author pid="153/2031">Michael Axtmann</author>
<author pid="207/8283">Armin Wiebigke</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>Lightweight MPI Communicators with Applications to Perfectly Balanced Schizophrenic Quicksort.</title>
<year>2017</year>
<volume>abs/1710.08027</volume>
<journal>CoRR</journal>
<ee type="oa">http://arxiv.org/abs/1710.08027</ee>
<url>db/journals/corr/corr1710.html#abs-1710-08027</url>
</article>
</r>
<r><article publtype="informal" key="journals/corr/abs-1710-08231" mdate="2018-08-13">
<author pid="144/7382">Yaroslav Akhremtsev</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="10/1388-3">Christian Schulz 0003</author>
<title>High-Quality Shared-Memory Graph Partitioning.</title>
<year>2017</year>
<volume>abs/1710.08231</volume>
<journal>CoRR</journal>
<ee type="oa">http://arxiv.org/abs/1710.08231</ee>
<url>db/journals/corr/corr1710.html#abs-1710-08231</url>
</article>
</r>
<r><article publtype="informal" key="journals/corr/abs-1710-08255" mdate="2018-08-13">
<author pid="151/1543">Lorenz H&#252;bschle-Schneider</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>Communication Efficient Checking of Big Data Operations.</title>
<year>2017</year>
<volume>abs/1710.08255</volume>
<journal>CoRR</journal>
<ee type="oa">http://arxiv.org/abs/1710.08255</ee>
<url>db/journals/corr/corr1710.html#abs-1710-08255</url>
</article>
</r>
<r><article key="journals/heuristics/MeyerhenkeS016" mdate="2019-12-27">
<author orcid="0000-0002-7769-726X" pid="55/3065">Henning Meyerhenke</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author orcid="0000-0002-2823-3506" pid="10/1388-3">Christian Schulz 0003</author>
<title>Partitioning (hierarchically clustered) complex networks via size-constrained graph clustering.</title>
<pages>759-782</pages>
<year>2016</year>
<volume>22</volume>
<journal>J. Heuristics</journal>
<number>5</number>
<ee>https://doi.org/10.1007/s10732-016-9315-8</ee>
<url>db/journals/heuristics/heuristics22.html#MeyerhenkeS016</url>
</article>
</r>
<r><article key="journals/ipl/Sanders016" mdate="2019-12-27">
<author orcid="0000-0003-3330-9349" pid="s/PeterSanders">Peter Sanders 0001</author>
<author orcid="0000-0002-2823-3506" pid="10/1388-3">Christian Schulz 0003</author>
<title>Scalable generation of scale-free graphs.</title>
<pages>489-491</pages>
<year>2016</year>
<volume>116</volume>
<journal>Inf. Process. Lett.</journal>
<number>7</number>
<ee>https://doi.org/10.1016/j.ipl.2016.02.004</ee>
<url>db/journals/ipl/ipl116.html#Sanders016</url>
</article>
</r>
<r><article key="journals/jea/0001Z16" mdate="2020-06-25">
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="73/3395">Norbert Zeh</author>
<title>Introduction to Special Issue ALENEX 2013.</title>
<pages>2.1:1-2.1:2</pages>
<year>2016</year>
<volume>21</volume>
<journal>ACM J. Exp. Algorithmics</journal>
<number>1</number>
<ee>https://doi.org/10.1145/2966922</ee>
<url>db/journals/jea/jea21.html#0001Z16</url>
</article>
</r>
<r><article key="journals/topc/HeideSS16" mdate="2020-04-25">
<author pid="h/FMaufderHeide">Friedhelm Meyer auf der Heide</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="51/947">Nodari Sitchinava</author>
<title>Introduction to the Special Issue on SPAA 2014.</title>
<pages>1:1-1:2</pages>
<year>2016</year>
<volume>3</volume>
<journal>ACM Trans. Parallel Comput.</journal>
<number>1</number>
<ee>https://doi.org/10.1145/2936716</ee>
<url>db/journals/topc/topc3.html#HeideSS16</url>
</article>
</r>
<r><inproceedings key="conf/alenex/SchlagHHMS016" mdate="2019-06-02">
<author pid="139/4269">Sebastian Schlag</author>
<author pid="163/2048">Vitali Henne</author>
<author pid="172/1146">Tobias Heuer</author>
<author pid="55/3065">Henning Meyerhenke</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="10/1388-3">Christian Schulz 0003</author>
<title><i>k</i>-way Hypergraph Partitioning via <i>n</i>-Level Recursive Bisection.</title>
<pages>53-67</pages>
<year>2016</year>
<booktitle>ALENEX</booktitle>
<ee>https://doi.org/10.1137/1.9781611974317.5</ee>
<ee>https://www.wikidata.org/entity/Q60043533</ee>
<crossref>conf/alenex/2016</crossref>
<url>db/conf/alenex/alenex2016.html#SchlagHHMS016</url>
</inproceedings>
</r>
<r><inproceedings key="conf/alenex/LammS0SW16" mdate="2018-11-02">
<author pid="159/1660">Sebastian Lamm</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="10/1388-3">Christian Schulz 0003</author>
<author orcid="0000-0001-7095-8749" pid="18/3295">Darren Strash</author>
<author pid="63/3747">Renato F. Werneck</author>
<title>Finding Near-Optimal Independent Sets at Scale.</title>
<pages>138-150</pages>
<year>2016</year>
<booktitle>ALENEX</booktitle>
<ee>https://doi.org/10.1137/1.9781611974317.12</ee>
<crossref>conf/alenex/2016</crossref>
<url>db/conf/alenex/alenex2016.html#LammS0SW16</url>
</inproceedings>
</r>
<r><inproceedings key="conf/bigdataconf/BingmannAJLNNSS16" mdate="2021-03-31">
<author pid="129/6546">Timo Bingmann</author>
<author pid="153/2031">Michael Axtmann</author>
<author pid="153/1085">Emanuel J&#246;bstl</author>
<author pid="159/1660">Sebastian Lamm</author>
<author pid="185/1021">Huyen Chau Nguyen</author>
<author pid="154/6650">Alexander Noe</author>
<author pid="139/4269">Sebastian Schlag</author>
<author pid="11/10894">Matthias Stumpp</author>
<author pid="150/6694">Tobias Sturm</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>Thrill: High-performance algorithmic distributed batch data processing with C++.</title>
<pages>172-183</pages>
<year>2016</year>
<booktitle>IEEE BigData</booktitle>
<ee>https://doi.org/10.1109/BigData.2016.7840603</ee>
<crossref>conf/bigdataconf/2016</crossref>
<url>db/conf/bigdataconf/bigdataconf2016.html#BingmannAJLNNSS16</url>
</inproceedings>
</r>
<r><inproceedings key="conf/hipc/Akhremtsev016" mdate="2023-03-24">
<author pid="144/7382">Yaroslav Akhremtsev</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>Fast Parallel Operations on Search Trees.</title>
<pages>291-300</pages>
<year>2016</year>
<booktitle>HiPC</booktitle>
<ee>https://doi.org/10.1109/HiPC.2016.042</ee>
<ee>https://doi.ieeecomputersociety.org/10.1109/HiPC.2016.042</ee>
<crossref>conf/hipc/2016</crossref>
<url>db/conf/hipc/hipc2016.html#Akhremtsev016</url>
</inproceedings>
</r>
<r><inproceedings key="conf/ipps/Hubschle-Schneider16" mdate="2023-03-24">
<author orcid="0000-0002-4315-3264" pid="151/1543">Lorenz H&#252;bschle-Schneider</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>Communication Efficient Algorithms for Top-k Selection Problems.</title>
<pages>659-668</pages>
<year>2016</year>
<booktitle>IPDPS</booktitle>
<ee>https://doi.org/10.1109/IPDPS.2016.45</ee>
<ee>https://doi.ieeecomputersociety.org/10.1109/IPDPS.2016.45</ee>
<crossref>conf/ipps/2016</crossref>
<url>db/conf/ipps/ipdps2016.html#Hubschle-Schneider16</url>
</inproceedings>
</r>
<r><inproceedings key="conf/isbi/StegmaierASOKNS16" mdate="2023-06-26">
<author orcid="0000-0003-4072-3759" pid="142/5460">Johannes Stegmaier</author>
<author pid="126/4652">Julian Arz</author>
<author pid="176/5604">Benjamin Schott</author>
<author pid="48/11159">Jens C. Otte</author>
<author pid="179/2678">Andrei Kobitski</author>
<author orcid="0000-0002-5027-3192" pid="179/2250">G. Ulrich Nienhaus</author>
<author pid="22/8429">Uwe Str&#228;hle</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author orcid="0000-0001-9100-5496" pid="82/4675">Ralf Mikut</author>
<title>Generating semi-synthetic validation benchmarks for embryomics.</title>
<pages>684-688</pages>
<year>2016</year>
<booktitle>ISBI</booktitle>
<ee>https://doi.org/10.1109/ISBI.2016.7493359</ee>
<crossref>conf/isbi/2016</crossref>
<url>db/conf/isbi/isbi2016.html#StegmaierASOKNS16</url>
</inproceedings>
</r>
<r><inproceedings key="conf/ppopp/MaierSD16" mdate="2022-06-12">
<author pid="81/910">Tobias Maier</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="d/RomanDementiev">Roman Dementiev</author>
<title>Concurrent hash tables: fast <i>and</i> general?(!).</title>
<pages>34:1-34:2</pages>
<year>2016</year>
<booktitle>PPoPP</booktitle>
<ee>https://doi.org/10.1145/2851141.2851188</ee>
<ee>https://doi.org/10.1145/3016078.2851188</ee>
<crossref>conf/ppopp/2016</crossref>
<url>db/conf/ppopp/ppopp2016.html#MaierSD16</url>
</inproceedings>
</r>
<r><inproceedings key="conf/wea/DahlumLS0SW16" mdate="2019-12-27">
<author pid="176/5462">Jakob Dahlum</author>
<author pid="159/1660">Sebastian Lamm</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author orcid="0000-0002-2823-3506" pid="10/1388-3">Christian Schulz 0003</author>
<author orcid="0000-0001-7095-8749" pid="18/3295">Darren Strash</author>
<author pid="63/3747">Renato F. Werneck</author>
<title>Accelerating Local Search for the Maximum Independent Set Problem.</title>
<pages>118-133</pages>
<year>2016</year>
<booktitle>SEA</booktitle>
<ee>https://doi.org/10.1007/978-3-319-38851-9_9</ee>
<crossref>conf/wea/2016</crossref>
<url>db/conf/wea/sea2016.html#DahlumLS0SW16</url>
</inproceedings>
</r>
<r><inproceedings key="conf/wea/Sanders016" mdate="2019-12-27">
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author orcid="0000-0002-2823-3506" pid="10/1388-3">Christian Schulz 0003</author>
<title>Advanced Multilevel Node Separator Algorithms.</title>
<pages>294-309</pages>
<year>2016</year>
<booktitle>SEA</booktitle>
<ee>https://doi.org/10.1007/978-3-319-38851-9_20</ee>
<crossref>conf/wea/2016</crossref>
<url>db/conf/wea/sea2016.html#Sanders016</url>
</inproceedings>
</r>
<r><incollection key="series/lncs/BastDGMPSWW16" mdate="2018-11-14">
<author pid="b/HannahBast">Hannah Bast</author>
<author pid="10/5981">Daniel Delling</author>
<author pid="g/AndrewVGoldberg">Andrew V. Goldberg</author>
<author orcid="0000-0001-6976-0006" pid="37/5076">Matthias M&#252;ller-Hannemann</author>
<author pid="99/5937">Thomas Pajor</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="w/DorotheaWagner">Dorothea Wagner</author>
<author pid="63/3747">Renato F. Werneck</author>
<title>Route Planning in Transportation Networks.</title>
<pages>19-80</pages>
<year>2016</year>
<booktitle>Algorithm Engineering</booktitle>
<ee>https://doi.org/10.1007/978-3-319-49487-6_2</ee>
<ee>https://www.wikidata.org/entity/Q57013106</ee>
<crossref>series/lncs/9220</crossref>
<url>db/series/lncs/lncs9220.html#BastDGMPSWW16</url>
</incollection>
</r>
<r><incollection key="series/lncs/BulucMSS016" mdate="2021-04-09">
<author orcid="0000-0001-7253-9038" pid="80/1552">Aydin Bulu&#231;</author>
<author orcid="0000-0002-7769-726X" pid="55/3065">Henning Meyerhenke</author>
<author orcid="0000-0001-6284-7408" pid="64/5096">Ilya Safro</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author orcid="0000-0002-2823-3506" pid="10/1388-3">Christian Schulz 0003</author>
<title>Recent Advances in Graph Partitioning.</title>
<pages>117-158</pages>
<year>2016</year>
<booktitle>Algorithm Engineering</booktitle>
<ee>https://doi.org/10.1007/978-3-319-49487-6_4</ee>
<crossref>series/lncs/9220</crossref>
<url>db/series/lncs/lncs9220.html#BulucMSS016</url>
</incollection>
</r>
<r><book key="series/lncs/9220" mdate="2025-11-02">
<editor pid="37/5165">Lasse Kliemann</editor>
<editor pid="s/PeterSanders">Peter Sanders 0001</editor>
<title>Algorithm Engineering - Selected Results and Surveys</title>
<booktitle>Algorithm Engineering</booktitle>
<year>2016</year>
<series href="db/series/lncs/index.html">Lecture Notes in Computer Science</series>
<volume>9220</volume>
<isbn>978-3-319-49486-9</isbn>
<ee>https://doi.org/10.1007/978-3-319-49487-6</ee>
<ee>https://www.wikidata.org/entity/Q136491215</ee>
<url>db/series/lncs/lncs9220.html</url>
</book>
</r>
<r><article publtype="informal" key="journals/corr/MaierSD16" mdate="2018-08-13">
<author pid="81/910">Tobias Maier</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="d/RomanDementiev">Roman Dementiev</author>
<title>Concurrent Hash Tables: Fast and General?(!).</title>
<year>2016</year>
<volume>abs/1601.04017</volume>
<journal>CoRR</journal>
<ee type="oa">http://arxiv.org/abs/1601.04017</ee>
<url>db/journals/corr/corr1601.html#MaierSD16</url>
</article>
</r>
<r><article publtype="informal" key="journals/corr/DahlumLS0SW16" mdate="2018-08-13">
<author pid="176/5462">Jakob Dahlum</author>
<author pid="159/1660">Sebastian Lamm</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="10/1388-3">Christian Schulz 0003</author>
<author pid="18/3295">Darren Strash</author>
<author pid="63/3747">Renato F. Werneck</author>
<title>Accelerating Local Search for the Maximum Independent Set Problem.</title>
<year>2016</year>
<volume>abs/1602.01659</volume>
<journal>CoRR</journal>
<ee type="oa">http://arxiv.org/abs/1602.01659</ee>
<url>db/journals/corr/corr1602.html#DahlumLS0SW16</url>
</article>
</r>
<r><article publtype="informal" key="journals/corr/Sanders016" mdate="2018-08-13">
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="10/1388-3">Christian Schulz 0003</author>
<title>Scalable Generation of Scale-free Graphs.</title>
<year>2016</year>
<volume>abs/1602.07106</volume>
<journal>CoRR</journal>
<ee type="oa">http://arxiv.org/abs/1602.07106</ee>
<url>db/journals/corr/corr1602.html#Sanders016</url>
</article>
</r>
<r><article publtype="informal" key="journals/corr/StegmaierASOKNS16" mdate="2018-08-13">
<author pid="142/5460">Johannes Stegmaier</author>
<author pid="126/4652">Julian Arz</author>
<author pid="176/5604">Benjamin Schott</author>
<author pid="48/11159">Jens C. Otte</author>
<author pid="179/2678">Andrei Kobitski</author>
<author pid="179/2250">G. Ulrich Nienhaus</author>
<author pid="22/8429">Uwe Str&#228;hle</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="82/4675">Ralf Mikut</author>
<title>Generating Semi-Synthetic Validation Benchmarks for Embryomics.</title>
<year>2016</year>
<volume>abs/1604.04906</volume>
<journal>CoRR</journal>
<ee type="oa">http://arxiv.org/abs/1604.04906</ee>
<url>db/journals/corr/corr1604.html#StegmaierASOKNS16</url>
</article>
</r>
<r><article publtype="informal" key="journals/corr/AxtmannS16" mdate="2018-08-13">
<author pid="153/2031">Michael Axtmann</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>Robust Massively Parallel Sorting.</title>
<year>2016</year>
<volume>abs/1606.08766</volume>
<journal>CoRR</journal>
<ee type="oa">http://arxiv.org/abs/1606.08766</ee>
<url>db/journals/corr/corr1606.html#AxtmannS16</url>
</article>
</r>
<r><article publtype="informal" key="journals/corr/BingmannAJLNNSS16" mdate="2018-08-13">
<author pid="129/6546">Timo Bingmann</author>
<author pid="153/2031">Michael Axtmann</author>
<author pid="153/1085">Emanuel J&#246;bstl</author>
<author pid="159/1660">Sebastian Lamm</author>
<author pid="185/1021">Huyen Chau Nguyen</author>
<author pid="154/6650">Alexander Noe</author>
<author pid="139/4269">Sebastian Schlag</author>
<author pid="11/10894">Matthias Stumpp</author>
<author pid="150/6694">Tobias Sturm</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>Thrill: High-Performance Algorithmic Distributed Batch Data Processing with C++.</title>
<year>2016</year>
<volume>abs/1608.05634</volume>
<journal>CoRR</journal>
<ee type="oa">http://arxiv.org/abs/1608.05634</ee>
<url>db/journals/corr/corr1608.html#BingmannAJLNNSS16</url>
</article>
</r>
<r><article publtype="informal" key="journals/corr/0001KS16" mdate="2018-08-13">
<author pid="90/834-1">Johannes Fischer 0001</author>
<author pid="163/4161">Florian Kurpicz</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>Engineering a Distributed Full-Text Index.</title>
<year>2016</year>
<volume>abs/1610.03332</volume>
<journal>CoRR</journal>
<ee type="oa">http://arxiv.org/abs/1610.03332</ee>
<url>db/journals/corr/corr1610.html#0001KS16</url>
</article>
</r>
<r><article publtype="informal" key="journals/corr/SandersLHSD16" mdate="2018-08-13">
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="159/1660">Sebastian Lamm</author>
<author pid="151/1543">Lorenz H&#252;bschle-Schneider</author>
<author pid="183/8759">Emanuel Schrade</author>
<author pid="22/4239">Carsten Dachsbacher</author>
<title>Efficient Random Sampling - Parallel, Vectorized, Cache-Efficient, and Online.</title>
<year>2016</year>
<volume>abs/1610.05141</volume>
<journal>CoRR</journal>
<ee type="oa">http://arxiv.org/abs/1610.05141</ee>
<url>db/journals/corr/corr1610.html#SandersLHSD16</url>
</article>
</r>
<r><article key="journals/topc/SandersSS15" mdate="2020-04-25">
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="28/6353">Jochen Speck</author>
<author pid="132/3988">Raoul Steffen</author>
<title>Work-Efficient Matrix Inversion in Polylogarithmic Time.</title>
<pages>15:1-15:29</pages>
<year>2015</year>
<volume>2</volume>
<journal>ACM Trans. Parallel Comput.</journal>
<number>3</number>
<ee>https://doi.org/10.1145/2809812</ee>
<url>db/journals/topc/topc2.html#SandersSS15</url>
</article>
</r>
<r><inproceedings key="conf/alenex/AkhremtsevS015" mdate="2017-05-19">
<author pid="144/7382">Yaroslav Akhremtsev</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="10/1388-3">Christian Schulz 0003</author>
<title>(Semi-)External Algorithms for Graph Partitioning and Clustering.</title>
<pages>33-43</pages>
<year>2015</year>
<booktitle>ALENEX</booktitle>
<ee>https://doi.org/10.1137/1.9781611973754.4</ee>
<crossref>conf/alenex/2015</crossref>
<url>db/conf/alenex/alenex2015.html#AkhremtsevS015</url>
</inproceedings>
</r>
<r><inproceedings key="conf/eenergy/LeibfriedMMNRSW15" mdate="2023-09-30">
<author pid="13/7977">Thomas Leibfried</author>
<author pid="32/4396">Tamara Mchedlidze</author>
<author pid="163/1804">Nico Meyer-H&#252;bner</author>
<author pid="41/4420">Martin N&#246;llenburg</author>
<author orcid="0000-0002-3794-4406" pid="99/44">Ignaz Rutter</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="w/DorotheaWagner">Dorothea Wagner</author>
<author orcid="0000-0001-5146-4145" pid="163/1869">Franziska Wegner</author>
<title>Operating Power Grids with Few Flow Control Buses.</title>
<pages>289-294</pages>
<year>2015</year>
<booktitle>e-Energy</booktitle>
<ee>https://doi.org/10.1145/2768510.2768521</ee>
<crossref>conf/eenergy/2015</crossref>
<url>db/conf/eenergy/eenergy2015.html#LeibfriedMMNRSW15</url>
</inproceedings>
</r>
<r><inproceedings key="conf/gis/AhujaBS0W15" mdate="2019-12-27">
<author pid="49/3122">Nitin Ahuja</author>
<author pid="b/MatthiasBender2">Matthias Bender 0002</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author orcid="0000-0002-2823-3506" pid="10/1388-3">Christian Schulz 0003</author>
<author pid="09/6351">Andreas Wagner</author>
<title>Incorporating road networks into territory design.</title>
<pages>4:1-4:10</pages>
<year>2015</year>
<booktitle>SIGSPATIAL/GIS</booktitle>
<ee>https://doi.org/10.1145/2820783.2820800</ee>
<crossref>conf/gis/2015</crossref>
<url>db/conf/gis/gis2015.html#AhujaBS0W15</url>
</inproceedings>
</r>
<r><inproceedings key="conf/icml/LiebigSSOF15" mdate="2023-03-10">
<author pid="94/3226">Thomas Liebig</author>
<author pid="74/9877">Sabine Storandt</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="10/4032">Walied Othman</author>
<author pid="f/StefanFunke">Stefan Funke</author>
<title>Report from Dagstuhl: SocioPaths - Multimodal Door-to-Door Route Planning via Social Paths.</title>
<pages>90-94</pages>
<year>2015</year>
<booktitle>MUD@ICML</booktitle>
<ee type="oa">https://ceur-ws.org/Vol-1392/paper-14.pdf</ee>
<crossref>conf/icml/2015mud</crossref>
<url>db/conf/icml/mud2015.html#LiebigSSOF15</url>
</inproceedings>
</r>
<r><inproceedings key="conf/ipps/MaierSS15" mdate="2023-03-24">
<author pid="81/910">Tobias Maier</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="28/6353">Jochen Speck</author>
<title>Locality Aware DAG-Scheduling for LU-Decomposition.</title>
<pages>82-92</pages>
<year>2015</year>
<booktitle>IPDPS</booktitle>
<ee>https://doi.org/10.1109/IPDPS.2015.85</ee>
<ee>https://doi.ieeecomputersociety.org/10.1109/IPDPS.2015.85</ee>
<crossref>conf/ipps/2015</crossref>
<url>db/conf/ipps/ipdps2015.html#MaierSS15</url>
</inproceedings>
</r>
<r><inproceedings key="conf/ipps/MeyerhenkeS015" mdate="2023-03-24">
<author orcid="0000-0002-7769-726X" pid="55/3065">Henning Meyerhenke</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author orcid="0000-0002-2823-3506" pid="10/1388-3">Christian Schulz 0003</author>
<title>Parallel Graph Partitioning for Complex Networks.</title>
<pages>1055-1064</pages>
<year>2015</year>
<booktitle>IPDPS</booktitle>
<ee>https://doi.org/10.1109/IPDPS.2015.18</ee>
<ee>https://doi.ieeecomputersociety.org/10.1109/IPDPS.2015.18</ee>
<crossref>conf/ipps/2015</crossref>
<url>db/conf/ipps/ipdps2015.html#MeyerhenkeS015</url>
</inproceedings>
</r>
<r><inproceedings key="conf/sat/BalyoSS15" mdate="2017-11-30">
<author pid="117/4925">Tom&#225;s Balyo</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="s/CarstenSinz">Carsten Sinz</author>
<title>HordeSat: A Massively Parallel Portfolio SAT Solver.</title>
<pages>156-172</pages>
<year>2015</year>
<booktitle>SAT</booktitle>
<ee>https://doi.org/10.1007/978-3-319-24318-4_12</ee>
<crossref>conf/sat/2015</crossref>
<url>db/conf/sat/sat2015.html#BalyoSS15</url>
</inproceedings>
</r>
<r><inproceedings key="conf/sigmod/0002SLLF15" mdate="2025-10-14">
<author orcid="0000-0001-8818-8324" pid="76/3160-2">Ingo M&#252;ller 0002</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="163/0557">Arnaud Lacurie</author>
<author orcid="0000-0001-8107-2775" pid="l/WLehner">Wolfgang Lehner</author>
<author pid="36/7116">Franz F&#228;rber</author>
<title>Cache-Efficient Aggregation: Hashing Is Sorting.</title>
<pages>1123-1136</pages>
<year>2015</year>
<booktitle>SIGMOD Conference</booktitle>
<ee>https://doi.org/10.1145/2723372.2747644</ee>
<crossref>conf/sigmod/2015</crossref>
<url>db/conf/sigmod/sigmod2015.html#0002SLLF15</url>
</inproceedings>
</r>
<r><inproceedings key="conf/spaa/AxtmannBS015" mdate="2019-12-27">
<author pid="153/2031">Michael Axtmann</author>
<author pid="129/6546">Timo Bingmann</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author orcid="0000-0002-2823-3506" pid="10/1388-3">Christian Schulz 0003</author>
<title>Practical Massively Parallel Sorting.</title>
<pages>13-23</pages>
<year>2015</year>
<booktitle>SPAA</booktitle>
<ee>https://doi.org/10.1145/2755573.2755595</ee>
<crossref>conf/spaa/2015</crossref>
<url>db/conf/spaa/spaa2015.html#AxtmannBS015</url>
</inproceedings>
</r>
<r><inproceedings key="conf/spaa/RihaniSD15" mdate="2018-11-06">
<author pid="154/6598">Hamza Rihani</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="d/RomanDementiev">Roman Dementiev</author>
<title>Brief Announcement: MultiQueues: Simple Relaxed Concurrent Priority Queues.</title>
<pages>80-82</pages>
<year>2015</year>
<booktitle>SPAA</booktitle>
<ee>https://doi.org/10.1145/2755573.2755616</ee>
<crossref>conf/spaa/2015</crossref>
<url>db/conf/spaa/spaa2015.html#RihaniSD15</url>
</inproceedings>
</r>
<r><inproceedings key="conf/spire/DimondS15" mdate="2017-05-24">
<author pid="154/6589">Jonathan Dimond</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>Faster Exact Search Using Document Clustering.</title>
<pages>1-12</pages>
<year>2015</year>
<booktitle>SPIRE</booktitle>
<ee>https://doi.org/10.1007/978-3-319-23826-5_1</ee>
<crossref>conf/spire/2015</crossref>
<url>db/conf/spire/spire2015.html#DimondS15</url>
</inproceedings>
</r>
<r><inproceedings key="conf/stacs/Sanders15" mdate="2018-08-23">
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>Parallel Algorithms Reconsidered (Invited Talk).</title>
<pages>10-18</pages>
<year>2015</year>
<booktitle>STACS</booktitle>
<ee type="oa">https://doi.org/10.4230/LIPIcs.STACS.2015.10</ee>
<crossref>conf/stacs/2015</crossref>
<url>db/conf/stacs/stacs2015.html#Sanders15</url>
</inproceedings>
</r>
<r><inproceedings key="conf/wea/BingmannKS15" mdate="2017-05-17">
<author pid="129/6546">Timo Bingmann</author>
<author pid="162/0191">Thomas Keh</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>A Bulk-Parallel Priority Queue in External Memory with STXXL.</title>
<pages>28-40</pages>
<year>2015</year>
<booktitle>SEA</booktitle>
<ee>https://doi.org/10.1007/978-3-319-20086-6_3</ee>
<crossref>conf/wea/2015</crossref>
<url>db/conf/wea/sea2015.html#BingmannKS15</url>
</inproceedings>
</r>
<r><inproceedings key="conf/wea/LammS015" mdate="2019-12-27">
<author pid="159/1660">Sebastian Lamm</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author orcid="0000-0002-2823-3506" pid="10/1388-3">Christian Schulz 0003</author>
<title>Graph Partitioning for Independent Sets.</title>
<pages>68-81</pages>
<year>2015</year>
<booktitle>SEA</booktitle>
<ee>https://doi.org/10.1007/978-3-319-20086-6_6</ee>
<crossref>conf/wea/2015</crossref>
<url>db/conf/wea/sea2015.html#LammS015</url>
</inproceedings>
</r>
<r><article publtype="informal" key="journals/corr/LammS015" mdate="2018-08-13">
<author pid="159/1660">Sebastian Lamm</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="10/1388-3">Christian Schulz 0003</author>
<title>Graph Partitioning for Independent Sets.</title>
<year>2015</year>
<volume>abs/1502.01687</volume>
<journal>CoRR</journal>
<ee type="oa">http://arxiv.org/abs/1502.01687</ee>
<url>db/journals/corr/corr1502.html#LammS015</url>
</article>
</r>
<r><article publtype="informal" key="journals/corr/Hubschle-Schneider15" mdate="2018-08-13">
<author pid="151/1543">Lorenz H&#252;bschle-Schneider</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="76/3160-2">Ingo M&#252;ller 0002</author>
<title>Communication Efficient Algorithms for Top-k Selection Problems.</title>
<year>2015</year>
<volume>abs/1502.03942</volume>
<journal>CoRR</journal>
<ee type="oa">http://arxiv.org/abs/1502.03942</ee>
<url>db/journals/corr/corr1502.html#Hubschle-Schneider15</url>
</article>
</r>
<r><article publtype="informal" key="journals/corr/BingmannKS15" mdate="2018-08-13">
<author pid="129/6546">Timo Bingmann</author>
<author pid="162/0191">Thomas Keh</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>A Bulk-Parallel Priority Queue in External Memory with STXXL.</title>
<year>2015</year>
<volume>abs/1504.00545</volume>
<journal>CoRR</journal>
<ee type="oa">http://arxiv.org/abs/1504.00545</ee>
<url>db/journals/corr/corr1504.html#BingmannKS15</url>
</article>
</r>
<r><article publtype="informal" key="journals/corr/BastDGMPSWW15" mdate="2018-08-13">
<author pid="b/HannahBast">Hannah Bast</author>
<author pid="10/5981">Daniel Delling</author>
<author pid="g/AndrewVGoldberg">Andrew V. Goldberg</author>
<author pid="37/5076">Matthias M&#252;ller-Hannemann</author>
<author pid="99/5937">Thomas Pajor</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="w/DorotheaWagner">Dorothea Wagner</author>
<author pid="63/3747">Renato F. Werneck</author>
<title>Route Planning in Transportation Networks.</title>
<year>2015</year>
<volume>abs/1504.05140</volume>
<journal>CoRR</journal>
<ee type="oa">http://arxiv.org/abs/1504.05140</ee>
<url>db/journals/corr/corr1504.html#BastDGMPSWW15</url>
</article>
</r>
<r><article publtype="informal" key="journals/corr/AhujaBS0W15" mdate="2018-08-13">
<author pid="49/3122">Nitin Ahuja</author>
<author pid="b/MatthiasBender2">Matthias Bender 0002</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="10/1388-3">Christian Schulz 0003</author>
<author pid="09/6351">Andreas Wagner</author>
<title>Incorporating Road Networks into Territory Design.</title>
<year>2015</year>
<volume>abs/1504.07846</volume>
<journal>CoRR</journal>
<ee type="oa">http://arxiv.org/abs/1504.07846</ee>
<url>db/journals/corr/corr1504.html#AhujaBS0W15</url>
</article>
</r>
<r><article publtype="informal" key="journals/corr/HenneMSS015" mdate="2018-08-13">
<author pid="163/2048">Vitali Henne</author>
<author pid="55/3065">Henning Meyerhenke</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="139/4269">Sebastian Schlag</author>
<author pid="10/1388-3">Christian Schulz 0003</author>
<title>n-Level Hypergraph Partitioning.</title>
<year>2015</year>
<volume>abs/1505.00693</volume>
<journal>CoRR</journal>
<ee type="oa">http://arxiv.org/abs/1505.00693</ee>
<url>db/journals/corr/corr1505.html#HenneMSS015</url>
</article>
</r>
<r><article publtype="informal" key="journals/corr/BalyoSS15" mdate="2018-08-13">
<author pid="117/4925">Tom&#225;s Balyo</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="s/CarstenSinz">Carsten Sinz</author>
<title>HordeSat: A Massively Parallel Portfolio SAT Solver.</title>
<year>2015</year>
<volume>abs/1505.03340</volume>
<journal>CoRR</journal>
<ee type="oa">http://arxiv.org/abs/1505.03340</ee>
<url>db/journals/corr/corr1505.html#BalyoSS15</url>
</article>
</r>
<r><article publtype="informal" key="journals/corr/LeibfriedMMNRSW15" mdate="2018-08-13">
<author pid="13/7977">Thomas Leibfried</author>
<author pid="32/4396">Tamara Mchedlidze</author>
<author pid="163/1804">Nico Meyer-H&#252;bner</author>
<author pid="41/4420">Martin N&#246;llenburg</author>
<author pid="99/44">Ignaz Rutter</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="w/DorotheaWagner">Dorothea Wagner</author>
<author pid="163/1869">Franziska Wegner</author>
<title>Operating Power Grids with Few Flow Control Buses.</title>
<year>2015</year>
<volume>abs/1505.05747</volume>
<journal>CoRR</journal>
<ee type="oa">http://arxiv.org/abs/1505.05747</ee>
<url>db/journals/corr/corr1505.html#LeibfriedMMNRSW15</url>
</article>
</r>
<r><article publtype="informal" key="journals/corr/LammS0SW15" mdate="2018-08-13">
<author pid="159/1660">Sebastian Lamm</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="10/1388-3">Christian Schulz 0003</author>
<author pid="18/3295">Darren Strash</author>
<author pid="63/3747">Renato F. Werneck</author>
<title>Finding Near-Optimal Independent Sets at Scale.</title>
<year>2015</year>
<volume>abs/1509.00764</volume>
<journal>CoRR</journal>
<ee type="oa">http://arxiv.org/abs/1509.00764</ee>
<url>db/journals/corr/corr1509.html#LammS0SW15</url>
</article>
</r>
<r><article publtype="informal" key="journals/corr/Sanders015" mdate="2018-08-13">
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="10/1388-3">Christian Schulz 0003</author>
<title>Advanced Multilevel Node Separator Algorithms.</title>
<year>2015</year>
<volume>abs/1509.01190</volume>
<journal>CoRR</journal>
<ee type="oa">http://arxiv.org/abs/1509.01190</ee>
<url>db/journals/corr/corr1509.html#Sanders015</url>
</article>
</r>
<r><article publtype="informal" key="journals/corr/AkhremtsevS15" mdate="2018-08-13">
<author pid="144/7382">Yaroslav Akhremtsev</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>Fast Parallel Operations on Search Trees.</title>
<year>2015</year>
<volume>abs/1510.05433</volume>
<journal>CoRR</journal>
<ee type="oa">http://arxiv.org/abs/1510.05433</ee>
<url>db/journals/corr/corr1510.html#AkhremtsevS15</url>
</article>
</r>
<r><article publtype="informal" key="journals/corr/SchlagHHMS015" mdate="2018-08-13">
<author pid="139/4269">Sebastian Schlag</author>
<author pid="163/2048">Vitali Henne</author>
<author pid="172/1146">Tobias Heuer</author>
<author pid="55/3065">Henning Meyerhenke</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="10/1388-3">Christian Schulz 0003</author>
<title>k-way Hypergraph Partitioning via n-Level Recursive Bisection.</title>
<year>2015</year>
<volume>abs/1511.03137</volume>
<journal>CoRR</journal>
<ee type="oa">http://arxiv.org/abs/1511.03137</ee>
<url>db/journals/corr/corr1511.html#SchlagHHMS015</url>
</article>
</r>
<r><book key="books/daglib/0033948" mdate="2017-06-14">
<author orcid="0000-0001-5484-3474" pid="d/MartinDietzfelbinger">Martin Dietzfelbinger</author>
<author pid="m/KurtMehlhorn">Kurt Mehlhorn</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>Algorithmen und Datenstrukturen - die Grundwerkzeuge.</title>
<pages>I-XII, 1-380</pages>
<publisher>Springer</publisher>
<year>2014</year>
<series>eXamen.press</series>
<isbn>978-3-642-05471-6</isbn>
<ee>https://doi.org/10.1007/978-3-642-05472-3</ee>
</book>
</r>
<r><article key="journals/jea/SafroS014" mdate="2020-06-25">
<author orcid="0000-0001-6284-7408" pid="64/5096">Ilya Safro</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author orcid="0000-0002-2823-3506" pid="10/1388-3">Christian Schulz 0003</author>
<title>Advanced Coarsening Schemes for Graph Partitioning.</title>
<year>2014</year>
<volume>19</volume>
<journal>ACM J. Exp. Algorithmics</journal>
<number>1</number>
<ee>https://doi.org/10.1145/2670338</ee>
<url>db/journals/jea/jea19.html#SafroS014</url>
</article>
</r>
<r><article key="journals/ubiquity/Sanders14" mdate="2018-11-06">
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>Engineering Parallel Algorithms: The multicore transformation (Ubiquity symposium).</title>
<pages>4:1-4:11</pages>
<year>2014</year>
<volume>2014</volume>
<journal>Ubiquity</journal>
<number>July</number>
<ee>https://doi.org/10.1145/2618399</ee>
<url>db/journals/ubiquity/ubiquity2014.html#Sanders14</url>
</article>
</r>
<r><inproceedings key="conf/esa/MerzS14" mdate="2017-05-26">
<author pid="60/7861-3">Florian Merz 0003</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>PReaCH: A Fast Lightweight Reachability Index Using Pruning and Contraction Hierarchies.</title>
<pages>701-712</pages>
<year>2014</year>
<booktitle>ESA</booktitle>
<ee>https://doi.org/10.1007/978-3-662-44777-2_58</ee>
<crossref>conf/esa/2014</crossref>
<url>db/conf/esa/esa2014.html#MerzS14</url>
</inproceedings>
</r>
<r><inproceedings key="conf/gi/Sanders14" mdate="2024-10-14">
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>Algorithm Engineering for Big Data.</title>
<pages>57</pages>
<year>2014</year>
<booktitle>GI-Jahrestagung</booktitle>
<crossref>conf/gi/2014</crossref>
<url>db/conf/gi/gi2014.html#Sanders14</url>
<ee type="oa">https://dl.gi.de/handle/20.500.12116/2945</ee>
</inproceedings>
</r>
<r><inproceedings key="conf/wea/ErbKS14" mdate="2017-05-17">
<author pid="146/6104">Stephan Erb</author>
<author pid="65/8409">Moritz Kobitzsch</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>Parallel Bi-objective Shortest Paths Using Weight-Balanced B-trees with Bulk Updates.</title>
<pages>111-122</pages>
<year>2014</year>
<booktitle>SEA</booktitle>
<ee>https://doi.org/10.1007/978-3-319-07959-2_10</ee>
<crossref>conf/wea/2014</crossref>
<url>db/conf/wea/sea2014.html#ErbKS14</url>
</inproceedings>
</r>
<r><inproceedings key="conf/wea/0002SSZ14" mdate="2018-11-02">
<author orcid="0000-0001-8818-8324" pid="76/3160-2">Ingo M&#252;ller 0002</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author orcid="0000-0003-0041-9701" pid="87/9883">Robert Schulze</author>
<author pid="69/5011">Wei Zhou</author>
<title>Retrieval and Perfect Hashing Using Fingerprinting.</title>
<pages>138-149</pages>
<year>2014</year>
<booktitle>SEA</booktitle>
<ee>https://doi.org/10.1007/978-3-319-07959-2_12</ee>
<crossref>conf/wea/2014</crossref>
<url>db/conf/wea/sea2014.html#0002SSZ14</url>
</inproceedings>
</r>
<r><inproceedings key="conf/wea/MeyerhenkeSS14" mdate="2019-12-27">
<author orcid="0000-0002-7769-726X" pid="55/3065">Henning Meyerhenke</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author orcid="0000-0002-2823-3506" pid="10/1388-3">Christian Schulz 0003</author>
<title>Partitioning Complex Networks via Size-Constrained Clustering.</title>
<pages>351-363</pages>
<year>2014</year>
<booktitle>SEA</booktitle>
<ee>https://doi.org/10.1007/978-3-319-07959-2_30</ee>
<crossref>conf/wea/2014</crossref>
<url>db/conf/wea/sea2014.html#MeyerhenkeSS14</url>
</inproceedings>
</r>
<r><proceedings key="conf/spaa/2014" mdate="2018-11-21">
<editor pid="b/GEBlelloch">Guy E. Blelloch</editor>
<editor pid="s/PeterSanders">Peter Sanders 0001</editor>
<title>26th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA '14, Prague, Czech Republic - June 23 - 25, 2014</title>
<publisher>ACM</publisher>
<booktitle>SPAA</booktitle>
<year>2014</year>
<isbn>978-1-4503-2821-0</isbn>
<ee>https://doi.org/10.1145/2612669</ee>
<url>db/conf/spaa/spaa2014.html</url>
</proceedings>
</r>
<r><incollection publtype="encyclopedia" key="reference/snam/BaderMS0KW14" mdate="2025-12-25">
<author orcid="0000-0002-7380-5876" pid="41/3005">David A. Bader</author>
<author orcid="0000-0002-7769-726X" pid="55/3065">Henning Meyerhenke</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="10/1388-3">Christian Schulz 0003</author>
<author pid="128/4179">Andrea Kappes</author>
<author pid="w/DorotheaWagner">Dorothea Wagner</author>
<title>Benchmarking for Graph Clustering and Partitioning.</title>
<pages>73-82</pages>
<year>2014</year>
<booktitle>Encyclopedia of Social Network Analysis and Mining</booktitle>
<ee>https://doi.org/10.1007/978-1-4614-6170-8_23</ee>
<url>db/reference/snam/snam2014.html#BaderMS0KW14</url>
</incollection>
</r>
<r><article publtype="informal" key="journals/corr/MeyerhenkeSS14" mdate="2018-08-13">
<author pid="55/3065">Henning Meyerhenke</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="10/1388-3">Christian Schulz 0003</author>
<title>Partitioning Complex Networks via Size-constrained Clustering.</title>
<year>2014</year>
<volume>abs/1402.3281</volume>
<journal>CoRR</journal>
<ee type="oa">http://arxiv.org/abs/1402.3281</ee>
<url>db/journals/corr/corr1402.html#MeyerhenkeSS14</url>
</article>
</r>
<r><article publtype="informal" key="journals/corr/BingmannES14" mdate="2018-08-13">
<author pid="129/6546">Timo Bingmann</author>
<author pid="143/7185">Andreas Eberle</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>Engineering Parallel String Sorting.</title>
<year>2014</year>
<volume>abs/1403.2056</volume>
<journal>CoRR</journal>
<ee type="oa">http://arxiv.org/abs/1403.2056</ee>
<url>db/journals/corr/corr1403.html#BingmannES14</url>
</article>
</r>
<r><article publtype="informal" key="journals/corr/MerzS14" mdate="2018-08-13">
<author pid="60/7861-3">Florian Merz 0003</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>PReaCH: A Fast Lightweight Reachability Index using Pruning and Contraction Hierarchies.</title>
<year>2014</year>
<volume>abs/1404.4465</volume>
<journal>CoRR</journal>
<ee type="oa">http://arxiv.org/abs/1404.4465</ee>
<url>db/journals/corr/corr1404.html#MerzS14</url>
</article>
</r>
<r><article publtype="informal" key="journals/corr/MeyerhenkeSS14a" mdate="2018-08-13">
<author pid="55/3065">Henning Meyerhenke</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="10/1388-3">Christian Schulz 0003</author>
<title>Parallel Graph Partitioning for Complex Networks.</title>
<year>2014</year>
<volume>abs/1404.4797</volume>
<journal>CoRR</journal>
<ee type="oa">http://arxiv.org/abs/1404.4797</ee>
<url>db/journals/corr/corr1404.html#MeyerhenkeSS14a</url>
</article>
</r>
<r><article publtype="informal" key="journals/corr/AkhremtsevSS14" mdate="2018-08-13">
<author pid="144/7382">Yaroslav Akhremtsev</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="10/1388-3">Christian Schulz 0003</author>
<title>(Semi-)External Algorithms for Graph Partitioning and Clustering.</title>
<year>2014</year>
<volume>abs/1404.4887</volume>
<journal>CoRR</journal>
<ee type="oa">http://arxiv.org/abs/1404.4887</ee>
<url>db/journals/corr/corr1404.html#AkhremtsevSS14</url>
</article>
</r>
<r><article publtype="informal" key="journals/corr/AxtmannBS014" mdate="2018-08-13">
<author pid="153/2031">Michael Axtmann</author>
<author pid="129/6546">Timo Bingmann</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="10/1388-3">Christian Schulz 0003</author>
<title>Practical Massively Parallel Sorting - Basic Algorithmic Ideas.</title>
<year>2014</year>
<volume>abs/1410.6754</volume>
<journal>CoRR</journal>
<ee type="oa">http://arxiv.org/abs/1410.6754</ee>
<url>db/journals/corr/corr1410.html#AxtmannBS014</url>
</article>
</r>
<r><article publtype="informal" key="journals/corr/RihaniSD14" mdate="2018-08-13">
<author pid="154/6598">Hamza Rihani</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="d/RomanDementiev">Roman Dementiev</author>
<title>MultiQueues: Simpler, Faster, and Better Relaxed Concurrent Priority Queues.</title>
<year>2014</year>
<volume>abs/1411.1209</volume>
<journal>CoRR</journal>
<ee type="oa">http://arxiv.org/abs/1411.1209</ee>
<url>db/journals/corr/corr1411.html#RihaniSD14</url>
</article>
</r>
<r><article publtype="informal" key="journals/corr/DimondS14" mdate="2018-08-13">
<author pid="154/6589">Jonathan Dimond</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>Faster Exact Search using Document Clustering.</title>
<year>2014</year>
<volume>abs/1411.1220</volume>
<journal>CoRR</journal>
<ee type="oa">http://arxiv.org/abs/1411.1220</ee>
<url>db/journals/corr/corr1411.html#DimondS14</url>
</article>
</r>
<r><article key="journals/insk/SandersW13" mdate="2020-08-13">
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="w/DorotheaWagner">Dorothea Wagner</author>
<title>Algorithm Engineering.</title>
<pages>131</pages>
<year>2013</year>
<volume>36</volume>
<journal>Inform. Spektrum</journal>
<number>2</number>
<ee type="oa">https://doi.org/10.1007/s00287-013-0679-y</ee>
<url>db/journals/insk/insk36.html#SandersW13</url>
</article>
</r>
<r><article key="journals/insk/Sanders13" mdate="2024-02-05">
<author orcid="0000-0003-3330-9349" pid="s/PeterSanders">Peter Sanders 0001</author>
<title>Algorithmenbibliotheken.</title>
<pages>174-179</pages>
<year>2013</year>
<volume>36</volume>
<journal>Inform. Spektrum</journal>
<number>2</number>
<ee>https://doi.org/10.1007/s00287-013-0683-2</ee>
<url>db/journals/insk/insk36.html#Sanders13</url>
</article>
</r>
<r><article key="journals/insk/SandersW13a" mdate="2024-02-05">
<author orcid="0000-0003-3330-9349" pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="w/DorotheaWagner">Dorothea Wagner</author>
<title>Algorithm Engineering.</title>
<pages>187-190</pages>
<year>2013</year>
<volume>36</volume>
<journal>Inform. Spektrum</journal>
<number>2</number>
<ee>https://doi.org/10.1007/s00287-013-0684-1</ee>
<url>db/journals/insk/insk36.html#SandersW13a</url>
</article>
</r>
<r><article key="journals/jea/BatzGSV13" mdate="2020-06-25">
<author pid="85/4519">Gernot Veit Batz</author>
<author pid="52/3048">Robert Geisberger</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="95/3382">Christian Vetter</author>
<title>Minimum time-dependent travel times with contraction hierarchies.</title>
<year>2013</year>
<volume>18</volume>
<journal>ACM J. Exp. Algorithmics</journal>
<ee>https://doi.org/10.1145/2444016.2444020</ee>
<url>db/journals/jea/jea18.html#BatzGSV13</url>
</article>
</r>
<r><article key="journals/scheduling/SandersSS13" mdate="2020-04-01">
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="s/JohannesSingler">Johannes Singler</author>
<author pid="10/4553">Rob van Stee</author>
<title>Real-time integrated prefetching and caching.</title>
<pages>47-58</pages>
<year>2013</year>
<volume>16</volume>
<journal>J. Sched.</journal>
<number>1</number>
<ee>https://doi.org/10.1007/s10951-012-0301-1</ee>
<url>db/journals/scheduling/scheduling16.html#SandersSS13</url>
</article>
</r>
<r><inproceedings key="conf/bigdataconf/SandersSM13" mdate="2021-03-31">
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author orcid="0000-0003-1550-882X" pid="139/4269">Sebastian Schlag</author>
<author orcid="0000-0001-8818-8324" pid="76/3160-2">Ingo M&#252;ller 0002</author>
<title>Communication efficient algorithms for fundamental big data problems.</title>
<pages>15-23</pages>
<year>2013</year>
<booktitle>IEEE BigData</booktitle>
<ee>https://doi.org/10.1109/BigData.2013.6691549</ee>
<crossref>conf/bigdataconf/2013</crossref>
<url>db/conf/bigdataconf/bigdataconf2013.html#SandersSM13</url>
</inproceedings>
</r>
<r><inproceedings key="conf/bigdataconf/WeidnerDS13" mdate="2021-03-31">
<author pid="134/4153">Martin Weidner</author>
<author pid="90/7867">Jonathan Dees</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>Fast OLAP query execution in main memory on large data in a cluster.</title>
<pages>518-524</pages>
<year>2013</year>
<booktitle>IEEE BigData</booktitle>
<ee>https://doi.org/10.1109/BigData.2013.6691616</ee>
<crossref>conf/bigdataconf/2013</crossref>
<url>db/conf/bigdataconf/bigdataconf2013.html#WeidnerDS13</url>
</inproceedings>
</r>
<r><inproceedings key="conf/esa/BingmannS13" mdate="2017-05-26">
<author pid="129/6546">Timo Bingmann</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>Parallel String Sample Sort.</title>
<pages>169-180</pages>
<year>2013</year>
<booktitle>ESA</booktitle>
<ee>https://doi.org/10.1007/978-3-642-40450-4_15</ee>
<crossref>conf/esa/2013</crossref>
<url>db/conf/esa/esa2013.html#BingmannS13</url>
</inproceedings>
</r>
<r><inproceedings key="conf/europar/BirnOSSS13" mdate="2019-12-27">
<author pid="78/8408">Marcel Birn</author>
<author pid="91/2425">Vitaly Osipov</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author orcid="0000-0002-2823-3506" pid="10/1388-3">Christian Schulz 0003</author>
<author pid="51/947">Nodari Sitchinava</author>
<title>Efficient Parallel and External Matching.</title>
<pages>659-670</pages>
<year>2013</year>
<booktitle>Euro-Par</booktitle>
<ee>https://doi.org/10.1007/978-3-642-40047-6_66</ee>
<crossref>conf/europar/2013</crossref>
<url>db/conf/europar/europar2013.html#BirnOSSS13</url>
</inproceedings>
</r>
<r><inproceedings key="conf/icde/DeesS13" mdate="2023-03-23">
<author pid="90/7867">Jonathan Dees</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>Efficient many-core query execution in main memory column-stores.</title>
<pages>350-361</pages>
<year>2013</year>
<booktitle>ICDE</booktitle>
<ee>https://doi.org/10.1109/ICDE.2013.6544838</ee>
<ee>https://doi.ieeecomputersociety.org/10.1109/ICDE.2013.6544838</ee>
<crossref>conf/icde/2013</crossref>
<url>db/conf/icde/icde2013.html#DeesS13</url>
</inproceedings>
</r>
<r><inproceedings key="conf/ipps/SandersM13" mdate="2023-03-24">
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author orcid="0000-0002-8141-498X" pid="m/LawrenceMandow">Lawrence Mandow</author>
<title>Parallel Label-Setting Multi-objective Shortest Path Search.</title>
<pages>215-224</pages>
<year>2013</year>
<booktitle>IPDPS</booktitle>
<ee>https://doi.org/10.1109/IPDPS.2013.89</ee>
<ee>https://doi.ieeecomputersociety.org/10.1109/IPDPS.2013.89</ee>
<crossref>conf/ipps/2013</crossref>
<url>db/conf/ipps/ipdps2013.html#SandersM13</url>
</inproceedings>
</r>
<r><inproceedings key="conf/ipps/FlickSS13" mdate="2023-03-24">
<author pid="133/3722">Patrick Flick</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="28/6353">Jochen Speck</author>
<title>Malleable Sorting.</title>
<pages>418-426</pages>
<year>2013</year>
<booktitle>IPDPS</booktitle>
<ee>https://doi.org/10.1109/IPDPS.2013.90</ee>
<ee>https://doi.ieeecomputersociety.org/10.1109/IPDPS.2013.90</ee>
<crossref>conf/ipps/2013</crossref>
<url>db/conf/ipps/ipdps2013.html#FlickSS13</url>
</inproceedings>
</r>
<r><inproceedings key="conf/sofsem/Sanders13" mdate="2017-05-23">
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>Engineering Algorithms for Large Data Sets.</title>
<pages>29-32</pages>
<year>2013</year>
<crossref>conf/sofsem/2013</crossref>
<booktitle>SOFSEM</booktitle>
<ee>https://doi.org/10.1007/978-3-642-35843-2_3</ee>
<url>db/conf/sofsem/sofsem2013.html#Sanders13</url>
</inproceedings>
</r>
<r><inproceedings key="conf/spaa/SandersSS13" mdate="2018-11-06">
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="28/6353">Jochen Speck</author>
<author pid="132/3988">Raoul Steffen</author>
<title>Work-efficient matrix inversion in polylogarithmic time.</title>
<pages>214-221</pages>
<year>2013</year>
<booktitle>SPAA</booktitle>
<ee>https://doi.org/10.1145/2486159.2486173</ee>
<crossref>conf/spaa/2013</crossref>
<url>db/conf/spaa/spaa2013.html#SandersSS13</url>
</inproceedings>
</r>
<r><inproceedings key="conf/wads/ArgeFSS13" mdate="2017-05-21">
<author pid="a/LArge">Lars Arge</author>
<author pid="90/834-1">Johannes Fischer 0001</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="51/947">Nodari Sitchinava</author>
<title>On (Dynamic) Range Minimum Queries in External Memory.</title>
<pages>37-48</pages>
<year>2013</year>
<booktitle>WADS</booktitle>
<ee>https://doi.org/10.1007/978-3-642-40104-6_4</ee>
<crossref>conf/wads/2013</crossref>
<url>db/conf/wads/wads2013.html#ArgeFSS13</url>
</inproceedings>
</r>
<r><inproceedings key="conf/wea/ArzLS13" mdate="2017-05-17">
<author pid="126/4652">Julian Arz</author>
<author pid="48/7217">Dennis Luxen</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>Transit Node Routing Reconsidered.</title>
<pages>55-66</pages>
<year>2013</year>
<booktitle>SEA</booktitle>
<ee>https://doi.org/10.1007/978-3-642-38527-8_7</ee>
<crossref>conf/wea/2013</crossref>
<url>db/conf/wea/sea2013.html#ArzLS13</url>
</inproceedings>
</r>
<r><inproceedings key="conf/wea/SandersS13" mdate="2019-12-27">
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author orcid="0000-0002-2823-3506" pid="10/1388-3">Christian Schulz 0003</author>
<title>Think Locally, Act Globally: Highly Balanced Graph Partitioning.</title>
<pages>164-175</pages>
<year>2013</year>
<booktitle>SEA</booktitle>
<ee>https://doi.org/10.1007/978-3-642-38527-8_16</ee>
<crossref>conf/wea/2013</crossref>
<url>db/conf/wea/sea2013.html#SandersS13</url>
</inproceedings>
</r>
<r><proceedings key="conf/alenex/2013" mdate="2017-05-19">
<editor pid="s/PeterSanders">Peter Sanders 0001</editor>
<editor pid="73/3395">Norbert Zeh</editor>
<title>Proceedings of the 15th Meeting on Algorithm Engineering and Experiments, ALENEX 2013, New Orleans, Louisiana, USA, January 7, 2013</title>
<booktitle>ALENEX</booktitle>
<publisher>SIAM</publisher>
<year>2013</year>
<isbn>978-1-61197-253-5</isbn>
<isbn>978-1-61197-293-1</isbn>
<ee>https://doi.org/10.1137/1.9781611972931</ee>
<url>db/conf/alenex/alenex2013.html</url>
</proceedings>
</r>
<r><proceedings key="conf/cpm/2013" mdate="2019-05-14">
<editor pid="90/834-1">Johannes Fischer 0001</editor>
<editor pid="s/PeterSanders">Peter Sanders 0001</editor>
<title>Combinatorial Pattern Matching, 24th Annual Symposium, CPM 2013, Bad Herrenalb, Germany, June 17-19, 2013. Proceedings</title>
<publisher>Springer</publisher>
<year>2013</year>
<isbn>978-3-642-38904-7</isbn>
<isbn>978-3-642-38905-4</isbn>
<ee>https://doi.org/10.1007/978-3-642-38905-4</ee>
<volume>7922</volume>
<series href="db/series/lncs/index.html">Lecture Notes in Computer Science</series>
<booktitle>CPM</booktitle>
<url>db/conf/cpm/cpm2013.html</url>
</proceedings>
</r>
<r><proceedings key="conf/dimacs/2012" mdate="2020-11-03">
<editor orcid="0000-0002-7380-5876" pid="41/3005">David A. Bader</editor>
<editor orcid="0000-0002-7769-726X" pid="55/3065">Henning Meyerhenke</editor>
<editor pid="s/PeterSanders">Peter Sanders 0001</editor>
<editor pid="w/DorotheaWagner">Dorothea Wagner</editor>
<title>Graph Partitioning and Graph Clustering, 10th DIMACS Implementation Challenge Workshop, Georgia Institute of Technology, Atlanta, GA, USA, February 13-14, 2012. Proceedings</title>
<publisher>American Mathematical Society</publisher>
<booktitle>Graph Partitioning and Graph Clustering</booktitle>
<year>2013</year>
<series href="db/series/conm/index.html">Contemporary Mathematics</series>
<volume>588</volume>
<isbn>978-0-8218-9038-7</isbn>
<isbn>978-0-8218-9869-7</isbn>
<ee>https://doi.org/10.1090/conm/588</ee>
<ee>https://www.wikidata.org/entity/Q56688748</ee>
<url>db/conf/dimacs/dimacs2012.html</url>
</proceedings>
</r>
<r><article publtype="informal" key="journals/corr/abs-1302-4587" mdate="2018-08-13">
<author pid="78/8408">Marcel Birn</author>
<author pid="91/2425">Vitaly Osipov</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="10/1388-3">Christian Schulz 0003</author>
<author pid="51/947">Nodari Sitchinava</author>
<title>Efficient Parallel and External Matching</title>
<ee type="oa">http://arxiv.org/abs/1302.4587</ee>
<year>2013</year>
<journal>CoRR</journal>
<volume>abs/1302.4587</volume>
<url>db/journals/corr/corr1302.html#abs-1302-4587</url>
</article>
</r>
<r><article publtype="informal" key="journals/corr/abs-1302-5611" mdate="2018-08-13">
<author pid="126/4652">Julian Arz</author>
<author pid="48/7217">Dennis Luxen</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>Transit Node Routing Reconsidered</title>
<ee type="oa">http://arxiv.org/abs/1302.5611</ee>
<year>2013</year>
<journal>CoRR</journal>
<volume>abs/1302.5611</volume>
<url>db/journals/corr/corr1302.html#abs-1302-5611</url>
</article>
</r>
<r><article publtype="informal" key="journals/corr/abs-1305-1157" mdate="2018-08-13">
<author pid="129/6546">Timo Bingmann</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>Parallel String Sample Sort</title>
<ee type="oa">http://arxiv.org/abs/1305.1157</ee>
<year>2013</year>
<journal>CoRR</journal>
<volume>abs/1305.1157</volume>
<url>db/journals/corr/corr1305.html#abs-1305-1157</url>
</article>
</r>
<r><article publtype="informal" key="journals/corr/SandersS13" mdate="2018-08-13">
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="10/1388-3">Christian Schulz 0003</author>
<title>KaHIP v0.53 - Karlsruhe High Quality Partitioning - User Guide.</title>
<year>2013</year>
<journal>CoRR</journal>
<ee type="oa">http://arxiv.org/abs/1311.1714</ee>
<volume>abs/1311.1714</volume>
<url>db/journals/corr/corr1311.html#SandersS13</url>
</article>
</r>
<r><article publtype="informal" key="journals/corr/BulucMSSS13" mdate="2018-08-13">
<author pid="80/1552">Aydin Bulu&#231;</author>
<author pid="55/3065">Henning Meyerhenke</author>
<author pid="64/5096">Ilya Safro</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="10/1388-3">Christian Schulz 0003</author>
<title>Recent Advances in Graph Partitioning.</title>
<year>2013</year>
<journal>CoRR</journal>
<ee type="oa">http://arxiv.org/abs/1311.3144</ee>
<volume>abs/1311.3144</volume>
<url>db/journals/corr/corr1311.html#BulucMSSS13</url>
</article>
</r>
<r><article key="journals/jea/GeisbergerRST12" mdate="2021-10-14">
<author pid="52/3048">Robert Geisberger</author>
<author pid="43/8999">Michael N. Rice</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author orcid="0000-0001-5462-9451" pid="t/VassilisJTsotras">Vassilis J. Tsotras</author>
<title>Route planning with flexible edge restrictions.</title>
<year>2012</year>
<volume>17</volume>
<journal>ACM J. Exp. Algorithmics</journal>
<number>1</number>
<ee>https://doi.org/10.1145/2133803.2133805</ee>
<url>db/journals/jea/jea17.html#GeisbergerRST12</url>
</article>
</r>
<r><article key="journals/jea/SandersS12" mdate="2020-06-25">
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="31/3154">Dominik Schultes</author>
<title>Engineering highway hierarchies.</title>
<year>2012</year>
<volume>17</volume>
<journal>ACM J. Exp. Algorithmics</journal>
<number>1</number>
<ee>https://doi.org/10.1145/2133803.2330080</ee>
<url>db/journals/jea/jea17.html#SandersS12</url>
</article>
</r>
<r><article key="journals/transci/GeisbergerSSV12" mdate="2020-09-08">
<author pid="52/3048">Robert Geisberger</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="31/3154">Dominik Schultes</author>
<author pid="95/3382">Christian Vetter</author>
<title>Exact Routing in Large Road Networks Using Contraction Hierarchies.</title>
<pages>388-404</pages>
<year>2012</year>
<volume>46</volume>
<journal>Transp. Sci.</journal>
<number>3</number>
<ee>https://doi.org/10.1287/trsc.1110.0401</ee>
<url>db/journals/transci/transci46.html#GeisbergerSSV12</url>
</article>
</r>
<r><inproceedings key="conf/alenex/SandersS12" mdate="2017-05-19">
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="10/1388-3">Christian Schulz 0003</author>
<title>Distributed Evolutionary Graph Partitioning.</title>
<pages>16-29</pages>
<year>2012</year>
<booktitle>ALENEX</booktitle>
<ee>https://doi.org/10.1137/1.9781611972924.2</ee>
<crossref>conf/alenex/2012</crossref>
<url>db/conf/alenex/alenex2012.html#SandersS12</url>
</inproceedings>
</r>
<r><inproceedings key="conf/dimacs/SandersS12" mdate="2017-01-06">
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="10/1388-3">Christian Schulz 0003</author>
<title>High quality graph partitioning.</title>
<pages>1-18</pages>
<year>2012</year>
<booktitle>Graph Partitioning and Graph Clustering</booktitle>
<ee>http://www.ams.org/books/conm/588/11700</ee>
<crossref>conf/dimacs/2012</crossref>
<url>db/conf/dimacs/dimacs2012.html#SandersS12</url>
</inproceedings>
</r>
<r><inproceedings key="conf/esa/BatzS12" mdate="2017-05-26">
<author pid="85/4519">Gernot Veit Batz</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>Time-Dependent Route Planning with Generalized Objective Functions.</title>
<pages>169-180</pages>
<year>2012</year>
<booktitle>ESA</booktitle>
<ee>https://doi.org/10.1007/978-3-642-33090-2_16</ee>
<crossref>conf/esa/2012</crossref>
<url>db/conf/esa/esa2012.html#BatzS12</url>
</inproceedings>
</r>
<r><inproceedings key="conf/europar/SandersS12" mdate="2017-05-24">
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="28/6353">Jochen Speck</author>
<title>Energy Efficient Frequency Scaling and Scheduling for Malleable Tasks.</title>
<pages>167-178</pages>
<year>2012</year>
<booktitle>Euro-Par</booktitle>
<ee>https://doi.org/10.1007/978-3-642-32820-6_18</ee>
<crossref>conf/europar/2012</crossref>
<url>db/conf/europar/europar2012.html#SandersS12</url>
</inproceedings>
</r>
<r><inproceedings key="conf/europar/FietzKSSH12" mdate="2023-09-30">
<author pid="117/6977">Jonas Fietz</author>
<author orcid="0000-0003-1026-6462" pid="52/8873">Mathias J. Krause</author>
<author orcid="0000-0002-2823-3506" pid="10/1388-3">Christian Schulz 0003</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author orcid="0000-0002-2217-7558" pid="27/1141">Vincent Heuveline</author>
<title>Optimized Hybrid Parallel Lattice Boltzmann Fluid Flow Simulations on Complex Geometries.</title>
<pages>818-829</pages>
<year>2012</year>
<booktitle>Euro-Par</booktitle>
<ee>https://doi.org/10.1007/978-3-642-32820-6_81</ee>
<crossref>conf/europar/2012</crossref>
<url>db/conf/europar/europar2012.html#FietzKSSH12</url>
</inproceedings>
</r>
<r><inproceedings key="conf/medalg/BatzGLSZ12" mdate="2017-05-21">
<author pid="85/4519">Gernot Veit Batz</author>
<author pid="52/3048">Robert Geisberger</author>
<author pid="48/7217">Dennis Luxen</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="122/0272">Roman Zubkov</author>
<title>Efficient Route Compression for Hybrid Route Planning.</title>
<pages>93-107</pages>
<year>2012</year>
<booktitle>MedAlg</booktitle>
<ee>https://doi.org/10.1007/978-3-642-34862-4_7</ee>
<crossref>conf/medalg/2012</crossref>
<url>db/conf/medalg/medalg2012.html#BatzGLSZ12</url>
</inproceedings>
</r>
<r><inproceedings key="conf/wea/OsipovSS12" mdate="2019-12-27">
<author pid="91/2425">Vitaly Osipov</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author orcid="0000-0002-2823-3506" pid="10/1388-3">Christian Schulz 0003</author>
<title>Engineering Graph Partitioning Algorithms.</title>
<pages>18-26</pages>
<year>2012</year>
<booktitle>SEA</booktitle>
<ee>https://doi.org/10.1007/978-3-642-30850-5_3</ee>
<crossref>conf/wea/2012</crossref>
<url>db/conf/wea/sea2012.html#OsipovSS12</url>
</inproceedings>
</r>
<r><inproceedings key="conf/wea/SafroSS12" mdate="2019-12-27">
<author orcid="0000-0001-6284-7408" pid="64/5096">Ilya Safro</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author orcid="0000-0002-2823-3506" pid="10/1388-3">Christian Schulz 0003</author>
<title>Advanced Coarsening Schemes for Graph Partitioning.</title>
<pages>369-380</pages>
<year>2012</year>
<booktitle>SEA</booktitle>
<ee>https://doi.org/10.1007/978-3-642-30850-5_32</ee>
<crossref>conf/wea/2012</crossref>
<url>db/conf/wea/sea2012.html#SafroSS12</url>
</inproceedings>
</r>
<r><article publtype="informal" key="journals/corr/abs-1201-6488" mdate="2018-08-13">
<author pid="64/5096">Ilya Safro</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="10/1388-3">Christian Schulz 0003</author>
<title>Advanced Coarsening Schemes for Graph Partitioning</title>
<ee type="oa">http://arxiv.org/abs/1201.6488</ee>
<year>2012</year>
<journal>CoRR</journal>
<volume>abs/1201.6488</volume>
<url>db/journals/corr/corr1201.html#abs-1201-6488</url>
</article>
</r>
<r><article publtype="informal" key="journals/corr/abs-1210-0477" mdate="2018-08-13">
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="10/1388-3">Christian Schulz 0003</author>
<title>Think Locally, Act Globally: Perfectly Balanced Graph Partitioning</title>
<ee type="oa">http://arxiv.org/abs/1210.0477</ee>
<year>2012</year>
<journal>CoRR</journal>
<volume>abs/1210.0477</volume>
<url>db/journals/corr/corr1210.html#abs-1210-0477</url>
</article>
</r>
<r><article key="journals/algorithmica/BeierFMS11" mdate="2017-05-17">
<author pid="22/5581">Ren&#233; Beier</author>
<author pid="f/StefanFunke">Stefan Funke</author>
<author pid="m/DomagojMatijevic">Domagoj Matijevic</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>Energy-Efficient Paths in Radio Networks.</title>
<pages>298-319</pages>
<year>2011</year>
<volume>61</volume>
<journal>Algorithmica</journal>
<number>2</number>
<ee>https://doi.org/10.1007/s00453-010-9414-0</ee>
<url>db/journals/algorithmica/algorithmica61.html#BeierFMS11</url>
</article>
</r>
<r><article key="journals/ijfcs/NavarroPPS11" mdate="2024-02-28">
<author pid="n/GonzaloNavarro">Gonzalo Navarro 0001</author>
<author orcid="0000-0002-9943-2510" pid="95/3010">Rodrigo Paredes</author>
<author pid="28/1091">Patricio V. Poblete</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>Stronger Quickheaps.</title>
<pages>945-969</pages>
<year>2011</year>
<volume>22</volume>
<journal>Int. J. Found. Comput. Sci.</journal>
<number>4</number>
<ee>https://doi.org/10.1142/S0129054111008507</ee>
<url>db/journals/ijfcs/ijfcs22.html#NavarroPPS11</url>
</article>
</r>
<r><article key="journals/it/SandersW11" mdate="2020-03-06">
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="w/DorotheaWagner">Dorothea Wagner</author>
<title>Algorithm Engineering.</title>
<pages>263-265</pages>
<year>2011</year>
<volume>53</volume>
<journal>it Inf. Technol.</journal>
<number>6</number>
<ee>https://doi.org/10.1524/itit.2011.9072</ee>
<url>db/journals/it/it53.html#SandersW11</url>
</article>
</r>
<r><article key="journals/suscom/BeckmannMSS11" mdate="2020-02-25">
<author pid="03/5407">Andreas Beckmann</author>
<author pid="m/UlrichMeyer-1">Ulrich Meyer 0001</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="s/JohannesSingler">Johannes Singler</author>
<title>Energy-efficient sorting using solid state disks.</title>
<pages>151-163</pages>
<year>2011</year>
<volume>1</volume>
<journal>Sustain. Comput. Informatics Syst.</journal>
<number>2</number>
<ee>https://doi.org/10.1016/j.suscom.2011.02.004</ee>
<url>db/journals/suscom/suscom1.html#BeckmannMSS11</url>
</article>
</r>
<r><article key="journals/tcs/BrodalGJS11" mdate="2021-02-17">
<author orcid="0000-0001-9054-915X" pid="b/GerthStoltingBrodal">Gerth St&#248;lting Brodal</author>
<author pid="43/5670">Beat Gfeller</author>
<author pid="48/481">Allan Gr&#248;nlund J&#248;rgensen</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>Towards optimal range medians.</title>
<pages>2588-2601</pages>
<year>2011</year>
<volume>412</volume>
<journal>Theor. Comput. Sci.</journal>
<number>24</number>
<ee type="oa">https://doi.org/10.1016/j.tcs.2010.05.003</ee>
<url>db/journals/tcs/tcs412.html#BrodalGJS11</url>
</article>
</r>
<r><inproceedings key="conf/esa/SandersS11" mdate="2019-12-27">
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author orcid="0000-0002-2823-3506" pid="10/1388-3">Christian Schulz 0003</author>
<title>Engineering Multilevel Graph Partitioning Algorithms.</title>
<pages>469-480</pages>
<year>2011</year>
<booktitle>ESA</booktitle>
<ee>https://doi.org/10.1007/978-3-642-23719-5_40</ee>
<crossref>conf/esa/2011</crossref>
<url>db/conf/esa/esa2011.html#SandersS11</url>
</inproceedings>
</r>
<r><inproceedings key="conf/europar/WassenbergS11" mdate="2017-05-24">
<author pid="44/7407">Jan Wassenberg</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>Engineering a Multi-core Radix Sort.</title>
<pages>160-169</pages>
<year>2011</year>
<booktitle>Euro-Par (2)</booktitle>
<ee>https://doi.org/10.1007/978-3-642-23397-5_16</ee>
<crossref>conf/europar/2011-2</crossref>
<url>db/conf/europar/europar2011-2.html#WassenbergS11</url>
</inproceedings>
</r>
<r><inproceedings key="conf/gis/JungKKLS11" mdate="2025-01-19">
<author pid="16/2948-3">Christian Jung 0003</author>
<author pid="97/8398">Daniel Karch</author>
<author pid="76/5320">Sebastian Knopp</author>
<author pid="48/7217">Dennis Luxen</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>Engineering efficient error-correcting geocoding.</title>
<pages>469-472</pages>
<year>2011</year>
<booktitle>GIS</booktitle>
<ee>https://doi.org/10.1145/2093973.2094050</ee>
<ee>https://www.wikidata.org/entity/Q130986748</ee>
<crossref>conf/gis/2011</crossref>
<url>db/conf/gis/gis2011.html#JungKKLS11</url>
</inproceedings>
</r>
<r><inproceedings key="conf/ipps/Sanders11" mdate="2023-03-24">
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>Algorithm Engineering for Scalable Parallel External Sorting.</title>
<pages>1</pages>
<year>2011</year>
<booktitle>IPDPS</booktitle>
<ee>https://doi.org/10.1109/IPDPS.2011.418</ee>
<ee>https://doi.ieeecomputersociety.org/10.1109/IPDPS.2011.418</ee>
<crossref>conf/ipps/2011</crossref>
<url>db/conf/ipps/ipdps2011.html#Sanders11</url>
</inproceedings>
</r>
<r><inproceedings key="conf/ipps/SandersS11" mdate="2023-03-24">
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="28/6353">Jochen Speck</author>
<title>Efficient Parallel Scheduling of Malleable Tasks.</title>
<pages>1156-1166</pages>
<year>2011</year>
<booktitle>IPDPS</booktitle>
<ee>https://doi.org/10.1109/IPDPS.2011.110</ee>
<ee>https://doi.ieeecomputersociety.org/10.1109/IPDPS.2011.110</ee>
<crossref>conf/ipps/2011</crossref>
<url>db/conf/ipps/ipdps2011.html#SandersS11</url>
</inproceedings>
</r>
<r><inproceedings key="conf/parco/BenknerPTTRNBKMS11" mdate="2018-11-02">
<author orcid="0000-0002-6520-2047" pid="s/SiegfriedBenkner">Siegfried Benkner</author>
<author pid="40/1392">Sabri Pllana</author>
<author pid="t/JLTraff">Jesper Larsson Tr&#228;ff</author>
<author orcid="0000-0001-9635-9154" pid="t/PhilippasTsigas">Philippas Tsigas</author>
<author pid="19/6205">Andrew Richards</author>
<author pid="75/4443">Raymond Namyst</author>
<author pid="42/10311">Beverly Bachmayer</author>
<author pid="k/ChristophWKessler">Christoph W. Kessler</author>
<author pid="76/3181">David Moloney</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>The PEPPHER Approach to Programmability and Performance Portability for Heterogeneous many-core Architectures.</title>
<pages>361-368</pages>
<year>2011</year>
<booktitle>PARCO</booktitle>
<ee>https://doi.org/10.3233/978-1-61499-041-3-361</ee>
<crossref>conf/parco/2011</crossref>
<url>db/conf/parco/parco2011.html#BenknerPTTRNBKMS11</url>
</inproceedings>
</r>
<r><inproceedings key="conf/tapas/BaderDGS11" mdate="2017-05-22">
<author pid="78/7867">Roland Bader</author>
<author pid="90/7867">Jonathan Dees</author>
<author pid="52/3048">Robert Geisberger</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>Alternative Route Graphs in Road Networks.</title>
<pages>21-32</pages>
<year>2011</year>
<booktitle>TAPAS</booktitle>
<ee>https://doi.org/10.1007/978-3-642-19754-3_5</ee>
<crossref>conf/tapas/2011</crossref>
<url>db/conf/tapas/tapas2011.html#BaderDGS11</url>
</inproceedings>
</r>
<r><inproceedings key="conf/wea/LuxenS11" mdate="2017-05-17">
<author pid="48/7217">Dennis Luxen</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>Hierarchy Decomposition for Faster User Equilibria on Road Networks.</title>
<pages>242-253</pages>
<year>2011</year>
<booktitle>SEA</booktitle>
<ee>https://doi.org/10.1007/978-3-642-20662-7_21</ee>
<crossref>conf/wea/2011</crossref>
<url>db/conf/wea/sea2011.html#LuxenS11</url>
</inproceedings>
</r>
<r><inproceedings key="conf/wpmc/Sanders11" mdate="2021-08-12">
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>Displaying Cell Broadcast messages.</title>
<pages>1-5</pages>
<year>2011</year>
<booktitle>WPMC</booktitle>
<ee>https://ieeexplore.ieee.org/document/6081581/</ee>
<crossref>conf/wpmc/2011</crossref>
<url>db/conf/wpmc/wpmc2011.html#Sanders11</url>
</inproceedings>
</r>
<r><incollection key="books/sp/voecking2011/SandersS11" mdate="2017-05-16">
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="s/JohannesSingler">Johannes Singler</author>
<title>Shortest Paths.</title>
<pages>317-324</pages>
<year>2011</year>
<booktitle>Algorithms Unplugged</booktitle>
<ee>https://doi.org/10.1007/978-3-642-15328-0_32</ee>
<crossref>books/sp/voecking11</crossref>
<url>db/books/collections/Voecking2011.html#SandersS11</url>
</incollection>
</r>
<r><incollection publtype="encyclopedia" key="reference/parallel/Sanders11" mdate="2017-07-12">
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>Algorithm Engineering.</title>
<pages>33-38</pages>
<year>2011</year>
<booktitle>Encyclopedia of Parallel Computing</booktitle>
<ee>https://doi.org/10.1007/978-0-387-09766-4_89</ee>
<crossref>reference/parallel/2011</crossref>
<url>db/reference/parallel/parallel2011.html#Sanders11</url>
</incollection>
</r>
<r><article publtype="informal" key="journals/corr/abs-1102-3306" mdate="2024-05-08">
<author pid="16/2948-3">Christian Jung 0003</author>
<author pid="97/8398">Daniel Karch</author>
<author pid="76/5320">Sebastian Knopp</author>
<author pid="48/7217">Dennis Luxen</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>Efficient Error-Correcting Geocoding</title>
<ee type="oa">http://arxiv.org/abs/1102.3306</ee>
<year>2011</year>
<journal>CoRR</journal>
<volume>abs/1102.3306</volume>
<url>db/journals/corr/corr1102.html#abs-1102-3306</url>
</article>
</r>
<r><article publtype="informal" key="journals/corr/abs-1110-0477" mdate="2018-08-13">
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="10/1388-3">Christian Schulz 0003</author>
<title>Distributed Evolutionary Graph Partitioning</title>
<ee type="oa">http://arxiv.org/abs/1110.0477</ee>
<year>2011</year>
<journal>CoRR</journal>
<volume>abs/1110.0477</volume>
<url>db/journals/corr/corr1110.html#abs-1110-0477</url>
</article>
</r>
<r><article key="journals/insk/Sanders10" mdate="2020-08-13">
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>Algorithm Engineering.</title>
<pages>475-478</pages>
<year>2010</year>
<volume>33</volume>
<journal>Inform. Spektrum</journal>
<number>5</number>
<ee>https://doi.org/10.1007/s00287-010-0464-0</ee>
<url>db/journals/insk/insk33.html#Sanders10</url>
</article>
</r>
<r><article key="journals/jea/BauerDSSSW10" mdate="2020-06-25">
<author pid="40/7046">Reinhard Bauer</author>
<author pid="10/5981">Daniel Delling</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="77/2645">Dennis Schieferdecker</author>
<author pid="31/3154">Dominik Schultes</author>
<author pid="w/DorotheaWagner">Dorothea Wagner</author>
<title>Combining hierarchical and goal-directed speed-up techniques for dijkstra's algorithm.</title>
<year>2010</year>
<volume>15</volume>
<journal>ACM J. Exp. Algorithmics</journal>
<ee>https://doi.org/10.1145/1671970.1671976</ee>
<url>db/journals/jea/jea15.html#BauerDSSSW10</url>
</article>
</r>
<r><article key="journals/jea/LangguthMS10" mdate="2020-06-25">
<author pid="14/7938">Johannes Langguth</author>
<author pid="m/FredrikManne">Fredrik Manne</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>Heuristic initialization for bipartite matching problems.</title>
<year>2010</year>
<volume>15</volume>
<journal>ACM J. Exp. Algorithmics</journal>
<ee>https://doi.org/10.1145/1671970.1712656</ee>
<url>db/journals/jea/jea15.html#LangguthMS10</url>
</article>
</r>
<r><article key="journals/tois/TransierS10" mdate="2018-11-06">
<author pid="71/3602">Frederik Transier</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>Engineering basic algorithms of an in-memory text search engine.</title>
<pages>2:1-2:37</pages>
<year>2010</year>
<volume>29</volume>
<journal>ACM Trans. Inf. Syst.</journal>
<number>1</number>
<ee>https://doi.org/10.1145/1877766.1877768</ee>
<url>db/journals/tois/tois29.html#TransierS10</url>
</article>
</r>
<r><inproceedings key="conf/alenex/BirnHSS10" mdate="2017-05-19">
<author pid="78/8408">Marcel Birn</author>
<author pid="64/7481">Manuel Holtgrewe</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="s/JohannesSingler">Johannes Singler</author>
<title>Simple and Fast Nearest Neighbor Search.</title>
<pages>43-54</pages>
<year>2010</year>
<booktitle>ALENEX</booktitle>
<ee>https://doi.org/10.1137/1.9781611972900.5</ee>
<crossref>conf/alenex/2010</crossref>
<url>db/conf/alenex/alenex2010.html#BirnHSS10</url>
</inproceedings>
</r>
<r><inproceedings key="conf/alenex/Sanders10" mdate="2017-05-19">
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>Algorithm Engineering - An Attempt at a Definition Using Sorting as an Example.</title>
<pages>55-61</pages>
<year>2010</year>
<booktitle>ALENEX</booktitle>
<ee>https://doi.org/10.1137/1.9781611972900.6</ee>
<crossref>conf/alenex/2010</crossref>
<url>db/conf/alenex/alenex2010.html#Sanders10</url>
</inproceedings>
</r>
<r><inproceedings key="conf/alenex/GeisbergerKS10" mdate="2017-05-19">
<author pid="52/3048">Robert Geisberger</author>
<author pid="65/8409">Moritz Kobitzsch</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>Route Planning with Flexible Objective Functions.</title>
<pages>124-137</pages>
<year>2010</year>
<booktitle>ALENEX</booktitle>
<ee>https://doi.org/10.1137/1.9781611972900.12</ee>
<crossref>conf/alenex/2010</crossref>
<url>db/conf/alenex/alenex2010.html#GeisbergerKS10</url>
</inproceedings>
</r>
<r><inproceedings key="conf/algosensors/SandersS10" mdate="2017-05-19">
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="77/2645">Dennis Schieferdecker</author>
<title>Lifetime Maximization of Monitoring Sensor Networks.</title>
<pages>134-147</pages>
<year>2010</year>
<booktitle>ALGOSENSORS</booktitle>
<ee>https://doi.org/10.1007/978-3-642-16988-5_12</ee>
<crossref>conf/algosensors/2010</crossref>
<url>db/conf/algosensors/algosensors2010.html#SandersS10</url>
</inproceedings>
</r>
<r><inproceedings key="conf/atmos/GeisbergerS10" mdate="2018-08-23">
<author pid="52/3048">Robert Geisberger</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>Engineering Time-Dependent Many-to-Many Shortest Paths Computation.</title>
<pages>74-87</pages>
<year>2010</year>
<booktitle>ATMOS</booktitle>
<ee type="oa">https://doi.org/10.4230/OASIcs.ATMOS.2010.74</ee>
<crossref>conf/atmos/2010</crossref>
<url>db/conf/atmos/atmos2010.html#GeisbergerS10</url>
</inproceedings>
</r>
<r><inproceedings key="conf/atmos/GeisbergerLNSV10" mdate="2018-08-23">
<author pid="52/3048">Robert Geisberger</author>
<author pid="48/7217">Dennis Luxen</author>
<author pid="75/7218">Sabine Neubauer</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="14/2332">Lars V&#246;lker</author>
<title>Fast Detour Computation for Ride Sharing.</title>
<pages>88-99</pages>
<year>2010</year>
<booktitle>ATMOS</booktitle>
<ee type="oa">https://doi.org/10.4230/OASIcs.ATMOS.2010.88</ee>
<crossref>conf/atmos/2010</crossref>
<url>db/conf/atmos/atmos2010.html#GeisbergerLNSV10</url>
</inproceedings>
</r>
<r><inproceedings key="conf/esa/OsipovS10" mdate="2017-05-26">
<author pid="91/2425">Vitaly Osipov</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title><i>n</i>-Level Graph Partitioning.</title>
<pages>278-289</pages>
<year>2010</year>
<booktitle>ESA (1)</booktitle>
<ee>https://doi.org/10.1007/978-3-642-15775-2_24</ee>
<crossref>conf/esa/2010-1</crossref>
<url>db/conf/esa/esa2010-1.html#OsipovS10</url>
</inproceedings>
</r>
<r><inproceedings key="conf/green/BeckmannMSS10" mdate="2023-03-24">
<author pid="03/5407">Andreas Beckmann</author>
<author pid="m/UlrichMeyer-1">Ulrich Meyer 0001</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="s/JohannesSingler">Johannes Singler</author>
<title>Energy-efficient sorting using solid state disks.</title>
<pages>191-202</pages>
<year>2010</year>
<booktitle>Green Computing Conference</booktitle>
<ee>https://doi.org/10.1109/GREENCOMP.2010.5598309</ee>
<ee>https://doi.ieeecomputersociety.org/10.1109/GREENCOMP.2010.5598309</ee>
<crossref>conf/green/2010</crossref>
<url>db/conf/green/green2010.html#BeckmannMSS10</url>
</inproceedings>
</r>
<r><inproceedings key="conf/icde/RahnSS10" mdate="2023-03-24">
<author pid="96/4653">Mirko Rahn</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="s/JohannesSingler">Johannes Singler</author>
<title>Scalable distributed-memory external sorting.</title>
<pages>685-688</pages>
<year>2010</year>
<booktitle>ICDE</booktitle>
<ee>https://doi.org/10.1109/ICDE.2010.5447865</ee>
<ee>https://doi.ieeecomputersociety.org/10.1109/ICDE.2010.5447865</ee>
<crossref>conf/icde/2010</crossref>
<url>db/conf/icde/icde2010.html#RahnSS10</url>
</inproceedings>
</r>
<r><inproceedings key="conf/ipps/HoltgreweSS10" mdate="2023-03-24">
<author pid="64/7481">Manuel Holtgrewe</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author orcid="0000-0002-2823-3506" pid="10/1388-3">Christian Schulz 0003</author>
<title>Engineering a scalable high quality graph partitioner.</title>
<pages>1-12</pages>
<year>2010</year>
<booktitle>IPDPS</booktitle>
<ee>https://doi.org/10.1109/IPDPS.2010.5470485</ee>
<ee>https://doi.ieeecomputersociety.org/10.1109/IPDPS.2010.5470485</ee>
<crossref>conf/ipps/2010</crossref>
<url>db/conf/ipps/ipdps2010.html#HoltgreweSS10</url>
</inproceedings>
</r>
<r><inproceedings key="conf/ipps/LeischnerOS10" mdate="2023-03-24">
<author pid="96/7412">Nikolaj Leischner</author>
<author pid="91/2425">Vitaly Osipov</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>GPU sample sort.</title>
<pages>1-10</pages>
<year>2010</year>
<booktitle>IPDPS</booktitle>
<ee>https://doi.org/10.1109/IPDPS.2010.5470444</ee>
<ee>https://doi.ieeecomputersociety.org/10.1109/IPDPS.2010.5470444</ee>
<crossref>conf/ipps/2010</crossref>
<url>db/conf/ipps/ipdps2010.html#LeischnerOS10</url>
</inproceedings>
</r>
<r><inproceedings key="conf/ipps/Sanders10" mdate="2023-03-24">
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>Algorithm engineering for scalable parallel external sorting.</title>
<pages>1-3</pages>
<year>2010</year>
<booktitle>IPDPS</booktitle>
<ee>https://doi.org/10.1109/IPDPS.2010.5470384</ee>
<ee>https://doi.ieeecomputersociety.org/10.1109/IPDPS.2010.5470384</ee>
<crossref>conf/ipps/2010</crossref>
<url>db/conf/ipps/ipdps2010.html#Sanders10</url>
</inproceedings>
</r>
<r><inproceedings key="conf/spire/KarchLS10" mdate="2017-05-24">
<author pid="97/8398">Daniel Karch</author>
<author pid="48/7217">Dennis Luxen</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>Improved Fast Similarity Search in Dictionaries.</title>
<pages>173-178</pages>
<year>2010</year>
<booktitle>SPIRE</booktitle>
<ee>https://doi.org/10.1007/978-3-642-16321-0_16</ee>
<crossref>conf/spire/2010</crossref>
<url>db/conf/spire/spire2010.html#KarchLS10</url>
</inproceedings>
</r>
<r><inproceedings key="conf/wea/KieritzLSV10" mdate="2017-05-17">
<author pid="98/8030">Tim Kieritz</author>
<author pid="48/7217">Dennis Luxen</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="95/3382">Christian Vetter</author>
<title>Distributed Time-Dependent Contraction Hierarchies.</title>
<pages>83-93</pages>
<year>2010</year>
<booktitle>SEA</booktitle>
<ee>https://doi.org/10.1007/978-3-642-13193-6_8</ee>
<crossref>conf/wea/2010</crossref>
<url>db/conf/wea/sea2010.html#KieritzLSV10</url>
</inproceedings>
</r>
<r><inproceedings key="conf/wea/BatzGNS10" mdate="2017-05-17">
<author pid="85/4519">Gernot Veit Batz</author>
<author pid="52/3048">Robert Geisberger</author>
<author pid="75/7218">Sabine Neubauer</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>Time-Dependent Contraction Hierarchies and Approximation.</title>
<pages>166-177</pages>
<year>2010</year>
<booktitle>SEA</booktitle>
<ee>https://doi.org/10.1007/978-3-642-13193-6_15</ee>
<crossref>conf/wea/2010</crossref>
<url>db/conf/wea/sea2010.html#BatzGNS10</url>
</inproceedings>
</r>
<r><proceedings key="conf/dagstuhl/2010P10261" mdate="2025-05-26">
<editor pid="i/GiuseppeFItaliano">Giuseppe F. Italiano</editor>
<editor pid="j/DavidSJohnson">David S. Johnson 0001</editor>
<editor pid="m/PetraMutzel">Petra Mutzel</editor>
<editor pid="s/PeterSanders">Peter Sanders 0001</editor>
<title>Algorithm Engineering, 27.06. - 02.07.2010</title>
<booktitle>Algorithm Engineering</booktitle>
<volume>10261</volume>
<year>2010</year>
<publisher>Schloss Dagstuhl - Leibniz-Zentrum f&#252;r Informatik, Germany</publisher>
<series href="db/series/dagstuhl/index.html">Dagstuhl Seminar Proceedings</series>
<url>db/conf/dagstuhl/P10261.html</url>
<ee type="oa">http://drops.dagstuhl.de/portals/10261/</ee>
</proceedings>
</r>
<r><inproceedings publtype="informal" key="conf/dagstuhl/ItalianoJMS10" mdate="2025-05-26">
<author pid="i/GiuseppeFItaliano">Giuseppe F. Italiano</author>
<author pid="j/DavidSJohnson">David S. Johnson 0001</author>
<author pid="m/PetraMutzel">Petra Mutzel</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>10261 Abstracts Collection - Algorithm Engineering.</title>
<year>2010</year>
<booktitle>Algorithm Engineering</booktitle>
<ee type="oa">http://drops.dagstuhl.de/opus/volltexte/2010/2817/</ee>
<crossref>conf/dagstuhl/2010P10261</crossref>
<url>db/conf/dagstuhl/P10261.html#ItalianoJMS10</url>
</inproceedings>
</r>
<r><inproceedings publtype="informal" key="conf/dagstuhl/ItalianoJMS10a" mdate="2025-05-26">
<author pid="i/GiuseppeFItaliano">Giuseppe F. Italiano</author>
<author pid="j/DavidSJohnson">David S. Johnson 0001</author>
<author pid="m/PetraMutzel">Petra Mutzel</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>10261 Executive Summary - Algorithm Engineering.</title>
<year>2010</year>
<booktitle>Algorithm Engineering</booktitle>
<ee type="oa">http://drops.dagstuhl.de/opus/volltexte/2010/2796/</ee>
<crossref>conf/dagstuhl/2010P10261</crossref>
<url>db/conf/dagstuhl/P10261.html#ItalianoJMS10a</url>
</inproceedings>
</r>
<r><article publtype="informal" key="journals/corr/abs-1002-4330" mdate="2018-08-13">
<author pid="90/7867">Jonathan Dees</author>
<author pid="52/3048">Robert Geisberger</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="78/7867">Roland Bader</author>
<title>Defining and Computing Alternative Routes in Road Networks</title>
<ee type="oa">http://arxiv.org/abs/1002.4330</ee>
<year>2010</year>
<journal>CoRR</journal>
<volume>abs/1002.4330</volume>
<url>db/journals/corr/corr1002.html#abs-1002-4330</url>
</article>
</r>
<r><article publtype="informal" key="journals/corr/abs-1004-4024" mdate="2018-08-13">
<author pid="91/2425">Vitaly Osipov</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>n-Level Graph Partitioning</title>
<ee type="oa">http://arxiv.org/abs/1004.4024</ee>
<year>2010</year>
<journal>CoRR</journal>
<volume>abs/1004.4024</volume>
<url>db/journals/corr/corr1004.html#abs-1004-4024</url>
</article>
</r>
<r><article publtype="informal" key="journals/corr/abs-1008-1191" mdate="2018-08-13">
<author pid="97/8398">Daniel Karch</author>
<author pid="48/7217">Dennis Luxen</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>Improved Fast Similarity Search in Dictionaries</title>
<ee type="oa">http://arxiv.org/abs/1008.1191</ee>
<year>2010</year>
<journal>CoRR</journal>
<volume>abs/1008.1191</volume>
<url>db/journals/corr/corr1008.html#abs-1008-1191</url>
</article>
</r>
<r><article publtype="informal" key="journals/corr/abs-1008-2849" mdate="2018-08-13">
<author pid="44/7407">Jan Wassenberg</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>Faster Radix Sort via Virtual Memory and Write-Combining</title>
<ee type="oa">http://arxiv.org/abs/1008.2849</ee>
<year>2010</year>
<journal>CoRR</journal>
<volume>abs/1008.2849</volume>
<url>db/journals/corr/corr1008.html#abs-1008-2849</url>
</article>
</r>
<r><article publtype="informal" key="journals/corr/abs-1011-4465" mdate="2018-08-13">
<author pid="85/4519">Gernot Veit Batz</author>
<author pid="52/3048">Robert Geisberger</author>
<author pid="48/7217">Dennis Luxen</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>Compressed Transmission of Route Descriptions</title>
<ee type="oa">http://arxiv.org/abs/1011.4465</ee>
<year>2010</year>
<journal>CoRR</journal>
<volume>abs/1011.4465</volume>
<url>db/journals/corr/corr1011.html#abs-1011-4465</url>
</article>
</r>
<r><article publtype="informal" key="journals/corr/abs-1012-0006" mdate="2018-08-13">
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="10/1388-3">Christian Schulz 0003</author>
<title>Engineering Multilevel Graph Partitioning Algorithms</title>
<ee type="oa">http://arxiv.org/abs/1012.0006</ee>
<year>2010</year>
<journal>CoRR</journal>
<volume>abs/1012.0006</volume>
<url>db/journals/corr/corr1012.html#abs-1012-0006</url>
</article>
</r>
<r><article key="journals/jea/MaueSM09" mdate="2020-06-25">
<author pid="98/5569">Jens Maue</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="m/DomagojMatijevic">Domagoj Matijevic</author>
<title>Goal-directed shortest-path queries using precomputed cluster distances.</title>
<year>2009</year>
<volume>14</volume>
<journal>ACM J. Exp. Algorithmics</journal>
<ee>https://doi.org/10.1145/1498698.1564502</ee>
<url>db/journals/jea/jea14.html#MaueSM09</url>
</article>
</r>
<r><article key="journals/jea/PutzeSS09" mdate="2020-06-25">
<author pid="37/3890">Felix Putze</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="s/JohannesSingler">Johannes Singler</author>
<title>Cache-, hash-, and space-efficient bloom filters.</title>
<year>2009</year>
<volume>14</volume>
<journal>ACM J. Exp. Algorithmics</journal>
<ee>https://doi.org/10.1145/1498698.1594230</ee>
<url>db/journals/jea/jea14.html#PutzeSS09</url>
</article>
</r>
<r><article key="journals/mor/SandersSS09" mdate="2017-05-28">
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="70/613">Naveen Sivadasan</author>
<author pid="80/2691">Martin Skutella</author>
<title>Online Scheduling with Bounded Migration.</title>
<pages>481-498</pages>
<year>2009</year>
<volume>34</volume>
<journal>Math. Oper. Res.</journal>
<number>2</number>
<ee>https://doi.org/10.1287/moor.1090.0381</ee>
<url>db/journals/mor/mor34.html#SandersSS09</url>
</article>
</r>
<r><article key="journals/pc/SandersST09" mdate="2020-02-22">
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="28/6353">Jochen Speck</author>
<author pid="t/JLTraff">Jesper Larsson Tr&#228;ff</author>
<title>Two-tree algorithms for full bandwidth broadcast, reduction and scan.</title>
<pages>581-594</pages>
<year>2009</year>
<volume>35</volume>
<journal>Parallel Comput.</journal>
<number>12</number>
<ee>https://doi.org/10.1016/j.parco.2009.09.001</ee>
<ee>https://www.wikidata.org/entity/Q64114876</ee>
<url>db/journals/pc/pc35.html#SandersST09</url>
</article>
</r>
<r><inproceedings key="conf/alenex/OsipovSS09" mdate="2017-05-19">
<author pid="91/2425">Vitaly Osipov</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="s/JohannesSingler">Johannes Singler</author>
<title>The Filter-Kruskal Minimum Spanning Tree Algorithm.</title>
<pages>52-61</pages>
<year>2009</year>
<booktitle>ALENEX</booktitle>
<ee>https://doi.org/10.1137/1.9781611972894.5</ee>
<crossref>conf/alenex/2009</crossref>
<url>db/conf/alenex/alenex2009.html#OsipovSS09</url>
</inproceedings>
</r>
<r><inproceedings key="conf/alenex/BatzDSV09" mdate="2017-05-19">
<author pid="85/4519">Gernot Veit Batz</author>
<author pid="10/5981">Daniel Delling</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="95/3382">Christian Vetter</author>
<title>Time-Dependent Contraction Hierarchies.</title>
<pages>97-105</pages>
<year>2009</year>
<booktitle>ALENEX</booktitle>
<ee>https://doi.org/10.1137/1.9781611972894.10</ee>
<crossref>conf/alenex/2009</crossref>
<url>db/conf/alenex/alenex2009.html#BatzDSV09</url>
</inproceedings>
</r>
<r><inproceedings key="conf/birthday/Sanders09" mdate="2017-05-23">
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>Algorithm Engineering - An Attempt at a Definition.</title>
<pages>321-340</pages>
<year>2009</year>
<booktitle>Efficient Algorithms</booktitle>
<ee>https://doi.org/10.1007/978-3-642-03456-5_22</ee>
<crossref>conf/birthday/2009mehlhorn</crossref>
<url>db/conf/birthday/mehlhorn2009.html#Sanders09</url>
</inproceedings>
</r>
<r><inproceedings key="conf/caip/WassenbergMS09" mdate="2017-05-21">
<author pid="44/7407">Jan Wassenberg</author>
<author pid="85/6769">Wolfgang Middelmann</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>An Efficient Parallel Algorithm for Graph-Based Image Segmentation.</title>
<pages>1003-1010</pages>
<year>2009</year>
<booktitle>CAIP</booktitle>
<ee>https://doi.org/10.1007/978-3-642-03767-2_122</ee>
<crossref>conf/caip/2009</crossref>
<url>db/conf/caip/caip2009.html#WassenbergMS09</url>
</inproceedings>
</r>
<r><inproceedings key="conf/dfg/DellingSSW09" mdate="2018-11-14">
<author pid="10/5981">Daniel Delling</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="31/3154">Dominik Schultes</author>
<author pid="w/DorotheaWagner">Dorothea Wagner</author>
<title>Engineering Route Planning Algorithms.</title>
<pages>117-139</pages>
<year>2009</year>
<booktitle>Algorithmics of Large and Complex Networks</booktitle>
<ee>https://doi.org/10.1007/978-3-642-02094-0_7</ee>
<ee>https://www.wikidata.org/entity/Q55924035</ee>
<crossref>conf/dfg/2009netw</crossref>
<url>db/conf/dfg/netw2009.html#DellingSSW09</url>
</inproceedings>
</r>
<r><inproceedings key="conf/icalp/GfellerS09" mdate="2017-05-23">
<author pid="43/5670">Beat Gfeller</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>Towards Optimal Range Medians.</title>
<pages>475-486</pages>
<year>2009</year>
<booktitle>ICALP (1)</booktitle>
<ee>https://doi.org/10.1007/978-3-642-02927-1_40</ee>
<crossref>conf/icalp/2009-1</crossref>
<url>db/conf/icalp/icalp2009-1.html#GfellerS09</url>
</inproceedings>
</r>
<r><proceedings key="conf/dagstuhl/2009P9491" mdate="2021-06-10">
<editor pid="92/3060">Lubos Brim</editor>
<editor pid="98/3919">Stefan Edelkamp</editor>
<editor pid="02/6770">Eric A. Hansen</editor>
<editor pid="s/PeterSanders">Peter Sanders 0001</editor>
<title>Graph Search Engineering, 29.11. - 04.12.2009</title>
<booktitle>Graph Search Engineering</booktitle>
<volume>09491</volume>
<year>2009</year>
<publisher>Schloss Dagstuhl - Leibniz-Zentrum f&#252;r Informatik, Germany</publisher>
<series href="db/series/dagstuhl/index.html">Dagstuhl Seminar Proceedings</series>
<url>db/conf/dagstuhl/P9491.html</url>
<ee type="oa">http://drops.dagstuhl.de/portals/09491/</ee>
</proceedings>
</r>
<r><proceedings key="conf/esa/2009" mdate="2019-05-14">
<editor pid="06/894">Amos Fiat</editor>
<editor pid="s/PeterSanders">Peter Sanders 0001</editor>
<title>Algorithms - ESA 2009, 17th Annual European Symposium, Copenhagen, Denmark, September 7-9, 2009. Proceedings</title>
<volume>5757</volume>
<year>2009</year>
<ee>https://doi.org/10.1007/978-3-642-04128-0</ee>
<isbn>978-3-642-04127-3</isbn>
<booktitle>ESA</booktitle>
<series href="db/series/lncs/index.html">Lecture Notes in Computer Science</series>
<publisher>Springer</publisher>
<url>db/conf/esa/esa2009.html</url>
</proceedings>
</r>
<r><inproceedings publtype="informal" key="conf/dagstuhl/BrimEHS09" mdate="2018-08-23">
<author pid="92/3060">Lubos Brim</author>
<author pid="98/3919">Stefan Edelkamp</author>
<author pid="02/6770">Eric A. Hansen</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>09491 Abstracts Collection - Graph Search Engineering.</title>
<year>2009</year>
<booktitle>Graph Search Engineering</booktitle>
<ee type="oa">http://drops.dagstuhl.de/opus/volltexte/2010/2431/</ee>
<crossref>conf/dagstuhl/2009P9491</crossref>
<url>db/conf/dagstuhl/P9491.html#BrimEHS09</url>
</inproceedings>
</r>
<r><article publtype="informal" key="journals/corr/abs-0901-1761" mdate="2018-08-13">
<author pid="43/5670">Beat Gfeller</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>Towards Optimal Range Medians</title>
<ee type="oa">http://arxiv.org/abs/0901.1761</ee>
<year>2009</year>
<journal>CoRR</journal>
<volume>abs/0901.1761</volume>
<url>db/journals/corr/corr0901.html#abs-0901-1761</url>
</article>
</r>
<r><article publtype="informal" key="journals/corr/abs-0907-5269" mdate="2018-08-13">
<author pid="52/3048">Robert Geisberger</author>
<author pid="48/7217">Dennis Luxen</author>
<author pid="75/7218">Sabine Neubauer</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="14/2332">Lars V&#246;lker</author>
<title>Fast Detour Computation for Ride Sharing</title>
<ee type="oa">http://arxiv.org/abs/0907.5269</ee>
<year>2009</year>
<journal>CoRR</journal>
<volume>abs/0907.5269</volume>
<url>db/journals/corr/corr0907.html#abs-0907-5269</url>
</article>
</r>
<r><article publtype="informal" key="journals/corr/abs-0909-5649" mdate="2018-08-13">
<author pid="96/7412">Nikolaj Leischner</author>
<author pid="91/2425">Vitaly Osipov</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>GPU sample sort</title>
<ee type="oa">http://arxiv.org/abs/0909.5649</ee>
<year>2009</year>
<journal>CoRR</journal>
<volume>abs/0909.5649</volume>
<url>db/journals/corr/corr0909.html#abs-0909-5649</url>
</article>
</r>
<r><article publtype="informal" key="journals/corr/abs-0910-2004" mdate="2018-08-13">
<author pid="64/7481">Manuel Holtgrewe</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="10/1388-3">Christian Schulz 0003</author>
<title>Engineering a Scalable High Quality Graph Partitioner</title>
<ee type="oa">http://arxiv.org/abs/0910.2004</ee>
<year>2009</year>
<journal>CoRR</journal>
<volume>abs/0910.2004</volume>
<url>db/journals/corr/corr0910.html#abs-0910-2004</url>
</article>
</r>
<r><article publtype="informal" key="journals/corr/abs-0910-2582" mdate="2018-08-13">
<author pid="96/4653">Mirko Rahn</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="s/JohannesSingler">Johannes Singler</author>
<title>Scalable Distributed-Memory External Sorting</title>
<ee type="oa">http://arxiv.org/abs/0910.2582</ee>
<year>2009</year>
<journal>CoRR</journal>
<volume>abs/0910.2582</volume>
<url>db/journals/corr/corr0910.html#abs-0910-2582</url>
</article>
</r>
<r><book key="books/sp/MehlhornS2008" mdate="2018-11-14">
<author pid="m/KurtMehlhorn">Kurt Mehlhorn</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>Algorithms and Data Structures: The Basic Toolbox.</title>
<publisher>Springer</publisher>
<year>2008</year>
<isbn>978-3-540-77977-3</isbn>
<ee>https://doi.org/10.1007/978-3-540-77978-0</ee>
<ee>https://www.wikidata.org/entity/Q54200828</ee>
</book>
</r>
<r><article key="journals/cit/FunkeMS08" mdate="2022-06-10">
<author pid="f/StefanFunke">Stefan Funke</author>
<author pid="m/DomagojMatijevic">Domagoj Matijevic</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>Constant Time Queries for Energy Efficient Paths in Multi-hop Wireless Networks.</title>
<pages>119-130</pages>
<year>2008</year>
<volume>16</volume>
<journal>J. Comput. Inf. Technol.</journal>
<number>2</number>
<ee>https://doi.org/10.2498/cit.1001047</ee>
<url>db/journals/cit/cit16.html#FunkeMS08</url>
</article>
</r>
<r><article key="journals/jea/DementievKMS08" mdate="2020-10-26">
<author pid="d/RomanDementiev">Roman Dementiev</author>
<author pid="k/JKarkkainen">Juha K&#228;rkk&#228;inen</author>
<author orcid="0000-0002-0079-0036" pid="09/5738">Jens Mehnert</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>Better external memory suffix array construction.</title>
<year>2008</year>
<volume>12</volume>
<journal>ACM J. Exp. Algorithmics</journal>
<ee>https://doi.org/10.1145/1227161.1402296</ee>
<ee>https://www.wikidata.org/entity/Q56485255</ee>
<url>db/journals/jea/jea12.html#DementievKMS08</url>
<pages>3.4:1-3.4:24</pages>
</article>
</r>
<r><article key="journals/scpe/FriasSS08" mdate="2021-02-17">
<author pid="19/5909">Leonor Frias</author>
<author pid="s/JohannesSingler">Johannes Singler</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>Single-Pass List Partitioning.</title>
<year>2008</year>
<volume>9</volume>
<journal>Scalable Comput. Pract. Exp.</journal>
<number>3</number>
<ee type="oa">http://www.scpe.org/index.php/scpe/article/view/538</ee>
<url>db/journals/scpe/scpe9.html#FriasSS08</url>
</article>
</r>
<r><article key="journals/spe/DementievKS08" mdate="2020-04-09">
<author pid="d/RomanDementiev">Roman Dementiev</author>
<author pid="56/4202">Lutz Kettner</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>STXXL: standard template library for XXL data sets.</title>
<pages>589-637</pages>
<year>2008</year>
<volume>38</volume>
<journal>Softw. Pract. Exp.</journal>
<number>6</number>
<ee>https://doi.org/10.1002/spe.844</ee>
<url>db/journals/spe/spe38.html#DementievKS08</url>
</article>
</r>
<r><article key="journals/talg/SandersS08" mdate="2024-08-04">
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author orcid="0000-0002-3908-8180" pid="59/254">David Steurer</author>
<title>An asymptotic approximation scheme for multigraph edge coloring.</title>
<year>2008</year>
<volume>4</volume>
<journal>ACM Trans. Algorithms</journal>
<number>2</number>
<ee>https://doi.org/10.1145/1361192.1361198</ee>
<url>db/journals/talg/talg4.html#SandersS08</url>
<pages>21:1-21:24</pages>
</article>
</r>
<r><inproceedings key="conf/alenex/TransierS08" mdate="2017-05-19">
<author pid="71/3602">Frederik Transier</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>Compressed Inverted Indexes for In-Memory Search Engines.</title>
<pages>3-12</pages>
<year>2008</year>
<booktitle>ALENEX</booktitle>
<ee>https://doi.org/10.1137/1.9781611972887.1</ee>
<crossref>conf/alenex/2008</crossref>
<url>db/conf/alenex/alenex2008.html#TransierS08</url>
</inproceedings>
</r>
<r><inproceedings key="conf/alenex/GeisbergerSS08" mdate="2017-05-19">
<author pid="52/3048">Robert Geisberger</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="31/3154">Dominik Schultes</author>
<title>Better Approximation of Betweenness Centrality.</title>
<pages>90-100</pages>
<year>2008</year>
<booktitle>ALENEX</booktitle>
<ee>https://doi.org/10.1137/1.9781611972887.9</ee>
<crossref>conf/alenex/2008</crossref>
<url>db/conf/alenex/alenex2008.html#GeisbergerSS08</url>
</inproceedings>
</r>
<r><inproceedings key="conf/cav/EdelkampSS08" mdate="2018-10-03">
<author pid="98/3919">Stefan Edelkamp</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="66/1775">Pavel Simecek</author>
<title>Semi-external LTL Model Checking.</title>
<pages>530-542</pages>
<year>2008</year>
<booktitle>CAV</booktitle>
<ee type="oa">https://doi.org/10.1007/978-3-540-70545-1_50</ee>
<crossref>conf/cav/2008</crossref>
<url>db/conf/cav/cav2008.html#EdelkampSS08</url>
</inproceedings>
</r>
<r><inproceedings key="conf/cisis/FriasSS08" mdate="2023-03-24">
<author pid="19/5909">Leonor Frias</author>
<author pid="s/JohannesSingler">Johannes Singler</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>Single-Pass List Partitioning.</title>
<pages>817-821</pages>
<year>2008</year>
<crossref>conf/cisis/2008</crossref>
<booktitle>CISIS</booktitle>
<ee>https://doi.org/10.1109/CISIS.2008.44</ee>
<ee>https://doi.ieeecomputersociety.org/10.1109/CISIS.2008.44</ee>
<url>db/conf/cisis/cisis2008.html#FriasSS08</url>
</inproceedings>
</r>
<r><inproceedings key="conf/esa/SandersSV08" mdate="2017-05-26">
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="31/3154">Dominik Schultes</author>
<author pid="95/3382">Christian Vetter</author>
<title>Mobile Route Planning.</title>
<pages>732-743</pages>
<year>2008</year>
<booktitle>ESA</booktitle>
<ee>https://doi.org/10.1007/978-3-540-87744-8_61</ee>
<crossref>conf/esa/2008</crossref>
<url>db/conf/esa/esa2008.html#SandersSV08</url>
</inproceedings>
</r>
<r><inproceedings key="conf/spire/TransierS08" mdate="2017-05-24">
<author pid="71/3602">Frederik Transier</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>Out of the Box Phrase Indexing.</title>
<pages>200-211</pages>
<year>2008</year>
<booktitle>SPIRE</booktitle>
<ee>https://doi.org/10.1007/978-3-540-89097-3_20</ee>
<crossref>conf/spire/2008</crossref>
<url>db/conf/spire/spire2008.html#TransierS08</url>
</inproceedings>
</r>
<r><inproceedings key="conf/wea/BauerDSSSW08" mdate="2017-05-17">
<author pid="40/7046">Reinhard Bauer</author>
<author pid="10/5981">Daniel Delling</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="77/2645">Dennis Schieferdecker</author>
<author pid="31/3154">Dominik Schultes</author>
<author pid="w/DorotheaWagner">Dorothea Wagner</author>
<title>Combining Hierarchical and Goal-Directed Speed-Up Techniques for Dijkstra's Algorithm.</title>
<pages>303-318</pages>
<year>2008</year>
<booktitle>WEA</booktitle>
<ee>https://doi.org/10.1007/978-3-540-68552-4_23</ee>
<crossref>conf/wea/2008</crossref>
<url>db/conf/wea/wea2008.html#BauerDSSSW08</url>
</inproceedings>
</r>
<r><inproceedings key="conf/wea/GeisbergerSSD08" mdate="2017-05-17">
<author pid="52/3048">Robert Geisberger</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="31/3154">Dominik Schultes</author>
<author pid="10/5981">Daniel Delling</author>
<title>Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks.</title>
<pages>319-333</pages>
<year>2008</year>
<booktitle>WEA</booktitle>
<ee>https://doi.org/10.1007/978-3-540-68552-4_24</ee>
<crossref>conf/wea/2008</crossref>
<url>db/conf/wea/wea2008.html#GeisbergerSSD08</url>
</inproceedings>
</r>
<r><incollection key="reference/algo/SandersS08" mdate="2017-05-16">
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="s/JohannesSingler">Johannes Singler</author>
<title>K&#252;rzeste Wege.</title>
<pages>345-352</pages>
<year>2008</year>
<booktitle>Taschenbuch der Algorithmen</booktitle>
<ee>https://doi.org/10.1007/978-3-540-76394-9_34</ee>
<crossref>reference/algo/2008t</crossref>
<url>db/reference/algo/taschenbuch2008.html#SandersS08</url>
</incollection>
</r>
<r><article publtype="informal" key="journals/corr/abs-0804-3947" mdate="2018-08-13">
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>Time Dependent Contraction Hierarchies -- Basic Algorithmic Ideas</title>
<ee type="oa">http://arxiv.org/abs/0804.3947</ee>
<year>2008</year>
<journal>CoRR</journal>
<volume>abs/0804.3947</volume>
<url>db/journals/corr/corr0804.html#abs-0804-3947</url>
</article>
</r>
<r><article key="journals/pc/KullaS07" mdate="2020-02-22">
<author pid="85/6949">Fabian Kulla</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>Scalable parallel suffix array construction.</title>
<pages>605-612</pages>
<year>2007</year>
<volume>33</volume>
<journal>Parallel Comput.</journal>
<number>9</number>
<ee>https://doi.org/10.1016/j.parco.2007.06.004</ee>
<ee>https://www.wikidata.org/entity/Q56485257</ee>
<url>db/journals/pc/pc33.html#KullaS07</url>
</article>
</r>
<r><inproceedings key="conf/alenex/BastFMSS07" mdate="2023-08-28">
<author pid="b/HannahBast">Hannah Bast</author>
<author pid="f/StefanFunke">Stefan Funke</author>
<author pid="m/DomagojMatijevic">Domagoj Matijevic</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="31/3154">Dominik Schultes</author>
<title>In Transit to Constant Time Shortest-Path Queries in Road Networks.</title>
<year>2007</year>
<crossref>conf/alenex/2007</crossref>
<booktitle>ALENEX</booktitle>
<ee>https://doi.org/10.1137/1.9781611972870.5</ee>
<ee>https://www.wikidata.org/entity/Q121550666</ee>
<url>db/conf/alenex/alenex2007.html#BastFMSS07</url>
</inproceedings>
</r>
<r><inproceedings key="conf/alenex/KnoppSSSW07" mdate="2020-09-05">
<author pid="76/5320">Sebastian Knopp</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="31/3154">Dominik Schultes</author>
<author orcid="0000-0002-3144-8479" pid="s/FranKSchulz">Frank Schulz 0001</author>
<author pid="w/DorotheaWagner">Dorothea Wagner</author>
<title>Computing Many-to-Many Shortest Paths Using Highway Hierarchies.</title>
<year>2007</year>
<crossref>conf/alenex/2007</crossref>
<booktitle>ALENEX</booktitle>
<ee>https://doi.org/10.1137/1.9781611972870.4</ee>
<url>db/conf/alenex/alenex2007.html#KnoppSSSW07</url>
</inproceedings>
</r>
<r><inproceedings key="conf/alenex/SandersT07" mdate="2017-05-19">
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="71/3602">Frederik Transier</author>
<title>Intersection in Integer Inverted Indices.</title>
<year>2007</year>
<crossref>conf/alenex/2007</crossref>
<booktitle>ALENEX</booktitle>
<ee>https://doi.org/10.1137/1.9781611972870.7</ee>
<url>db/conf/alenex/alenex2007.html#SandersT07</url>
</inproceedings>
</r>
<r><inproceedings key="conf/europar/SinglerSP07" mdate="2019-06-02">
<author pid="s/JohannesSingler">Johannes Singler</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="37/3890">Felix Putze</author>
<title>MCSTL: The Multi-core Standard Template Library.</title>
<pages>682-694</pages>
<year>2007</year>
<crossref>conf/europar/2007</crossref>
<booktitle>Euro-Par</booktitle>
<ee>https://doi.org/10.1007/978-3-540-74466-5_72</ee>
<ee>https://www.wikidata.org/entity/Q63353490</ee>
<url>db/conf/europar/europar2007.html#SinglerSP07</url>
</inproceedings>
</r>
<r><inproceedings key="conf/ppopp/PutzeSS07" mdate="2022-06-12">
<author pid="37/3890">Felix Putze</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="s/JohannesSingler">Johannes Singler</author>
<title>MCSTL: the multi-core standard template library.</title>
<pages>144-145</pages>
<year>2007</year>
<crossref>conf/ppopp/2007</crossref>
<booktitle>PPoPP</booktitle>
<ee>https://doi.org/10.1145/1229428.1229458</ee>
<url>db/conf/ppopp/ppopp2007.html#PutzeSS07</url>
</inproceedings>
</r>
<r><inproceedings key="conf/pvm/SandersST07" mdate="2017-05-19">
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="28/6353">Jochen Speck</author>
<author pid="t/JLTraff">Jesper Larsson Tr&#228;ff</author>
<title>Full Bandwidth Broadcast, Reduction and Scan with Only Two Trees.</title>
<pages>17-26</pages>
<year>2007</year>
<crossref>conf/pvm/2007</crossref>
<booktitle>PVM/MPI</booktitle>
<ee>https://doi.org/10.1007/978-3-540-75416-9_10</ee>
<url>db/conf/pvm/pvm2007.html#SandersST07</url>
</inproceedings>
</r>
<r><inproceedings key="conf/soda/CainSW07" mdate="2017-01-06">
<author pid="99/6759">Julie Anne Cain</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="w/NicholasCWormald">Nicholas C. Wormald</author>
<title>The random graph threshold for <i>k</i>-orientiability and a fast algorithm for optimal multiple-choice allocation.</title>
<pages>469-476</pages>
<year>2007</year>
<crossref>conf/soda/2007</crossref>
<booktitle>SODA</booktitle>
<ee>http://dl.acm.org/citation.cfm?id=1283383.1283433</ee>
<url>db/conf/soda/soda2007.html#CainSW07</url>
</inproceedings>
</r>
<r><inproceedings key="conf/wea/SandersS07" mdate="2017-05-17">
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="31/3154">Dominik Schultes</author>
<title>Engineering Fast Route Planning Algorithms.</title>
<pages>23-36</pages>
<year>2007</year>
<crossref>conf/wea/2007</crossref>
<booktitle>WEA</booktitle>
<ee>https://doi.org/10.1007/978-3-540-72845-0_2</ee>
<url>db/conf/wea/wea2007.html#SandersS07</url>
</inproceedings>
</r>
<r><inproceedings key="conf/wea/SchultesS07" mdate="2017-05-17">
<author pid="31/3154">Dominik Schultes</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>Dynamic Highway-Node Routing.</title>
<pages>66-79</pages>
<year>2007</year>
<crossref>conf/wea/2007</crossref>
<booktitle>WEA</booktitle>
<ee>https://doi.org/10.1007/978-3-540-72845-0_6</ee>
<url>db/conf/wea/wea2007.html#SchultesS07</url>
</inproceedings>
</r>
<r><inproceedings key="conf/wea/PutzeSS07" mdate="2017-05-17">
<author pid="37/3890">Felix Putze</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="s/JohannesSingler">Johannes Singler</author>
<title>Cache-, Hash- and Space-Efficient Bloom Filters.</title>
<pages>108-121</pages>
<year>2007</year>
<crossref>conf/wea/2007</crossref>
<booktitle>WEA</booktitle>
<ee>https://doi.org/10.1007/978-3-540-72845-0_9</ee>
<url>db/conf/wea/wea2007.html#PutzeSS07</url>
</inproceedings>
</r>
<r><inproceedings key="conf/wea/MaueS07" mdate="2017-05-17">
<author pid="98/5569">Jens Maue</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>Engineering Algorithms for Approximate Weighted Matching.</title>
<pages>242-255</pages>
<year>2007</year>
<crossref>conf/wea/2007</crossref>
<booktitle>WEA</booktitle>
<ee>https://doi.org/10.1007/978-3-540-72845-0_19</ee>
<url>db/conf/wea/wea2007.html#MaueS07</url>
</inproceedings>
</r>
<r><article key="journals/jacm/KarkkainenSB06" mdate="2018-11-06">
<author pid="k/JKarkkainen">Juha K&#228;rkk&#228;inen</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="02/6792">Stefan Burkhardt</author>
<title>Linear work suffix array construction.</title>
<pages>918-936</pages>
<year>2006</year>
<volume>53</volume>
<journal>J. ACM</journal>
<number>6</number>
<ee>https://doi.org/10.1145/1217856.1217858</ee>
<url>db/journals/jacm/jacm53.html#KarkkainenSB06</url>
</article>
</r>
<r><article key="journals/mst/SandersSV06" mdate="2017-05-28">
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="s/AravindSrinivasan">Aravind Srinivasan</author>
<author pid="v/BertholdVocking">Berthold V&#246;cking</author>
<title>Foreword.</title>
<pages>785</pages>
<year>2006</year>
<volume>39</volume>
<journal>Theory Comput. Syst.</journal>
<number>6</number>
<ee>https://doi.org/10.1007/s00224-006-3906-y</ee>
<url>db/journals/mst/mst39.html#SandersSV06</url>
</article>
</r>
<r><inproceedings key="conf/dimacs/DellingSSW06" mdate="2022-06-09">
<author pid="10/5981">Daniel Delling</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="31/3154">Dominik Schultes</author>
<author pid="w/DorotheaWagner">Dorothea Wagner</author>
<title>Highway Hierarchies Star.</title>
<pages>141-174</pages>
<year>2006</year>
<booktitle>The Shortest Path Problem</booktitle>
<crossref>conf/dimacs/dimacs74</crossref>
<url>db/conf/dimacs/dimacs74.html#DellingSSW06</url>
<ee type="archive">https://doi.org/10.1090/dimacs/074/06</ee>
</inproceedings>
</r>
<r><inproceedings key="conf/dimacs/SandersS06" mdate="2022-06-09">
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="31/3154">Dominik Schultes</author>
<title>Robust, Almost Constant Time Shortest-Path Queries in Road Networks.</title>
<pages>193-218</pages>
<year>2006</year>
<booktitle>The Shortest Path Problem</booktitle>
<crossref>conf/dimacs/dimacs74</crossref>
<url>db/conf/dimacs/dimacs74.html#SandersS06</url>
<ee type="archive">https://doi.org/10.1090/dimacs/074/08</ee>
</inproceedings>
</r>
<r><inproceedings key="conf/esa/KaligosiS06" mdate="2017-05-26">
<author pid="01/3245">Kanela Kaligosi</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>How Branch Mispredictions Affect Quicksort.</title>
<pages>780-791</pages>
<year>2006</year>
<crossref>conf/esa/2006</crossref>
<booktitle>ESA</booktitle>
<ee>https://doi.org/10.1007/11841036_69</ee>
<url>db/conf/esa/esa2006.html#KaligosiS06</url>
</inproceedings>
</r>
<r><inproceedings key="conf/esa/SandersS06" mdate="2017-05-26">
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="31/3154">Dominik Schultes</author>
<title>Engineering Highway Hierarchies.</title>
<pages>804-816</pages>
<year>2006</year>
<crossref>conf/esa/2006</crossref>
<booktitle>ESA</booktitle>
<ee>https://doi.org/10.1007/11841036_71</ee>
<url>db/conf/esa/esa2006.html#SandersS06</url>
</inproceedings>
</r>
<r><inproceedings key="conf/pvm/KullaS06" mdate="2017-05-19">
<author pid="85/6949">Fabian Kulla</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>Scalable Parallel Suffix Array Construction.</title>
<pages>22-29</pages>
<year>2006</year>
<crossref>conf/pvm/2006</crossref>
<booktitle>PVM/MPI</booktitle>
<ee>https://doi.org/10.1007/11846802_12</ee>
<url>db/conf/pvm/pvm2006.html#KullaS06</url>
</inproceedings>
</r>
<r><inproceedings key="conf/pvm/SandersT06" mdate="2019-06-02">
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="t/JLTraff">Jesper Larsson Tr&#228;ff</author>
<title>Parallel Prefix (Scan) Algorithms for MPI.</title>
<pages>49-57</pages>
<year>2006</year>
<crossref>conf/pvm/2006</crossref>
<booktitle>PVM/MPI</booktitle>
<ee>https://doi.org/10.1007/11846802_15</ee>
<ee>https://www.wikidata.org/entity/Q63353489</ee>
<url>db/conf/pvm/pvm2006.html#SandersT06</url>
</inproceedings>
</r>
<r><inproceedings key="conf/wea/MaueSM06" mdate="2017-05-17">
<author pid="98/5569">Jens Maue</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="m/DomagojMatijevic">Domagoj Matijevic</author>
<title>Goal Directed Shortest Path Queries Using Precomputed Cluster Distances.</title>
<pages>316-327</pages>
<year>2006</year>
<crossref>conf/wea/2006</crossref>
<booktitle>WEA</booktitle>
<ee>https://doi.org/10.1007/11764298_29</ee>
<url>db/conf/wea/wea2006.html#MaueSM06</url>
</inproceedings>
</r>
<r><article key="journals/mst/FotakisPSS05" mdate="2022-03-24">
<author orcid="0000-0001-6864-8960" pid="95/4731">Dimitris Fotakis 0001</author>
<author pid="p/RasmusPagh">Rasmus Pagh</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="s/PaulGSpirakis">Paul G. Spirakis</author>
<title>Space Efficient Hash Tables with Worst Case Constant Access Time.</title>
<pages>229-248</pages>
<year>2005</year>
<volume>38</volume>
<journal>Theory Comput. Syst.</journal>
<number>2</number>
<ee>https://doi.org/10.1007/s00224-004-1195-x</ee>
<ee>https://www.wikidata.org/entity/Q59818745</ee>
<url>db/journals/mst/mst38.html#FotakisPSS05</url>
</article>
</r>
<r><article key="journals/siamcomp/HutchinsonSV05" mdate="2023-03-21">
<author pid="h/DavidAHutchinson">David A. Hutchinson</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author orcid="0000-0001-7970-6118" pid="v/JeffreyScottVitter">Jeffrey Scott Vitter</author>
<title>Duality Between Prefetching and Queued Writing with Parallel Disks.</title>
<pages>1443-1463</pages>
<year>2005</year>
<volume>34</volume>
<journal>SIAM J. Comput.</journal>
<number>6</number>
<ee>https://doi.org/10.1137/S0097539703431573</ee>
<url>db/journals/siamcomp/siamcomp34.html#HutchinsonSV05</url>
</article>
</r>
<r><article key="journals/tit/JaggiSCEEJT05" mdate="2020-03-10">
<author pid="77/4320">Sidharth Jaggi</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="c/PhilipAChou">Philip A. Chou</author>
<author pid="83/4741">Michelle Effros</author>
<author pid="66/3540">Sebastian Egner</author>
<author pid="13/4619">Kamal Jain</author>
<author pid="05/7218">Ludo M. G. M. Tolhuizen</author>
<title>Polynomial time algorithms for multicast network code construction.</title>
<pages>1973-1982</pages>
<year>2005</year>
<volume>51</volume>
<journal>IEEE Trans. Inf. Theory</journal>
<number>6</number>
<ee>https://doi.org/10.1109/TIT.2005.847712</ee>
<url>db/journals/tit/tit51.html#JaggiSCEEJT05</url>
</article>
</r>
<r><inproceedings key="conf/alenex/DementievKMS05" mdate="2017-01-06">
<author pid="d/RomanDementiev">Roman Dementiev</author>
<author pid="k/JKarkkainen">Juha K&#228;rkk&#228;inen</author>
<author pid="09/5738">Jens Mehnert</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>Better External Memory Suffix Array Construction.</title>
<pages>86-97</pages>
<year>2005</year>
<crossref>conf/alenex/2005</crossref>
<booktitle>ALENEX/ANALCO</booktitle>
<ee>http://www.siam.org/meetings/alenex05/papers/08rdementiev.pdf</ee>
<url>db/conf/alenex/alenex2005.html#DementievKMS05</url>
</inproceedings>
</r>
<r><inproceedings key="conf/esa/SandersS05" mdate="2017-05-26">
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="31/3154">Dominik Schultes</author>
<title>Highway Hierarchies Hasten Exact Shortest Path Queries.</title>
<pages>568-579</pages>
<year>2005</year>
<crossref>conf/esa/2005</crossref>
<booktitle>ESA</booktitle>
<ee>https://doi.org/10.1007/11561071_51</ee>
<url>db/conf/esa/esa2005.html#SandersS05</url>
</inproceedings>
</r>
<r><inproceedings key="conf/esa/DementievKS05" mdate="2017-05-26">
<author pid="d/RomanDementiev">Roman Dementiev</author>
<author pid="56/4202">Lutz Kettner</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>: Standard Template Library for XXL Data Sets.</title>
<pages>640-651</pages>
<year>2005</year>
<crossref>conf/esa/2005</crossref>
<booktitle>ESA</booktitle>
<ee>https://doi.org/10.1007/11561071_57</ee>
<url>db/conf/esa/esa2005.html#DementievKS05</url>
</inproceedings>
</r>
<r><inproceedings key="conf/icalp/KaligosiMMS05" mdate="2017-05-23">
<author pid="01/3245">Kanela Kaligosi</author>
<author pid="m/KurtMehlhorn">Kurt Mehlhorn</author>
<author pid="m/JIanMunro">J. Ian Munro</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>Towards Optimal Multiple Selection.</title>
<pages>103-114</pages>
<year>2005</year>
<crossref>conf/icalp/2005</crossref>
<booktitle>ICALP</booktitle>
<ee>https://doi.org/10.1007/11523468_9</ee>
<url>db/conf/icalp/icalp2005.html#KaligosiMMS05</url>
</inproceedings>
</r>
<r><inproceedings key="conf/soda/SandersS05" mdate="2024-08-04">
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author orcid="0000-0002-3908-8180" pid="59/254">David Steurer</author>
<title>An asymptotic approximation scheme for multigraph edge coloring.</title>
<pages>897-906</pages>
<year>2005</year>
<crossref>conf/soda/2005</crossref>
<booktitle>SODA</booktitle>
<ee>http://dl.acm.org/citation.cfm?id=1070432.1070559</ee>
<url>db/conf/soda/soda2005.html#SandersS05</url>
</inproceedings>
</r>
<r><inproceedings publtype="informal" key="conf/dagstuhl/SandersSS05" mdate="2018-08-23">
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="70/613">Naveen Sivadasan</author>
<author pid="80/2691">Martin Skutella</author>
<title>Online Scheduling with Bounded Migration.</title>
<year>2005</year>
<crossref>conf/dagstuhl/2005P5031</crossref>
<booktitle>Algorithms for Optimization with Incomplete Information</booktitle>
<ee type="oa">http://drops.dagstuhl.de/opus/volltexte/2005/70</ee>
<url>db/conf/dagstuhl/P5031.html#SandersSS05</url>
</inproceedings>
</r>
<r><article key="journals/eatcs/Sanders04" mdate="2020-06-18">
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>Algorithms for Memory Hierarchies (Column: Algorithmics).</title>
<pages>67-85</pages>
<year>2004</year>
<volume>83</volume>
<journal>Bull. EATCS</journal>
<url>db/journals/eatcs/eatcs83.html#Sanders04</url>
</article>
</r>
<r><article key="journals/ipl/PettieS04" mdate="2017-05-26">
<author pid="77/888">Seth Pettie</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>A simpler linear time 2/3-epsilon approximation for maximum weight matching.</title>
<pages>271-276</pages>
<year>2004</year>
<volume>91</volume>
<journal>Inf. Process. Lett.</journal>
<number>6</number>
<ee>https://doi.org/10.1016/j.ipl.2004.05.007</ee>
<url>db/journals/ipl/ipl91.html#PettieS04</url>
</article>
</r>
<r><inproceedings key="conf/alenex/DementievKMS04" mdate="2017-01-06">
<author pid="d/RomanDementiev">Roman Dementiev</author>
<author pid="56/4202">Lutz Kettner</author>
<author pid="09/5738">Jens Mehnert</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>Engineering a Sorted List Data Structure for 32 Bit Key.</title>
<pages>142-151</pages>
<year>2004</year>
<crossref>conf/alenex/2004</crossref>
<booktitle>ALENEX/ANALC</booktitle>
<url>db/conf/alenex/alenex2004.html#DementievKMS04</url>
</inproceedings>
</r>
<r><inproceedings key="conf/esa/SandersW04" mdate="2018-11-14">
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="05/3117">Sebastian Winkel</author>
<title>Super Scalar Sample Sort.</title>
<pages>784-796</pages>
<ee>https://doi.org/10.1007/978-3-540-30140-0_69</ee>
<ee>https://www.wikidata.org/entity/Q56679547</ee>
<year>2004</year>
<crossref>conf/esa/2004</crossref>
<booktitle>ESA</booktitle>
<url>db/conf/esa/esa2004.html#SandersW04</url>
</inproceedings>
</r>
<r><inproceedings key="conf/icalp/SandersSS04" mdate="2017-05-23">
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="70/613">Naveen Sivadasan</author>
<author pid="80/2691">Martin Skutella</author>
<title>Online Scheduling with Bounded Migration.</title>
<pages>1111-1122</pages>
<ee>https://doi.org/10.1007/978-3-540-27836-8_92</ee>
<year>2004</year>
<crossref>conf/icalp/2004</crossref>
<booktitle>ICALP</booktitle>
<url>db/conf/icalp/icalp2004.html#SandersSS04</url>
</inproceedings>
</r>
<r><inproceedings key="conf/ifipTCS/DementievSSS04" mdate="2019-11-28">
<author pid="d/RomanDementiev">Roman Dementiev</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="31/3154">Dominik Schultes</author>
<author pid="s/JopFSibeyn">Jop F. Sibeyn</author>
<title>Engineering an External Memory Minimum Spanning Tree Algorithm.</title>
<pages>195-208</pages>
<year>2004</year>
<crossref>conf/ifipTCS/2004</crossref>
<booktitle>IFIP TCS</booktitle>
<url>db/conf/ifipTCS/ifipTCS2004.html#DementievSSS04</url>
<ee>https://doi.org/10.1007/1-4020-8141-3_17</ee>
<ee>https://www.wikidata.org/entity/Q67224674</ee>
</inproceedings>
</r>
<r><inproceedings key="conf/sofsem/Sanders04" mdate="2017-05-23">
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>Algorithms for Scalable Storage Servers.</title>
<pages>82-101</pages>
<ee>https://doi.org/10.1007/978-3-540-24618-3_8</ee>
<year>2004</year>
<crossref>conf/sofsem/2004</crossref>
<booktitle>SOFSEM</booktitle>
<url>db/conf/sofsem/sofsem2004.html#Sanders04</url>
</inproceedings>
</r>
<r><article key="journals/algorithmica/SandersEK03" mdate="2017-05-17">
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="66/3540">Sebastian Egner</author>
<author pid="17/666">Jan H. M. Korst</author>
<title>Fast Concurrent Access to Parallel Disks.</title>
<pages>21-55</pages>
<year>2003</year>
<volume>35</volume>
<journal>Algorithmica</journal>
<number>1</number>
<ee>https://doi.org/10.1007/s00453-002-0987-0</ee>
<url>db/journals/algorithmica/algorithmica35.html#SandersEK03</url>
</article>
</r>
<r><article key="journals/algorithmica/MehlhornS03" mdate="2017-05-17">
<author pid="m/KurtMehlhorn">Kurt Mehlhorn</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>Scanning Multiple Sequences Via Cache Memory.</title>
<pages>75-93</pages>
<year>2003</year>
<volume>35</volume>
<journal>Algorithmica</journal>
<number>1</number>
<ee>https://doi.org/10.1007/s00453-002-0993-2</ee>
<url>db/journals/algorithmica/algorithmica35.html#MehlhornS03</url>
</article>
</r>
<r><article key="journals/cpc/SandersV03" mdate="2020-03-12">
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="v/BertholdVocking">Berthold V&#246;cking</author>
<title>Tail Bounds And Expectations For Random Arc Allocation And Applications.</title>
<year>2003</year>
<volume>12</volume>
<journal>Comb. Probab. Comput.</journal>
<number>3</number>
<url>db/journals/cpc/cpc12.html#SandersV03</url>
<ee>https://doi.org/10.1017/S0963548303005601</ee>
<pages>301-318</pages>
</article>
</r>
<r><article key="journals/ipl/SandersS03" mdate="2019-06-02">
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="s/JopFSibeyn">Jop F. Sibeyn</author>
<title>A bandwidth latency tradeoff for broadcast and reduction.</title>
<pages>33-38</pages>
<year>2003</year>
<volume>86</volume>
<journal>Inf. Process. Lett.</journal>
<number>1</number>
<ee>https://doi.org/10.1016/S0020-0190(02)00473-8</ee>
<ee>https://www.wikidata.org/entity/Q60307050</ee>
<url>db/journals/ipl/ipl86.html#SandersS03</url>
</article>
</r>
<r><article key="journals/jal/MeyerS03" mdate="2017-07-25">
<author pid="m/UlrichMeyer-1">Ulrich Meyer 0001</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>[Delta]-stepping: a parallelizable shortest path algorithm.</title>
<pages>114-152</pages>
<year>2003</year>
<volume>49</volume>
<journal>J. Algorithms</journal>
<number>1</number>
<ee>https://doi.org/10.1016/S0196-6774(03)00076-2</ee>
<url>db/journals/jal/jal49.html#MeyerS03</url>
</article>
</r>
<r><article key="journals/tc/Sanders03" mdate="2017-05-20">
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>Asynchronous Scheduling of Redundant Disk Arrays.</title>
<pages>1170-1184</pages>
<year>2003</year>
<volume>52</volume>
<journal>IEEE Trans. Computers</journal>
<number>9</number>
<ee>https://doi.org/10.1109/TC.2003.1228512</ee>
<ee>http://doi.ieeecomputersociety.org/10.1109/TC.2003.1228512</ee>
<url>db/journals/tc/tc52.html#Sanders03</url>
</article>
</r>
<r><inproceedings key="conf/esa/FunkeMS03" mdate="2017-05-26">
<author pid="f/StefanFunke">Stefan Funke</author>
<author pid="m/DomagojMatijevic">Domagoj Matijevic</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>Approximating Energy Efficient Paths in Wireless Multi-hop Networks.</title>
<pages>230-241</pages>
<ee>https://doi.org/10.1007/978-3-540-39658-1_23</ee>
<year>2003</year>
<crossref>conf/esa/2003</crossref>
<booktitle>ESA</booktitle>
<url>db/conf/esa/esa2003.html#FunkeMS03</url>
</inproceedings>
</r>
<r><inproceedings key="conf/esa/KatrielST03" mdate="2017-05-26">
<author pid="k/IritKatriel">Irit Katriel</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="t/JLTraff">Jesper Larsson Tr&#228;ff</author>
<title>A Practical Minimum Spanning Tree Algorithm Using the Cycle Property.</title>
<pages>679-690</pages>
<ee>https://doi.org/10.1007/978-3-540-39658-1_61</ee>
<year>2003</year>
<crossref>conf/esa/2003</crossref>
<booktitle>ESA</booktitle>
<url>db/conf/esa/esa2003.html#KatrielST03</url>
</inproceedings>
</r>
<r><inproceedings key="conf/icalp/KarkkainenS03" mdate="2018-11-14">
<author pid="k/JKarkkainen">Juha K&#228;rkk&#228;inen</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>Simple Linear Work Suffix Array Construction.</title>
<pages>943-955</pages>
<year>2003</year>
<crossref>conf/icalp/2003</crossref>
<booktitle>ICALP</booktitle>
<ee>https://doi.org/10.1007/3-540-45061-0_73</ee>
<ee>https://www.wikidata.org/entity/Q56485253</ee>
<url>db/conf/icalp/icalp2003.html#KarkkainenS03</url>
</inproceedings>
</r>
<r><inproceedings key="conf/mfcs/KrystaSV03" mdate="2017-05-25">
<author pid="k/PiotrKrysta">Piotr Krysta</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="v/BertholdVocking">Berthold V&#246;cking</author>
<title>Scheduling and Traffic Allocation for Tasks with Bounded Splittability.</title>
<pages>500-510</pages>
<ee>https://doi.org/10.1007/978-3-540-45138-9_44</ee>
<year>2003</year>
<crossref>conf/mfcs/2003</crossref>
<booktitle>MFCS</booktitle>
<url>db/conf/mfcs/mfcs2003.html#KrystaSV03</url>
</inproceedings>
</r>
<r><inproceedings key="conf/spaa/DementievS03" mdate="2018-11-06">
<author pid="d/RomanDementiev">Roman Dementiev</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>Asynchronous parallel disk sorting.</title>
<pages>138-148</pages>
<year>2003</year>
<crossref>conf/spaa/2003</crossref>
<booktitle>SPAA</booktitle>
<ee>https://doi.org/10.1145/777412.777435</ee>
<url>db/conf/spaa/spaa2003.html#DementievS03</url>
</inproceedings>
</r>
<r><inproceedings key="conf/spaa/SandersET03" mdate="2018-11-06">
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="66/3540">Sebastian Egner</author>
<author pid="05/7218">Ludo M. G. M. Tolhuizen</author>
<title>Polynomial time algorithms for network information flow.</title>
<pages>286-294</pages>
<year>2003</year>
<crossref>conf/spaa/2003</crossref>
<booktitle>SPAA</booktitle>
<ee>https://doi.org/10.1145/777412.777464</ee>
<url>db/conf/spaa/spaa2003.html#SandersET03</url>
</inproceedings>
</r>
<r><inproceedings key="conf/stacs/FotakisPSS03" mdate="2022-03-24">
<author orcid="0000-0001-6864-8960" pid="95/4731">Dimitris Fotakis 0001</author>
<author pid="p/RasmusPagh">Rasmus Pagh</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="s/PaulGSpirakis">Paul G. Spirakis</author>
<title>Space Efficient Hash Tables with Worst Case Constant Access Time.</title>
<pages>271-282</pages>
<year>2003</year>
<crossref>conf/stacs/2003</crossref>
<booktitle>STACS</booktitle>
<ee>https://doi.org/10.1007/3-540-36494-3_25</ee>
<ee>https://www.wikidata.org/entity/Q59818820</ee>
<url>db/conf/stacs/stacs2003.html#FotakisPSS03</url>
</inproceedings>
</r>
<r><proceedings key="conf/dagstuhl/2002amh" mdate="2019-05-14">
<editor pid="m/UlrichMeyer-1">Ulrich Meyer 0001</editor>
<editor pid="s/PeterSanders">Peter Sanders 0001</editor>
<editor pid="s/JopFSibeyn">Jop F. Sibeyn</editor>
<title>Algorithms for Memory Hierarchies, Advanced Lectures [Dagstuhl Research Seminar, March 10-14, 2002]</title>
<booktitle>Algorithms for Memory Hierarchies</booktitle>
<series href="db/series/lncs/index.html">Lecture Notes in Computer Science</series>
<volume>2625</volume>
<publisher>Springer</publisher>
<year>2003</year>
<isbn>3-540-00883-7</isbn>
<ee>https://doi.org/10.1007/3-540-36574-5</ee>
<ee>https://www.wikidata.org/entity/Q57515800</ee>
<url>db/conf/dagstuhl/amh2002.html</url>
</proceedings>
</r>
<r><article key="journals/cj/Sanders02" mdate="2017-05-20">
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>Randomized Receiver Initiated Load-balancing Algorithms for Tree-shaped Computations.</title>
<pages>561-573</pages>
<year>2002</year>
<volume>45</volume>
<journal>Comput. J.</journal>
<number>5</number>
<ee>https://doi.org/10.1093/comjnl/45.5.561</ee>
<url>db/journals/cj/cj45.html#Sanders02</url>
</article>
</r>
<r><article key="journals/dam/NiedermeierRS02" mdate="2025-01-19">
<author pid="n/RolfNiedermeier">Rolf Niedermeier</author>
<author pid="r/KlausReinhardt">Klaus Reinhardt</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>Towards optimal locality in mesh-indexings.</title>
<pages>211-237</pages>
<year>2002</year>
<volume>117</volume>
<journal>Discret. Appl. Math.</journal>
<number>1-3</number>
<url>db/journals/dam/dam117.html#NiedermeierRS02</url>
<ee type="oa">https://doi.org/10.1016/S0166-218X(00)00326-7</ee>
<ee>https://www.wikidata.org/entity/Q126844199</ee>
</article>
</r>
<r><article key="journals/fuin/SandersVW02" mdate="2020-09-18">
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="v/RolandVollmar">Roland Vollmar</author>
<author pid="49/2653">Thomas Worsch</author>
<title>Cellular Automata: Energy Consumption and Physical Feasibility.</title>
<pages>233-248</pages>
<year>2002</year>
<volume>52</volume>
<journal>Fundam. Informaticae</journal>
<number>1-3</number>
<ee>http://content.iospress.com/articles/fundamenta-informaticae/fi52-1-3-11</ee>
<url>db/journals/fuin/fuin52.html#SandersVW02</url>
</article>
</r>
<r><article key="journals/pc/Sanders02" mdate="2020-02-22">
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>Reconciling simplicity and realism in parallel disk models.</title>
<pages>705-723</pages>
<year>2002</year>
<volume>28</volume>
<journal>Parallel Comput.</journal>
<number>5</number>
<url>db/journals/pc/pc28.html#Sanders02</url>
<ee>https://doi.org/10.1016/S0167-8191(02)00092-3</ee>
</article>
</r>
<r><article key="journals/sp/ReussnerST02" mdate="2022-04-09">
<author orcid="0000-0002-9308-6290" pid="r/RalfReussner">Ralf H. Reussner</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="t/JLTraff">Jesper Larsson Tr&#228;ff</author>
<title>SKaMPI: a comprehensive benchmark for public benchmarking of MPI.</title>
<pages>55-65</pages>
<year>2002</year>
<volume>10</volume>
<journal>Sci. Program.</journal>
<number>1</number>
<url>db/journals/sp/sp10.html#ReussnerST02</url>
<ee type="oa">https://doi.org/10.1155/2002/202839</ee>
<ee>http://content.iospress.com/articles/scientific-programming/spr00094</ee>
</article>
</r>
<r><inproceedings key="conf/dagstuhl/Sanders02" mdate="2017-05-19">
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>Memory Hierarchies - Models and Lower Bounds.</title>
<pages>1-13</pages>
<year>2002</year>
<crossref>conf/dagstuhl/2002amh</crossref>
<booktitle>Algorithms for Memory Hierarchies</booktitle>
<ee>https://doi.org/10.1007/3-540-36574-5_1</ee>
<url>db/conf/dagstuhl/amh2002.html#Sanders02</url>
</inproceedings>
</r>
<r><inproceedings key="conf/europar/SandersT02" mdate="2017-05-24">
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="t/JLTraff">Jesper Larsson Tr&#228;ff</author>
<title>The Hierarchical Factor Algorithm for All-to-All Communication (Research Note).</title>
<pages>799-804</pages>
<year>2002</year>
<crossref>conf/europar/2002</crossref>
<booktitle>Euro-Par</booktitle>
<ee>https://doi.org/10.1007/3-540-45706-2_112</ee>
<url>db/conf/europar/europar2002.html#SandersT02</url>
</inproceedings>
</r>
<r><inproceedings key="conf/icalp/BeierSS02" mdate="2017-05-23">
<author pid="22/5581">Ren&#233; Beier</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="70/613">Naveen Sivadasan</author>
<title>Energy Optimal Routing in Radio Networks Using Geometric Data Structures.</title>
<pages>366-376</pages>
<year>2002</year>
<crossref>conf/icalp/2002</crossref>
<booktitle>ICALP</booktitle>
<ee>https://doi.org/10.1007/3-540-45465-9_32</ee>
<url>db/conf/icalp/icalp2002.html#BeierSS02</url>
</inproceedings>
</r>
<r><inproceedings key="conf/swat/SandersV02" mdate="2017-05-23">
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="v/BertholdVocking">Berthold V&#246;cking</author>
<title>Random Arc Allocation and Applications.</title>
<pages>121-130</pages>
<year>2002</year>
<crossref>conf/swat/2002</crossref>
<booktitle>SWAT</booktitle>
<ee>https://doi.org/10.1007/3-540-45471-3_13</ee>
<url>db/conf/swat/swat2002.html#SandersV02</url>
</inproceedings>
</r>
<r><article key="journals/jal/SandersS01" mdate="2017-05-28">
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="58/628">Roberto Solis-Oba</author>
<title>How Helpers Hasten h-Relations.</title>
<pages>86-98</pages>
<year>2001</year>
<volume>41</volume>
<journal>J. Algorithms</journal>
<number>1</number>
<url>db/journals/jal/jal41.html#SandersS01</url>
<ee>https://doi.org/10.1006/jagm.2001.1169</ee>
</article>
</r>
<r><inproceedings key="conf/esa/HutchinsonSV01" mdate="2023-03-21">
<author pid="h/DavidAHutchinson">David A. Hutchinson</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author orcid="0000-0001-7970-6118" pid="v/JeffreyScottVitter">Jeffrey Scott Vitter</author>
<title>Duality between Prefetching and Queued Writing with Parallel Disks.</title>
<pages>62-73</pages>
<year>2001</year>
<crossref>conf/esa/2001</crossref>
<booktitle>ESA</booktitle>
<ee>https://doi.org/10.1007/3-540-44676-1_5</ee>
<url>db/conf/esa/esa2001.html#HutchinsonSV01</url>
</inproceedings>
</r>
<r><inproceedings key="conf/soda/Sanders01" mdate="2017-01-06">
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>Reconciling simplicity and realism in parallel disk models.</title>
<pages>67-76</pages>
<year>2001</year>
<crossref>conf/soda/2001</crossref>
<booktitle>SODA</booktitle>
<ee>http://dl.acm.org/citation.cfm?id=365411.365420</ee>
<url>db/conf/soda/soda2001.html#Sanders01</url>
</inproceedings>
</r>
<r><inproceedings key="conf/spaa/HutchinsonSV01" mdate="2023-03-21">
<author pid="h/DavidAHutchinson">David A. Hutchinson</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author orcid="0000-0001-7970-6118" pid="v/JeffreyScottVitter">Jeffrey Scott Vitter</author>
<title>The power of duality for prefetching and sorting with parallel disks.</title>
<pages>334-335</pages>
<year>2001</year>
<crossref>conf/spaa/2001</crossref>
<booktitle>SPAA</booktitle>
<ee>https://doi.org/10.1145/378580.378760</ee>
<url>db/conf/spaa/spaa2001.html#HutchinsonSV01</url>
</inproceedings>
</r>
<r><article key="journals/anor/AlefragisSTW00" mdate="2020-08-13">
<author pid="40/6391">Panayiotis Alefragis</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="43/212">Tuomo Takkula</author>
<author pid="17/1915">Dag Wedelin</author>
<title>Parallel Integer Optimization for Crew Scheduling.</title>
<pages>141-166</pages>
<year>2000</year>
<volume>99</volume>
<journal>Ann. Oper. Res.</journal>
<number>1-4</number>
<ee>https://doi.org/10.1023/A%3A1019293017474</ee>
<url>db/journals/anor/anor99.html#AlefragisSTW00</url>
</article>
</r>
<r><article key="journals/jea/Sanders00" mdate="2020-06-25">
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>Fast Priority Queues for Cached Memory.</title>
<pages>7</pages>
<year>2000</year>
<volume>5</volume>
<journal>ACM J. Exp. Algorithmics</journal>
<ee>https://doi.org/10.1145/351827.384249</ee>
<url>db/journals/jea/jea5.html#Sanders00</url>
</article>
</r>
<r><inproceedings key="conf/dagstuhl/BaderMS00" mdate="2019-10-19">
<author orcid="0000-0002-7380-5876" pid="41/3005">David A. Bader</author>
<author pid="18/242">Bernard M. E. Moret</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>Algorithm Engineering for Parallel Computation.</title>
<pages>1-23</pages>
<year>2000</year>
<crossref>conf/dagstuhl/2000ea</crossref>
<booktitle>Experimental Algorithmics</booktitle>
<ee>https://doi.org/10.1007/3-540-36383-1_1</ee>
<url>db/conf/dagstuhl/ea2000.html#BaderMS00</url>
</inproceedings>
</r>
<r><inproceedings key="conf/dagstuhl/McGeochSFCP00" mdate="2017-05-19">
<author pid="m/CatherineCMcGeoch">Catherine C. McGeoch</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="f/RudolfFleischer">Rudolf Fleischer</author>
<author pid="59/840">Paul R. Cohen</author>
<author pid="p/DoinaPrecup">Doina Precup</author>
<title>Using Finite Experiments to Study Asymptotic Performance.</title>
<pages>93-126</pages>
<year>2000</year>
<crossref>conf/dagstuhl/2000ea</crossref>
<booktitle>Experimental Algorithmics</booktitle>
<ee>https://doi.org/10.1007/3-540-36383-1_5</ee>
<url>db/conf/dagstuhl/ea2000.html#McGeochSFCP00</url>
</inproceedings>
</r>
<r><inproceedings key="conf/dagstuhl/Sanders00" mdate="2017-05-19">
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>Presenting Data from Experiments in Algorithmics.</title>
<pages>181-196</pages>
<year>2000</year>
<crossref>conf/dagstuhl/2000ea</crossref>
<booktitle>Experimental Algorithmics</booktitle>
<ee>https://doi.org/10.1007/3-540-36383-1_9</ee>
<url>db/conf/dagstuhl/ea2000.html#Sanders00</url>
</inproceedings>
</r>
<r><inproceedings key="conf/esa/SandersS00" mdate="2017-05-24">
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="58/628">Roberto Solis-Oba</author>
<title>How Helpers Hasten <i>h</i>-Relations.</title>
<pages>392-402</pages>
<year>2000</year>
<crossref>conf/esa/2000</crossref>
<booktitle>ESA</booktitle>
<url>db/conf/esa/esa2000.html#SandersS00</url>
<ee>https://doi.org/10.1007/3-540-45253-2_36</ee>
</inproceedings>
</r>
<r><inproceedings key="conf/europar/MeyerS00" mdate="2017-07-25">
<author pid="m/UlrichMeyer-1">Ulrich Meyer 0001</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>Parallel Shortest Path for Arbitrary Graphs.</title>
<pages>461-470</pages>
<year>2000</year>
<crossref>conf/europar/2000</crossref>
<booktitle>Euro-Par</booktitle>
<ee>https://doi.org/10.1007/3-540-44520-X_61</ee>
<url>db/conf/europar/europar2000.html#MeyerS00</url>
</inproceedings>
</r>
<r><inproceedings key="conf/europar/SandersS00" mdate="2017-05-24">
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="s/JopFSibeyn">Jop F. Sibeyn</author>
<title>A Bandwidth Latency Tradeoff for Broadcast and Reduction.</title>
<pages>918-926</pages>
<year>2000</year>
<crossref>conf/europar/2000</crossref>
<booktitle>Euro-Par</booktitle>
<ee>https://doi.org/10.1007/3-540-44520-X_128</ee>
<url>db/conf/europar/europar2000.html#SandersS00</url>
</inproceedings>
</r>
<r><inproceedings key="conf/soda/SandersEK00" mdate="2017-01-06">
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="66/3540">Sebastian Egner</author>
<author pid="17/666">Jan H. M. Korst</author>
<title>Fast concurrent access to parallel disks.</title>
<pages>849-858</pages>
<year>2000</year>
<crossref>conf/soda/2000</crossref>
<booktitle>SODA</booktitle>
<ee>http://dl.acm.org/citation.cfm?id=338219.338649</ee>
<url>db/conf/soda/soda2000.html#SandersEK00</url>
</inproceedings>
</r>
<r><inproceedings key="conf/spaa/Sanders00" mdate="2018-11-21">
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>Asynchronous scheduling of redundant disk arrays.</title>
<pages>89-98</pages>
<year>2000</year>
<crossref>conf/spaa/2000</crossref>
<booktitle>SPAA</booktitle>
<ee>https://doi.org/10.1145/341800.341812</ee>
<url>db/conf/spaa/spaa2000.html#Sanders00</url>
</inproceedings>
</r>
<r><inproceedings key="conf/wae/SandersF00" mdate="2021-05-07">
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="f/RudolfFleischer">Rudolf Fleischer</author>
<title>Asymptotic Complexity from Experiments? A Case Study for Randomized Algorithms.</title>
<pages>135-146</pages>
<year>2000</year>
<crossref>conf/wae/2000</crossref>
<booktitle>WAE</booktitle>
<ee>https://doi.org/10.1007/3-540-44691-5_12</ee>
<url>db/conf/wae/wae2000.html#SandersF00</url>
</inproceedings>
</r>
<r><article key="journals/pc/RatheSK99" mdate="2020-02-22">
<author pid="88/676">U. W. Rathe</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="37/911">P. L. Knight</author>
<title>A case study in scalability: An ADI method for the two-dimensional time-dependent Dirac equation.</title>
<pages>525-533</pages>
<year>1999</year>
<volume>25</volume>
<journal>Parallel Comput.</journal>
<number>5</number>
<url>db/journals/pc/pc25.html#RatheSK99</url>
<ee>https://doi.org/10.1016/S0167-8191(99)00011-3</ee>
</article>
</r>
<r><article key="journals/pc/Sanders99" mdate="2020-02-22">
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>Analysis of nearest neighbor load balancing algorithms for random loads.</title>
<pages>1013-1033</pages>
<year>1999</year>
<volume>25</volume>
<journal>Parallel Comput.</journal>
<number>8</number>
<url>db/journals/pc/pc25.html#Sanders99</url>
<ee>https://doi.org/10.1016/S0167-8191(99)00040-X</ee>
</article>
</r>
<r><inproceedings key="conf/alenex/Sanders99" mdate="2017-05-19">
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>Fast Priority Queues for Cached Memory.</title>
<pages>312-327</pages>
<ee>https://doi.org/10.1007/3-540-48518-X_19</ee>
<year>1999</year>
<crossref>conf/alenex/1999</crossref>
<booktitle>ALENEX</booktitle>
<url>db/conf/alenex/alenex1999.html#Sanders99</url>
</inproceedings>
</r>
<r><inproceedings key="conf/hpcn/SandersTW99" mdate="2017-05-23">
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="43/212">Tuomo Takkula</author>
<author pid="17/1915">Dag Wedelin</author>
<title>High Performance Integer Optimization for Crew Scheduling.</title>
<pages>3-12</pages>
<year>1999</year>
<crossref>conf/hpcn/1999</crossref>
<booktitle>HPCN Europe</booktitle>
<url>db/conf/hpcn/hpcn1999.html#SandersTW99</url>
<ee>https://doi.org/10.1007/BFb0100560</ee>
</inproceedings>
</r>
<r><inproceedings key="conf/icalp/Sanders99" mdate="2017-05-23">
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>Accessing Multiple Sequences Through Set Associative Caches.</title>
<pages>655-664</pages>
<ee>https://doi.org/10.1007/3-540-48523-6_62</ee>
<year>1999</year>
<crossref>conf/icalp/99</crossref>
<booktitle>ICALP</booktitle>
<url>db/conf/icalp/icalp99.html#Sanders99</url>
</inproceedings>
</r>
<r><inproceedings key="conf/isaac/Sanders99" mdate="2017-05-19">
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>Asynchronous Random Polling Dynamic Load Balancing.</title>
<pages>37-48</pages>
<ee>https://doi.org/10.1007/3-540-46632-0_5</ee>
<year>1999</year>
<crossref>conf/isaac/1999</crossref>
<booktitle>ISAAC</booktitle>
<url>db/conf/isaac/isaac99.html#Sanders99</url>
</inproceedings>
</r>
<r><article key="journals/ipl/Sanders98" mdate="2017-05-26">
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>Random Permutations on Distributed, External and Hierarchical Memory.</title>
<pages>305-309</pages>
<year>1998</year>
<volume>67</volume>
<journal>Inf. Process. Lett.</journal>
<number>6</number>
<url>db/journals/ipl/ipl67.html#Sanders98</url>
<ee>https://doi.org/10.1016/S0020-0190(98)00127-6</ee>
</article>
</r>
<r><article key="journals/jpdc/Sanders98" mdate="2020-02-22">
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>Randomized Priority Queues for Fast Parallel Access.</title>
<pages>86-97</pages>
<year>1998</year>
<volume>49</volume>
<journal>J. Parallel Distributed Comput.</journal>
<number>1</number>
<url>db/journals/jpdc/jpdc49.html#Sanders98</url>
<ee>https://doi.org/10.1006/jpdc.1998.1429</ee>
</article>
</r>
<r><inproceedings key="conf/esa/MeyerS98" mdate="2017-07-25">
<author pid="m/UlrichMeyer-1">Ulrich Meyer 0001</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>Delta-Stepping: A Parallel Single Source Shortest Path Algorithm.</title>
<pages>393-404</pages>
<ee>https://doi.org/10.1007/3-540-68530-8_33</ee>
<year>1998</year>
<crossref>conf/esa/1998</crossref>
<booktitle>ESA</booktitle>
<url>db/conf/esa/esa98.html#MeyerS98</url>
</inproceedings>
</r>
<r><inproceedings key="conf/europar/AlefragisGHSTW98" mdate="2026-03-24">
<author orcid="0000-0002-1313-1750" pid="40/6391">Panayiotis Alefragis</author>
<author orcid="0000-0003-1096-4439" pid="45/1341">Christos Goumopoulos</author>
<author orcid="0000-0002-5360-5527" pid="22/2186">Efthymios Housos</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="43/212">Tuomo Takkula</author>
<author pid="17/1915">Dag Wedelin</author>
<title>Parallel Crew Scheduling in PAROS.</title>
<pages>1104-1113</pages>
<ee>https://doi.org/10.1007/BFb0057972</ee>
<year>1998</year>
<crossref>conf/europar/1998</crossref>
<booktitle>Euro-Par</booktitle>
<url>db/conf/europar/europar98.html#AlefragisGHSTW98</url>
</inproceedings>
</r>
<r><inproceedings key="conf/mfcs/CrauserMMS98" mdate="2017-07-25">
<author pid="84/600">Andreas Crauser</author>
<author pid="m/KurtMehlhorn">Kurt Mehlhorn</author>
<author pid="m/UlrichMeyer-1">Ulrich Meyer 0001</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>A Parallelization of Dijkstra's Shortest Path Algorithm.</title>
<pages>722-731</pages>
<year>1998</year>
<crossref>conf/mfcs/1998</crossref>
<booktitle>MFCS</booktitle>
<ee>https://doi.org/10.1007/BFb0055823</ee>
<url>db/conf/mfcs/mfcs98.html#CrauserMMS98</url>
</inproceedings>
</r>
<r><inproceedings key="conf/pvm/ReussnerSPM98" mdate="2017-05-19">
<author pid="r/RalfReussner">Ralf H. Reussner</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="54/3155">Lutz Prechelt</author>
<author pid="59/650">Matthias M&#252;ller</author>
<title>SKaMPI: A Detailed, Accurate MPI Benchmark.</title>
<pages>52-59</pages>
<ee>https://doi.org/10.1007/BFb0056559</ee>
<year>1998</year>
<crossref>conf/pvm/1998</crossref>
<booktitle>PVM/MPI</booktitle>
<url>db/conf/pvm/pvm1998.html#ReussnerSPM98</url>
</inproceedings>
</r>
<r><inproceedings key="conf/wae/HagerupST98" mdate="2021-05-07">
<author pid="h/TorbenHagerup">Torben Hagerup</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="t/JLTraff">Jesper Larsson Tr&#228;ff</author>
<title>An Implementation of the Binary Blocking Flow Algorithm.</title>
<pages>143-154</pages>
<year>1998</year>
<crossref>conf/wae/1998</crossref>
<booktitle>WAE</booktitle>
<url>db/conf/wae/wae1998.html#HagerupST98</url>
</inproceedings>
</r>
<r><book key="books/daglib/0092190" mdate="2017-01-06">
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="49/2653">Thomas Worsch</author>
<title>Parallele Programmierung mit MPI - ein Praktikum, Programmtexte im Internet.</title>
<pages>1-150</pages>
<publisher>Logos Verlag</publisher>
<year>1997</year>
<isbn>978-3-931216-76-4</isbn>
</book>
</r>
<r><phdthesis key="phd/dnb/Sanders97" mdate="2021-07-17">
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>Lastverteilungsalgorithmen f&#252;r parallele Tiefensuche.</title>
<year>1997</year>
<pages>1-154</pages>
<publisher>VDI-Verlag</publisher>
<school>Karlsruhe Institute of Technology</school>
<isbn>3-18-346310-5</isbn>
<ee>https://d-nb.info/949988073</ee>
</phdthesis>
</r>
<r><inproceedings key="conf/europar/SandersVW97" mdate="2017-05-23">
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="v/RolandVollmar">Roland Vollmar</author>
<author pid="49/2653">Thomas Worsch</author>
<title>Feasible Models of Computation: Three-Dimensionality and Energy Consumption.</title>
<pages>384-388</pages>
<year>1997</year>
<crossref>conf/europar/1997</crossref>
<booktitle>Euro-Par</booktitle>
<url>db/conf/europar/europar97.html#SandersVW97</url>
<ee>https://doi.org/10.1007/BFb0002761</ee>
</inproceedings>
</r>
<r><inproceedings key="conf/fct/NiedermeierRS97" mdate="2017-05-17">
<author pid="n/RolfNiedermeier">Rolf Niedermeier</author>
<author pid="r/KlausReinhardt">Klaus Reinhardt</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>Towards Optimal Locality in Mesh-Indexings.</title>
<pages>364-375</pages>
<year>1997</year>
<crossref>conf/fct/1997</crossref>
<booktitle>FCT</booktitle>
<url>db/conf/fct/fct97.html#NiedermeierRS97</url>
<ee>https://doi.org/10.1007/BFb0036198</ee>
</inproceedings>
</r>
<r><inproceedings key="conf/irregular/SandersH97" mdate="2017-05-22">
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<author pid="79/2691">Thomas Hansch</author>
<title>Efficient Massively Parallel Quicksort.</title>
<pages>13-24</pages>
<year>1997</year>
<crossref>conf/irregular/1997</crossref>
<booktitle>IRREGULAR</booktitle>
<url>db/conf/irregular/irregular97.html#SandersH97</url>
<ee>https://doi.org/10.1007/3-540-63138-0_2</ee>
</inproceedings>
</r>
<r><inproceedings key="conf/parcella/Sanders96" mdate="2017-01-06">
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>On the Efficiency of Nearest Neighbor Load Balancing for Random Loads.</title>
<pages>120-127</pages>
<year>1996</year>
<booktitle>Parcella</booktitle>
<crossref>conf/parcella/1996</crossref>
<url>db/conf/parcella/parcella1996.html#Sanders96</url>
</inproceedings>
</r>
<r><inproceedings key="conf/parcella/Sanders96a" mdate="2017-01-06">
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>Optimizing the Emulation of MIMD Behavior on SIMD Machines.</title>
<pages>320-321</pages>
<year>1996</year>
<booktitle>Parcella</booktitle>
<crossref>conf/parcella/1996</crossref>
<url>db/conf/parcella/parcella1996.html#Sanders96a</url>
</inproceedings>
</r>
<r><inproceedings key="conf/irregular/Sanders95" mdate="2017-05-20">
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>Better Algorithms for Parallel Backtracking.</title>
<pages>333-347</pages>
<year>1995</year>
<crossref>conf/irregular/1995</crossref>
<booktitle>IRREGULAR</booktitle>
<url>db/conf/irregular/irregular95.html#Sanders95</url>
<ee>https://doi.org/10.1007/3-540-60321-2_27</ee>
</inproceedings>
</r>
<r><inproceedings key="conf/irregular/HoppS95" mdate="2017-05-20">
<author pid="29/899">Holger Hopp</author>
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>Parallel Game Tree Search on SIMD Machines.</title>
<pages>349-361</pages>
<year>1995</year>
<crossref>conf/irregular/1995</crossref>
<booktitle>IRREGULAR</booktitle>
<url>db/conf/irregular/irregular95.html#HoppS95</url>
<ee>https://doi.org/10.1007/3-540-60321-2_28</ee>
</inproceedings>
</r>
<r><inproceedings key="conf/irregular/Sanders95a" mdate="2017-05-20">
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>Fast Priority Queues for Parallel Branch-and-Bound.</title>
<pages>379-393</pages>
<year>1995</year>
<crossref>conf/irregular/1995</crossref>
<booktitle>IRREGULAR</booktitle>
<url>db/conf/irregular/irregular95.html#Sanders95a</url>
<ee>https://doi.org/10.1007/3-540-60321-2_30</ee>
</inproceedings>
</r>
<r><inproceedings key="conf/eurosim/Sanders94" mdate="2017-01-06">
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>Emulating MIMD Behaviour on SIMD-Machines.</title>
<pages>313-320</pages>
<year>1994</year>
<crossref>conf/eurosim/1994</crossref>
<booktitle>EUROSIM</booktitle>
<url>db/conf/eurosim/eurosim1994.html#Sanders94</url>
</inproceedings>
</r>
<r><inproceedings key="conf/ispan/Sanders94" mdate="2023-03-24">
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>A detailed analysis of random polling dynamic load balancing.</title>
<pages>382-389</pages>
<year>1994</year>
<booktitle>ISPAN</booktitle>
<ee>https://doi.org/10.1109/ISPAN.1994.367176</ee>
<ee>https://doi.ieeecomputersociety.org/10.1109/ISPAN.1994.367176</ee>
<crossref>conf/ispan/1994</crossref>
<url>db/conf/ispan/ispan1994.html#Sanders94</url>
</inproceedings>
</r>
<r><inproceedings key="conf/parcella/Sanders94" mdate="2017-01-06">
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>Massively Parallel Search for Transition-Tables of Polyautomata.</title>
<pages>99-108</pages>
<year>1994</year>
<booktitle>Parcella</booktitle>
<crossref>conf/parcella/1994</crossref>
<url>db/conf/parcella/parcella1994.html#Sanders94</url>
</inproceedings>
</r>
<r><inproceedings key="conf/tools/Sanders93" mdate="2017-01-06">
<author pid="s/PeterSanders">Peter Sanders 0001</author>
<title>A Case Study in Object Oriented Programming: Algebraic Structures in Eiffel.</title>
<pages>379-388</pages>
<year>1993</year>
<crossref>conf/tools/11-1993</crossref>
<booktitle>TOOLS (11)</booktitle>
<url>db/conf/tools/tools11-1993.html#Sanders93</url>
</inproceedings>
</r>
<coauthors n="283" nc="6">
<co c="0"><na f="a/Ahuja:Nitin" pid="49/3122">Nitin Ahuja</na></co>
<co c="0"><na f="a/Akhremtsev:Yaroslav" pid="144/7382">Yaroslav Akhremtsev</na></co>
<co c="0"><na f="a/Akram:Matthew" pid="329/5057">Matthew Akram</na></co>
<co c="5"><na f="a/Alam:Md=_Maksudul" pid="20/5978">Md. Maksudul Alam</na></co>
<co c="2"><na f="a/Alefragis:Panayiotis" pid="40/6391">Panayiotis Alefragis</na></co>
<co c="0"><na f="a/Arge:Lars" pid="a/LArge">Lars Arge</na></co>
<co c="0"><na f="a/Arz:Julian" pid="126/4652">Julian Arz</na></co>
<co c="0"><na f="a/Axtmann:Michael" pid="153/2031">Michael Axtmann</na></co>
<co c="0"><na f="b/Bachmayer:Beverly" pid="42/10311">Beverly Bachmayer</na></co>
<co c="0"><na f="b/Bader:David_A=" pid="41/3005">David A. Bader</na></co>
<co c="0"><na f="b/Bader:Roland" pid="78/7867">Roland Bader</na></co>
<co c="0"><na f="b/Balyo:Tom=aacute=s" pid="117/4925">Tom&#225;s Balyo</na></co>
<co c="0"><na f="b/Bast:Hannah" pid="b/HannahBast">Hannah Bast</na></co>
<co c="0"><na f="b/Batz:Gernot_Veit" pid="85/4519">Gernot Veit Batz</na></co>
<co c="0"><na f="b/Bauer:Reinhard" pid="40/7046">Reinhard Bauer</na></co>
<co c="0"><na f="b/Becht:Matthias" pid="396/2603">Matthias Becht</na></co>
<co c="0"><na f="b/Beckert:Bernhard" pid="b/BBeckert">Bernhard Beckert</na></co>
<co c="0"><na f="b/Beckmann:Andreas" pid="03/5407">Andreas Beckmann</na></co>
<co c="0"><na f="b/Beier:Ren=eacute=" pid="22/5581">Ren&#233; Beier</na></co>
<co c="-1"><na f="b/Beling:Piotr" pid="119/5115">Piotr Beling</na></co>
<co c="0"><na f="b/Bender_0002:Matthias" pid="b/MatthiasBender2">Matthias Bender 0002</na></co>
<co c="0"><na f="b/Benkner:Siegfried" pid="s/SiegfriedBenkner">Siegfried Benkner</na></co>
<co c="0"><na f="b/Bez:Dominik" pid="336/4850">Dominik Bez</na></co>
<co c="0"><na f="b/Bingmann:Timo" pid="129/6546">Timo Bingmann</na></co>
<co c="0"><na f="b/Birn:Marcel" pid="78/8408">Marcel Birn</na></co>
<co c="0"><na f="b/Blacher:Mark" pid="277/9082">Mark Blacher</na></co>
<co c="0"><na f="b/Bl=auml=sius:Thomas" pid="74/9125">Thomas Bl&#228;sius</na></co>
<co c="0"><na f="b/Blelloch:Guy_E=" pid="b/GEBlelloch">Guy E. Blelloch</na></co>
<co c="0"><na f="b/Brandes:Ulrik" pid="b/UlrikBrandes">Ulrik Brandes</na></co>
<co c="0"><na f="b/Breitbach:Thomas" pid="33/2920">Thomas Breitbach</na></co>
<co c="0"><na f="b/Brim:Lubos" pid="92/3060">Lubos Brim</na></co>
<co c="0"><na f="b/Brodal:Gerth_St=oslash=lting" pid="b/GerthStoltingBrodal">Gerth St&#248;lting Brodal</na></co>
<co c="0"><na f="b/Buchhold:Valentin" pid="173/5447">Valentin Buchhold</na></co>
<co c="0"><na f="b/Bulu=ccedil=:Aydin" pid="80/1552">Aydin Bulu&#231;</na></co>
<co c="0"><na f="b/Burkhardt:Stefan" pid="02/6792">Stefan Burkhardt</na></co>
<co c="0"><na f="c/Cain:Julie_Anne" pid="99/6759">Julie Anne Cain</na></co>
<co c="0"><na f="=/=Ccedil=ataly=uuml=rek:=Uuml=mit_V=" pid="c/UmitVCatalyurek">&#220;mit V. &#199;ataly&#252;rek</na></co>
<co c="1"><na f="c/Chou:Philip_A=" pid="c/PhilipAChou">Philip A. Chou</na></co>
<co c="0"><na f="c/Cohen:Paul_R=" pid="59/840">Paul R. Cohen</na></co>
<co c="0"><na f="c/Crauser:Andreas" pid="84/600">Andreas Crauser</na></co>
<co c="0"><na f="d/Dachsbacher:Carsten" pid="22/4239">Carsten Dachsbacher</na></co>
<co c="0"><na f="d/Dahlum:Jakob" pid="176/5462">Jakob Dahlum</na></co>
<co c="0"><na f="d/Dees:Jonathan" pid="90/7867">Jonathan Dees</na></co>
<co c="0"><na f="d/Delling:Daniel" pid="10/5981">Daniel Delling</na></co>
<co c="0"><na f="d/Dementiev:Roman" pid="d/RomanDementiev">Roman Dementiev</na></co>
<co c="0"><na f="d/Devine:Karen_D=" pid="d/KarenDDevine">Karen D. Devine</na></co>
<co c="0"><na f="d/Dietzfelbinger:Martin" pid="d/MartinDietzfelbinger">Martin Dietzfelbinger</na></co>
<co c="0"><na f="d/Dillinger:Peter_C=" pid="37/2340">Peter C. Dillinger</na></co>
<co c="-1"><na f="d/Dimond:Jonathan" pid="154/6589">Jonathan Dimond</na></co>
<co c="0"><na f="d/Dinklage:Patrick" pid="195/6001">Patrick Dinklage</na></co>
<co c="0"><na f="e/Eberle:Andreas" pid="143/7185">Andreas Eberle</na></co>
<co c="0"><na f="e/Edelkamp:Stefan" pid="98/3919">Stefan Edelkamp</na></co>
<co c="1"><na f="e/Effros:Michelle" pid="83/4741">Michelle Effros</na></co>
<co c="1"><na f="e/Egner:Sebastian" pid="66/3540">Sebastian Egner</na></co>
<co c="0"><na f="e/Erb:Stephan" pid="146/6104">Stephan Erb</na></co>
<co c="0"><na f="f/Faraj:Marcelo_Fonseca" pid="191/0315">Marcelo Fonseca Faraj</na></co>
<co c="0"><na f="f/F=auml=rber:Franz" pid="36/7116">Franz F&#228;rber</na></co>
<co c="0"><na f="f/Farhan:Muhammad" pid="62/10825">Muhammad Farhan</na></co>
<co c="0"><na f="f/Feilhauer:Adrian" pid="340/4024">Adrian Feilhauer</na></co>
<co c="0"><na f="f/Ferizovic:Daniel" pid="176/5263">Daniel Ferizovic</na></co>
<co c="0"><na f="f/Ferragina:Paolo" pid="f/PaoloFerragina">Paolo Ferragina</na></co>
<co c="0"><na f="f/Fiat:Amos" pid="06/894">Amos Fiat</na></co>
<co c="0"><na f="f/Fietz:Jonas" pid="117/6977">Jonas Fietz</na></co>
<co c="0"><na f="f/Fischer_0001:Johannes" pid="90/834-1">Johannes Fischer 0001</na></co>
<co c="0"><na f="f/Fleischer:Rudolf" pid="f/RudolfFleischer">Rudolf Fleischer</na></co>
<co c="0"><na f="f/Flick:Patrick" pid="133/3722">Patrick Flick</na></co>
<co c="0"><na f="f/Fotakis_0001:Dimitris" pid="95/4731">Dimitris Fotakis 0001</na></co>
<co c="0"><na f="f/Frias:Leonor" pid="19/5909">Leonor Frias</na></co>
<co c="0"><na f="f/Funke:Daniel" pid="06/8509">Daniel Funke</na></co>
<co c="0"><na f="f/Funke:Stefan" pid="f/StefanFunke">Stefan Funke</na></co>
<co c="0"><na f="g/Geisberger:Robert" pid="52/3048">Robert Geisberger</na></co>
<co c="0"><na f="g/Gfeller:Beat" pid="43/5670">Beat Gfeller</na></co>
<co c="0"><na f="g/Giesen:Joachim" pid="30/3504">Joachim Giesen</na></co>
<co c="0"><na f="g/Goldberg:Andrew_V=" pid="g/AndrewVGoldberg">Andrew V. Goldberg</na></co>
<co c="0"><na f="g/Gottesb=uuml=ren:Lars" pid="243/6884">Lars Gottesb&#252;ren</na></co>
<co c="2"><na f="g/Goumopoulos:Christos" pid="45/1341">Christos Goumopoulos</na></co>
<co c="0"><na f="g/Grandoni_0001:Fabrizio" pid="g/FGrandoni">Fabrizio Grandoni 0001</na></co>
<co c="0"><na f="h/Haag:Manuel" pid="395/3476">Manuel Haag</na></co>
<co c="0"><na f="h/Hagerup:Torben" pid="h/TorbenHagerup">Torben Hagerup</na></co>
<co c="0"><na f="h/Hamann:Michael" pid="128/3534">Michael Hamann</na></co>
<co c="-1"><na f="h/Hansch:Thomas" pid="79/2691">Thomas Hansch</na></co>
<co c="0"><na f="h/Hansen:Eric_A=" pid="02/6770">Eric A. Hansen</na></co>
<co c="0"><na f="h/Heide:Friedhelm_Meyer_auf_der" pid="h/FMaufderHeide">Friedhelm Meyer auf der Heide</na></co>
<co c="0"><na f="h/Held:Martin" pid="06/1785">Martin Held</na></co>
<co c="0"><na f="h/Henne:Vitali" pid="163/2048">Vitali Henne</na></co>
<co c="0"><na f="h/Herman:Grzegorz" pid="76/1969">Grzegorz Herman</na></co>
<co c="0"><na f="h/Hermann:Stefan" pid="05/1398">Stefan Hermann</na></co>
<co c="0"><na f="h/Hespe:Demian" pid="205/2346">Demian Hespe</na></co>
<co c="0"><na f="h/Heuer:Tobias" pid="172/1146">Tobias Heuer</na></co>
<co c="0"><na f="h/Heuveline:Vincent" pid="27/1141">Vincent Heuveline</na></co>
<co c="0"><na f="h/Holtgrewe:Manuel" pid="64/7481">Manuel Holtgrewe</na></co>
<co c="-1"><na f="h/Hopp:Holger" pid="29/899">Holger Hopp</na></co>
<co c="2"><na f="h/Housos:Efthymios" pid="22/2186">Efthymios Housos</na></co>
<co c="0"><na f="h/H=uuml=bner:Lukas" pid="246/0570">Lukas H&#252;bner</na></co>
<co c="0" n="2"><na f="h/H=uuml=bner:Nico" pid="163/1804">Nico H&#252;bner</na><na>Nico Meyer-H&#252;bner</na></co>
<co c="0"><na f="h/H=uuml=bschle=Schneider:Lorenz" pid="151/1543">Lorenz H&#252;bschle-Schneider</na></co>
<co c="0"><na f="h/H=uuml=ning:Nicolai" pid="347/2570">Nicolai H&#252;ning</na></co>
<co c="0"><na f="h/Hutchinson:David_A=" pid="h/DavidAHutchinson">David A. Hutchinson</na></co>
<co c="0"><na f="i/Italiano:Giuseppe_F=" pid="i/GiuseppeFItaliano">Giuseppe F. Italiano</na></co>
<co c="1"><na f="j/Jaggi:Sidharth" pid="77/4320">Sidharth Jaggi</na></co>
<co c="1"><na f="j/Jain:Kamal" pid="13/4619">Kamal Jain</na></co>
<co c="0"><na f="j/J=ouml=bstl:Emanuel" pid="153/1085">Emanuel J&#246;bstl</na></co>
<co c="0"><na f="j/Johnson_0001:David_S=" pid="j/DavidSJohnson">David S. Johnson 0001</na></co>
<co c="0"><na f="j/J=oslash=rgensen:Allan_Gr=oslash=nlund" pid="48/481">Allan Gr&#248;nlund J&#248;rgensen</na></co>
<co c="0"><na f="j/Jung_0003:Christian" pid="16/2948-3">Christian Jung 0003</na></co>
<co c="0"><na f="j/Jung:Markus" pid="05/3449">Markus Jung</na></co>
<co c="0"><na f="k/Kaligosi:Kanela" pid="01/3245">Kanela Kaligosi</na></co>
<co c="0"><na f="k/Kappes:Andrea" pid="128/4179">Andrea Kappes</na></co>
<co c="0"><na f="k/Karch:Daniel" pid="97/8398">Daniel Karch</na></co>
<co c="0"><na f="k/K=auml=rkk=auml=inen:Juha" pid="k/JKarkkainen">Juha K&#228;rkk&#228;inen</na></co>
<co c="0"><na f="k/Katriel:Irit" pid="k/IritKatriel">Irit Katriel</na></co>
<co c="0"><na f="k/Keh:Thomas" pid="162/0191">Thomas Keh</na></co>
<co c="0"><na f="k/Kessler:Christoph_W=" pid="k/ChristophWKessler">Christoph W. Kessler</na></co>
<co c="0"><na f="k/Kettner:Lutz" pid="56/4202">Lutz Kettner</na></co>
<co c="0"><na f="k/Kiefer:Moritz" pid="189/1087">Moritz Kiefer</na></co>
<co c="0"><na f="k/Kieritz:Tim" pid="98/8030">Tim Kieritz</na></co>
<co c="0"><na f="k/Kirmayer:Sebastian" pid="405/7608">Sebastian Kirmayer</na></co>
<co c="-1"><na f="k/Kliemann:Lasse" pid="37/5165">Lasse Kliemann</na></co>
<co c="3"><na f="k/Knight:P=_L=" pid="37/911">P. L. Knight</na></co>
<co c="0"><na f="k/Knopp:Sebastian" pid="76/5320">Sebastian Knopp</na></co>
<co c="0"><na f="k/Kobitski:Andrei" pid="179/2678">Andrei Kobitski</na></co>
<co c="0"><na f="k/Kobitzsch:Moritz" pid="65/8409">Moritz Kobitzsch</na></co>
<co c="0"><na f="k/Koch_0004:Stefan" pid="65/6404-4">Stefan Koch 0004</na></co>
<co c="0" n="2"><na f="k/K=ouml=hler:Henning" pid="13/2962">Henning K&#246;hler</na><na>Henning Koehler</na></co>
<co c="1"><na f="k/Korst:Jan_H=_M=" pid="17/666">Jan H. M. Korst</na></co>
<co c="0"><na f="k/Koziolek:Anne" pid="51/1757">Anne Koziolek</na></co>
<co c="0"><na f="k/Kozlov:Alexey_M=" pid="155/5457">Alexey M. Kozlov</na></co>
<co c="0"><na f="k/Krause:Mathias_J=" pid="52/8873">Mathias J. Krause</na></co>
<co c="0"><na f="k/Krysta:Piotr" pid="k/PiotrKrysta">Piotr Krysta</na></co>
<co c="-1"><na f="k/Kulla:Fabian" pid="85/6949">Fabian Kulla</na></co>
<co c="4"><na f="k/Kumar:Ajay" pid="85/4670">Ajay Kumar</na></co>
<co c="0"><na f="k/Kurpicz:Florian" pid="163/4161">Florian Kurpicz</na></co>
<co c="0"><na f="l/Lacurie:Arnaud" pid="163/0557">Arnaud Lacurie</na></co>
<co c="0"><na f="l/Lamm:Sebastian" pid="159/1660">Sebastian Lamm</na></co>
<co c="0"><na f="l/Langedal:Kenneth" pid="324/0624">Kenneth Langedal</na></co>
<co c="0"><na f="l/Langguth:Johannes" pid="14/7938">Johannes Langguth</na></co>
<co c="0"><na f="l/Laupichler:Moritz" pid="347/1309">Moritz Laupichler</na></co>
<co c="0"><na f="l/Lehmann:Hans=Peter" pid="295/9136">Hans-Peter Lehmann</na></co>
<co c="0"><na f="l/Lehner:Wolfgang" pid="l/WLehner">Wolfgang Lehner</na></co>
<co c="0"><na f="l/Leibfried:Thomas" pid="13/7977">Thomas Leibfried</na></co>
<co c="0"><na f="l/Leischner:Nikolaj" pid="96/7412">Nikolaj Leischner</na></co>
<co c="0"><na f="l/Liebig:Thomas" pid="94/3226">Thomas Liebig</na></co>
<co c="0"><na f="l/Looz:Moritz_von" pid="157/8455">Moritz von Looz</na></co>
<co c="0"><na f="l/Luxen:Dennis" pid="48/7217">Dennis Luxen</na></co>
<co c="0"><na f="m/Maas:Nikolai" pid="284/8160">Nikolai Maas</na></co>
<co c="0"><na f="m/Maier:Tobias" pid="81/910">Tobias Maier</na></co>
<co c="0"><na f="m/Mandow:Lawrence" pid="m/LawrenceMandow">Lawrence Mandow</na></co>
<co c="0"><na f="m/Manne:Fredrik" pid="m/FredrikManne">Fredrik Manne</na></co>
<co c="0"><na f="m/Marianczuk:Jasper" pid="247/5980">Jasper Marianczuk</na></co>
<co c="0"><na f="m/Matijevic:Domagoj" pid="m/DomagojMatijevic">Domagoj Matijevic</na></co>
<co c="0"><na f="m/Maue:Jens" pid="98/5569">Jens Maue</na></co>
<co c="0"><na f="m/McGeoch:Catherine_C=" pid="m/CatherineCMcGeoch">Catherine C. McGeoch</na></co>
<co c="0"><na f="m/Mchedlidze:Tamara" pid="32/4396">Tamara Mchedlidze</na></co>
<co c="0"><na f="m/Mehlhorn:Kurt" pid="m/KurtMehlhorn">Kurt Mehlhorn</na></co>
<co c="0"><na f="m/Mehnert:Jens" pid="09/5738">Jens Mehnert</na></co>
<co c="0"><na f="m/Mehnert:Pascal" pid="376/8711">Pascal Mehnert</na></co>
<co c="0"><na f="m/Mercatoris:Charel" pid="393/3265">Charel Mercatoris</na></co>
<co c="-1"><na f="m/Merz_0003:Florian" pid="60/7861-3">Florian Merz 0003</na></co>
<co c="0"><na f="m/Meyer_0001:Ulrich" pid="m/UlrichMeyer-1">Ulrich Meyer 0001</na></co>
<co c="0"><na f="m/Meyerhenke:Henning" pid="55/3065">Henning Meyerhenke</na></co>
<co c="0"><na f="m/Middelmann:Wolfgang" pid="85/6769">Wolfgang Middelmann</na></co>
<co c="0"><na f="m/Mikut:Ralf" pid="82/4675">Ralf Mikut</na></co>
<co c="0"><na f="m/Moloney:David" pid="76/3181">David Moloney</na></co>
<co c="0"><na f="m/Moret:Bernard_M=_E=" pid="18/242">Bernard M. E. Moret</na></co>
<co c="0"><na f="m/Mueller:Thomas" pid="91/7068">Thomas Mueller</na></co>
<co c="0"><na f="m/M=uuml=ller_0002:Ingo" pid="76/3160-2">Ingo M&#252;ller 0002</na></co>
<co c="0"><na f="m/M=uuml=ller:Matthias" pid="59/650">Matthias M&#252;ller</na></co>
<co c="0"><na f="m/M=uuml=ller=Hannemann:Matthias" pid="37/5076">Matthias M&#252;ller-Hannemann</na></co>
<co c="0"><na f="m/Munro:J=_Ian" pid="m/JIanMunro">J. Ian Munro</na></co>
<co c="0"><na f="m/Mutzel:Petra" pid="m/PetraMutzel">Petra Mutzel</na></co>
<co c="0"><na f="n/N=auml=her:Stefan" pid="n/StefanNaher">Stefan N&#228;her</na></co>
<co c="0"><na f="n/Namyst:Raymond" pid="75/4443">Raymond Namyst</na></co>
<co c="0"><na f="n/Navarro_0001:Gonzalo" pid="n/GonzaloNavarro">Gonzalo Navarro 0001</na></co>
<co c="0"><na f="n/Neubauer:Sabine" pid="75/7218">Sabine Neubauer</na></co>
<co c="0"><na f="n/Nguyen:Huyen_Chau" pid="185/1021">Huyen Chau Nguyen</na></co>
<co c="0"><na f="n/Niedermeier:Rolf" pid="n/RolfNiedermeier">Rolf Niedermeier</na></co>
<co c="0"><na f="n/Nienhaus:G=_Ulrich" pid="179/2250">G. Ulrich Nienhaus</na></co>
<co c="0"><na f="n/Noe:Alexander" pid="154/6650">Alexander Noe</na></co>
<co c="0"><na f="n/N=ouml=llenburg:Martin" pid="41/4420">Martin N&#246;llenburg</na></co>
<co c="0"><na f="o/Ohlebusch:Enno" pid="o/EnnoOhlebusch">Enno Ohlebusch</na></co>
<co c="0"><na f="o/Osipov:Vitaly" pid="91/2425">Vitaly Osipov</na></co>
<co c="0"><na f="o/Othman:Walied" pid="10/4032">Walied Othman</na></co>
<co c="0"><na f="o/Otte:Jens_C=" pid="48/11159">Jens C. Otte</na></co>
<co c="0"><na f="p/Pagh:Rasmus" pid="p/RasmusPagh">Rasmus Pagh</na></co>
<co c="0"><na f="p/Pajor:Thomas" pid="99/5937">Thomas Pajor</na></co>
<co c="0"><na f="p/Paredes:Rodrigo" pid="95/3010">Rodrigo Paredes</na></co>
<co c="0"><na f="p/Penschuck:Manuel" pid="173/4727">Manuel Penschuck</na></co>
<co c="5"><na f="p/Perumalla:Kalyan_S=" pid="15/4026">Kalyan S. Perumalla</na></co>
<co c="0"><na f="p/Pettie:Seth" pid="77/888">Seth Pettie</na></co>
<co c="0"><na f="p/Pibiri:Giulio_Ermanno" pid="204/0111">Giulio Ermanno Pibiri</na></co>
<co c="0"><na f="p/Pllana:Sabri" pid="40/1392">Sabri Pllana</na></co>
<co c="0"><na f="p/Poblete:Patricio_V=" pid="28/1091">Patricio V. Poblete</na></co>
<co c="0"><na f="p/Prechelt:Lutz" pid="54/3155">Lutz Prechelt</na></co>
<co c="0"><na f="p/Precup:Doina" pid="p/DoinaPrecup">Doina Precup</na></co>
<co c="0"><na f="p/Putze:Felix" pid="37/3890">Felix Putze</na></co>
<co c="0"><na f="r/Rahn:Mirko" pid="96/4653">Mirko Rahn</na></co>
<co c="4"><na f="r/Rao_0001:Praveen" pid="69/9203">Praveen Rao 0001</na></co>
<co c="3"><na f="r/Rathe:U=_W=" pid="88/676">U. W. Rathe</na></co>
<co c="0"><na f="r/Reinhardt:Klaus" pid="r/KlausReinhardt">Klaus Reinhardt</na></co>
<co c="0"><na f="r/Reussner:Ralf_H=" pid="r/RalfReussner">Ralf H. Reussner</na></co>
<co c="0"><na f="r/Rice:Michael_N=" pid="43/8999">Michael N. Rice</na></co>
<co c="0"><na f="r/Richards:Andrew" pid="19/6205">Andrew Richards</na></co>
<co c="0"><na f="r/Rigi=Luperti:Niccol=ograve=" pid="413/4050">Niccol&#242; Rigi-Luperti</na></co>
<co c="0"><na f="r/Rihani:Hamza" pid="154/6598">Hamza Rihani</na></co>
<co c="0"><na f="r/Rosch:Dominik" pid="405/5825">Dominik Rosch</na></co>
<co c="0"><na f="r/Rutter:Ignaz" pid="99/44">Ignaz Rutter</na></co>
<co c="0"><na f="s/Safro:Ilya" pid="64/5096">Ilya Safro</na></co>
<co c="0"><na f="s/Salwasser:Daniel" pid="391/5845">Daniel Salwasser</na></co>
<co c="0"><na f="s/Schieferdecker:Dennis" pid="77/2645">Dennis Schieferdecker</na></co>
<co c="0"><na f="s/Schimek:Matthias" pid="256/9438">Matthias Schimek</na></co>
<co c="0"><na f="s/Schlag:Sebastian" pid="139/4269">Sebastian Schlag</na></co>
<co c="0"><na f="s/Schott:Benjamin" pid="176/5604">Benjamin Schott</na></co>
<co c="0"><na f="s/Schrade:Emanuel" pid="183/8759">Emanuel Schrade</na></co>
<co c="0"><na f="s/Schreiber_0001:Dominik" pid="178/3095-1">Dominik Schreiber 0001</na></co>
<co c="0"><na f="s/Schultes:Dominik" pid="31/3154">Dominik Schultes</na></co>
<co c="0"><na f="s/Schulz_0003:Christian" pid="10/1388-3">Christian Schulz 0003</na></co>
<co c="0"><na f="s/Schulz_0001:Frank" pid="s/FranKSchulz">Frank Schulz 0001</na></co>
<co c="0"><na f="s/Schulze:Robert" pid="87/9883">Robert Schulze</na></co>
<co c="0"><na f="s/Seemaier:Daniel" pid="225/5422">Daniel Seemaier</na></co>
<co c="0"><na f="s/Sibeyn:Jop_F=" pid="s/JopFSibeyn">Jop F. Sibeyn</na></co>
<co c="0"><na f="s/Simecek:Pavel" pid="66/1775">Pavel Simecek</na></co>
<co c="0"><na f="s/Singler:Johannes" pid="s/JohannesSingler">Johannes Singler</na></co>
<co c="0"><na f="s/Sinz:Carsten" pid="s/CarstenSinz">Carsten Sinz</na></co>
<co c="0"><na f="s/Sitchinava:Nodari" pid="51/947">Nodari Sitchinava</na></co>
<co c="0"><na f="s/Sivadasan:Naveen" pid="70/613">Naveen Sivadasan</na></co>
<co c="0"><na f="s/Skutella:Martin" pid="80/2691">Martin Skutella</na></co>
<co c="0"><na f="s/Solis=Oba:Roberto" pid="58/628">Roberto Solis-Oba</na></co>
<co c="0"><na f="s/Speck:Jochen" pid="28/6353">Jochen Speck</na></co>
<co c="0"><na f="s/Spirakis:Paul_G=" pid="s/PaulGSpirakis">Paul G. Spirakis</na></co>
<co c="0"><na f="s/Srinivasan:Aravind" pid="s/AravindSrinivasan">Aravind Srinivasan</na></co>
<co c="0"><na f="s/Stamatakis:Alexandros" pid="01/501">Alexandros Stamatakis</na></co>
<co c="0"><na f="s/Stee:Rob_van" pid="10/4553">Rob van Stee</na></co>
<co c="0"><na f="s/Steffen:Raoul" pid="132/3988">Raoul Steffen</na></co>
<co c="0"><na f="s/Stegmaier:Johannes" pid="142/5460">Johannes Stegmaier</na></co>
<co c="0"><na f="s/Stelz:Christoph" pid="375/1725">Christoph Stelz</na></co>
<co c="-1"><na f="s/Steurer:David" pid="59/254">David Steurer</na></co>
<co c="0"><na f="s/Storandt:Sabine" pid="74/9877">Sabine Storandt</na></co>
<co c="0"><na f="s/Str=auml=hle:Uwe" pid="22/8429">Uwe Str&#228;hle</na></co>
<co c="0"><na f="s/Strash:Darren" pid="18/3295">Darren Strash</na></co>
<co c="0"><na f="s/Stumpp:Matthias" pid="11/10894">Matthias Stumpp</na></co>
<co c="0"><na f="s/Sturm:Tobias" pid="150/6694">Tobias Sturm</na></co>
<co c="2"><na f="t/Takkula:Tuomo" pid="43/212">Tuomo Takkula</na></co>
<co c="0"><na f="t/Toledo:Sivan" pid="33/6491">Sivan Toledo</na></co>
<co c="1" n="2"><na f="t/Tolhuizen:Ludo" pid="05/7218">Ludo Tolhuizen</na><na>Ludo M. G. M. Tolhuizen</na></co>
<co c="0"><na f="t/Tr=auml=ff:Jesper_Larsson" pid="t/JLTraff">Jesper Larsson Tr&#228;ff</na></co>
<co c="-1"><na f="t/Transier:Frederik" pid="71/3602">Frederik Transier</na></co>
<co c="0"><na f="t/Truschel:Carina" pid="355/3125">Carina Truschel</na></co>
<co c="0"><na f="t/Tsigas:Philippas" pid="t/PhilippasTsigas">Philippas Tsigas</na></co>
<co c="0"><na f="t/Tsotras:Vassilis_J=" pid="t/VassilisJTsotras">Vassilis J. Tsotras</na></co>
<co c="0"><na f="u/Uhl:Tim_Niklas" pid="243/7018">Tim Niklas Uhl</na></co>
<co c="0"><na f="u/Ulbrich:Mattias" pid="73/9580">Mattias Ulbrich</na></co>
<co c="0"><na f="v/Vetter:Christian" pid="95/3382">Christian Vetter</na></co>
<co c="0"><na f="v/Vigna:Sebastiano" pid="27/6106">Sebastiano Vigna</na></co>
<co c="0"><na f="v/Vinciguerra:Giorgio" pid="237/9641">Giorgio Vinciguerra</na></co>
<co c="0"><na f="v/Vitter:Jeffrey_Scott" pid="v/JeffreyScottVitter">Jeffrey Scott Vitter</na></co>
<co c="0"><na f="v/V=ouml=cking:Berthold" pid="v/BertholdVocking">Berthold V&#246;cking</na></co>
<co c="0"><na f="v/V=ouml=lker:Lars" pid="14/2332">Lars V&#246;lker</na></co>
<co c="0"><na f="v/Vollmar:Roland" pid="v/RolandVollmar">Roland Vollmar</na></co>
<co c="0"><na f="w/Wagner:Andreas" pid="09/6351">Andreas Wagner</na></co>
<co c="0"><na f="w/Wagner:Dorothea" pid="w/DorotheaWagner">Dorothea Wagner</na></co>
<co c="0"><na f="w/Walzer:Stefan" pid="139/7331">Stefan Walzer</na></co>
<co c="0"><na f="w/Wang:Jiawen" pid="135/8997">Jiawen Wang</na></co>
<co c="0"><na f="w/Wang_0002:Qing" pid="97/6505-2">Qing Wang 0002</na></co>
<co c="0"><na f="w/Wassenberg:Jan" pid="44/7407">Jan Wassenberg</na></co>
<co c="2"><na f="w/Wedelin:Dag" pid="17/1915">Dag Wedelin</na></co>
<co c="0"><na f="w/Wegner:Franziska" pid="163/1869">Franziska Wegner</na></co>
<co c="0"><na f="w/Weidner:Martin" pid="134/4153">Martin Weidner</na></co>
<co c="0"><na f="w/Weigl:Alexander" pid="170/0399">Alexander Weigl</na></co>
<co c="0"><na f="w/Werneck:Renato_F=" pid="63/3747">Renato F. Werneck</na></co>
<co c="0"><na f="w/Wiebigke:Armin" pid="207/8283">Armin Wiebigke</na></co>
<co c="0"><na f="w/Wiesler:Julian" pid="372/5592">Julian Wiesler</na></co>
<co c="0"><na f="w/Williams:Marvin" pid="296/3808">Marvin Williams</na></co>
<co c="0"><na f="w/Williger:Robert" pid="195/5540">Robert Williger</na></co>
<co c="-1"><na f="w/Winkel:Sebastian" pid="05/3117">Sebastian Winkel</na></co>
<co c="0"><na f="w/Winkler:Vincent" pid="236/4836">Vincent Winkler</na></co>
<co c="0"><na f="w/Witt:Sascha" pid="161/9821">Sascha Witt</na></co>
<co c="0"><na f="w/Wormald:Nicholas_C=" pid="w/NicholasCWormald">Nicholas C. Wormald</na></co>
<co c="0"><na f="w/Worsch:Thomas" pid="49/2653">Thomas Worsch</na></co>
<co c="0"><na f="z/Zeh:Norbert" pid="73/3395">Norbert Zeh</na></co>
<co c="0"><na f="z/Zhou:Wei" pid="69/5011">Wei Zhou</na></co>
<co c="0"><na f="z/Ziegler:Jonatan" pid="399/6935">Jonatan Ziegler</na></co>
<co c="0"><na f="z/Zubkov:Roman" pid="122/0272">Roman Zubkov</na></co>
<co c="0"><na f="z/Z=uuml=ndorf:Michael" pid="278/0964">Michael Z&#252;ndorf</na></co>
</coauthors>
</dblpperson>

