A Case Study in Object Oriented Programming: Algebraic Structures in Eiffel. - Peter Sanders 001 (TOOLS (11), 1993)

Emulating MIMD Behaviour on SIMD-Machines. - Peter Sanders 001 (EUROSIM, 1994)

A detailed analysis of random polling dynamic load balancing. - Peter Sanders 001 (ISPAN, 1994)

Massively Parallel Search for Transition-Tables of Polyautomata. - Peter Sanders 001 (Parcella, 1994)

Parallel Game Tree Search on SIMD Machines. - Holger Hopp; Peter Sanders 001 (IRREGULAR, 1995)

Better Algorithms for Parallel Backtracking. - Peter Sanders 001 (IRREGULAR, 1995)

Fast Priority Queues for Parallel Branch-and-Bound. - Peter Sanders 001 (IRREGULAR, 1995)

On the Efficiency of Nearest Neighbor Load Balancing for Random Loads. - Peter Sanders 001 (Parcella, 1996)

Optimizing the Emulation of MIMD Behavior on SIMD Machines. - Peter Sanders 001 (Parcella, 1996)

Parallele Programmierung mit MPI - ein Praktikum, Programmtexte im Internet. - Peter Sanders 001; Thomas Worsch (Logos Verlag, 1997)

Feasible Models of Computation: Three-Dimensionality and Energy Consumption. - Peter Sanders 001; Roland Vollmar; Thomas Worsch (Euro-Par, 1997)

Efficient Massively Parallel Quicksort. - Peter Sanders 001; Thomas Hansch (IRREGULAR, 1997)

Lastverteilungsalgorithmen für parallele Tiefensuche. - Peter Sanders 001 (VDI-Verlag, 1997)

Delta-Stepping: A Parallel Single Source Shortest Path Algorithm. - Ulrich Meyer 001; Peter Sanders 001 (ESA, 1998)

Parallel Crew Scheduling in PAROS. - Panayiotis Alefragis; Christos Goumopoulos; Efthymios Housos; Peter Sanders 001; Tuomo Takkula; Dag Wedelin (Euro-Par, 1998)

A Parallelization of Dijkstra's Shortest Path Algorithm. - Andreas Crauser; Kurt Mehlhorn; Ulrich Meyer 001; Peter Sanders 001 (MFCS, 1998)

SKaMPI: A Detailed, Accurate MPI Benchmark. - Ralf H. Reussner; Peter Sanders 001; Lutz Prechelt; Matthias Müller (PVM/MPI, 1998)

An Implementation of the Binary Blocking Flow Algorithm. - Torben Hagerup; Peter Sanders 001; Jesper Larsson Träff (WAE, 1998)

Random Permutations on Distributed, External and Hierarchical Memory. - Peter Sanders 001 (Inf. Process. Lett., 1998)

Randomized Priority Queues for Fast Parallel Access. - Peter Sanders 001 (J. Parallel Distributed Comput., 1998)

High Performance Integer Optimization for Crew Scheduling. - Peter Sanders 001; Tuomo Takkula; Dag Wedelin (HPCN Europe, 1999)

Accessing Multiple Sequences Through Set Associative Caches. - Peter Sanders 001 (ICALP, 1999)

Asynchronous Random Polling Dynamic Load Balancing. - Peter Sanders 001 (ISAAC, 1999)

A case study in scalability: An ADI method for the two-dimensional time-dependent Dirac equation. - U. W. Rathe; Peter Sanders 001; P. L. Knight (Parallel Comput., 1999)

Analysis of nearest neighbor load balancing algorithms for random loads. - Peter Sanders 001 (Parallel Comput., 1999)

Algorithm Engineering for Parallel Computation. - David A. Bader; Bernard M. E. Moret; Peter Sanders 001 (Experimental Algorithmics, 2000)

Using Finite Experiments to Study Asymptotic Performance. - Catherine C. McGeoch; Peter Sanders 001; Rudolf Fleischer; Paul R. Cohen; Doina Precup (Experimental Algorithmics, 2000)

Presenting Data from Experiments in Algorithmics. - Peter Sanders 001 (Experimental Algorithmics, 2000)

How Helpers Hasten h-Relations. - Peter Sanders 001; Roberto Solis-Oba (ESA, 2000)

Parallel Shortest Path for Arbitrary Graphs. - Ulrich Meyer 001; Peter Sanders 001 (Euro-Par, 2000)

Asymptotic Complexity from Experiments? A Case Study for Randomized Algorithms. - Peter Sanders 001; Rudolf Fleischer (WAE, 2000)

Parallel Integer Optimization for Crew Scheduling. - Panayiotis Alefragis; Peter Sanders 001; Tuomo Takkula; Dag Wedelin (Ann. Oper. Res., 2000)

Fast Priority Queues for Cached Memory. - Peter Sanders 001 (ACM J. Exp. Algorithmics, 2000)

The power of duality for prefetching and sorting with parallel disks. - David A. Hutchinson; Peter Sanders 001; Jeffrey Scott Vitter (SPAA, 2001)

How Helpers Hasten h-Relations. - Peter Sanders 001; Roberto Solis-Oba (J. Algorithms, 2001)

Memory Hierarchies - Models and Lower Bounds. - Peter Sanders 001 (Algorithms for Memory Hierarchies, 2002)

The Hierarchical Factor Algorithm for All-to-All Communication (Research Note). - Peter Sanders 001; Jesper Larsson Träff (Euro-Par, 2002)

Energy Optimal Routing in Radio Networks Using Geometric Data Structures. - René Beier; Peter Sanders 001; Naveen Sivadasan (ICALP, 2002)

Random Arc Allocation and Applications. - Peter Sanders 001; Berthold Vöcking (SWAT, 2002)

Randomized Receiver Initiated Load-balancing Algorithms for Tree-shaped Computations. - Peter Sanders 001 (Comput. J., 2002)

Towards optimal locality in mesh-indexings. - Rolf Niedermeier; Klaus Reinhardt; Peter Sanders 001 (Discret. Appl. Math., 2002)

Cellular Automata: Energy Consumption and Physical Feasibility. - Peter Sanders 001; Roland Vollmar; Thomas Worsch (Fundam. Informaticae, 2002)

Reconciling simplicity and realism in parallel disk models. - Peter Sanders 001 (Parallel Comput., 2002)

SKaMPI: a comprehensive benchmark for public benchmarking of MPI. - Ralf H. Reussner; Peter Sanders 001; Jesper Larsson Träff (Sci. Program., 2002)

Approximating Energy Efficient Paths in Wireless Multi-hop Networks. - Stefan Funke; Domagoj Matijevic; Peter Sanders 001 (ESA, 2003)

A Practical Minimum Spanning Tree Algorithm Using the Cycle Property. - Irit Katriel; Peter Sanders 001; Jesper Larsson Träff (ESA, 2003)

Simple Linear Work Suffix Array Construction. - Juha Kärkkäinen; Peter Sanders 001 (ICALP, 2003)

Scheduling and Traffic Allocation for Tasks with Bounded Splittability. - Piotr Krysta; Peter Sanders 001; Berthold Vöcking (MFCS, 2003)

