default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPeter Sanders 0001
Person information
- affiliation: Karlsruhe Institute of Technology, Department of Informatics
- affiliation: Max Planck Institute for Informatics
- award (2012): Gottfried Wilhelm Leibniz Prize
Other persons with the same name
- Peter Sanders 0002 — Maxeler Technologies
- Peter Sanders 0003
![[0000-0002-6344-5221]](https://dblp.dagstuhl.de/img/orcid-mark.12x12.png "0000-0002-6344-5221")
— One2many, Deventer, CL, The Netherlands
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j82]Dominik Schreiber, Peter Sanders:
MallobSat: Scalable SAT Solving by Clause Sharing. J. Artif. Intell. Res. 80: 1437-1495 (2024)- [j81]Lars Gottesbüren, Tobias Heuer, Nikolai Maas, Peter Sanders, Sebastian Schlag:
Scalable High-Quality Hypergraph Partitioning. ACM Trans. Algorithms 20(1): 9:1-9:54 (2024) - [c215]Moritz Laupichler, Peter Sanders:
Fast Many-to-Many Routing for Dynamic Taxi Sharing with Meeting Points. ALENEX 2024: 74-90 - [c214]Hans-Peter Lehmann, Peter Sanders, Stefan Walzer:
ShockHash: Towards Optimal-Space Minimal Perfect Hashing Beyond Brute-Force. ALENEX 2024: 194-206 - [c213]Stefan Hermann, Hans-Peter Lehmann, Giulio Ermanno Pibiri, Peter Sanders, Stefan Walzer:
PHOBIC: Perfect Hashing With Optimized Bucket Sizes and Interleaved Coding. ESA 2024: 69:1-69:17 - [c212]Florian Kurpicz, Pascal Mehnert, Peter Sanders, Matthias Schimek:
Scalable Distributed String Sorting. ESA 2024: 83:1-83:17 - [c211]Lars Gottesbüren, Nikolai Maas, Peter Sanders, Daniel Seemaier:
Modern Software Libraries for Graph Partitioning (Abstract). HOPC@SPAA 2024 - [c210]Dominik Schreiber, Peter Sanders:
Scalable SAT Solving on Demand (Abstract). HOPC@SPAA 2024 - [c209]Demian Hespe, Lukas Hübner, Florian Kurpicz, Peter Sanders, Matthias Schimek, Daniel Seemaier, Tim Niklas Uhl:
Brief Announcement: (Near) Zero-Overhead C++ Bindings for MPI. SPAA 2024: 289-291 - [c208]Florian Kurpicz, Pascal Mehnert, Peter Sanders, Matthias Schimek:
Brief Announcement: Scalable Distributed String Sorting. SPAA 2024: 375-377 - [c207]Peter Sanders, Daniel Seemaier:
Brief Announcement: Distributed Unconstrained Local Search for Multilevel Graph Partitioning. SPAA 2024: 443-445 - [c206]Bernhard Beckert, Peter Sanders, Mattias Ulbrich, Julian Wiesler, Sascha Witt:
Formally Verifying an Efficient Sorter. TACAS (1) 2024: 268-287 - [c205]Kenneth Langedal, Demian Hespe, Peter Sanders:
Targeted Branching for the Maximum Independent Set Problem Using Graph Neural Networks. SEA 2024: 20:1-20:21 - [i112]Demian Hespe, Lukas Hübner, Florian Kurpicz, Peter Sanders, Matthias Schimek, Daniel Seemaier, Christoph Stelz, Tim Niklas Uhl:
KaMPIng: Flexible and (Near) Zero-overhead C++ Bindings for MPI. CoRR abs/2404.05610 (2024) - [i111]Florian Kurpicz, Pascal Mehnert, Peter Sanders, Matthias Schimek:
Scalable Distributed String Sorting. CoRR abs/2404.16517 (2024) - [i110]Stefan Hermann, Hans-Peter Lehmann, Giulio Ermanno Pibiri, Peter Sanders, Stefan Walzer:
PHOBIC: Perfect Hashing with Optimized Bucket Sizes and Interleaved Coding. CoRR abs/2404.18497 (2024) - [i109]Matthew Akram, Nikolai Maas, Peter Sanders, Dominik Schreiber:
Engineering Optimal Parallel Task Scheduling. CoRR abs/2405.15371 (2024) - [i108]Peter Sanders, Daniel Seemaier:
Brief Announcement: Distributed Unconstrained Local Search for Multilevel Graph Partitioning. CoRR abs/2406.03169 (2024) - [i107]Daniel Funke, Demian Hespe, Peter Sanders, Sabine Storandt, Carina Truschel:
Pareto Sums of Pareto Sets: Lower Bounds and Algorithms. CoRR abs/2409.10232 (2024) - [i106]Daniel Salwasser, Daniel Seemaier, Lars Gottesbüren, Peter Sanders:
Tera-Scale Multilevel Graph Partitioning. CoRR abs/2410.19119 (2024) - 2023
- [j80]Martin Held, Martin Nöllenburg, Peter Sanders:
Editorial. Comput. Geom. 110: 101950 (2023) - [j79]Ümit V. Çatalyürek, Karen D. Devine, Marcelo Fonseca Faraj, Lars Gottesbüren, Tobias Heuer, Henning Meyerhenke, Peter Sanders, Sebastian Schlag, Christian Schulz, Daniel Seemaier, Dorothea Wagner:
More Recent Advances in (Hyper)Graph Partitioning. ACM Comput. Surv. 55(12): 253:1-253:38 (2023) - [c204]Florian Kurpicz, Hans-Peter Lehmann, Peter Sanders:
PaCHash: Packed and Compressed Hash Tables. ALENEX 2023: 162-175 - [c203]Hans-Peter Lehmann, Peter Sanders, Stefan Walzer:
SicHash - Small Irregular Cuckoo Tables for Perfect Hashing. ALENEX 2023: 176-189 - [c202]Dominik Bez, Florian Kurpicz, Hans-Peter Lehmann, Peter Sanders:
High Performance Construction of RecSplit Based Minimal Perfect Hash Functions. ESA 2023: 19:1-19:16 - [c201]Paolo Ferragina, Hans-Peter Lehmann, Peter Sanders, Giorgio Vinciguerra:
Learned Monotone Minimal Perfect Hashing. ESA 2023: 46:1-46:17 - [c200]Daniel Funke, Nicolai Hüning, Peter Sanders:
A Sweep-Plane Algorithm for Calculating the Isolation of Mountains. ESA 2023: 51:1-51:17 - [c199]Demian Hespe, Peter Sanders, Sabine Storandt, Carina Truschel:
Pareto Sums of Pareto Sets. ESA 2023: 60:1-60:17 - [c198]Peter Sanders, Daniel Seemaier:
Distributed Deep Multilevel Graph Partitioning. Euro-Par 2023: 443-457 - [c197]Peter Sanders, Matthias Schimek:
Engineering Massively Parallel MST Algorithms. IPDPS 2023: 691-701 - [c196]Peter Sanders, Tim Niklas Uhl:
Engineering a Distributed-Memory Triangle Counting Algorithm. IPDPS 2023: 702-712 - [c195]Daniel Funke, Peter Sanders:
Efficient Yao Graph Construction. SEA 2023: 20:1-20:20 - [d2]Bernhard Beckert, Peter Sanders, Mattias Ulbrich, Julian Wiesler, Sascha Witt:
Formally Verifying an Efficient Sorter - Verification and Benchmarking Artifact. Zenodo, 2023
- [i105]Peter Sanders, Tim Niklas Uhl:
Engineering a Distributed-Memory Triangle Counting Algorithm. CoRR abs/2302.11443 (2023) - [i104]Peter Sanders, Matthias Schimek:
Engineering Massively Parallel MST Algorithms. CoRR abs/2302.12199 (2023) - [i103]Peter Sanders, Daniel Seemaier:
Distributed Deep Multilevel Graph Partitioning. CoRR abs/2303.01417 (2023) - [i102]Daniel Funke, Peter Sanders:
Efficient Yao Graph Construction. CoRR abs/2303.07858 (2023) - [i101]Lars Gottesbüren, Tobias Heuer, Nikolai Maas, Peter Sanders, Sebastian Schlag:
Scalable High-Quality Hypergraph Partitioning. CoRR abs/2303.17679 (2023) - [i100]Hans-Peter Lehmann, Peter Sanders, Stefan Walzer:
Sliding Block Hashing (Slick) - Basic Algorithmic Ideas. CoRR abs/2304.09283 (2023) - [i99]Paolo Ferragina, Hans-Peter Lehmann, Peter Sanders, Giorgio Vinciguerra:
Learned Monotone Minimal Perfect Hashing. CoRR abs/2304.11012 (2023) - [i98]Moritz Laupichler, Peter Sanders:
Fast Many-to-Many Routing for Ridesharing with Multiple Pickup and Dropoff Locations. CoRR abs/2305.05417 (2023) - [i97]Daniel Funke, Nicolai Hüning, Peter Sanders:
A Sweep-plane Algorithm for Calculating the Isolation of Mountains. CoRR abs/2305.08470 (2023) - [i96]Hans-Peter Lehmann, Peter Sanders, Stefan Walzer:
ShockHash: Towards Optimal-Space Minimal Perfect Hashing Beyond Brute-Force. CoRR abs/2308.09561 (2023) - [i95]Hans-Peter Lehmann, Peter Sanders, Stefan Walzer:
Bipartite ShockHash: Pruning ShockHash Search for Efficient Perfect Hashing. CoRR abs/2310.14959 (2023) - [i94]Moritz Laupichler, Peter Sanders:
Fast Many-to-Many Routing for Dynamic Taxi Sharing with Meeting Points. CoRR abs/2311.01581 (2023) - 2022
- [j78]Sebastian Schlag, Tobias Heuer, Lars Gottesbüren, Yaroslav Akhremtsev, Christian Schulz, Peter Sanders:
High-Quality Hypergraph Partitioning. ACM J. Exp. Algorithmics 27: 1.9:1-1.9:39 (2022) - [j77]Peter Sanders, Dominik Schreiber:
Mallob: Scalable SAT Solving On Demand With Decentralized Job Scheduling. J. Open Source Softw. 7(77): 4591 (2022) - [j76]Jan Wassenberg, Mark Blacher, Joachim Giesen, Peter Sanders:
Vectorized and performance-portable quicksort. Softw. Pract. Exp. 52(12): 2684-2699 (2022) - [j75]Lorenz Hübschle-Schneider, Peter Sanders:
Parallel Weighted Random Sampling. ACM Trans. Math. Softw. 48(3): 29:1-29:40 (2022) - [j74]Michael Axtmann, Sascha Witt, Daniel Ferizovic, Peter Sanders:
Engineering In-place (Shared-memory) Sorting Algorithms. ACM Trans. Parallel Comput. 9(1): 2:1-2:62 (2022) - [c194]Lars Gottesbüren, Tobias Heuer, Peter Sanders, Sebastian Schlag:
Shared-Memory n-level Hypergraph Partitioning. ALENEX 2022: 131-144 - [c193]Peter Sanders, Dominik Schreiber:
Decentralized Online Scheduling of Malleable NP-hard Jobs. Euro-Par 2022: 119-135 - [c192]Lukas Hübner, Demian Hespe, Peter Sanders, Alexandros Stamatakis:
ReStore: In-Memory REplicated STORagE for Rapid Recovery in Fault-Tolerant Algorithms. FTXS@SC 2022: 24-35 - [c191]Sebastian Lamm, Peter Sanders:
Communication-efficient Massively Distributed Connected Components. IPDPS 2022: 302-312 - [c190]Peter C. Dillinger, Lorenz Hübschle-Schneider, Peter Sanders, Stefan Walzer:
Fast Succinct Retrieval and Approximate Membership Using Ribbon. SEA 2022: 4:1-4:20 - [c189]Lars Gottesbüren, Tobias Heuer, Peter Sanders:
Parallel Flow-Based Hypergraph Partitioning. SEA 2022: 5:1-5:21 - [p7]Stephan Erb, Moritz Kobitzsch, Lawrence Mandow, Peter Sanders:
Multi-Objective Shortest Paths. Massive Graph Analytics 2022: 35-59 - [p6]Manuel Penschuck, Ulrik Brandes, Michael Hamann, Sebastian Lamm, Ulrich Meyer, Ilya Safro, Peter Sanders, Christian Schulz:
Recent Advances in Scalable Network Generation1. Massive Graph Analytics 2022: 333-376 - [p5]Timo Bingmann, Patrick Dinklage, Johannes Fischer, Florian Kurpicz, Enno Ohlebusch, Peter Sanders:
Scalable Text Index Construction. Algorithms for Big Data 2022: 252-284 - [d1]Dominik Schreiber, Peter Sanders:
Mallob: Scalable SAT Solving On Demand With Decentralized Job Scheduling. Zenodo, 2022 - [i93]Lars Gottesbüren, Tobias Heuer, Peter Sanders:
Parallel Flow-Based Hypergraph Partitioning. CoRR abs/2201.01556 (2022) - [i92]Demian Hespe, Lukas Hübner, Peter Sanders, Alexandros Stamatakis:
ReStore: In-Memory REplicated STORagE for Rapid Recovery in Fault-Tolerant Algorithms. CoRR abs/2203.01107 (2022) - [i91]Florian Kurpicz, Hans-Peter Lehmann, Peter Sanders:
PaCHash: Packed and Compressed Hash Tables. CoRR abs/2205.04745 (2022) - [i90]Mark Blacher, Joachim Giesen, Peter Sanders, Jan Wassenberg:
Vectorized and performance-portable Quicksort. CoRR abs/2205.05982 (2022) - [i89]Dominik Schreiber, Peter Sanders:
Scalable SAT Solving in the Cloud. CoRR abs/2205.06590 (2022) - [i88]Ümit V. Çatalyürek, Karen D. Devine, Marcelo Fonseca Faraj, Lars Gottesbüren, Tobias Heuer, Henning Meyerhenke, Peter Sanders, Sebastian Schlag, Christian Schulz, Daniel Seemaier, Dorothea Wagner:
More Recent Advances in (Hyper)Graph Partitioning. CoRR abs/2205.13202 (2022) - [i87]Hans-Peter Lehmann, Peter Sanders, Stefan Walzer:
SicHash - Small Irregular Cuckoo Tables for Perfect Hashing. CoRR abs/2210.01560 (2022) - [i86]Dominik Bez, Florian Kurpicz, Hans-Peter Lehmann, Peter Sanders:
High Performance Construction of RecSplit Based Minimal Perfect Hash Functions. CoRR abs/2212.09562 (2022) - 2021
- [j73]Lukas Hübner, Alexey M. Kozlov, Demian Hespe, Peter Sanders, Alexandros Stamatakis:
Exploring parallel MPI fault tolerance mechanisms for phylogenetic inference with RAxML-NG. Bioinform. 37(22): 4056-4063 (2021) - [j72]Timo Bingmann, Jasper Marianczuk, Peter Sanders:
Engineering faster sorters for small sets of items. Softw. Pract. Exp. 51(5): 965-1004 (2021) - [c188]Lars Gottesbüren, Tobias Heuer, Peter Sanders, Sebastian Schlag:
Scalable Shared-Memory Hypergraph Partitioning. ALENEX 2021: 16-30 - [c187]Valentin Buchhold, Peter Sanders, Dorothea Wagner:
Fast, Exact and Scalable Dynamic Ridesharing. ALENEX 2021: 98-112 - [c186]Lars Gottesbüren, Tobias Heuer, Peter Sanders, Christian Schulz, Daniel Seemaier:
Deep Multilevel Graph Partitioning. ESA 2021: 48:1-48:17 - [c185]Marvin Williams, Peter Sanders, Roman Dementiev:
Engineering MultiQueues: Fast Relaxed Concurrent Priority Queues. ESA 2021: 81:1-81:17 - [c184]Dominik Schreiber, Peter Sanders:
Scalable SAT Solving in the Cloud. SAT 2021: 518-534 - [i85]Lars Gottesbüren, Tobias Heuer, Peter Sanders, Sebastian Schlag:
Shared-Memory n-level Hypergraph Partitioning. CoRR abs/2104.08107 (2021) - [i84]Lars Gottesbüren, Tobias Heuer, Peter Sanders, Christian Schulz, Daniel Seemaier:
Deep Multilevel Graph Partitioning. CoRR abs/2105.02022 (2021) - [i83]Sebastian Schlag, Tobias Heuer, Lars Gottesbüren, Yaroslav Akhremtsev, Christian Schulz, Peter Sanders:
High-Quality Hypergraph Partitioning. CoRR abs/2106.08696 (2021) - [i82]Hans-Peter Lehmann, Lorenz Hübschle-Schneider, Peter Sanders:
Weighted Random Sampling on GPUs. CoRR abs/2106.12270 (2021) - [i81]Marvin Williams, Peter Sanders, Roman Dementiev:
Engineering MultiQueues: Fast Relaxed Concurrent Priority Queues. CoRR abs/2107.01350 (2021) - [i80]Peter C. Dillinger, Lorenz Hübschle-Schneider, Peter Sanders, Stefan Walzer:
Fast Succinct Retrieval and Approximate Membership using Ribbon. CoRR abs/2109.01892 (2021) - 2020
- [j71]Lorenz Hübschle-Schneider, Peter Sanders:
Linear work generation of R-MAT graphs. Netw. Sci. 8(4): 543-550 (2020) - [j70]Yaroslav Akhremtsev, Peter Sanders, Christian Schulz:
High-Quality Shared-Memory Graph Partitioning. IEEE Trans. Parallel Distributed Syst. 31(11): 2710-2722 (2020) - [c183]Peter Sanders:
Connecting MapReduce Computations to Realistic Machine Models. IEEE BigData 2020: 84-93 - [c182]Timo Bingmann, Peter Sanders, Matthias Schimek:
Communication-Efficient String Sorting. IPDPS 2020: 137-147 - [c181]Lorenz Hübschle-Schneider, Peter Sanders:
Communication-Efficient Weighted Reservoir Sampling from Fully Distributed Data Streams. SPAA 2020: 543-545 - [c180]Tobias Maier, Peter Sanders, Robert Williger:
Concurrent Expandable AMQs on the Basis of Quotient Filters. SEA 2020: 15:1-15:13 - [e11]Fabrizio Grandoni, Grzegorz Herman, Peter Sanders:
28th Annual European Symposium on Algorithms, ESA 2020, September 7-9, 2020, Pisa, Italy (Virtual Conference). LIPIcs 173, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2020, ISBN 978-3-95977-162-7 [contents] - [i79]Timo Bingmann, Peter Sanders, Matthias Schimek:
Communication-Efficient String Sorting. CoRR abs/2001.08516 (2020) - [i78]Timo Bingmann, Jasper Marianczuk, Peter Sanders:
Engineering Faster Sorters for Small Sets of Items. CoRR abs/2002.05599 (2020) - [i77]Peter Sanders:
Connecting MapReduce Computations to Realistic Machine Models. CoRR abs/2002.07553 (2020) - [i76]Manuel Penschuck, Ulrik Brandes, Michael Hamann, Sebastian Lamm, Ulrich Meyer, Ilya Safro, Peter Sanders, Christian Schulz:
Recent Advances in Scalable Network Generation. CoRR abs/2003.00736 (2020) - [i75]Michael Axtmann, Sascha Witt, Daniel Ferizovic, Peter Sanders:
Engineering In-place (Shared-memory) Sorting Algorithms. CoRR abs/2009.13569 (2020) - [i74]Lars Gottesbüren, Tobias Heuer, Peter Sanders, Sebastian Schlag:
Scalable Shared-Memory Hypergraph Partitioning. CoRR abs/2010.10272 (2020) - [i73]Valentin Buchhold, Peter Sanders, Dorothea Wagner:
Fast, Exact and Scalable Dynamic Ridesharing. CoRR abs/2011.02601 (2020)
2010 – 2019
- 2019
- [b5]Peter Sanders, Kurt Mehlhorn, Martin Dietzfelbinger, Roman Dementiev:
Sequential and Parallel Algorithms and Data Structures - The Basic Toolbox. Springer 2019, ISBN 978-3-030-25208-3, pp. 1-434 - [j69]Tobias Maier, Peter Sanders, Stefan Walzer:
Dynamic Space Efficient Hashing. Algorithmica 81(8): 3162-3185 (2019) - [j68]Md. Maksudul Alam, Kalyan S. Perumalla, Peter Sanders:
Novel Parallel Algorithms for Fast Multi-GPU-Based Generation of Massive Scale-Free Networks. Data Sci. Eng. 4(1): 61-75 (2019) - [j67]Valentin Buchhold, Peter Sanders, Dorothea Wagner:
Real-time Traffic Assignment Using Engineered Customizable Contraction Hierarchies. ACM J. Exp. Algorithmics 24(1): 2.4:1-2.4:28 (2019) - [j66]Tobias Heuer, Peter Sanders, Sebastian Schlag:
Network Flow-Based Refinement for Multilevel Hypergraph Partitioning. ACM J. Exp. Algorithmics 24(1): 2.3:1-2.3:36 (2019) - [j65]Daniel Funke, Sebastian Lamm, Ulrich Meyer, Manuel Penschuck, Peter Sanders, Christian Schulz, Darren Strash, Moritz von Looz:
Communication-free massively distributed graph generation. J. Parallel Distributed Comput. 131: 200-217 (2019) - [j64]Tobias Maier, Peter Sanders, Roman Dementiev:
Concurrent Hash Tables: Fast and General(?)! ACM Trans. Parallel Comput. 5(4): 16:1-16:32 (2019) - [c179]Demian Hespe, Peter Sanders:
More Hierarchy in Route Planning Using Edge Hierarchies. ATMOS 2019: 10:1-10:14 - [c178]Lorenz Hübschle-Schneider, Peter Sanders:
Parallel Weighted Random Sampling. ESA 2019: 59:1-59:24 - [c177]Daniel Funke, Peter Sanders, Vincent Winkler:
Load-Balancing for Parallel Delaunay Triangulations. Euro-Par 2019: 156-169 - [c176]Valentin Buchhold, Peter Sanders, Dorothea Wagner:
Efficient Calculation of Microscopic Travel Demand Data with Low Calibration Effort. SIGSPATIAL/GIS 2019: 379-388 - [i72]Daniel Funke, Peter Sanders, Vincent Winkler:
Load-Balancing for Parallel Delaunay Triangulations. CoRR abs/1902.07554 (2019) - [i71]Lorenz Hübschle-Schneider, Peter Sanders:
Parallel Weighted Random Sampling. CoRR abs/1903.00227 (2019) - [i70]Lorenz Hübschle-Schneider, Peter Sanders:
Linear Work Generation of R-MAT Graphs. CoRR abs/1905.03525 (2019) - [i69]Demian Hespe, Peter Sanders:
More Hierarchy in Route Planning Using Edge Hierarchies. CoRR abs/1907.03535 (2019) - [i68]Lorenz Hübschle-Schneider, Peter Sanders:
Communication-Efficient (Weighted) Reservoir Sampling. CoRR abs/1910.11069 (2019) - [i67]Tobias Maier, Peter Sanders, Robert Williger:
Concurrent Expandable AMQs on the Basis of Quotient Filters. CoRR abs/1911.08374 (2019) - 2018
- [j63]Peter Sanders, Sebastian Lamm, Lorenz Hübschle-Schneider, Emanuel Schrade, Carsten Dachsbacher:
Efficient Parallel Random Sampling - Vectorized, Cache-Efficient, and Online. ACM Trans. Math. Softw. 44(3): 29:1-29:14 (2018) - [c175]Thomas Breitbach, Peter Sanders, Dominik Schultes:
Optimizing energy consumption and user experience in a mobile video streaming scenario. CCNC 2018: 1-9 - [c174]Anne Koziolek, Peter Sanders, Dorothea Wagner:
An equal opportunity concept for the coordinated research effort AESC. ECSA (Companion) 2018: 16:1-16:4 - [c173]Yaroslav Akhremtsev, Peter Sanders, Christian Schulz:
High-Quality Shared-Memory Graph Partitioning. Euro-Par 2018: 659-671 - [c172]Michael Axtmann, Armin Wiebigke, Peter Sanders:
Lightweight MPI Communicators with Applications to Perfectly Balanced Quicksort. IPDPS 2018: 254-265 - [c171]Daniel Funke, Sebastian Lamm, Peter Sanders, Christian Schulz, Darren Strash, Moritz von Looz:
Communication-Free Massively Distributed Graph Generation. IPDPS 2018: 336-347 - [c170]Lorenz Hübschle-Schneider, Peter Sanders:
Communication Efficient Checking of Big Data Operations. IPDPS 2018: 650-659 - [c169]