Peter Sanders

ORCID

Publication Activity (10 Years)

Years Active: 1993-2024
Publications (10 Years): 155

Top Venues

Karlsruhe Institute of Technology (PHD)

Education History

Karlsruhe Institute of Technology

PHD

Publications

Lars Gottesbüren, Nikolai Maas, Peter Sanders, Daniel Seemaier
Modern Software Libraries for Graph Partitioning (Abstract). HOPC@SPAA (2024)
Peter Sanders, Daniel Seemaier
Brief Announcement: Distributed Unconstrained Local Search for Multilevel Graph Partitioning. SPAA (2024)
Bernhard Beckert, Peter Sanders, Mattias Ulbrich, Julian Wiesler, Sascha Witt
Formally Verifying an Efficient Sorter. TACAS (1) (2024)
Stefan Hermann, Hans-Peter Lehmann, Giulio Ermanno Pibiri, Peter Sanders, Stefan Walzer
PHOBIC: Perfect Hashing with Optimized Bucket Sizes and Interleaved Coding. CoRR (2024)
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)
Florian Kurpicz, Pascal Mehnert, Peter Sanders, Matthias Schimek
Scalable Distributed String Sorting. CoRR (2024)
Florian Kurpicz, Pascal Mehnert, Peter Sanders, Matthias Schimek
Brief Announcement: Scalable Distributed String Sorting. SPAA (2024)
Matthew Akram, Nikolai Maas, Peter Sanders, Dominik Schreiber
Engineering Optimal Parallel Task Scheduling. CoRR (2024)
Dominik Schreiber, Peter Sanders
Scalable SAT Solving on Demand (Abstract). HOPC@SPAA (2024)
Hans-Peter Lehmann, Peter Sanders, Stefan Walzer
ShockHash: Towards Optimal-Space Minimal Perfect Hashing Beyond Brute-Force. ALENEX (2024)
Kenneth Langedal, Demian Hespe, Peter Sanders
Targeted Branching for the Maximum Independent Set Problem Using Graph Neural Networks. SEA (2024)
Peter Sanders, Daniel Seemaier
Brief Announcement: Distributed Unconstrained Local Search for Multilevel Graph Partitioning. CoRR (2024)
Lars Gottesbüren, Tobias Heuer, Nikolai Maas, Peter Sanders, Sebastian Schlag
Scalable High-Quality Hypergraph Partitioning. ACM Trans. Algorithms 20 (1) (2024)
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 (2024)
Moritz Laupichler, Peter Sanders
Fast Many-to-Many Routing for Dynamic Taxi Sharing with Meeting Points. ALENEX (2024)
Peter Sanders, Matthias Schimek
Engineering Massively Parallel MST Algorithms. CoRR (2023)
Paolo Ferragina, Hans-Peter Lehmann, Peter Sanders, Giorgio Vinciguerra
Learned Monotone Minimal Perfect Hashing. ESA (2023)
Daniel Funke, Nicolai Hüning, Peter Sanders
A Sweep-plane Algorithm for Calculating the Isolation of Mountains. CoRR (2023)
Moritz Laupichler, Peter Sanders
Fast Many-to-Many Routing for Ridesharing with Multiple Pickup and Dropoff Locations. CoRR (2023)
Martin Held, Martin Nöllenburg, Peter Sanders
Editorial. Comput. Geom. 110 (2023)
Peter Sanders, Daniel Seemaier
Distributed Deep Multilevel Graph Partitioning. CoRR (2023)
Florian Kurpicz, Hans-Peter Lehmann, Peter Sanders
PaCHash: Packed and Compressed Hash Tables. ALENEX (2023)
Daniel Funke, Peter Sanders
Efficient Yao Graph Construction. SEA (2023)
Paolo Ferragina, Hans-Peter Lehmann, Peter Sanders, Giorgio Vinciguerra
Learned Monotone Minimal Perfect Hashing. CoRR (2023)
Moritz Laupichler, Peter Sanders
Fast Many-to-Many Routing for Dynamic Taxi Sharing with Meeting Points. CoRR (2023)
Hans-Peter Lehmann, Peter Sanders, Stefan Walzer
ShockHash: Towards Optimal-Space Minimal Perfect Hashing Beyond Brute-Force. CoRR (2023)
Daniel Funke, Nicolai Hüning, Peter Sanders
A Sweep-Plane Algorithm for Calculating the Isolation of Mountains. ESA (2023)
Ü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) (2023)
Demian Hespe, Peter Sanders, Sabine Storandt, Carina Truschel
Pareto Sums of Pareto Sets. ESA (2023)
Peter Sanders, Tim Niklas Uhl
Engineering a Distributed-Memory Triangle Counting Algorithm. CoRR (2023)
Peter Sanders, Matthias Schimek
Engineering Massively Parallel MST Algorithms. IPDPS (2023)
Hans-Peter Lehmann, Peter Sanders, Stefan Walzer
Bipartite ShockHash: Pruning ShockHash Search for Efficient Perfect Hashing. CoRR (2023)
Hans-Peter Lehmann, Peter Sanders, Stefan Walzer
Sliding Block Hashing (Slick) - Basic Algorithmic Ideas. CoRR (2023)
Dominik Bez, Florian Kurpicz, Hans-Peter Lehmann, Peter Sanders
High Performance Construction of RecSplit Based Minimal Perfect Hash Functions. ESA (2023)
Daniel Funke, Peter Sanders
Efficient Yao Graph Construction. CoRR (2023)
Lars Gottesbüren, Tobias Heuer, Nikolai Maas, Peter Sanders, Sebastian Schlag
Scalable High-Quality Hypergraph Partitioning. CoRR (2023)
Hans-Peter Lehmann, Peter Sanders, Stefan Walzer
SicHash - Small Irregular Cuckoo Tables for Perfect Hashing. ALENEX (2023)
Peter Sanders, Tim Niklas Uhl
Engineering a Distributed-Memory Triangle Counting Algorithm. IPDPS (2023)
Peter Sanders, Daniel Seemaier
Distributed Deep Multilevel Graph Partitioning. Euro-Par (2023)
Jan Wassenberg, Mark Blacher, Joachim Giesen, Peter Sanders
Vectorized and performance-portable quicksort. Softw. Pract. Exp. 52 (12) (2022)
Sebastian Lamm, Peter Sanders
Communication-efficient Massively Distributed Connected Components. IPDPS (2022)
Lars Gottesbüren, Tobias Heuer, Peter Sanders
Parallel Flow-Based Hypergraph Partitioning. CoRR (2022)
Florian Kurpicz, Hans-Peter Lehmann, Peter Sanders
PaCHash: Packed and Compressed Hash Tables. CoRR (2022)
Peter Sanders, Dominik Schreiber
Mallob: Scalable SAT Solving On Demand With Decentralized Job Scheduling. J. Open Source Softw. 7 (77) (2022)
Lukas Hübner, Demian Hespe, Peter Sanders, Alexandros Stamatakis
ReStore: In-Memory REplicated STORagE for Rapid Recovery in Fault-Tolerant Algorithms. FTXS@SC (2022)
Ü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 (2022)
Hans-Peter Lehmann, Peter Sanders, Stefan Walzer
SicHash - Small Irregular Cuckoo Tables for Perfect Hashing. CoRR (2022)
Lars Gottesbüren, Tobias Heuer, Peter Sanders
Parallel Flow-Based Hypergraph Partitioning. SEA (2022)
Demian Hespe, Lukas Hübner, Peter Sanders, Alexandros Stamatakis
ReStore: In-Memory REplicated STORagE for Rapid Recovery in Fault-Tolerant Algorithms. CoRR (2022)
Michael Axtmann, Sascha Witt, Daniel Ferizovic, Peter Sanders
Engineering In-place (Shared-memory) Sorting Algorithms. ACM Trans. Parallel Comput. 9 (1) (2022)
Peter Sanders, Dominik Schreiber
Decentralized Online Scheduling of Malleable NP-hard Jobs. Euro-Par (2022)
Dominik Schreiber, Peter Sanders
Scalable SAT Solving in the Cloud. CoRR (2022)
Mark Blacher, Joachim Giesen, Peter Sanders, Jan Wassenberg
Vectorized and performance-portable Quicksort. CoRR (2022)
Dominik Bez, Florian Kurpicz, Hans-Peter Lehmann, Peter Sanders
High Performance Construction of RecSplit Based Minimal Perfect Hash Functions. CoRR (2022)
Lars Gottesbüren, Tobias Heuer, Peter Sanders, Sebastian Schlag
Shared-Memory n-level Hypergraph Partitioning. ALENEX (2022)
Sebastian Schlag, Tobias Heuer, Lars Gottesbüren, Yaroslav Akhremtsev, Christian Schulz, Peter Sanders
High-Quality Hypergraph Partitioning. ACM J. Exp. Algorithmics 27 (2022)
Peter C. Dillinger, Lorenz Hübschle-Schneider, Peter Sanders, Stefan Walzer
Fast Succinct Retrieval and Approximate Membership Using Ribbon. SEA (2022)
Lorenz Hübschle-Schneider, Peter Sanders
Parallel Weighted Random Sampling. ACM Trans. Math. Softw. 48 (3) (2022)
Lars Gottesbüren, Tobias Heuer, Peter Sanders, Christian Schulz, Daniel Seemaier
Deep Multilevel Graph Partitioning. CoRR (2021)
Sebastian Schlag, Tobias Heuer, Lars Gottesbüren, Yaroslav Akhremtsev, Christian Schulz, Peter Sanders
High-Quality Hypergraph Partitioning. CoRR (2021)
Hans-Peter Lehmann, Lorenz Hübschle-Schneider, Peter Sanders
Weighted Random Sampling on GPUs. CoRR (2021)
Lars Gottesbüren, Tobias Heuer, Peter Sanders, Christian Schulz, Daniel Seemaier
Deep Multilevel Graph Partitioning. ESA (2021)
Marvin Williams, Peter Sanders, Roman Dementiev
Engineering MultiQueues: Fast Relaxed Concurrent Priority Queues. CoRR (2021)
Dominik Schreiber, Peter Sanders
Scalable SAT Solving in the Cloud. SAT (2021)
Timo Bingmann, Jasper Marianczuk, Peter Sanders
Engineering faster sorters for small sets of items. Softw. Pract. Exp. 51 (5) (2021)
Peter C. Dillinger, Lorenz Hübschle-Schneider, Peter Sanders, Stefan Walzer
Fast Succinct Retrieval and Approximate Membership using Ribbon. CoRR (2021)
Marvin Williams, Peter Sanders, Roman Dementiev
Engineering MultiQueues: Fast Relaxed Concurrent Priority Queues. ESA (2021)
Lars Gottesbüren, Tobias Heuer, Peter Sanders, Sebastian Schlag
Shared-Memory n-level Hypergraph Partitioning. CoRR (2021)
Valentin Buchhold, Peter Sanders, Dorothea Wagner
Fast, Exact and Scalable Dynamic Ridesharing. ALENEX (2021)
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) (2021)
Lars Gottesbüren, Tobias Heuer, Peter Sanders, Sebastian Schlag
Scalable Shared-Memory Hypergraph Partitioning. ALENEX (2021)
Yaroslav Akhremtsev, Peter Sanders, Christian Schulz
High-Quality Shared-Memory Graph Partitioning. IEEE Trans. Parallel Distributed Syst. 31 (11) (2020)
Lars Gottesbüren, Tobias Heuer, Peter Sanders, Sebastian Schlag
Scalable Shared-Memory Hypergraph Partitioning. CoRR (2020)
Michael Axtmann, Sascha Witt, Daniel Ferizovic, Peter Sanders
Engineering In-place (Shared-memory) Sorting Algorithms. CoRR (2020)
Tobias Maier, Peter Sanders, Robert Williger
Concurrent Expandable AMQs on the Basis of Quotient Filters. SEA (2020)
Lorenz Hübschle-Schneider, Peter Sanders
Communication-Efficient Weighted Reservoir Sampling from Fully Distributed Data Streams. SPAA (2020)
Peter Sanders
Connecting MapReduce Computations to Realistic Machine Models. CoRR (2020)
Timo Bingmann, Peter Sanders, Matthias Schimek
Communication-Efficient String Sorting. CoRR (2020)
Peter Sanders
Connecting MapReduce Computations to Realistic Machine Models. IEEE BigData (2020)
Timo Bingmann, Peter Sanders, Matthias Schimek
Communication-Efficient String Sorting. IPDPS (2020)
Lorenz Hübschle-Schneider, Peter Sanders
Linear work generation of R-MAT graphs. Netw. Sci. 8 (4) (2020)
Manuel Penschuck, Ulrik Brandes, Michael Hamann, Sebastian Lamm, Ulrich Meyer, Ilya Safro, Peter Sanders, Christian Schulz
Recent Advances in Scalable Network Generation. CoRR (2020)
Valentin Buchhold, Peter Sanders, Dorothea Wagner
Fast, Exact and Scalable Dynamic Ridesharing. CoRR (2020)
Timo Bingmann, Jasper Marianczuk, Peter Sanders
Engineering Faster Sorters for Small Sets of Items. CoRR (2020)
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) (2019)
Lorenz Hübschle-Schneider, Peter Sanders
Parallel Weighted Random Sampling. ESA (2019)
Tobias Maier, Peter Sanders, Stefan Walzer
Dynamic Space Efficient Hashing. Algorithmica 81 (8) (2019)
Lorenz Hübschle-Schneider, Peter Sanders
Linear Work Generation of R-MAT Graphs. CoRR (2019)
Demian Hespe, Peter Sanders
More Hierarchy in Route Planning Using Edge Hierarchies. CoRR (2019)
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 (2019)
Tobias Maier, Peter Sanders, Robert Williger
Concurrent Expandable AMQs on the Basis of Quotient Filters. CoRR (2019)
Valentin Buchhold, Peter Sanders, Dorothea Wagner
Real-time Traffic Assignment Using Engineered Customizable Contraction Hierarchies. ACM J. Exp. Algorithmics 24 (1) (2019)
Daniel Funke, Peter Sanders, Vincent Winkler
Load-Balancing for Parallel Delaunay Triangulations. CoRR (2019)
Daniel Funke, Peter Sanders, Vincent Winkler
Load-Balancing for Parallel Delaunay Triangulations. Euro-Par (2019)
Tobias Heuer, Peter Sanders, Sebastian Schlag
Network Flow-Based Refinement for Multilevel Hypergraph Partitioning. ACM J. Exp. Algorithmics 24 (1) (2019)
Lorenz Hübschle-Schneider, Peter Sanders
Parallel Weighted Random Sampling. CoRR (2019)
Tobias Maier, Peter Sanders, Roman Dementiev
Concurrent Hash Tables: Fast and General(?)! ACM Trans. Parallel Comput. 5 (4) (2019)
Valentin Buchhold, Peter Sanders, Dorothea Wagner
Efficient Calculation of Microscopic Travel Demand Data with Low Calibration Effort. SIGSPATIAL/GIS (2019)
Demian Hespe, Peter Sanders
More Hierarchy in Route Planning Using Edge Hierarchies. ATMOS (2019)
Lorenz Hübschle-Schneider, Peter Sanders
Communication-Efficient (Weighted) Reservoir Sampling. CoRR (2019)

Peter Sanders.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Peter Sanders