Asynchronous parallel disk sorting. - Roman Dementiev; Peter Sanders 001 (SPAA, 2003)

Polynomial time algorithms for network information flow. - Peter Sanders 001; Sebastian Egner; Ludo M. G. M. Tolhuizen (SPAA, 2003)

Scanning Multiple Sequences Via Cache Memory. - Kurt Mehlhorn; Peter Sanders 001 (Algorithmica, 2003)

Fast Concurrent Access to Parallel Disks. - Peter Sanders 001; Sebastian Egner; Jan H. M. Korst (Algorithmica, 2003)

Tail Bounds And Expectations For Random Arc Allocation And Applications. - Peter Sanders 001; Berthold Vöcking (Comb. Probab. Comput., 2003)

A bandwidth latency tradeoff for broadcast and reduction. - Peter Sanders 001; Jop F. Sibeyn (Inf. Process. Lett., 2003)

[Delta]-stepping: a parallelizable shortest path algorithm. - Ulrich Meyer 001; Peter Sanders 001 (J. Algorithms, 2003)

Asynchronous Scheduling of Redundant Disk Arrays. - Peter Sanders 001 (IEEE Trans. Computers, 2003)

Engineering a Sorted List Data Structure for 32 Bit Key. - Roman Dementiev; Lutz Kettner; Jens Mehnert; Peter Sanders 001 (ALENEX/ANALC, 2004)

Super Scalar Sample Sort. - Peter Sanders 001; Sebastian Winkel (ESA, 2004)

Engineering an External Memory Minimum Spanning Tree Algorithm. - Roman Dementiev; Peter Sanders 001; Dominik Schultes; Jop F. Sibeyn (IFIP TCS, 2004)

Algorithms for Scalable Storage Servers. - Peter Sanders 001 (SOFSEM, 2004)

Algorithms for Memory Hierarchies (Column: Algorithmics). - Peter Sanders 001 (Bull. EATCS, 2004)

A simpler linear time 2/3-epsilon approximation for maximum weight matching. - Seth Pettie; Peter Sanders 001 (Inf. Process. Lett., 2004)

: Standard Template Library for XXL Data Sets. - Roman Dementiev; Lutz Kettner; Peter Sanders 001 (ESA, 2005)

Highway Hierarchies Hasten Exact Shortest Path Queries. - Peter Sanders 001; Dominik Schultes (ESA, 2005)

Towards Optimal Multiple Selection. - Kanela Kaligosi; Kurt Mehlhorn; J. Ian Munro; Peter Sanders 001 (ICALP, 2005)

Space Efficient Hash Tables with Worst Case Constant Access Time. - Dimitris Fotakis 001; Rasmus Pagh; Peter Sanders 001; Paul G. Spirakis (Theory Comput. Syst., 2005)

Duality Between Prefetching and Queued Writing with Parallel Disks. - David A. Hutchinson; Peter Sanders 001; Jeffrey Scott Vitter (SIAM J. Comput., 2005)

Polynomial time algorithms for multicast network code construction. - Sidharth Jaggi; Peter Sanders 001; Philip A. Chou; Michelle Effros; Sebastian Egner; Kamal Jain; Ludo M. G. M. Tolhuizen (IEEE Trans. Inf. Theory, 2005)

Highway Hierarchies Star. - Daniel Delling; Peter Sanders 001; Dominik Schultes; Dorothea Wagner (The Shortest Path Problem, 2006)

Robust, Almost Constant Time Shortest-Path Queries in Road Networks. - Peter Sanders 001; Dominik Schultes (The Shortest Path Problem, 2006)

How Branch Mispredictions Affect Quicksort. - Kanela Kaligosi; Peter Sanders 001 (ESA, 2006)

Parallel Prefix (Scan) Algorithms for MPI. - Peter Sanders 001; Jesper Larsson Träff (PVM/MPI, 2006)

Linear work suffix array construction. - Juha Kärkkäinen; Peter Sanders 001; Stefan Burkhardt (J. ACM, 2006)

Foreword. - Peter Sanders 001; Aravind Srinivasan; Berthold Vöcking (Theory Comput. Syst., 2006)

In Transit to Constant Time Shortest-Path Queries in Road Networks. - Hannah Bast; Stefan Funke; Domagoj Matijevic; Peter Sanders 001; Dominik Schultes (ALENEX, 2007)

Computing Many-to-Many Shortest Paths Using Highway Hierarchies. - Sebastian Knopp; Peter Sanders 001; Dominik Schultes; Frank Schulz 001; Dorothea Wagner (ALENEX, 2007)

Intersection in Integer Inverted Indices. - Peter Sanders 001; Frederik Transier (ALENEX, 2007)

MCSTL: The Multi-core Standard Template Library. - Johannes Singler; Peter Sanders 001; Felix Putze (Euro-Par, 2007)

Full Bandwidth Broadcast, Reduction and Scan with Only Two Trees. - Peter Sanders 001; Jochen Speck; Jesper Larsson Träff (PVM/MPI, 2007)

The random graph threshold for k-orientiability and a fast algorithm for optimal multiple-choice allocation. - Julie Anne Cain; Peter Sanders 001; Nicholas C. Wormald (SODA, 2007)

Engineering Algorithms for Approximate Weighted Matching. - Jens Maue; Peter Sanders 001 (WEA, 2007)

Engineering Fast Route Planning Algorithms. - Peter Sanders 001; Dominik Schultes (WEA, 2007)

Dynamic Highway-Node Routing. - Dominik Schultes; Peter Sanders 001 (WEA, 2007)

Scalable parallel suffix array construction. - Fabian Kulla; Peter Sanders 001 (Parallel Comput., 2007)

Algorithms and Data Structures: The Basic Toolbox. - Kurt Mehlhorn; Peter Sanders 001 (Springer, 2008)

Better Approximation of Betweenness Centrality. - Robert Geisberger; Peter Sanders 001; Dominik Schultes (ALENEX, 2008)

Compressed Inverted Indexes for In-Memory Search Engines. - Frederik Transier; Peter Sanders 001 (ALENEX, 2008)

Semi-external LTL Model Checking. - Stefan Edelkamp; Peter Sanders 001; Pavel Simecek (CAV, 2008)

Mobile Route Planning. - Peter Sanders 001; Dominik Schultes; Christian Vetter (ESA, 2008)

Out of the Box Phrase Indexing. - Frederik Transier; Peter Sanders 001 (SPIRE, 2008)

Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks. - Robert Geisberger; Peter Sanders 001; Dominik Schultes; Daniel Delling (WEA, 2008)

Constant Time Queries for Energy Efficient Paths in Multi-hop Wireless Networks. - Stefan Funke; Domagoj Matijevic; Peter Sanders 001 (J. Comput. Inf. Technol., 2008)

Time Dependent Contraction Hierarchies – Basic Algorithmic Ideas - Peter Sanders 001 (CoRR, 2008)

Better external memory suffix array construction. - Roman Dementiev; Juha Kärkkäinen; Jens Mehnert; Peter Sanders 001 (ACM J. Exp. Algorithmics, 2008)

