| 2026 | ALENEX | BlockFIFO & MultiFIFO: Scalable Relaxed Queues. | Stefan Koch, Peter Sanders, Marvin Williams |
| 2026 | ALENEX | PHast - Perfect Hashing made fast. | Piotr Beling, Peter Sanders |
| 2026 | CAV | Mallob: Scalable Automated Reasoning on Demand. | Dominik Schreiber, Niccol Rigi-Luperti, Peter Sanders |
| 2026 | ESA | Deconstructed "Learned" Indexes and Their Smoothed Analysis. | Stefan Hermann, Mattia Odorisio, Peter Sanders, Stefan Walzer |
| 2026 | ESA | Non-Minimal k-Perfect Hashing: Tight Lower Bounds and an Application to Fast Static Hash Tables. | Ragnar Groot Koerkamp, Stefan Hermann, Peter Sanders, Stefan Walzer |
| 2026 | ESA | Practical Bit Vectors Supporting Constant Time Rank and Select in Optimal Space. | Florian Kurpicz, Niccol Rigi-Luperti, Peter Sanders |
| 2026 | EuroPar | Engineering Scalable Distributed List Ranking. | Peter Sanders, Matthias Schimek, Tim Niklas Uhl, Thomas Weidmann |
| 2026 | PODC | Keynote Talk: Parallel Algorithm Engineering Reconsidered. | Peter Sanders |
| 2026 | SPAA | Keynote Talk: Parallel Algorithm Engineering Reconsidered. | Peter Sanders |
| 2025 | ALENEX | Engineering Optimal Parallel Task Scheduling. | Matthew Akram, Nikolai Maas, Peter Sanders, Dominik Schreiber |
| 2025 | ESA | Linear-Time Multilevel Graph Partitioning via Edge Sparsification. | Lars Gottesbren, Nikolai Maas, Dominik Rosch, Peter Sanders, Daniel Seemaier |
| 2025 | ESA | Fast and Lightweight Distributed Suffix Array Construction. | Manuel Haag, Florian Kurpicz, Peter Sanders, Matthias Schimek |
| 2025 | ESA | Engineering Minimal k-Perfect Hash Functions. | Stefan Hermann, Sebastian Kirmayer, Hans-Peter Lehmann, Peter Sanders, Stefan Walzer |
| 2025 | ESA | Combined Search and Encoding for Seeds, with an Application to Minimal Perfect Hashing. | Hans-Peter Lehmann, Peter Sanders, Stefan Walzer, Jonatan Ziegler |
| 2024 | ALENEX | Fast Many-to-Many Routing for Dynamic Taxi Sharing with Meeting Points. | Moritz Laupichler, Peter Sanders |
| 2024 | ALENEX | ShockHash: Towards Optimal-Space Minimal Perfect Hashing Beyond Brute-Force. | Hans-Peter Lehmann, Peter Sanders, Stefan Walzer |
| 2024 | ESA | PHOBIC: Perfect Hashing With Optimized Bucket Sizes and Interleaved Coding. | Stefan Hermann, Hans-Peter Lehmann, Giulio Ermanno Pibiri, Peter Sanders, Stefan Walzer |
| 2024 | ESA | Scalable Distributed String Sorting. | Florian Kurpicz, Pascal Mehnert, Peter Sanders, Matthias Schimek |
| 2024 | SC | KaMPIng: Flexible and (Near) Zero-Overhead C++ Bindings for MPI. | Tim Niklas Uhl, Matthias Schimek, Lukas Hbner, Demian Hespe, Florian Kurpicz, Daniel Seemaier, Christoph Stelz, Peter Sanders |
| 2024 | SPAA | Brief Announcement: Distributed Unconstrained Local Search for Multilevel Graph Partitioning. | Peter Sanders, Daniel Seemaier |
| 2024 | SPAA | Brief Announcement: (Near) Zero-Overhead C++ Bindings for MPI. | Demian Hespe, Lukas Hbner, Florian Kurpicz, Peter Sanders, Matthias Schimek, Daniel Seemaier, Tim Niklas Uhl |
| 2024 | SPAA | Brief Announcement: Scalable Distributed String Sorting. | Florian Kurpicz, Pascal Mehnert, Peter Sanders, Matthias Schimek |
| 2024 | TACAS | Formally Verifying an Efficient Sorter. | Bernhard Beckert, Peter Sanders, Mattias Ulbrich, Julian Wiesler, Sascha Witt |
| 2023 | ALENEX | PaCHash: Packed and Compressed Hash Tables. | Florian Kurpicz, Hans-Peter Lehmann, Peter Sanders |
| 2023 | ALENEX | SicHash - Small Irregular Cuckoo Tables for Perfect Hashing. | Hans-Peter Lehmann, Peter Sanders, Stefan Walzer |
| 2023 | ESA | High Performance Construction of RecSplit Based Minimal Perfect Hash Functions. | Dominik Bez, Florian Kurpicz, Hans-Peter Lehmann, Peter Sanders |
| 2023 | ESA | Learned Monotone Minimal Perfect Hashing. | Paolo Ferragina, Hans-Peter Lehmann, Peter Sanders, Giorgio Vinciguerra |
| 2023 | ESA | A Sweep-Plane Algorithm for Calculating the Isolation of Mountains. | Daniel Funke, Nicolai Hning, Peter Sanders |
| 2023 | ESA | Pareto Sums of Pareto Sets. | Demian Hespe, Peter Sanders, Sabine Storandt, Carina Truschel |
| 2023 | EuroPar | Distributed Deep Multilevel Graph Partitioning. | Peter Sanders, Daniel Seemaier |
| 2022 | ALENEX | Shared-Memory n-level Hypergraph Partitioning. | Lars Gottesbren, Tobias Heuer, Peter Sanders, Sebastian Schlag |
| 2022 | EuroPar | Decentralized Online Scheduling of Malleable NP-hard Jobs. | Peter Sanders, Dominik Schreiber |
| 2021 | ALENEX | Fast, Exact and Scalable Dynamic Ridesharing. | Valentin Buchhold, Peter Sanders, Dorothea Wagner |
| 2021 | ALENEX | Scalable Shared-Memory Hypergraph Partitioning. | Lars Gottesbren, Tobias Heuer, Peter Sanders, Sebastian Schlag |
| 2021 | ESA | Deep Multilevel Graph Partitioning. | Lars Gottesbren, Tobias Heuer, Peter Sanders, Christian Schulz, Daniel Seemaier |
| 2021 | ESA | Engineering MultiQueues: Fast Relaxed Concurrent Priority Queues. | Marvin Williams, Peter Sanders, Roman Dementiev |
| 2021 | SAT | Scalable SAT Solving in the Cloud. | Dominik Schreiber, Peter Sanders |
| 2020 | SPAA | Communication-Efficient Weighted Reservoir Sampling from Fully Distributed Data Streams. | Lorenz Hbschle-Schneider, Peter Sanders |
| 2019 | ATMOS | More Hierarchy in Route Planning Using Edge Hierarchies. | Demian Hespe, Peter Sanders |
| 2019 | ESA | Parallel Weighted Random Sampling. | Lorenz Hbschle-Schneider, Peter Sanders |
| 2019 | EuroPar | Load-Balancing for Parallel Delaunay Triangulations. | Daniel Funke, Peter Sanders, Vincent Winkler |
| 2018 | ECSA | An equal opportunity concept for the coordinated research effort AESC. | Anne Koziolek, Peter Sanders, Dorothea Wagner |
| 2018 | EuroPar | High-Quality Shared-Memory Graph Partitioning. | Yaroslav Akhremtsev, Peter Sanders, Christian Schulz |
| 2017 | ALENEX | Engineering a Distributed Full-Text Index. | Johannes Fischer, Florian Kurpicz, Peter Sanders |
| 2017 | ALENEX | Engineering a direct | Yaroslav Akhremtsev, Tobias Heuer, Peter Sanders, Sebastian Schlag |
| 2017 | ALENEX | Robust Massively Parallel Sorting. | Michael Axtmann, Peter Sanders |
| 2017 | ALENEX | Parallel | Daniel Funke, Peter Sanders |
| 2017 | ESA | In-Place Parallel Super Scalar Samplesort (IPSSSSo). | Michael Axtmann, Sascha Witt, Daniel Ferizovic, Peter Sanders |
| 2017 | ESA | Dynamic Space Efficient Hashing. | Tobias Maier, Peter Sanders |
| 2017 | GECCO | Distributed evolutionary | Peter Sanders, Christian Schulz, Darren Strash, Robert Williger |
| 2016 | ALENEX | Finding Near-Optimal Independent Sets at Scale. | Sebastian Lamm, Peter Sanders, Christian Schulz, Darren Strash, Renato F. Werneck |
| 2016 | ALENEX | Untitled record | Sebastian Schlag, Vitali Henne, Tobias Heuer, Henning Meyerhenke, Peter Sanders, Christian Schulz |
| 2016 | HiPC | Fast Parallel Operations on Search Trees. | Yaroslav Akhremtsev, Peter Sanders |
| 2016 | PPoPP | Concurrent hash tables: fast | Tobias Maier, Peter Sanders, Roman Dementiev |
| 2016 | UCC | High performance in the cloud with FPGA groups. | Anca Iordache, Guillaume Pierre, Peter Sanders, Jos Gabriel F. Coutinho, Mark Stillwell |
| 2015 | ALENEX | (Semi-)External Algorithms for Graph Partitioning and Clustering. | Yaroslav Akhremtsev, Peter Sanders, Christian Schulz |
| 2015 | ICML | Report from Dagstuhl: SocioPaths - Multimodal Door-to-Door Route Planning via Social Paths. | Thomas Liebig, Sabine Storandt, Peter Sanders, Walied Othman, Stefan Funke |
| 2015 | SIGMOD | Cache-Efficient Aggregation: Hashing Is Sorting. | Ingo Mller, Peter Sanders, Arnaud Lacurie, Wolfgang Lehner, Franz Frber |
| 2015 | STACS | Parallel Algorithms Reconsidered (Invited Talk). | Peter Sanders |
| 2015 | SPAA | Practical Massively Parallel Sorting. | Michael Axtmann, Timo Bingmann, Peter Sanders, Christian Schulz |
| 2015 | SPAA | Brief Announcement: MultiQueues: Simple Relaxed Concurrent Priority Queues. | Hamza Rihani, Peter Sanders, Roman Dementiev |
| 2015 | SAT | HordeSat: A Massively Parallel Portfolio SAT Solver. | Toms Balyo, Peter Sanders, Carsten Sinz |
| 2015 | SPIRE | Faster Exact Search Using Document Clustering. | Jonathan Dimond, Peter Sanders |
| 2014 | ESA | PReaCH: A Fast Lightweight Reachability Index Using Pruning and Contraction Hierarchies. | Florian Merz, Peter Sanders |
| 2014 | GI | Algorithm Engineering for Big Data. | Peter Sanders |
| 2014 | ISPA | Cross Resource Optimisation of Database Functionality across Heterogeneous Processors. | Eoghan O'Neill, John McGlone, Jos Gabriel F. Coutinho, Andrew Doole, Carmelo Ragusa, Oliver Pell, Peter Sanders |
| 2013 | ESA | Parallel String Sample Sort. | Timo Bingmann, Peter Sanders |
| 2013 | EuroPar | Efficient Parallel and External Matching. | Marcel Birn, Vitaly Osipov, Peter Sanders, Christian Schulz, Nodari Sitchinava |
| 2013 | ICDE | Efficient many-core query execution in main memory column-stores. | Jonathan Dees, Peter Sanders |
| 2013 | SPAA | Work-efficient matrix inversion in polylogarithmic time. | Peter Sanders, Jochen Speck, Raoul Steffen |
| 2013 | SOFSEM | Engineering Algorithms for Large Data Sets. | Peter Sanders |
| 2013 | WADS | On (Dynamic) Range Minimum Queries in External Memory. | Lars Arge, Johannes Fischer, Peter Sanders, Nodari Sitchinava |
| 2012 | ALENEX | Distributed Evolutionary Graph Partitioning. | Peter Sanders, Christian Schulz |
| 2012 | ESA | Time-Dependent Route Planning with Generalized Objective Functions. | Gernot Veit Batz, Peter Sanders |
| 2012 | EuroPar | Optimized Hybrid Parallel Lattice Boltzmann Fluid Flow Simulations on Complex Geometries. | Jonas Fietz, Mathias J. Krause, Christian Schulz, Peter Sanders, Vincent Heuveline |
| 2012 | EuroPar | Energy Efficient Frequency Scaling and Scheduling for Malleable Tasks. | Peter Sanders, Jochen Speck |
| 2011 | ESA | Engineering Multilevel Graph Partitioning Algorithms. | Peter Sanders, Christian Schulz |
| 2011 | EuroPar | Engineering a Multi-core Radix Sort. | Jan Wassenberg, Peter Sanders |
| 2010 | ALENEX | Simple and Fast Nearest Neighbor Search. | Marcel Birn, Manuel Holtgrewe, Peter Sanders, Johannes Singler |
| 2010 | ALENEX | Route Planning with Flexible Objective Functions. | Robert Geisberger, Moritz Kobitzsch, Peter Sanders |
| 2010 | ALENEX | Algorithm Engineering - An Attempt at a Definition Using Sorting as an Example. | Peter Sanders |
| 2010 | Algosensors | Lifetime Maximization of Monitoring Sensor Networks. | Peter Sanders, Dennis Schieferdecker |
| 2010 | ATMOS | Fast Detour Computation for Ride Sharing. | Robert Geisberger, Dennis Luxen, Sabine Neubauer, Peter Sanders, Lars Vlker |
| 2010 | ATMOS | Engineering Time-Dependent Many-to-Many Shortest Paths Computation. | Robert Geisberger, Peter Sanders |
| 2010 | ESA | Untitled record | Vitaly Osipov, Peter Sanders |
| 2010 | ICDE | Scalable distributed-memory external sorting. | Mirko Rahn, Peter Sanders, Johannes Singler |
| 2010 | SPIRE | Improved Fast Similarity Search in Dictionaries. | Daniel Karch, Dennis Luxen, Peter Sanders |
| 2009 | ALENEX | Time-Dependent Contraction Hierarchies. | Gernot Veit Batz, Daniel Delling, Peter Sanders, Christian Vetter |
| 2009 | ALENEX | The Filter-Kruskal Minimum Spanning Tree Algorithm. | Vitaly Osipov, Peter Sanders, Johannes Singler |
| 2009 | CAIP | An Efficient Parallel Algorithm for Graph-Based Image Segmentation. | Jan Wassenberg, Wolfgang Middelmann, Peter Sanders |
| 2009 | ICALP | Towards Optimal Range Medians. | Beat Gfeller, Peter Sanders |
| 2008 | ALENEX | Better Approximation of Betweenness Centrality. | Robert Geisberger, Peter Sanders, Dominik Schultes |
| 2008 | ALENEX | Compressed Inverted Indexes for In-Memory Search Engines. | Frederik Transier, Peter Sanders |
| 2008 | CAV | Semi-external LTL Model Checking. | Stefan Edelkamp, Peter Sanders, Pavel Simecek |
| 2008 | CISIS | Single-Pass List Partitioning. | Leonor Frias, Johannes Singler, Peter Sanders |
| 2008 | ESA | Mobile Route Planning. | Peter Sanders, Dominik Schultes, Christian Vetter |
| 2008 | SPIRE | Out of the Box Phrase Indexing. | Frederik Transier, Peter Sanders |
| 2007 | ALENEX | In Transit to Constant Time Shortest-Path Queries in Road Networks. | Hannah Bast, Stefan Funke, Domagoj Matijevic, Peter Sanders, Dominik Schultes |
| 2007 | ALENEX | Computing Many-to-Many Shortest Paths Using Highway Hierarchies. | Sebastian Knopp, Peter Sanders, Dominik Schultes, Frank Schulz, Dorothea Wagner |
| 2007 | ALENEX | Intersection in Integer Inverted Indices. | Peter Sanders, Frederik Transier |
| 2007 | EuroPar | MCSTL: The Multi-core Standard Template Library. | Johannes Singler, Peter Sanders, Felix Putze |
| 2007 | PPoPP | MCSTL: the multi-core standard template library. | Felix Putze, Peter Sanders, Johannes Singler |
| 2007 | SODA | The random graph threshold for | Julie Anne Cain, Peter Sanders, Nicholas C. Wormald |
| 2006 | ESA | How Branch Mispredictions Affect Quicksort. | Kanela Kaligosi, Peter Sanders |
| 2006 | ESA | Engineering Highway Hierarchies. | Peter Sanders, Dominik Schultes |
| 2005 | ALENEX | Better External Memory Suffix Array Construction. | Roman Dementiev, Juha Krkkinen, Jens Mehnert, Peter Sanders |
| 2005 | ESA | : Standard Template Library for XXL Data Sets. | Roman Dementiev, Lutz Kettner, Peter Sanders |
| 2005 | ESA | Highway Hierarchies Hasten Exact Shortest Path Queries. | Peter Sanders, Dominik Schultes |
| 2005 | ICALP | Towards Optimal Multiple Selection. | Kanela Kaligosi, Kurt Mehlhorn, J. Ian Munro, Peter Sanders |
| 2005 | SODA | An asymptotic approximation scheme for multigraph edge coloring. | Peter Sanders, David Steurer |
| 2004 | ALENEX | Engineering a Sorted List Data Structure for 32 Bit Key. | Roman Dementiev, Lutz Kettner, Jens Mehnert, Peter Sanders |
| 2004 | ESA | Super Scalar Sample Sort. | Peter Sanders, Sebastian Winkel |
| 2004 | ICALP | Online Scheduling with Bounded Migration. | Peter Sanders, Naveen Sivadasan, Martin Skutella |
| 2004 | SOFSEM | Algorithms for Scalable Storage Servers. | Peter Sanders |
| 2003 | ESA | Approximating Energy Efficient Paths in Wireless Multi-hop Networks. | Stefan Funke, Domagoj Matijevic, Peter Sanders |
| 2003 | ESA | A Practical Minimum Spanning Tree Algorithm Using the Cycle Property. | Irit Katriel, Peter Sanders, Jesper Larsson Trff |
| 2003 | ICALP | Simple Linear Work Suffix Array Construction. | Juha Krkkinen, Peter Sanders |
| 2003 | MFCS | Scheduling and Traffic Allocation for Tasks with Bounded Splittability. | Piotr Krysta, Peter Sanders, Berthold Vcking |
| 2003 | STACS | Space Efficient Hash Tables with Worst Case Constant Access Time. | Dimitris Fotakis, Rasmus Pagh, Peter Sanders, Paul G. Spirakis |
| 2003 | SPAA | Asynchronous parallel disk sorting. | Roman Dementiev, Peter Sanders |
| 2003 | SPAA | Polynomial time algorithms for network information flow. | Peter Sanders, Sebastian Egner, Ludo M. G. M. Tolhuizen |
| 2002 | EuroPar | The Hierarchical Factor Algorithm for All-to-All Communication (Research Note). | Peter Sanders, Jesper Larsson Trff |
| 2002 | ICALP | Energy Optimal Routing in Radio Networks Using Geometric Data Structures. | Ren Beier, Peter Sanders, Naveen Sivadasan |
| 2001 | ESA | Duality between Prefetching and Queued Writing with Parallel Disks. | David A. Hutchinson, Peter Sanders, Jeffrey Scott Vitter |
| 2001 | SODA | Reconciling simplicity and realism in parallel disk models. | Peter Sanders |
| 2001 | SPAA | The power of duality for prefetching and sorting with parallel disks. | David A. Hutchinson, Peter Sanders, Jeffrey Scott Vitter |
| 2000 | ESA | How Helpers Hasten | Peter Sanders, Roberto Solis-Oba |
| 2000 | EuroPar | Parallel Shortest Path for Arbitrary Graphs. | Ulrich Meyer, Peter Sanders |
| 2000 | EuroPar | A Bandwidth Latency Tradeoff for Broadcast and Reduction. | Peter Sanders, Jop F. Sibeyn |
| 2000 | SODA | Fast concurrent access to parallel disks. | Peter Sanders, Sebastian Egner, Jan H. M. Korst |
| 2000 | SPAA | Asynchronous scheduling of redundant disk arrays. | Peter Sanders |
| 1999 | ALENEX | Fast Priority Queues for Cached Memory. | Peter Sanders |
| 1999 | ICALP | Accessing Multiple Sequences Through Set Associative Caches. | Peter Sanders |
| 1999 | ISAAC | Asynchronous Random Polling Dynamic Load Balancing. | Peter Sanders |
| 1998 | ESA | Delta-Stepping: A Parallel Single Source Shortest Path Algorithm. | Ulrich Meyer, Peter Sanders |
| 1998 | EuroPar | Parallel Crew Scheduling in PAROS. | Panayiotis Alefragis, Christos Goumopoulos, Efthymios Housos, Peter Sanders, Tuomo Takkula, Dag Wedelin |
| 1998 | MFCS | A Parallelization of Dijkstra's Shortest Path Algorithm. | Andreas Crauser, Kurt Mehlhorn, Ulrich Meyer, Peter Sanders |
| 1997 | EuroPar | Feasible Models of Computation: Three-Dimensionality and Energy Consumption. | Peter Sanders, Roland Vollmar, Thomas Worsch |
| 1997 | FCT | Towards Optimal Locality in Mesh-Indexings. | Rolf Niedermeier, Klaus Reinhardt, Peter Sanders |