Single-Pass List Partitioning. - Leonor Frias; Johannes Singler; Peter Sanders 001 (Scalable Comput. Pract. Exp., 2008)

STXXL: standard template library for XXL data sets. - Roman Dementiev; Lutz Kettner; Peter Sanders 001 (Softw. Pract. Exp., 2008)

An asymptotic approximation scheme for multigraph edge coloring. - Peter Sanders 001; David Steurer (ACM Trans. Algorithms, 2008)

Kürzeste Wege. - Peter Sanders 001; Johannes Singler (Taschenbuch der Algorithmen, 2008)

Time-Dependent Contraction Hierarchies. - Gernot Veit Batz; Daniel Delling; Peter Sanders 001; Christian Vetter (ALENEX, 2009)

The Filter-Kruskal Minimum Spanning Tree Algorithm. - Vitaly Osipov; Peter Sanders 001; Johannes Singler (ALENEX, 2009)

Algorithm Engineering - An Attempt at a Definition. - Peter Sanders 001 (Efficient Algorithms, 2009)

An Efficient Parallel Algorithm for Graph-Based Image Segmentation. - Jan Wassenberg; Wolfgang Middelmann; Peter Sanders 001 (CAIP, 2009)

09491 Abstracts Collection - Graph Search Engineering. - Lubos Brim; Stefan Edelkamp; Eric A. Hansen; Peter Sanders 001 (Graph Search Engineering, 2009)

Engineering Route Planning Algorithms. - Daniel Delling; Peter Sanders 001; Dominik Schultes; Dorothea Wagner (Algorithmics of Large and Complex Networks, 2009)

Towards Optimal Range Medians. - Beat Gfeller; Peter Sanders 001 (ICALP (1), 2009)

Goal-directed shortest-path queries using precomputed cluster distances. - Jens Maue; Peter Sanders 001; Domagoj Matijevic (ACM J. Exp. Algorithmics, 2009)

Cache-, hash-, and space-efficient bloom filters. - Felix Putze; Peter Sanders 001; Johannes Singler (ACM J. Exp. Algorithmics, 2009)

Online Scheduling with Bounded Migration. - Peter Sanders 001; Naveen Sivadasan; Martin Skutella (Math. Oper. Res., 2009)

Two-tree algorithms for full bandwidth broadcast, reduction and scan. - Peter Sanders 001; Jochen Speck; Jesper Larsson Träff (Parallel Comput., 2009)

Simple and Fast Nearest Neighbor Search. - Marcel Birn; Manuel Holtgrewe; Peter Sanders 001; Johannes Singler (ALENEX, 2010)

Route Planning with Flexible Objective Functions. - Robert Geisberger; Moritz Kobitzsch; Peter Sanders 001 (ALENEX, 2010)

Algorithm Engineering - An Attempt at a Definition Using Sorting as an Example. - Peter Sanders 001 (ALENEX, 2010)

Lifetime Maximization of Monitoring Sensor Networks. - Peter Sanders 001; Dennis Schieferdecker (ALGOSENSORS, 2010)

Fast Detour Computation for Ride Sharing. - Robert Geisberger; Dennis Luxen; Sabine Neubauer; Peter Sanders 001; Lars Völker (ATMOS, 2010)

Engineering Time-Dependent Many-to-Many Shortest Paths Computation. - Robert Geisberger; Peter Sanders 001 (ATMOS, 2010)

10261 Abstracts Collection - Algorithm Engineering. - Giuseppe F. Italiano; David S. Johnson 001; Petra Mutzel; Peter Sanders 001 (Algorithm Engineering, 2010)

10261 Executive Summary - Algorithm Engineering. - Giuseppe F. Italiano; David S. Johnson 001; Petra Mutzel; Peter Sanders 001 (Algorithm Engineering, 2010)

n-Level Graph Partitioning. - Vitaly Osipov; Peter Sanders 001 (ESA (1), 2010)

Scalable distributed-memory external sorting. - Mirko Rahn; Peter Sanders 001; Johannes Singler (ICDE, 2010)

Engineering a scalable high quality graph partitioner. - Manuel Holtgrewe; Peter Sanders 001; Christian Schulz 003 (IPDPS, 2010)

GPU sample sort. - Nikolaj Leischner; Vitaly Osipov; Peter Sanders 001 (IPDPS, 2010)

Improved Fast Similarity Search in Dictionaries. - Daniel Karch; Dennis Luxen; Peter Sanders 001 (SPIRE, 2010)

Time-Dependent Contraction Hierarchies and Approximation. - Gernot Veit Batz; Robert Geisberger; Sabine Neubauer; Peter Sanders 001 (SEA, 2010)

Distributed Time-Dependent Contraction Hierarchies. - Tim Kieritz; Dennis Luxen; Peter Sanders 001; Christian Vetter (SEA, 2010)

Defining and Computing Alternative Routes in Road Networks - Jonathan Dees; Robert Geisberger; Peter Sanders 001; Roland Bader (CoRR, 2010)

n-Level Graph Partitioning - Vitaly Osipov; Peter Sanders 001 (CoRR, 2010)

Faster Radix Sort via Virtual Memory and Write-Combining - Jan Wassenberg; Peter Sanders 001 (CoRR, 2010)

Compressed Transmission of Route Descriptions - Gernot Veit Batz; Robert Geisberger; Dennis Luxen; Peter Sanders 001 (CoRR, 2010)

Algorithm Engineering. - Peter Sanders 001 (Inform. Spektrum, 2010)

Combining hierarchical and goal-directed speed-up techniques for dijkstra's algorithm. - Reinhard Bauer; Daniel Delling; Peter Sanders 001; Dennis Schieferdecker; Dominik Schultes; Dorothea Wagner (ACM J. Exp. Algorithmics, 2010)

Heuristic initialization for bipartite matching problems. - Johannes Langguth; Fredrik Manne; Peter Sanders 001 (ACM J. Exp. Algorithmics, 2010)

Engineering basic algorithms of an in-memory text search engine. - Frederik Transier; Peter Sanders 001 (ACM Trans. Inf. Syst., 2010)

Shortest Paths. - Peter Sanders 001; Johannes Singler (Algorithms Unplugged, 2011)

Engineering Multilevel Graph Partitioning Algorithms. - Peter Sanders 001; Christian Schulz 003 (ESA, 2011)

Engineering a Multi-core Radix Sort. - Jan Wassenberg; Peter Sanders 001 (Euro-Par (2), 2011)

Engineering efficient error-correcting geocoding. - Christian Jung 003; Daniel Karch; Sebastian Knopp; Dennis Luxen; Peter Sanders 001 (GIS, 2011)

Algorithm Engineering for Scalable Parallel External Sorting. - Peter Sanders 001 (IPDPS, 2011)

Efficient Parallel Scheduling of Malleable Tasks. - Peter Sanders 001; Jochen Speck (IPDPS, 2011)

The PEPPHER Approach to Programmability and Performance Portability for Heterogeneous many-core Architectures. - Siegfried Benkner; Sabri Pllana; Jesper Larsson Träff; Philippas Tsigas; Andrew Richards; Raymond Namyst; Beverly Bachmayer; Christoph W. Kessler; David Moloney; Peter Sanders 001 (PARCO, 2011)

Alternative Route Graphs in Road Networks. - Roland Bader; Jonathan Dees; Robert Geisberger; Peter Sanders 001 (TAPAS, 2011)

Hierarchy Decomposition for Faster User Equilibria on Road Networks. - Dennis Luxen; Peter Sanders 001 (SEA, 2011)

Displaying Cell Broadcast messages. - Peter Sanders 001 (WPMC, 2011)

Energy-Efficient Paths in Radio Networks. - René Beier; Stefan Funke; Domagoj Matijevic; Peter Sanders 001 (Algorithmica, 2011)

Efficient Error-Correcting Geocoding - Christian Jung 003; Daniel Karch; Sebastian Knopp; Dennis Luxen; Peter Sanders 001 (CoRR, 2011)

Stronger Quickheaps. - Gonzalo Navarro 001; Rodrigo Paredes; Patricio V. Poblete; Peter Sanders 001 (Int. J. Found. Comput. Sci., 2011)

Algorithm Engineering. - Peter Sanders 001; Dorothea Wagner (it Inf. Technol., 2011)

Energy-efficient sorting using solid state disks. - Andreas Beckmann; Ulrich Meyer 001; Peter Sanders 001; Johannes Singler (Sustain. Comput. Informatics Syst., 2011)

Towards optimal range medians. - Gerth Stølting Brodal; Beat Gfeller; Allan Grønlund Jørgensen; Peter Sanders 001 (Theor. Comput. Sci., 2011)

Algorithm Engineering. - Peter Sanders 001 (Encyclopedia of Parallel Computing, 2011)

Distributed Evolutionary Graph Partitioning. - Peter Sanders 001; Christian Schulz 003 (ALENEX, 2012)

High quality graph partitioning. - Peter Sanders 001; Christian Schulz 003 (Graph Partitioning and Graph Clustering, 2012)

Time-Dependent Route Planning with Generalized Objective Functions. - Gernot Veit Batz; Peter Sanders 001 (ESA, 2012)

Optimized Hybrid Parallel Lattice Boltzmann Fluid Flow Simulations on Complex Geometries. - Jonas Fietz; Mathias J. Krause; Christian Schulz 003; Peter Sanders 001; Vincent Heuveline (Euro-Par, 2012)

Energy Efficient Frequency Scaling and Scheduling for Malleable Tasks. - Peter Sanders 001; Jochen Speck (Euro-Par, 2012)

Efficient Route Compression for Hybrid Route Planning. - Gernot Veit Batz; Robert Geisberger; Dennis Luxen; Peter Sanders 001; Roman Zubkov (MedAlg, 2012)

Engineering Graph Partitioning Algorithms. - Vitaly Osipov; Peter Sanders 001; Christian Schulz 003 (SEA, 2012)

Think Locally, Act Globally: Perfectly Balanced Graph Partitioning - Peter Sanders 001; Christian Schulz 003 (CoRR, 2012)

Route planning with flexible edge restrictions. - Robert Geisberger; Michael N. Rice; Peter Sanders 001; Vassilis J. Tsotras (ACM J. Exp. Algorithmics, 2012)

Engineering highway hierarchies. - Peter Sanders 001; Dominik Schultes (ACM J. Exp. Algorithmics, 2012)

Exact Routing in Large Road Networks Using Contraction Hierarchies. - Robert Geisberger; Peter Sanders 001; Dominik Schultes; Christian Vetter (Transp. Sci., 2012)

Communication efficient algorithms for fundamental big data problems. - Peter Sanders 001; Sebastian Schlag; Ingo Müller 002 (IEEE BigData, 2013)

Fast OLAP query execution in main memory on large data in a cluster. - Martin Weidner; Jonathan Dees; Peter Sanders 001 (IEEE BigData, 2013)

Parallel String Sample Sort. - Timo Bingmann; Peter Sanders 001 (ESA, 2013)

Efficient Parallel and External Matching. - Marcel Birn; Vitaly Osipov; Peter Sanders 001; Christian Schulz 003; Nodari Sitchinava (Euro-Par, 2013)

Efficient many-core query execution in main memory column-stores. - Jonathan Dees; Peter Sanders 001 (ICDE, 2013)

Malleable Sorting. - Patrick Flick; Peter Sanders 001; Jochen Speck (IPDPS, 2013)

Parallel Label-Setting Multi-objective Shortest Path Search. - Peter Sanders 001; Lawrence Mandow (IPDPS, 2013)

Engineering Algorithms for Large Data Sets. - Peter Sanders 001 (SOFSEM, 2013)

On (Dynamic) Range Minimum Queries in External Memory. - Lars Arge; Johannes Fischer 001; Peter Sanders 001; Nodari Sitchinava (WADS, 2013)

Transit Node Routing Reconsidered. - Julian Arz; Dennis Luxen; Peter Sanders 001 (SEA, 2013)

Think Locally, Act Globally: Highly Balanced Graph Partitioning. - Peter Sanders 001; Christian Schulz 003 (SEA, 2013)

Recent Advances in Graph Partitioning. - Aydin Buluç; Henning Meyerhenke; Ilya Safro; Peter Sanders 001; Christian Schulz 003 (CoRR, 2013)

KaHIP v0.53 - Karlsruhe High Quality Partitioning - User Guide. - Peter Sanders 001; Christian Schulz 003 (CoRR, 2013)

Algorithmenbibliotheken. - Peter Sanders 001 (Inform. Spektrum, 2013)

Minimum time-dependent travel times with contraction hierarchies. - Gernot Veit Batz; Robert Geisberger; Peter Sanders 001; Christian Vetter (ACM J. Exp. Algorithmics, 2013)

Real-time integrated prefetching and caching. - Peter Sanders 001; Johannes Singler; Rob van Stee (J. Sched., 2013)

Algorithmen und Datenstrukturen - die Grundwerkzeuge. - Martin Dietzfelbinger; Kurt Mehlhorn; Peter Sanders 001 (Springer, 2014)

PReaCH: A Fast Lightweight Reachability Index Using Pruning and Contraction Hierarchies. - Florian Merz 003; Peter Sanders 001 (ESA, 2014)

Algorithm Engineering for Big Data. - Peter Sanders 001 (GI-Jahrestagung, 2014)

Retrieval and Perfect Hashing Using Fingerprinting. - Ingo Müller 002; Peter Sanders 001; Robert Schulze; Wei Zhou (SEA, 2014)

Parallel Bi-objective Shortest Paths Using Weight-Balanced B-trees with Bulk Updates. - Stephan Erb; Moritz Kobitzsch; Peter Sanders 001 (SEA, 2014)

Partitioning Complex Networks via Size-Constrained Clustering. - Henning Meyerhenke; Peter Sanders 001; Christian Schulz 003 (SEA, 2014)

Practical Massively Parallel Sorting - Basic Algorithmic Ideas. - Michael Axtmann; Timo Bingmann; Peter Sanders 001; Christian Schulz 003 (CoRR, 2014)

MultiQueues: Simpler, Faster, and Better Relaxed Concurrent Priority Queues. - Hamza Rihani; Peter Sanders 001; Roman Dementiev (CoRR, 2014)

Advanced Coarsening Schemes for Graph Partitioning. - Ilya Safro; Peter Sanders 001; Christian Schulz 003 (ACM J. Exp. Algorithmics, 2014)

Engineering Parallel Algorithms: The multicore transformation (Ubiquity symposium). - Peter Sanders 001 (Ubiquity, 2014)

Benchmarking for Graph Clustering and Partitioning. - David A. Bader; Henning Meyerhenke; Peter Sanders 001; Christian Schulz 003; Andrea Kappes; Dorothea Wagner (Encyclopedia of Social Network Analysis and Mining, 2014)

(Semi-)External Algorithms for Graph Partitioning and Clustering. - Yaroslav Akhremtsev; Peter Sanders 001; Christian Schulz 003 (ALENEX, 2015)

Operating Power Grids with Few Flow Control Buses. - Thomas Leibfried; Tamara Mchedlidze; Nico Meyer-Hübner; Martin Nöllenburg; Ignaz Rutter; Peter Sanders 001; Dorothea Wagner; Franziska Wegner (e-Energy, 2015)

Incorporating road networks into territory design. - Nitin Ahuja; Matthias Bender 002; Peter Sanders 001; Christian Schulz 003; Andreas Wagner (SIGSPATIAL/GIS, 2015)

Report from Dagstuhl: SocioPaths - Multimodal Door-to-Door Route Planning via Social Paths. - Thomas Liebig; Sabine Storandt; Peter Sanders 001; Walied Othman; Stefan Funke (MUD@ICML, 2015)

Locality Aware DAG-Scheduling for LU-Decomposition. - Tobias Maier; Peter Sanders 001; Jochen Speck (IPDPS, 2015)

HordeSat: A Massively Parallel Portfolio SAT Solver. - Tomás Balyo; Peter Sanders 001; Carsten Sinz (SAT, 2015)

Cache-Efficient Aggregation: Hashing Is Sorting. - Ingo Müller 002; Peter Sanders 001; Arnaud Lacurie; Wolfgang Lehner; Franz Färber (SIGMOD Conference, 2015)

Practical Massively Parallel Sorting. - Michael Axtmann; Timo Bingmann; Peter Sanders 001; Christian Schulz 003 (SPAA, 2015)

Brief Announcement: MultiQueues: Simple Relaxed Concurrent Priority Queues. - Hamza Rihani; Peter Sanders 001; Roman Dementiev (SPAA, 2015)

Faster Exact Search Using Document Clustering. - Jonathan Dimond; Peter Sanders 001 (SPIRE, 2015)

Parallel Algorithms Reconsidered (Invited Talk). - Peter Sanders 001 (STACS, 2015)

A Bulk-Parallel Priority Queue in External Memory with STXXL. - Timo Bingmann; Thomas Keh; Peter Sanders 001 (SEA, 2015)

Graph Partitioning for Independent Sets. - Sebastian Lamm; Peter Sanders 001; Christian Schulz 003 (SEA, 2015)

Route Planning in Transportation Networks. - Hannah Bast; Daniel Delling; Andrew V. Goldberg; Matthias Müller-Hannemann; Thomas Pajor; Peter Sanders 001; Dorothea Wagner; Renato F. Werneck (CoRR, 2015)

n-Level Hypergraph Partitioning. - Vitali Henne; Henning Meyerhenke; Peter Sanders 001; Sebastian Schlag; Christian Schulz 003 (CoRR, 2015)

Communication Efficient Algorithms for Top-k Selection Problems. - Lorenz Hübschle-Schneider; Peter Sanders 001; Ingo Müller 002 (CoRR, 2015)

k-way Hypergraph Partitioning via n-Level Recursive Bisection. - Sebastian Schlag; Vitali Henne; Tobias Heuer; Henning Meyerhenke; Peter Sanders 001; Christian Schulz 003 (CoRR, 2015)

Work-Efficient Matrix Inversion in Polylogarithmic Time. - Peter Sanders 001; Jochen Speck; Raoul Steffen (ACM Trans. Parallel Comput., 2015)

k-way Hypergraph Partitioning via n-Level Recursive Bisection. - Sebastian Schlag; Vitali Henne; Tobias Heuer; Henning Meyerhenke; Peter Sanders 001; Christian Schulz 003 (ALENEX, 2016)

Thrill: High-performance algorithmic distributed batch data processing with C++. - Timo Bingmann; Michael Axtmann; Emanuel Jöbstl; Sebastian Lamm; Huyen Chau Nguyen; Alexander Noe; Sebastian Schlag; Matthias Stumpp; Tobias Sturm; Peter Sanders 001 (IEEE BigData, 2016)

Fast Parallel Operations on Search Trees. - Yaroslav Akhremtsev; Peter Sanders 001 (HiPC, 2016)

Communication Efficient Algorithms for Top-k Selection Problems. - Lorenz Hübschle-Schneider; Peter Sanders 001 (IPDPS, 2016)

Generating semi-synthetic validation benchmarks for embryomics. - Johannes Stegmaier; Julian Arz; Benjamin Schott; Jens C. Otte; Andrei Kobitski; G. Ulrich Nienhaus; Uwe Strähle; Peter Sanders 001; Ralf Mikut (ISBI, 2016)

Concurrent hash tables: fast and general?(!). - Tobias Maier; Peter Sanders 001; Roman Dementiev (PPoPP, 2016)

Accelerating Local Search for the Maximum Independent Set Problem. - Jakob Dahlum; Sebastian Lamm; Peter Sanders 001; Christian Schulz 003; Darren Strash; Renato F. Werneck (SEA, 2016)

Advanced Multilevel Node Separator Algorithms. - Peter Sanders 001; Christian Schulz 003 (SEA, 2016)

Efficient Random Sampling - Parallel, Vectorized, Cache-Efficient, and Online. - Peter Sanders 001; Sebastian Lamm; Lorenz Hübschle-Schneider; Emanuel Schrade; Carsten Dachsbacher (CoRR, 2016)

Partitioning (hierarchically clustered) complex networks via size-constrained graph clustering. - Henning Meyerhenke; Peter Sanders 001; Christian Schulz 003 (J. Heuristics, 2016)

Scalable generation of scale-free graphs. - Peter Sanders 001; Christian Schulz 003 (Inf. Process. Lett., 2016)

Introduction to Special Issue ALENEX 2013. - Peter Sanders 001; Norbert Zeh (ACM J. Exp. Algorithmics, 2016)

Introduction to the Special Issue on SPAA 2014. - Friedhelm Meyer auf der Heide; Peter Sanders 001; Nodari Sitchinava (ACM Trans. Parallel Comput., 2016)

Route Planning in Transportation Networks. - Hannah Bast; Daniel Delling; Andrew V. Goldberg; Matthias Müller-Hannemann; Thomas Pajor; Peter Sanders 001; Dorothea Wagner; Renato F. Werneck (Algorithm Engineering, 2016)

Recent Advances in Graph Partitioning. - Aydin Buluç; Henning Meyerhenke; Ilya Safro; Peter Sanders 001; Christian Schulz 003 (Algorithm Engineering, 2016)

Engineering a Distributed Full-Text Index. - Johannes Fischer 001; Florian Kurpicz; Peter Sanders 001 (ALENEX, 2017)

Engineering a direct k-way Hypergraph Partitioning Algorithm. - Yaroslav Akhremtsev; Tobias Heuer; Peter Sanders 001; Sebastian Schlag (ALENEX, 2017)

Robust Massively Parallel Sorting. - Michael Axtmann; Peter Sanders 001 (ALENEX, 2017)

Parallel d-D Delaunay Triangulations in Shared and Distributed Memory. - Daniel Funke; Peter Sanders 001 (ALENEX, 2017)

In-Place Parallel Super Scalar Samplesort (IPSSSSo). - Michael Axtmann; Sascha Witt; Daniel Ferizovic; Peter Sanders 001 (ESA, 2017)

Dynamic Space Efficient Hashing. - Tobias Maier; Peter Sanders 001 (ESA, 2017)

Distributed evolutionary k-way node separators. - Peter Sanders 001; Christian Schulz 003; Darren Strash; Robert Williger (GECCO, 2017)

Engineering Parallel String Sorting. - Timo Bingmann; Andreas Eberle; Peter Sanders 001 (Algorithmica, 2017)

Distributed Evolutionary k-way Node Separators. - Peter Sanders 001; Christian Schulz 003; Darren Strash; Robert Williger (CoRR, 2017)

3D Cell Nuclei Segmentation with Balanced Graph Partitioning. - Julian Arz; Peter Sanders 001; Johannes Stegmaier; Ralf Mikut (CoRR, 2017)

Engineering DFS-Based Graph Algorithms. - Kurt Mehlhorn; Stefan Näher; Peter Sanders 001 (CoRR, 2017)

Fast OLAP Query Execution in Main Memory on Large Data in a Cluster. - Demian Hespe; Martin Weidner; Jonathan Dees; Peter Sanders 001 (CoRR, 2017)

Lightweight MPI Communicators with Applications to Perfectly Balanced Schizophrenic Quicksort. - Michael Axtmann; Armin Wiebigke; Peter Sanders 001 (CoRR, 2017)

Finding near-optimal independent sets at scale. - Sebastian Lamm; Peter Sanders 001; Christian Schulz 003; Darren Strash; Renato F. Werneck (J. Heuristics, 2017)

Parallel Graph Partitioning for Complex Networks. - Henning Meyerhenke; Peter Sanders 001; Christian Schulz 003 (IEEE Trans. Parallel Distributed Syst., 2017)

Optimizing energy consumption and user experience in a mobile video streaming scenario. - Thomas Breitbach; Peter Sanders 001; Dominik Schultes (CCNC, 2018)

An equal opportunity concept for the coordinated research effort AESC. - Anne Koziolek; Peter Sanders 001; Dorothea Wagner (ECSA (Companion), 2018)

Lightweight MPI Communicators with Applications to Perfectly Balanced Quicksort. - Michael Axtmann; Armin Wiebigke; Peter Sanders 001 (IPDPS, 2018)

Communication-Free Massively Distributed Graph Generation. - Daniel Funke; Sebastian Lamm; Peter Sanders 001; Christian Schulz 003; Darren Strash; Moritz von Looz (IPDPS, 2018)

Communication Efficient Checking of Big Data Operations. - Lorenz Hübschle-Schneider; Peter Sanders 001 (IPDPS, 2018)

Relational Equivalence Proofs Between Imperative and MapReduce Algorithms. - Bernhard Beckert; Timo Bingmann; Moritz Kiefer; Peter Sanders 001; Mattias Ulbrich; Alexander Weigl (VSTTE, 2018)

Real-Time Traffic Assignment Using Fast Queries in Customizable Contraction Hierarchies. - Valentin Buchhold; Peter Sanders 001; Dorothea Wagner (SEA, 2018)

Proving Equivalence Between Imperative and MapReduce Implementations Using Program Transformations. - Bernhard Beckert; Timo Bingmann; Moritz Kiefer; Peter Sanders 001; Mattias Ulbrich; Alexander Weigl (MARS/VPT@ETAPS, 2018)

Hashing with Linear Probing and Referential Integrity. - Peter Sanders 001 (CoRR, 2018)

Efficient Parallel Random Sampling - Vectorized, Cache-Efficient, and Online. - Peter Sanders 001; Sebastian Lamm; Lorenz Hübschle-Schneider; Emanuel Schrade; Carsten Dachsbacher (ACM Trans. Math. Softw., 2018)

Benchmarking for Graph Clustering and Partitioning. - David A. Bader; Andrea Kappes; Henning Meyerhenke; Peter Sanders 001; Christian Schulz 003; Dorothea Wagner (Encyclopedia of Social Network Analysis and Mining. 2nd Ed., 2018)

Sequential and Parallel Algorithms and Data Structures - The Basic Toolbox - Peter Sanders 001; Kurt Mehlhorn; Martin Dietzfelbinger; Roman Dementiev (Springer, 2019)

More Hierarchy in Route Planning Using Edge Hierarchies. - Demian Hespe; Peter Sanders 001 (ATMOS, 2019)

Load-Balancing for Parallel Delaunay Triangulations. - Daniel Funke; Peter Sanders 001; Vincent Winkler (Euro-Par, 2019)

Efficient Calculation of Microscopic Travel Demand Data with Low Calibration Effort. - Valentin Buchhold; Peter Sanders 001; Dorothea Wagner (SIGSPATIAL/GIS, 2019)

Dynamic Space Efficient Hashing. - Tobias Maier; Peter Sanders 001; Stefan Walzer (Algorithmica, 2019)

Communication-Efficient (Weighted) Reservoir Sampling. - Lorenz Hübschle-Schneider; Peter Sanders 001 (CoRR, 2019)

Novel Parallel Algorithms for Fast Multi-GPU-Based Generation of Massive Scale-Free Networks. - Md. Maksudul Alam; Kalyan S. Perumalla; Peter Sanders 001 (Data Sci. Eng., 2019)

Real-time Traffic Assignment Using Engineered Customizable Contraction Hierarchies. - Valentin Buchhold; Peter Sanders 001; Dorothea Wagner (ACM J. Exp. Algorithmics, 2019)

Network Flow-Based Refinement for Multilevel Hypergraph Partitioning. - Tobias Heuer; Peter Sanders 001; Sebastian Schlag (ACM J. Exp. Algorithmics, 2019)

Communication-free massively distributed graph generation. - Daniel Funke; Sebastian Lamm; Ulrich Meyer 001; Manuel Penschuck; Peter Sanders 001; Christian Schulz 003; Darren Strash; Moritz von Looz (J. Parallel Distributed Comput., 2019)

Concurrent Hash Tables: Fast and General(?)! - Tobias Maier; Peter Sanders 001; Roman Dementiev (ACM Trans. Parallel Comput., 2019)

Connecting MapReduce Computations to Realistic Machine Models. - Peter Sanders 001 (IEEE BigData, 2020)

Communication-Efficient String Sorting. - Timo Bingmann; Peter Sanders 001; Matthias Schimek (IPDPS, 2020)

Communication-Efficient Weighted Reservoir Sampling from Fully Distributed Data Streams. - Lorenz Hübschle-Schneider; Peter Sanders 001 (SPAA, 2020)

Concurrent Expandable AMQs on the Basis of Quotient Filters. - Tobias Maier; Peter Sanders 001; Robert Williger (SEA, 2020)

Recent Advances in Scalable Network Generation. - Manuel Penschuck; Ulrik Brandes; Michael Hamann; Sebastian Lamm; Ulrich Meyer 001; Ilya Safro; Peter Sanders 001; Christian Schulz 003 (CoRR, 2020)

Linear work generation of R-MAT graphs. - Lorenz Hübschle-Schneider; Peter Sanders 001 (Netw. Sci., 2020)

High-Quality Shared-Memory Graph Partitioning. - Yaroslav Akhremtsev; Peter Sanders 001; Christian Schulz 003 (IEEE Trans. Parallel Distributed Syst., 2020)

Fast, Exact and Scalable Dynamic Ridesharing. - Valentin Buchhold; Peter Sanders 001; Dorothea Wagner (ALENEX, 2021)

Scalable Shared-Memory Hypergraph Partitioning. - Lars Gottesbüren; Tobias Heuer; Peter Sanders 001; Sebastian Schlag (ALENEX, 2021)

Deep Multilevel Graph Partitioning. - Lars Gottesbüren; Tobias Heuer; Peter Sanders 001; Christian Schulz 003; Daniel Seemaier (ESA, 2021)

Engineering MultiQueues: Fast Relaxed Concurrent Priority Queues. - Marvin Williams; Peter Sanders 001; Roman Dementiev (ESA, 2021)

Scalable SAT Solving in the Cloud. - Dominik Schreiber 001; Peter Sanders 001 (SAT, 2021)

Weighted Random Sampling on GPUs. - Hans-Peter Lehmann; Lorenz Hübschle-Schneider; Peter Sanders 001 (CoRR, 2021)

Engineering faster sorters for small sets of items. - Timo Bingmann; Jasper Marianczuk; Peter Sanders 001 (Softw. Pract. Exp., 2021)

Exploring parallel MPI fault tolerance mechanisms for phylogenetic inference with RAxML-NG. - Lukas Hübner; Alexey M. Kozlov; Demian Hespe; Peter Sanders 001; Alexandros Stamatakis (Bioinform., 2021)

Multi-Objective Shortest Paths. - Stephan Erb; Moritz Kobitzsch; Lawrence Mandow; Peter Sanders 001 (Massive Graph Analytics, 2022)

Recent Advances in Scalable Network Generation1. - Manuel Penschuck; Ulrik Brandes; Michael Hamann; Sebastian Lamm; Ulrich Meyer 001; Ilya Safro; Peter Sanders 001; Christian Schulz 003 (Massive Graph Analytics, 2022)

Scalable Text Index Construction. - Timo Bingmann; Patrick Dinklage; Johannes Fischer 001; Florian Kurpicz; Enno Ohlebusch; Peter Sanders 001 (Algorithms for Big Data, 2022)

Shared-Memory n-level Hypergraph Partitioning. - Lars Gottesbüren; Tobias Heuer; Peter Sanders 001; Sebastian Schlag (ALENEX, 2022)

Decentralized Online Scheduling of Malleable NP-hard Jobs. - Peter Sanders 001; Dominik Schreiber 001 (Euro-Par, 2022)

ReStore: In-Memory REplicated STORagE for Rapid Recovery in Fault-Tolerant Algorithms. - Lukas Hübner; Demian Hespe; Peter Sanders 001; Alexandros Stamatakis (FTXS@SC, 2022)

Communication-efficient Massively Distributed Connected Components. - Sebastian Lamm; Peter Sanders 001 (IPDPS, 2022)

Fast Succinct Retrieval and Approximate Membership Using Ribbon. - Peter C. Dillinger; Lorenz Hübschle-Schneider; Peter Sanders 001; Stefan Walzer (SEA, 2022)

Parallel Flow-Based Hypergraph Partitioning. - Lars Gottesbüren; Tobias Heuer; Peter Sanders 001 (SEA, 2022)

Mallob: Scalable SAT Solving On Demand With Decentralized Job Scheduling. - Peter Sanders 001; Dominik Schreiber 001 (J. Open Source Softw., 2022)

Vectorized and performance-portable quicksort. - Jan Wassenberg; Mark Blacher; Joachim Giesen; Peter Sanders 001 (Softw. Pract. Exp., 2022)

Parallel Weighted Random Sampling. - Lorenz Hübschle-Schneider; Peter Sanders 001 (ACM Trans. Math. Softw., 2022)

Engineering In-place (Shared-memory) Sorting Algorithms. - Michael Axtmann; Sascha Witt; Daniel Ferizovic; Peter Sanders 001 (ACM Trans. Parallel Comput., 2022)

Mallob: Scalable SAT Solving On Demand With Decentralized Job Scheduling. - Dominik Schreiber 001; Peter Sanders 001 (Zenodo, 2022)

High-Quality Hypergraph Partitioning. - Sebastian Schlag; Tobias Heuer; Lars Gottesbüren; Yaroslav Akhremtsev; Christian Schulz 003; Peter Sanders 001 (ACM J. Exp. Algorithmics, 2022)

PaCHash: Packed and Compressed Hash Tables. - Florian Kurpicz; Hans-Peter Lehmann; Peter Sanders 001 (ALENEX, 2023)

SicHash - Small Irregular Cuckoo Tables for Perfect Hashing. - Hans-Peter Lehmann; Peter Sanders 001; Stefan Walzer (ALENEX, 2023)

High Performance Construction of RecSplit Based Minimal Perfect Hash Functions. - Dominik Bez; Florian Kurpicz; Hans-Peter Lehmann; Peter Sanders 001 (ESA, 2023)

Learned Monotone Minimal Perfect Hashing. - Paolo Ferragina; Hans-Peter Lehmann; Peter Sanders 001; Giorgio Vinciguerra (ESA, 2023)

A Sweep-Plane Algorithm for Calculating the Isolation of Mountains. - Daniel Funke; Nicolai Hüning; Peter Sanders 001 (ESA, 2023)

Pareto Sums of Pareto Sets. - Demian Hespe; Peter Sanders 001; Sabine Storandt; Carina Truschel (ESA, 2023)

Distributed Deep Multilevel Graph Partitioning. - Peter Sanders 001; Daniel Seemaier (Euro-Par, 2023)

Engineering Massively Parallel MST Algorithms. - Peter Sanders 001; Matthias Schimek (IPDPS, 2023)

Engineering a Distributed-Memory Triangle Counting Algorithm. - Peter Sanders 001; Tim Niklas Uhl (IPDPS, 2023)

Efficient Yao Graph Construction. - Daniel Funke; Peter Sanders 001 (SEA, 2023)

Editorial. - Martin Held; Martin Nöllenburg; Peter Sanders 001 (Comput. Geom., 2023)

Sliding Block Hashing (Slick) - Basic Algorithmic Ideas. - Hans-Peter Lehmann; Peter Sanders 001; Stefan Walzer (CoRR, 2023)

Fast Many-to-Many Routing for Ridesharing with Multiple Pickup and Dropoff Locations. - Moritz Laupichler; Peter Sanders 001 (CoRR, 2023)

Bipartite ShockHash: Pruning ShockHash Search for Efficient Perfect Hashing. - Hans-Peter Lehmann; Peter Sanders 001; Stefan Walzer (CoRR, 2023)

Formally Verifying an Efficient Sorter - Verification and Benchmarking Artifact. - Bernhard Beckert; Peter Sanders 001; Mattias Ulbrich; Julian Wiesler; Sascha Witt (Zenodo, 2023)

More Recent Advances in (Hyper)Graph Partitioning. - Ümit V. Çatalyürek; Karen D. Devine; Marcelo Fonseca Faraj; Lars Gottesbüren; Tobias Heuer; Henning Meyerhenke; Peter Sanders 001; Sebastian Schlag; Christian Schulz 003; Daniel Seemaier; Dorothea Wagner (ACM Comput. Surv., 2023)

Fast Many-to-Many Routing for Dynamic Taxi Sharing with Meeting Points. - Moritz Laupichler; Peter Sanders 001 (ALENEX, 2024)

ShockHash: Towards Optimal-Space Minimal Perfect Hashing Beyond Brute-Force. - Hans-Peter Lehmann; Peter Sanders 001; Stefan Walzer (ALENEX, 2024)

PHOBIC: Perfect Hashing With Optimized Bucket Sizes and Interleaved Coding. - Stefan Hermann; Hans-Peter Lehmann; Giulio Ermanno Pibiri; Peter Sanders 001; Stefan Walzer (ESA, 2024)

Scalable Distributed String Sorting. - Florian Kurpicz; Pascal Mehnert; Peter Sanders 001; Matthias Schimek (ESA, 2024)

Modern Software Libraries for Graph Partitioning (Abstract). - Lars Gottesbüren; Nikolai Maas; Peter Sanders 001; Daniel Seemaier (HOPC@SPAA, 2024)

Scalable SAT Solving on Demand (Abstract). - Dominik Schreiber 001; Peter Sanders 001 (HOPC@SPAA, 2024)

KaMPIng: Flexible and (Near) Zero-Overhead C++ Bindings for MPI. - Tim Niklas Uhl; Matthias Schimek; Lukas Hübner; Demian Hespe; Florian Kurpicz; Daniel Seemaier; Christoph Stelz; Peter Sanders 001 (SC, 2024)

Brief Announcement: Distributed Unconstrained Local Search for Multilevel Graph Partitioning. - Peter Sanders 001; Daniel Seemaier (SPAA, 2024)

Brief Announcement: (Near) Zero-Overhead C++ Bindings for MPI. - Demian Hespe; Lukas Hübner; Florian Kurpicz; Peter Sanders 001; Matthias Schimek; Daniel Seemaier; Tim Niklas Uhl (SPAA, 2024)

Brief Announcement: Scalable Distributed String Sorting. - Florian Kurpicz; Pascal Mehnert; Peter Sanders 001; Matthias Schimek (SPAA, 2024)

Formally Verifying an Efficient Sorter. - Bernhard Beckert; Peter Sanders 001; Mattias Ulbrich; Julian Wiesler; Sascha Witt (TACAS (1), 2024)

Targeted Branching for the Maximum Independent Set Problem Using Graph Neural Networks. - Kenneth Langedal; Demian Hespe; Peter Sanders 001 (SEA, 2024)

Engineering Optimal Parallel Task Scheduling. - Matthew Akram; Nikolai Maas; Peter Sanders 001; Dominik Schreiber 001 (CoRR, 2024)

Brief Announcement: Parallel Construction of Bumped Ribbon Retrieval. - Matthias Becht; Hans-Peter Lehmann; Peter Sanders 001 (CoRR, 2024)

Scalable Fault-Tolerant MapReduce. - Demian Hespe; Lukas Hübner; Charel Mercatoris; Peter Sanders 001 (CoRR, 2024)

Fast and Lightweight Distributed Suffix Array Construction - First Results. - Manuel Haag; Florian Kurpicz; Peter Sanders 001; Matthias Schimek (CoRR, 2024)

MallobSat: Scalable SAT Solving by Clause Sharing. - Dominik Schreiber 001; Peter Sanders 001 (J. Artif. Intell. Res., 2024)

Scalable High-Quality Hypergraph Partitioning. - Lars Gottesbüren; Tobias Heuer; Nikolai Maas; Peter Sanders 001; Sebastian Schlag (ACM Trans. Algorithms, 2024)

Synergistic Traffic Assignment. - Thomas Bläsius; Adrian Feilhauer; Markus Jung; Moritz Laupichler; Peter Sanders 001; Michael Zündorf (AAMAS, 2025)

Tera-Scale Multilevel Graph Partitioning. - Daniel Salwasser; Daniel Seemaier; Lars Gottesbüren; Peter Sanders 001 (IPDPS, 2025)

Combined Search and Encoding for Seeds, with an Application to Minimal Perfect Hashing. - Hans-Peter Lehmann; Peter Sanders 001; Stefan Walzer; Jonatan Ziegler (CoRR, 2025)

Engineering MultiQueues: Fast Relaxed Concurrent Priority Queues. - Marvin Williams; Peter Sanders 001 (CoRR, 2025)

Linear-Time Multilevel Graph Partitioning via Edge Sparsification. - Lars Gottesbüren; Nikolai Maas; Dominik Rosch; Peter Sanders 001; Daniel Seemaier (CoRR, 2025)

PHast - Perfect Hashing with fast evaluation. - Piotr Beling; Peter Sanders 001 (CoRR, 2025)

Engineering Minimal k-Perfect Hash Functions. - Stefan Hermann; Sebastian Kirmayer; Hans-Peter Lehmann; Peter Sanders 001; Stefan Walzer (CoRR, 2025)

Modern Minimal Perfect Hashing: A Survey. - Hans-Peter Lehmann; Thomas Mueller; Rasmus Pagh; Giulio Ermanno Pibiri; Peter Sanders 001; Sebastiano Vigna; Stefan Walzer (CoRR, 2025)

BlockFIFO & MultiFIFO: Scalable Relaxed Queues. - Stefan Koch; Peter Sanders 001; Marvin Williams (CoRR, 2025)

Pareto Sums of Pareto Sets: Lower Bounds and Algorithms. - Daniel Funke; Demian Hespe; Peter Sanders 001; Sabine Storandt; Carina Truschel (Algorithmica, 2025)