Peter Sanders

Prof. Dr. rer. nat. Peter Sanders

  •  

    Karlsruhe Institute of Technology
    Department of Informatics

    Mailbox 6980
    76128 Karlsruhe
     
    Visitor's address:
    Am Fasanengarten 5
    76131 Karlsruhe

     

CV

From 1988 to 1996 Peter Sanders studied at Karlsruhe University. Besides shorter stays at North Carolina State University and the Chalmers University in Goeteborg, he worked for seven years at the Max-Planck-Institute for Computer Science in Saarbruecken. Since 2004 he has a full professorship at KIT. He works on basic algorithms in theory and practice., e.g., sorting, data structures, or path search. A focus is on parallel computing and large data sets. His most well-known results are on route planning in road networks, graph partitioning, index data structures, load balancing, efficient network communication algorithms and a textbook on basic algorithms. Peter Sanders wrote more than 250 scientific papers and received a number of distinguished awards. This includes the DFG Leibniz Award and the State Research Award of Baden-Württemberg. He also coordinated the DFG Priority Program on Algorithm Engineering. His consulting activities range from startups to large companies like SAP and Google. Thematically, they range from optimization, route planning and search engines to scalable discrete algorithms and basic algorithms for data bases.

Research Interests

I am doing algorithm theory and algorithm engineering, i.e., I work on the design, implementation and analysis of efficient algorithms; "analysis" can be both theoretical and experimental. Topics I often touch:

  • Parallel processing and communication in networks
  • Solving problems with "irregular" structure
  • Randomized algorithms
  • Handling large data sets
  • Realistic models for problems and machines

Selected Academic Activities

Teaching

          

Publications


2024
Formally Verifying an Efficient Sorter
Beckert, B.; Sanders, P.; Ulbrich, M.; Witt, S.; Wiesler, J.
2024. Karlsruher Institut für Technologie (KIT). doi:10.5445/IR/1000167846Full textFull text of the publication as PDF document
Scalable High-Quality Hypergraph Partitioning
Gottesbüren, L.; Heuer, T.; Maas, N.; Sanders, P.; Schlag, S.
2024. ACM Transactions on Algorithms, 20 (1), 1–54. doi:10.1145/3626527
Fast Many-to-Many Routing for Dynamic Taxi Sharing with Meeting Points
Laupichler, M.; Sanders, P.
2024. Proceedings : 2024 Proceedings of the Symposium on Algorithm Engineering and Experiments (ALENEX). Ed.: R. Chowdhury, 74–90, Society for Industrial and Applied Mathematics (SIAM). doi:10.1137/1.9781611977929Full textFull text of the publication as PDF document
ShockHash: Towards Optimal-Space Minimal Perfect Hashing Beyond Brute-Force
Lehmann, H.-P.; Sanders, P.; Walzer, S.
2024. Proceedings : 2024 Proceedings of the Symposium on Algorithm Engineering and Experiments (ALENEX). Ed.: R. Chowdhury, 194–206, Society for Industrial and Applied Mathematics (SIAM). doi:10.1137/1.9781611977929.15
2023
More Recent Advances in (Hyper)Graph Partitioning
Çatalyürek, Ü.; Devine, K.; Faraj, M.; Gottesbüren, L.; Heuer, T.; Meyerhenke, H.; Sanders, P.; Schlag, S.; Schulz, C.; Seemaier, D.; Wagner, D.
2023. ACM Computing Surveys, 55 (12), Artkl.Nr.: 3571808. doi:10.1145/3571808
A Sweep-Plane Algorithm for Calculating the Isolation of Mountains
Funke, D.; Hüning, N.; Sanders, P.
2023. I. L. Gørtz, M. Farach-Colton, S. J. Puglisi & G. Herman (Eds.), 31st Annual European Symposium on Algorithms (ESA 2023). Hrsg.: I., Li Gortz; M., Farach-Colton; S.J., Puglisi; G., Herman, 1–17, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (LZI). doi:10.4230/lipics.esa.2023.51Full textFull text of the publication as PDF document
Pareto Sums of Pareto Sets
Hespe, D.; Sanders, P.; Storandt, S.; Truschel, C.
2023. I. L. Gørtz, M. Farach-Colton, S. J. Puglisi & G. Herman (Eds.), 31st Annual European Symposium on Algorithms (ESA 2023). Hrsg.: I. Li Gortz, M. Farach-Colton, S.J. Puglisi, G. Herman, 1–17, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (LZI). doi:10.4230/LIPIcs.ESA.2023.60Full textFull text of the publication as PDF document
Engineering Massively Parallel MST Algorithms
Sanders, P.; Schimek, M.
2023. IEEE International Parallel and Distributed Processing Symposium (IPDPS), St. Petersburg, FL, 15th - 19th May 2023, 691–701, Institute of Electrical and Electronics Engineers (IEEE). doi:10.1109/IPDPS54959.2023.00075
Distributed Deep Multilevel Graph Partitioning
Sanders, P.; Seemaier, D.
2023. Euro-Par 2023: Parallel Processing – 29th International Conference on Parallel and Distributed Computing, Limassol, Cyprus, August 28 – September 1, 2023, Proceedings. Ed.: J. Cano, 443 – 457, Springer Nature Switzerland. doi:10.1007/978-3-031-39698-4_30
Efficient Yao Graph Construction
Funke, D.; Sanders, P.
2023. L. Georgiadis (Ed.), 21st International Symposium on Experimental Algorithms (SEA 2023), 24th-26th July 2023, Barcelona, 0:1–20:20, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (LZI). doi:10.4230/lipics.sea.2023.20Full textFull text of the publication as PDF document
Learned Monotone Minimal Perfect Hashing
Ferragina, P.; Lehmann, H.-P.; Sanders, P.; Vinciguerra, G.
2023. 31st Annual European Symposium on Algorithms (ESA 2023), Schloss Dagstuhl - Leibniz-Zentrum für Informatik. Ed.: I. Gørtz, 46:1–46:17, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (LZI). doi:10.4230/LIPIcs.ESA.2023.46Full textFull text of the publication as PDF document
High Performance Construction of RecSplit Based Minimal Perfect Hash Functions
Bez, D.; Kurpicz, F.; Lehmann, H.-P.; Sanders, P.
2023. 31st Annual European Symposium on Algorithms (ESA 2023), Schloss Dagstuhl - Leibniz-Zentrum für Informatik. Ed.: I. Gørtz, 19:1–19:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (LZI). doi:10.4230/LIPIcs.ESA.2023.19Full textFull text of the publication as PDF document
Engineering a Distributed-Memory Triangle Counting Algorithm
Sanders, P.; Uhl, T. N.
2023. 2023 IEEE International Parallel and Distributed Processing Symposium (IPDPS), 702–712, Institute of Electrical and Electronics Engineers (IEEE). doi:10.1109/IPDPS54959.2023.00076
PaCHash: Packed and Compressed Hash Tables
Kurpicz, F.; Lehmann, H.-P.; Sanders, P.
2023. 2023 Proceedings of the Symposium on Algorithm Engineering and Experiments (ALENEX), 162–175, Society for Industrial and Applied Mathematics (SIAM). doi:10.1137/1.9781611977561.ch14Full textFull text of the publication as PDF document
SicHash - Small Irregular Cuckoo Tables for Perfect Hashing
Lehmann, H.-P.; Sanders, P.; Walzer, S.
2023. 2023 Proceedings of the Symposium on Algorithm Engineering and Experiments (ALENEX), Florence, I, January 22-23,2023, 176–189, Society for Industrial and Applied Mathematics (SIAM). doi:10.1137/1.9781611977561.ch15Full textFull text of the publication as PDF document
Scalable discrete algorithms for big data applications
Hespe, D.; Hübner, L.; Hübschle-Schneider, L.; Sanders, P.; Schreiber, D.
2023. High Performance Computing in Science and Engineering ’21 – Transactions of the High Performance Computing Center, Stuttgart (HLRS) 2021. Ed.: W. Nagel, 439–449, Springer International Publishing. doi:10.1007/978-3-031-17937-2_27
2022
ReStore: In-Memory REplicated STORagE for Rapid Recovery in Fault-Tolerant Algorithms
Hübner, L.; Hespe, D.; Sanders, P.; Stamatakis, A.
2022. 2022 IEEE/ACM 12th Workshop on Fault Tolerance for HPC at eXtreme Scale (FTXS), Dallas, TX, USA, 13-18 November 2022, 24–35, Institute of Electrical and Electronics Engineers (IEEE). doi:10.1109/FTXS56515.2022.00008Full textFull text of the publication as PDF document
Parallel Weighted Random Sampling
Hübschle-Schneider, L.; Sanders, P.
2022. ACM Transactions on Mathematical Software, 48 (3), Art.-Nr.: 29. doi:10.1145/3549934
Parallel Flow-Based Hypergraph Partitioning
Gottesbüren, L.; Heuer, T.; Sanders, P.
2022. 20th International Symposium on Experimental Algorithms (SEA 2022), 5:1–5:21, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (LZI). doi:10.4230/LIPIcs.SEA.2022.5Full textFull text of the publication as PDF document
Communication-efficient Massively Distributed Connected Components
Lamm, S.; Sanders, P.
2022. 2022 IEEE International Parallel and Distributed Processing Symposium (IPDPS), Lyon, France, 30 May 2022 - 03 June 2022, 302–312, Institute of Electrical and Electronics Engineers (IEEE). doi:10.1109/IPDPS53621.2022.00037
Engineering In-place (Shared-memory) Sorting Algorithms
Axtmann, M.; Witt, S.; Ferizovic, D.; Sanders, P.
2022. ACM Transactions on Parallel Computing, 9 (1), Art.-Nr.: 2. doi:10.1145/3505286
High-Quality Hypergraph Partitioning
Schlag, S.; Heuer, T.; Gottesbüren, L.; Akhremtsev, Y.; Schulz, C.; Sanders, P.
2022. ACM Journal of Experimental Algorithmics, 27, Art.Nr. 1.9. doi:10.1145/3529090
Shared-Memory n-level Hypergraph Partitioning
Gottesbüren, L.; Heuer, T.; Sanders, P.; Schlag, S.
2022. 2022 Proceedings of the Symposium on Algorithm Engineering and Experiments (ALENEX). Ed.: C. Phillips, Meeting on Algorithm Engineering and Experiments (ALENEX 2022 2022) Online, 09.01.2022–10.01.2022, 131–144, Society for Industrial and Applied Mathematics (SIAM). doi:10.1137/1.9781611977042.11
Vectorized and performance‐portable quicksort
Wassenberg, J.; Blacher, M.; Giesen, J.; Sanders, P.
2022. Software: Practice and Experience, 52 (12), 2684–2699. doi:10.1002/spe.3142
Decentralized Online Scheduling of Malleable NP-hard Jobs
Sanders, P.; Schreiber, D.
2022. Euro-Par 2022 : Parallel Processing. Hrsg.: J. Cano, 119–135, Springer International Publishing. doi:10.1007/978-3-031-12597-3_8Full textFull text of the publication as PDF document
Fast Succinct Retrieval and Approximate Membership Using Ribbon
Dillinger, P. C.; Hübschle-Schneider, L.; Sanders, P.; Walzer, S.
2022. 20th International Symposium on Experimental Algorithms (SEA 2022). Ed.: C. Schulz, Art.-Nr.: 4, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (LZI). doi:10.4230/LIPIcs.SEA.2022.4Full textFull text of the publication as PDF document
2021
Deep multilevel graph partitioning
Gottesbüren, L.; Heuer, T.; Sanders, P.; Schulz, C.; Seemaier, D.
2021 
Deep multilevel graph partitioning
Gottesbüren, L.; Heuer, T.; Sanders, P.; Schulz, C.; Seemaier, D.
2021. 29th Annual European Symposium on Algorithms (ESA 2021): 6-8 September 2021, online. Ed.: P. Mutzel, Art.-Nr.: 48, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (LZI). doi:10.4230/LIPIcs.ESA.2021.48Full textFull text of the publication as PDF document
Engineering MultiQueues: Fast relaxed concurrent priority queues
Williams, M.; Sanders, P.; Dementiev, R.
2021. 29th Annual European Symposium on Algorithms (ESA 2021): 6-8 September 2021, online. Ed.: P. Mutzel, Art.-Nr.: 81, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (LZI). doi:10.4230/LIPIcs.ESA.2021.81Full textFull text of the publication as PDF document
Fast, exact and scalable dynamic ridesharing
Buchhold, V.; Sanders, P.; Wagner, D.
2021. 2021 Proceedings of the Symposium on Algorithm Engineering and Experiments (ALENEX). Ed.: M. Farach-Colton, 98–112, Society for Industrial and Applied Mathematics (SIAM). doi:10.1137/1.9781611976472.8
Scalable SAT Solving in the Cloud
Schreiber, D.; Sanders, P.
2021. Theory and Applications of Satisfiability Testing – SAT 2021. Ed.: C.-M. Li, 518–534, Springer. doi:10.1007/978-3-030-80223-3_35Full textFull text of the publication as PDF document
Scalable Shared-Memory Hypergraph Partitioning
Gottesbüren, L.; Heuer, T.; Sanders, P.; Schlag, S.
2021. ALENEX 2021 : SIAM Symposium on Algorithm Engineering and Experiments. Ed.: M. Farach-Colton, 16–30, Society for Industrial and Applied Mathematics (SIAM). doi:10.1137/1.9781611976472.2
2020
Communication-Efficient Weighted Reservoir Sampling from Fully Distributed Data Streams
Hübschle-Schneider, L.; Sanders, P.
2020. Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures, 543–545, Association for Computing Machinery (ACM). doi:10.1145/3350755.3400287Full textFull text of the publication as PDF document
Concurrent Expandable AMQs on the Basis of Quotient Filters
Maier, T.; Sanders, P.; Williger, R.
2020. 18th International Symposium on Experimental Algorithms : SEA 2020, June 16-18, 2020, Catania, Italy / edited by Simone Faro, Domenico Cantone, 15:1–15:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (LZI). doi:10.4230/LIPIcs.SEA.2020.15Full textFull text of the publication as PDF document
Connecting MapReduce Computations to Realistic Machine Models
Sanders, P.
2020. 2020 IEEE International Conference on Big Data (Big Data): 10-13 December 2020, online, 84–93, Institute of Electrical and Electronics Engineers (IEEE). doi:10.1109/BigData50022.2020.9378039
Communication-Efficient String Sorting
Bingmann, T.; Sanders, P.; Schimek, M.
2020. 34th IEEE International Parallel and Distributed Processing Symposium, IPDPS 2020; New Orleans; United States; 18 May 2020 through 22 May 2020, 137–147, Institute of Electrical and Electronics Engineers (IEEE). doi:10.1109/IPDPS47924.2020.00024
2019
Real-time Traffic Assignment Using Engineered Customizable Contraction Hierarchies
Buchhold, V.; Sanders, P.; Wagner, D.
2019. Journal of experimental algorithmics, 24 (1), Article no: 3362693. doi:10.1145/3362693
Efficient Calculation of Microscopic Travel Demand Data with Low Calibration Effort
Buchhold, V.; Sanders, P.; Wagner, D.
2019. Proceedings of the 27th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, 379–388, Association for Computing Machinery (ACM). doi:10.1145/3347146.3359361
Network Flow-Based Refinement for Multilevel Hypergraph Partitioning
Heuer, T.; Sanders, P.; Schlag, S.
2019. Journal of experimental algorithmics, 24 (1), Article: 2.3. doi:10.1145/3329872
Communication-free massively distributed graph generation
Funke, D.; Lamm, S.; Meyer, U.; Penschuck, M.; Sanders, P.; Schulz, C.; Strash, D.; Looz, M. von
2019. Journal of parallel and distributed computing, 131, 200–217. doi:10.1016/j.jpdc.2019.03.011
Dynamic Space Efficient Hashing
Maier, T.; Sanders, P.; Walzer, S.
2019. Algorithmica, 81 (8), 3162–3185. doi:10.1007/s00453-019-00572-x
Load-Balancing for Parallel Delaunay Triangulations
Funke, D.; Sanders, P.; Winkler, V.
2019. Euro-Par 2019: Parallel Processing : 25th International Conference on Parallel and Distributed Computing, Göttingen, Germany, August 26–30, 2019, Proceedings. Ed.: R. Yahyapour, 156–169, Springer International Publishing. doi:10.1007/978-3-030-29400-7_12Full textFull text of the publication as PDF document
More Hierarchy in Route Planning Using Edge Hierarchies
Hespe, D.; Sanders, P.
2019. 19th Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2019), München, 12.-13. September 2019, 10:1–10:14. doi:10.4230/OASIcs.ATMOS.2019.10
Sequential and Parallel Algorithms and Data Structures - The Basic Toolbox
Sanders, P.; Mehlhorn, K.; Dietzfelbinger, M.; Dementiev, R.
2019. Springer International Publishing. doi:10.1007/978-3-030-25209-0
Parallel Weighted Random Sampling
Hübschle-Schneider, L.; Sanders, P.
2019. 27th European Symposium on Algorithms, Munich/Garching, Germany, 9th - 11th September 2019. Hrsg.: M.A. Bender, Aritcle no: 59, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (LZI). doi:10.4230/LIPIcs.ESA.2019.59Full textFull text of the publication as PDF document
Concurrent hash tables: Fast and General(?)!
Maier, T.; Sanders, P.; Dementiev, R.
2019. ACM Transactions on Parallel Computing, 5 (4), Art. Nr.: a16. doi:10.1145/3309206
2018
Communication Efficient Checking of Big Data Operations
Hübschle-Schneider, L.; Sanders, P.
2018. 32nd IEEE International Parallel and Distributed Processing Symposium (IPDPS), Vancouver, BC, Canada, 21-25 May 2018, 650–659, Institute of Electrical and Electronics Engineers (IEEE). doi:10.1109/IPDPS.2018.00074Full textFull text of the publication as PDF document
Efficient Parallel Random Sampling : Vectorized, Cache-Efficient, and Online
Sanders, P.; Lamm, S.; Hübschle-Schneider, L.; Schrade, E.; Dachsbacher, C.
2018. ACM transactions on mathematical software, 44 (3), 29:1–29:14. doi:10.1145/3157734Full textFull text of the publication as PDF document
Real-Time Traffic Assignment Using Fast Queries in Customizable Contraction Hierarchies
Buchhold, V.; Sanders, P.; Wagner, D.
2018. Proceedings of the 17th International Symposium on Experimental Algorithms (SEA’18). Ed.: G. d’Angelo, Article no: 27, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (LZI). doi:10.4230/LIPIcs.SEA.2018.27Full textFull text of the publication as PDF document
Relational Equivalence Proofs Between Imperative and MapReduce Algorithms
Beckert, B.; Bingmann, T.; Kiefer, M.; Sanders, P.; Ulbrich, M.; Weigl, A.
2018. Verified Software: Theories, Tools, and Experiments; 10th International Conference, VSTTE 2018; Oxford, UK, July 18–19, 2018; Revised Selected Papers. Ed.: R. Piskac, 248–266, Springer Nature. doi:10.1007/978-3-030-03592-1_14
An equal opportunity concept for the coordinated research effort AESC
Koziolek, A.; Sanders, P.; Wagner, D.
2018. 12th European Conference on Software Architecture, ECSA 2018; Madrid; Spain; 24 September 2018 through 28 September 2018, Art. Nr.: a16, Association for Computing Machinery (ACM). doi:10.1145/3241403.3241421
Lightweight MPI communicators with applications to perfectly balanced quicksort
Axtmann, M.; Wiebigke, A.; Sanders, P.
2018. 32nd IEEE International Parallel and Distributed Processing Symposium, IPDPS 2018; Vancouver; Canada; 21 May 2018 through 25 May 2018, 254–265, Institute of Electrical and Electronics Engineers (IEEE). doi:10.1109/IPDPS.2018.00035Full textFull text of the publication as PDF document
Communication-free Massively Distributed Graph Generation
Funke, D.; Lamm, S.; Sanders, P.; Schulz, C.; Strash, D.; Looz, M. von
2018. 32nd IEEE International Parallel & Distributed Processing Symposium (IPDPS), Vancouver, BC, Canada, 21-25 May 2018, 336–347, Institute of Electrical and Electronics Engineers (IEEE). doi:10.1109/IPDPS.2018.00043
Network Flow-Based Refinement for Multilevel Hypergraph Partitioning
Heuer, T.; Sanders, P.; Schlag, S.
2018. 17th International Symposium on Experimental Algorithms (SEA), June 27-29, 2018, L’Aquila, Italy. Ed.: G. D’Angelo, 1:1–1:19, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (LZI). doi:10.4230/LIPIcs.SEA.2018.1
High-Quality Shared-Memory Graph Partitioning
Akhremtsev, Y.; Sanders, P.; Schulz, C.
2018. Euro-Par 2018: parallel processing : 24th International Conference on Parallel and Distributed Computing, Turin, Italy, August 27- 31, 2018. Ed.: M. Aldinucci, 659–671, Springer. doi:10.1007/978-3-319-96983-1_47
Proving equivalence between imperative and MapReduce implementations using program transformations
Beckert, B.; Bingmann, T.; Kiefer, M.; Sanders, P.; Ulbrich, M.; Weigl, A.
2018. 3rd Workshop on Models for Formal Analysis of Real Systems and 6th International Workshop on Verification and Program Transformation, MARSVPT 2018; Thessaloniki; Greece; 20 April 2018. Ed.: R. van Glabbeek, 185–199, Open Publishing Association. doi:10.4204/EPTCS.268.7Full textFull text of the publication as PDF document
Optimizing energy consumption and user experience in a mobile video streaming scenario
Breitbach, T.; Sanders, P.; Schultes, D.
2018. 15th IEEE Annual Consumer Communications and Networking Conference, CCNC 2018; Las Vegas; United States; 12 January 2018 through 15 January 2018, 1–9, Institute of Electrical and Electronics Engineers (IEEE). doi:10.1109/CCNC.2018.8319166
2017
A new framework for interactive knowledge discovery in large-scale trajectory data of zebrafish embryos
Schott, B.; Traub, M.; Antritter, T.; Schlagenhauf, C.; Takamiya, M.; Barschat, A.; Otte, J. C.; Kobitski, A.; Nienhaus, G. U.; Sanders, P.; Strähle, U.; Mikut, R.; Stegmaier, J.
2017. 10th European Zebrafish Meeting, Budapest, H, July 3-7, 2017 
Interactive knowledge discovery in large-scale trajectory data of zebrafish embryos
Schott, B.; Traub, M.; Antritter, T.; Schlagenhauf, C.; Takamiya, M.; Barschat, A.; Otte, J. C.; Kobitski, A.; Nienhaus, G. U.; Sanders, P.; Strähle, U.; Mikut, R.; Stegmaier, J.
2017. Seeing is Believing - Imaging the Processes of Life, EMBO/EMBL Symposium, Heidelberg, October 4-7, 2017 
Dynamic space efficient hashing
Maier, T.; Sanders, P.
2017. 25th European Symposium on Algorithms, Vienna, Austria, 4th - 6th September 2017, Art.Nr.: 58, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (LZI). doi:10.4230/LIPIcs.ESA.2017.58
In-Place Parallel Super Scalar Samplesort (IPSSSSo)
Axtmann, M.; Witt, S.; Ferizovic, D.; Sanders, P.
2017. 25th European Symposium on Algorithms : (ESA 2017) Vienna, Austria, September 4-6, 2017. Ed.: K. Pruhs, C. Sohler, Art.Nr. 9, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (LZI). doi:10.4230/LIPIcs.ESA.2017.9Full textFull text of the publication as PDF document
Parallel Graph Partitioning for Complex Networks
Meyerhenke, H.; Sanders, P.; Schulz, C.
2017. IEEE transactions on parallel and distributed systems, 28 (9), 2625–2638. doi:10.1109/TPDS.2017.2671868
Algorithm Engineering for Large Data Sets
Sanders, P.
2017. Helmholtz Portfolio Theme Large-Scale Data Management and Analysis (LSDMA). Ed.: C. Jung, 199–214, KIT Scientific Publishing 
Distributed Evolutionary k-way Node Separators
Sanders, P.; Strash, D.; Schulz, C.; Williger, R.
2017. GECCO ’17 : Proceedings of the Genetic and Evolutionary Computation Conference, Berlin, Germany, 15th - 19th July 2017, 345–352, Association for Computing Machinery (ACM). doi:10.1145/3071178.3071204
Finding near-optimal independent sets at scale
Lamm, S.; Sanders, P.; Schulz, C.; Strash, D.; Werneck, R. F.
2017. Journal of heuristics, 23 (4), 207–229. doi:10.1007/s10732-017-9337-x
Peppher : Performance Portability and Programmability for Heterogeneous Many-Core Architectures
Benkner, S.; Pllana, S.; Träff, J. L.; Tsigas, P.; Richards, A.; Russell, G.; Thibault, S.; Augonnet, C.; Namyst, R.; Cornelius, H.; Keler, C.; Moloney, D.; Sanders, P.
2017. Programming multi-core and many-core computing systems. Ed.: S. Pllana, 241–260, John Wiley and Sons. doi:10.1002/9781119332015.ch12
Engineering a distributed full-text index
Fischer, J.; Kurpicz, F.; Sanders, P.
2017. Proceedings of the Ninteenth Workshop on Algorithm Engineering and Experiments (ALENEX), Barcelona, E, January 17-18, 2017. Ed.: S. Fekete, 120–134, SIAM Publ 
Robust massively parallel sorting
Axtmann, M.; Sanders, P.
2017. Proceedings of the Ninteenth Workshop on Algorithm Engineering and Experiments (ALENEX), Barcelona, E, January 17-18, 2017. Ed.: S. Fekete, 83–97, SIAM Publ. doi:10.1137/1.9781611974768.7Full textFull text of the publication as PDF document
Engineering a direct k-way hypergraph partitioning algorithm
Akhremtsev, Y.; Heuer, T.; Sanders, P.; Schlag, S.
2017. Proceedings of the Ninteenth Workshop on Algorithm Engineering and Experiments (ALENEX), Barcelona, E, January 17-18, 2017. Ed.: S. Fekete, 28–42, SIAM Publ. doi:10.1137/1.9781611974768.3
Parallel d-D delaunay triangulations in shared and distributed memory
Funke, D.; Sanders, P.
2017. Proceedings of the Ninteenth Workshop on Algorithm Engineering and Experiments (ALENEX), Barcelona, E, January 17-18, 2017. Ed.: S. Fekete, 207–217, SIAM Publ. doi:10.1137/1.9781611974768.17
2016
Finding Near-Optimal Independent Sets at Scale
Lamm, S.; Sanders, P.; Schulz, C.; Strash, D.; Werneck, R. F.
2016. 2016 Proceedings of the Eighteenth Workshop on Algorithm Engineering and Experiments (ALENEX), Arlington, VA, January 10, 2016, 138–150, Society for Industrial and Applied Mathematics (SIAM). doi:10.1137/1.9781611974317.12
Thrill: High-performance algorithmic distributed batch data processing with C++
Bingmann, T.; Axtmann, M.; Jobstl, E.; Lamm, S.; Nguyen, H. C.; Noe, A.; Schlag, S.; Stumpp, M.; Sturm, T.; Sanders, P.
2016. IEEE International Conference on Big Data (Big Data), Washington DC, USA, 5–8 December 2016, 172–183, Institute of Electrical and Electronics Engineers (IEEE). doi:10.1109/BigData.2016.7840603Full textFull text of the publication as PDF document
Accelerating Local Search for the Maximum Independent Set Problem
Dahlum, J.; Lamm, S.; Sanders, P.; Schulz, C.; Strash, D.; Werneck, R. F.
2016. 15th International Symposium on Experimental Algorithms, SEA 2016; St. Petersburg; Russian Federation. Ed.: A. Goldberg, 118–133, Springer International Publishing. doi:10.1007/978-3-319-38851-9_9
Advanced Multilevel Node Separator Algorithms
Sanders, P.; Schulz, C.
2016. 15th International Symposium on Experimental Algorithms, SEA 2016; St. Petersburg; Russian Federation; 5 June 2016 through 8 June 2016. Ed.: A. V. Goldberg, 294–309, Springer International Publishing. doi:10.1007/978-3-319-38851-9_20
Communication Efficient Algorithms for Top-k Selection Problems
Hübschle-Schneider, L.; Sanders, P.
2016. 2016 IEEE International Parallel and Distributed Processing Symposium (IPDPS), Chicago, IL, USA, 23–27 May 2016, 659–668, Institute of Electrical and Electronics Engineers (IEEE). doi:10.1109/IPDPS.2016.45Full textFull text of the publication as PDF document
Fast Parallel Operations on Search Trees
Akhremtsev, Y.; Sanders, P.
2016. HiPC 2016, the 23rd IEEE International Conference on High Performance Computing, Data, and Analytics, Hyderabad, India, December, 19-22, 291–300, Institute of Electrical and Electronics Engineers (IEEE). doi:10.1109/HiPC.2016.042
Introduction to Special Issue ALENEX 2013
Zeh, N.; Sanders, P.
2016. Journal of experimental algorithmics - Special Issue (SEA), 21, 2.1. doi:10.1145/2966922
Scalable generation of scale-free graphs
Sanders, P.; Schulz, C.
2016. Information processing letters, 116 (7), 489–491. doi:10.1016/j.ipl.2016.02.004
K-way hypergraph partitioning via n-level recursive bisection
Schlag, S.; Henne, V.; Heuer, T.; Meyerhenke, H.; Sanders, P.; Schulz, C.
2016. Proceedings of the 18th Workshop on Algorithm Engineering and Experiments 2016, ALENEX 2016, Arlington, United States. Ed.: M. Goodrich, 53–67. doi:10.1137/1.9781611974317.5
Concurrent hash tables: Fast and general?(!)
Maier, T.; Sanders, P.; Dementiev, R.
2016. Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPOPP 2016, Barcelona, Art.Nr. 34, Association for Computing Machinery (ACM). doi:10.1145/2851141.2851188
2015
Recent Advances in Graph Partitioning. [Preprint]
Buluc, A.; Meyerhenke, H.; Safro, I.; Sanders, P.; Schulz, C.
2015. arXiv [cs.DS] : Data Structures and Algorithms, arXiv:1311.3144 
MultiQueues: Simple Relaxed Concurrent Priority Queues
Rihani, H.; Sanders, P.; Dementiev, R.
2015. SPAA ’15 Proceedings of the 27th ACM symposium on Parallelism in Algorithms and Architectures : Portland, United States; 13 June 2015 through 15 June 2015, 80–82, Association for Computing Machinery (ACM). doi:10.1145/2760000/2755616
Incorporating Road Networks into Territory Design
Ahuja, N.; Bender, M.; Sanders, P.; Schulz, C.; Wagner, A.
2015. GIS ’15 Proceedings of the 23rd SIGSPATIAL International Conference on Advances in Geographic Information Systems, Bellevue, WA, USA, November 03 - 06, 2015, Art.Nr.: 4, Association for Computing Machinery (ACM). doi:10.1145/2820783.2820800
Turbo für Graphdatenbanken: Graphpartitionierung mit KaHIP
Papenfuß, H.; Sanders, P.; Schulz, C.
2015. Java Spektrum, (1), 48–51 
Work-Efficient Matrix Inversion in Polylogarithmic Time
Sanders, P.; Speck, J.; Steffen, R.
2015. ACM Transactions on Parallel Computing - Special Issue for SPAA 2013, 2 (3), Art.Nr. 15. doi:10.1145/2809812
n-Level Hypergraph Partitioning. [Preprint]
Henne, V.; Meyerhenke, H.; Sanders, P.; Schlag, S.; Schulz, C.
2015. arXiv [cs.DS], arXiv:1505.00693 
Parallel Algorithms Reconsidered (Invited Talk)
Sanders, P.
2015. 32nd International Symposium on Theoretical Aspects of Computer Science, STACS 2015, March 4-7, 2015, Garching, Germany. Ed.: E.W. Mayr, 10–18, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (LZI). doi:10.4230/LIPIcs.STACS.2015.10
Faster Exact Search Using Document Clustering
Dimond, J.; Sanders, P.
2015. String Processing and Information Retrieval : 22nd International Symposium, SPIRE 2015, London, UK, September 1-4, 2015, Proceedings. Ed.: C. Iliopoulos, 141249, 12 S., Springer. doi:10.1007/978-3-319-23826-5_1
Practical Massively Parallel Sorting
Axtmann, M.; Bingmann, T.; Sanders, P.; Schulz, C.
2015. Proceedings of the 27th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2015, Portland, OR, USA, June 13-15, 2015, 13–23, Association for Computing Machinery (ACM). doi:10.1145/2755573.2755595Full textFull text of the publication as PDF document
Cache-Efficient Aggregation: Hashing Is Sorting
Müller, I.; Sanders, P.; Lacurie, A.; Lehner, W.; Färber, F.
2015. Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data, Melbourne, Victoria, Australia, May 31 - June 4, 2015, 1123–1136, Association for Computing Machinery (ACM). doi:10.1145/2723372.2747644
Graph Partitioning for Independent Sets
Lamm, S.; Sanders, P.; Schulz, C.
2015. Experimental Algorithms : 14th International Symposium, SEA 2015, Paris, France, June 29 – July 1, 2015, Proceedings. Ed.: E. Bampis, 68–81, Springer. doi:10.1007/978-3-319-20086-6_6
Parallel Graph Partitioning for Complex Networks
Meyerhenke, H.; Sanders, P.; Schulz, C.
2015. 2015 IEEE International Parallel and Distributed Processing Symposium, IPDPS 2015, Hyderabad, India, May 25-29, 2015, 1055–1064. doi:10.1109/IPDPS.2015.18
Locality Aware DAG-Scheduling for LU-Decomposition
Maier, T.; Sanders, P.; Speck, J.
2015. 2015 IEEE International Parallel and Distributed Processing Symposium, IPDPS 2015, Hyderabad, India, May 25-29, 2015, 82–92, Institute of Electrical and Electronics Engineers (IEEE). doi:10.1109/IPDPS.2015.85
(Semi-)External Algorithms for Graph Partitioning and Clustering
Akhremtsev, Y.; Sanders, P.; Schulz, C.
2015. Proceedings of the Seventeenth Workshop on Algorithm Engineering and Experiments, ALENEX 2015, San Diego, CA, USA, January 5, 2015. Ed.: U. Brandes, 33–43. doi:10.1137/1.9781611973754.4
A Bulk-Parallel Priority Queue in External Memory with STXXL
Bingmann, T.; Keh, T.; Sanders, P.
2015. Experimental Algorithms : 14th International Symposium, SEA 2015, Paris, France, June 29 – July 1, 2015, Proceedings. Ed.: E. Bampis, 28–40, Springer. doi:10.1007/978-3-319-20086-6_3Full textFull text of the publication as PDF document
2014
Benchmarking for Graph Clustering and Partitioning
Bader, D. A.; Meyerhenke, H.; Sanders, P.; Schulz, C.; Kappes, A.; Wagner, D.
2014. Encyclopedia of Social Network Analysis and Mining. Ed.: Prof. R. Alhajj, 73–82, Springer Verlag. doi:10.1007/978-1-4614-6170-8_23
Partitioning Complex Networks via Size-Constrained Clustering
Meyerhenke, H.; Sanders, P.; Schulz, C.
2014. Experimental Algorithms - 13th International Symposium (SEA’14), Copenhagen, Denmark, June 29 - July 1, 2014. Ed.: J. Gudmundsson, 351–363, Springer US. doi:10.1007/978-3-319-07959-2_30
Retrieval and Perfect Hashing Using Fingerprinting
Müller, I.; Sanders, P.; Schulze, R.; Zhou, W.
2014. Experimental Algorithms - 13th International Symposium (SEA’14), Copenhagen, Denmark, June 29 - July 1, 2014. Ed.: J. Gudmundsson, 138–149, Springer US. doi:10.1007/978-3-319-07959-2_12Full textFull text of the publication as PDF document
STXXL 1.4.0 and Beyond
Bingmann, T.; Sanders, P.
2014. Large-Scale Data Management and Analysis (LSDMA) - Big Data in Science. Hrsg.: Ch. Jung, 31, Karlsruher Institut für Technologie (KIT) 
KaHIP - Karlsruhe High Quality Partitioning
Akhremtsev, Y.; Sanders, P.; Schlag, S.; Schulz, C.
2014. Large-Scale Data Management and Analysis (LSDMA) - Big Data in Science. Hrsg.: Ch. Jung, 8, Karlsruher Institut für Technologie (KIT) 
2013
Communication efficient algorithms for fundamental big data problems
Sanders, P.; Schlag, S.; Muller, I.
2013. Proceedings of the 2013 IEEE International Conference on Big Data, Santa Clara, CA, October 6-9, 2013, 15–23, Institute of Electrical and Electronics Engineers (IEEE). doi:10.1109/BigData.2013.6691549
Malleable Sorting
Flick, P.; Sanders, P.; Speck, J.
2013. 27th IEEE International Parallel and Distributed Processing Symposium (IPDPS 2013), Boston, MA, May 20-24, 2013, 418–426, Institute of Electrical and Electronics Engineers (IEEE). doi:10.1109/IPDPS.2013.90Full textFull text of the publication as PDF document
Minimum time-dependent travel times with contraction hierarchies
Batz, G. V.; Geisberger, R.; Sanders, P.; Vetter, C.
2013. Journal of experimental algorithmics, 18 (1), Article no: 1.4. doi:10.1145/2444016.2444020Full textFull text of the publication as PDF document
Efficient Parallel and External Matching
Birn, M.; Osipov, V.; Sanders, P.; Schulz, C.; Sitchinava, N.
2013. Euro-Par 2013 - Parallel Processing. Ed.: F. Wolf, 659–670, Springer Verlag. doi:10.1007/978-3-642-40047-6_66
Work-efficient matrix inversion in polylogarithmic time
Sanders, P.; Speck, J.; Steffen, R.
2013. SPAA’13 : proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures$dJuly 23 - 25, 2013, Montréal, Québec, Canada, 214–221, Association for Computing Machinery (ACM). doi:10.1145/2486159.2486173
Transit Node Routing Reconsidered
Arz, J.; Luxen, D.; Sanders, P.
2013. Experimental algorithms : 12th international symposium ; proceedings, SEA 2013, Rome, Italy, June 5 - 7, 2013. Ed.: V. Bonifaci, 55–66, Springer Verlag. doi:10.1007/978-3-642-38527-8_7
Parallel String Sample Sort
Bingmann, T.; Sanders, P.
2013. Algorithms - 21st Annual European Symposium (ESA’13), Sophia Antipolis, France, September 2-4, 2013 - Proceedings. Ed.: H.L. Bodlaender, 169–180, Springer Verlag. doi:10.1007/978-3-642-40450-4_15Full textFull text of the publication as PDF document
Think Locally, Act Globally: Highly Balanced Graph Partitioning
Sanders, P.; Schulz, C.
2013. Experimental algorithms : 12th international symposium ; proceedings, SEA 2013, Rome, Italy, June 5 - 7, 2013. Ed.: V. Bonifaci, 164–175, Springer Verlag. doi:10.1007/978-3-642-38527-8_16
Efficient many-core query execution in main memory column-stores
Dees, J.; Sanders, P.
2013. IEEE 29th International Conference on Data Engineering (ICDE), 2013 : 8 - 12 April 2013, Brisbane, Australia ; proceedings. Ed.: Ch. S. Jensen, Institute of Electrical and Electronics Engineers (IEEE). doi:10.1109/ICDE.2013.6544838
2012
Engineering highway hierarchies
Sanders, P.; Schultes, D.
2012. Journal of experimental algorithmics, 17 (1), Article no: 1.6. doi:10.1145/2133803.2330080Full textFull text of the publication as PDF document
Distributed Evolutionary Graph Partitioning
Sanders, P.; Schulz, C.
2012. 2012 Proceedings of the Fourteenth Workshop on Algorithm Engineering and Experiments (ALENEX). Ed.: D. Bader, 16–29, Society for Industrial and Applied Mathematics. doi:10.1137/1.9781611972924.2
Advanced Coarsening Schemes for Graph Partitioning
Safro, I.; Sanders, P.; Schulz, C.
2012. Experimental Algorithms. Ed.: R. Klasing, 369–380, Springer Verlag. doi:10.1007/978-3-642-30850-5_32
Engineering Graph Partitioning Algorithms
Osipov, V.; Sanders, P.; Schulz, C.
2012. Experimental Algorithms. Ed.: R. Klasing, 18–26, Springer Verlag. doi:10.1007/978-3-642-30850-5_3
Energy Efficient Frequency Scaling and Scheduling for Malleable Tasks
Sanders, P.; Speck, J.
2012. Euro-Par 2012 Parallel Processing. 18th International Conference, Euro-Par 2012, Rhodes Island, Greece, August 27-31, 2012. Proceedings. Ed.: C. Kaklamanis, 167–178, Springer Verlag. doi:10.1007/978-3-642-32820-6_18Full textFull text of the publication as PDF document
Time-Dependent Route Planning with Generalized Objective Functions
Batz, G. V.; Sanders, P.
2012. Algorithms - ESA 2012. Ed.: L. Epstein, 169–180, Springer Verlag. doi:10.1007/978-3-642-33090-2_16
Efficient Route Compression for Hybrid Route Planning
Batz, G. V.; Geisberger, R.; Luxen, D.; Sanders, P.; Zubkov, R.
2012. Design and analysis of algorithms: 1st Mediterranean Conference on Algorithms. Ed.: G. Even, 93–107, Springer Verlag. doi:10.1007/978-3-642-34862-4_7
Optimized Hybrid Parallel Lattice Boltzmann Fluid Flow Simulations on Complex Geometries
Fietz, J.; Krause, M. J.; Schulz, C.; Sanders, P.; Heuveline, V.
2012. Euro-Par 2012 parallel processing : 18th International Conference, Euro-Par 2012, Rhodes Islands, Greece, August 27-31, 2012. Ed.: Ch. Kaklamanis, 818–829, Springer Verlag. doi:10.1007/978-3-642-32820-6_81
2011
Algorithm Engineering for Scalable Parallel External Sorting
Sanders, P.
2011. IEEE International Parallel and Distributed Processing Symposium (IPDPS), Anchorage, AK, May 16-20, May 2011, 1, Institute of Electrical and Electronics Engineers (IEEE). doi:10.1109/IPDPS.2011.418Full textFull text of the publication as PDF document
Alternative Route Graphs in Road Networks
Bader, R.; Dees, J.; Geisberger, R.; Sanders, P.
2011. Theory and Practice of Algorithms in (Computer) Systems – 1st International ICST Conference (TAPAS 2011), Rome, I, April 18-20, 2011. Proceedings. Ed.: A. Marchetti-Spaccamela, 21–32, Springer Verlag. doi:10.1007/978-3-642-19754-3_5
Engineering Multilevel Graph Partitioning Algorithms
Sanders, P.; Schulz, C.
2011. Algorithms – ESA 2011. 19th Annual European Symposium, Saarbrücken, Germany, September 5-9, 2011. Proceedings. Ed.: C. Demetrescu, 469–480, Springer Verlag. doi:10.1007/978-3-642-23719-5_40
Engineering a Multi-core Radix Sort
Wassenberg, J.; Sanders, P.
2011. Euro-Par 2011 Parallel Processing : 17th International Euro-ParConference, Bordeaux, France, August 29 - September 2, 2011, proceedings. Teil: 2. Ed.: E. Jeannot, 160–169, Springer Verlag. doi:10.1007/978-3-642-23397-5_16
Efficient Parallel Scheduling of Malleable Tasks
Sanders, P.; Speck, J.
2011. Proceedings 25th IEEE International Parallel & Distributed Processing Symposium (IPDPS 2011), May 16-20, 2011, Anchorage, AK. Ed.: F. Mueller, 1156–1166, Institute of Electrical and Electronics Engineers (IEEE) Full textFull text of the publication as PDF document
Hierarchy Decomposition for Faster User Equilibria on Road Networks
Luxen, D.; Sanders, P.
2011. Experimental Algorithms. Ed.: P. M. Pardalos, 242–253, Springer Verlag Full textFull text of the publication as PDF document
Engineering efficient error-correcting geocoding
Jung, C.; Karch, D.; Knopp, S.; Luxen, D.; Sanders, P.
2011. Proceedings of the 19th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, November 1-4 2011, Chicago, Illinois. Ed.: I.Cruz, 469–472, Association for Computing Machinery (ACM) Full textFull text of the publication as PDF document
Energy-efficient paths in radio networks
Beier, R.; Funke, S.; Matijevic, D.; Sanders, P.
2011. Algorithmica, 61 (2), 298–319. doi:10.1007/s00453-010-9414-0
Stronger Quickheaps
Navarro, G.; Paredes, R.; v. Poblete, P.; Sanders, P.
2011. International Journal of Foundations of Computer Science (IJFCS), 22 (4), 945–969 
Shortest Paths
Sanders, P.; Singler, J.
2011. Algorithms unplugged. Ed.: B. Vöcking, 317–324, Springer Verlag 
Engineering State-of-the-Art Graph Partitioning Libraries @KIT
Osipov, V.; Sanders, P.; Schulz, C.; Holtgrewe, M.
2011. Computational Methods in Science and Engineering - Proceedings of the Workshop SimLabs@KIT, November 29 - 30, 2010, Karlsruhe, Germany. Ed.: I. Kondov, 117–130, KIT Scientific Publishing 
Efficient Error-Correcting Geocoding
Jung, C.; Karch, D.; Knopp, S.; Luxen, D.; Sanders, P.
2011. GIS ’11 Proceedings of the 19th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems. Ed.: D. Agrawal, 469–472, Association for Computing Machinery (ACM). doi:10.1145/2093973.2094050Full textFull text of the publication as PDF document
2010
Compressed Transmission of Route Descriptions
Batz, G. V.; Geisberger, R.; Luxen, D.; Sanders, P.
2010 
Fast Detour Computation for Ride Sharing
Geisberger, R.; Luxen, D.; Neubauer, S.; Sanders, P.; Volker, L.
2010. 10th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS’10), Liverpool, GB, September 9, 2010. Ed.: T. Erlebach, 88–99, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (LZI). doi:10.4230/OASIcs.ATMOS.2010.88Full textFull text of the publication as PDF document
Engineering Time-Dependent Many-to-Many Shortest Paths Computation
Geisberger, R.; Sanders, P.
2010. 10th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS’10) Hrsg.: Thomas Erlebach; Marco Lübbecke, 74–87, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (LZI). doi:10.4230/OASIcs.ATMOS.2010.74Full textFull text of the publication as PDF document
Improved Fast Similarity Search in Dictionaries
Karch, D.; Luxen, D.; Sanders, P.
2010. String Processing and Information Retrieval 17th International Symposium, SPIRE 2010, Los Cabos, Mexico, October 11-13, 2010. Proceedings. Ed.: E. Chavez, 173–178, Springer Verlag 
Route Planning with Flexible Objective Functions
Geisberger, R.; Kobitzsch, M.; Sanders, P.
2010. Proceedings of the Twelfth Workshop on Algorithm Engineering and Experiments, ALENEX 2010, Austin, Texas, USA, January 16, 2010. Ed.: G. E. Blelloch, 124–137, SIAM 
Combining Hierarchical and Goal-Directed Speed-Up Techniques for Dijkstra`s Algorithm
Bauer, R.; Delling, D.; Sanders, P.; Schieferdecker, D.; Schultes, D.; Wagner, D.
2010. Journal of experimental algorithmics, 15, 1–30 
Simple and Fast Nearest Neighbor Search
Birn, M.; Holtgrewe, M.; Sanders, P.; Singler, J.
2010. Workshop on Algorithm Engineering and Experiments 2010 (ALENEX10), Austin, Texas, USA, 16 January 2010, 43–54, Curran 
Scalable Distributed-Memory External Sorting
Rahn, M.; Sanders, P.; Singler, J.
2010. 2010 IEEE 26th International Conference on Data Engineering (ICDE 2010), Long Beach, California, USA, 1 - 6 March 2010. Ed.: F. Li, 685–688, Institute of Electrical and Electronics Engineers (IEEE) 
GPU Sample Sort
Leischner, N.; Osipov, V.; Sanders, P.
2010. 2010 IEEE International Symposium on Parallel & Distributed Processing (IPDPS 2010), Atlanta, Georgia, USA, 19 - 23 April 2010. Ed.: D. A. Bader, 05470444/1–10, Institute of Electrical and Electronics Engineers (IEEE) 
Time-Dependent Contraction Hierarchies and Approximation
Batz, G. V.; Geisberger, R.; Neubauer, S.; Sanders, P.
2010. Experimental algorithms: Proceedings of the 9th International Symposium, SEA 2010, Ischia Island, Naples, Italy, May 20-22, 2010. Ed.: P. Festa, 166–177, Springer Verlag 
Distributed Time-Dependent Contraction Hierarchies
Kieritz, T.; Luxen, D.; Sanders, P.; Vetter, C.
2010. Experimental algorithms: Proceedings of the 9th International Symposium (SEA 2010), Ischia Island, Naples, Italy, May 20-22, 2010. Ed.: P. Festa, 94–105, Springer Verlag 
Energy-Efficient Sorting using Solid State Disks
Beckmann, A.; Meyer, U.; Sanders, P.; Singler, J.
2010. 2010 International Green Computing Conference, Chicago, Illinois, USA, 15 - 18 August 2010, 191–202, Institute of Electrical and Electronics Engineers (IEEE) 
n-Level Graph Partitioning
Osipov, V.; Sanders, P.
2010. Algorithms - ESA 2010: Proceedings of the 18th Annual European Symposium, Liverpool, UK, September 6-8, 2010, Part I. Ed.: M. d. Berg, 278–289, Springer Verlag 
Energy-Efficient Sorting using Solid State Disks
Beckmann, A.; Meyer, U.; Sanders, P.; Singler, J.
2010. Sustainable Computing: Informatics and Systems, 1 (2), 151–163. doi:10.1016/j.suscom.2011.02.004
Lifetime Maximization of Monitoring Sensor Networks
Schieferdecker, D.; Sanders, P.
2010. Algorithms for Sensor Systems - 6th International Workshop on Algorithms for Sensor Systems, Wireless Ad Hoc Networks, and Autonomous Mobile Entities, ALGOSENSORS 2010, Bordeaux, France, July 5, 2010; Revised Selected Papers. Ed.: Ch. Scheideler, 134–147, Springer Verlag Full textFull text of the publication as PDF document
2009
Goal directed shortest path queries using Precomputed Cluster Distances
Maue, J.; Sanders, P.; Matijevic, D.
2009. Journal of Experimental Algorithmics, 14, 1–27 
The Filter-Kruskal Minimum Spanning Tree Algorithm
Osipov, V.; Sanders, P.; Singler, J.
2009. 11th Workshop on Algorithm Engineering and Experiments and 6th Workshop on Analytic Algorithms and Combinatorics (ALENEX 09/ANALCO 09), New York, New York, USA, 3 January 2009, 52–61, Curran 
An Efficient Parallel Algorithm for Graph-Based Image Segmentation
Wassenberg, J.; Middelmann, W.; Sanders, P.
2009. Computer analysis of images and patterns: Proceedings of the 13th International Conference (CAIP 2009), Münster, Germany, September 2-4, 2009. Ed.: X. Jiang, 1003–1010, Springer Verlag 
Towards Optimal Range Medians
Gfeller, B.; Sanders, P.
2009. Automata, languages and programming: Proceedings of the 36th International Colloquium, ICALP 2009, Rhodes, Greece, July 5 - 12, 2009. Ed.: S. Albers, 475–486, Springer Verlag 
Two-tree algorithms for full bandwidth broadcast, reduction and scan
Sanders, P.; Speck, J.; Larsson Träff, J.
2009. Parallel Computing, 35 (12), 581–594 
Cache-, Hash- and Space-Efficient Bloom Filters
Putze, F.; Sanders, P.; Singler, J.
2009. ACM Journal of Experimental Algorithmics, 14, 4.4/1–18 
Online Scheduling with Bounded Migration
Sanders, P.; Sivadasan, N.; Skutella, M.
2009. Mathematics of Operations Research, 34 (2), 481–498 
Algorithm Engineering - An Attempt at a Definition
Sanders, P.
2009. Efficient algorithms: essays dedicated to Kurt Mehlhorn on the occasion of his 60th birthday. Ed.: S. Albers, 321–340, Springer Verlag 
Highway Hierarchies Star
Delling, D.; Sanders, P.; Schultes, D.; Wagner, D.
2009. The Shortest Path Problem - 9th DIMACS Implementation Challenge. Ed.: C. Demetrescu, 141–174, American Mathematical Society 
Engineering Route Planning Algorithms
Delling, D.; Sanders, P.; Schultes, D.; Wagner, D.
2009. Algorithmics of Large and Complex Networks. Ed.: J. Lerner, 117–139, Springer Verlag 
Time-Dependent Contraction Hierarchies
Batz, V.; Delling, D.; Sanders, P.; Vetter, C.
2009. Proceedings of the 11th Workshop on Algorithm Engineering and Experiments (ALENEX’09), January 3, 2009 New York, 97–105, SIAM 
Fast Detour Computation for Ride Sharing
Geisberger, R.; Luxen, D.; Neubauer, S.; Sanders, P.; Volker, L.
2009. Universität Karlsruhe (TH) Full textFull text of the publication as PDF document
2008
Mobile Route Planning
Sanders, P.; Schultes, D.; Vetter, C.
2008. Algorithms - ESA 2008. Proceedings of the 16th annual European symposium, Karlsruhe, Germany, September 15-17, 2008. Ed.: D. Halperin, 732–743, Springer Verlag 
Semi-external LTL model checking
Edelkamp, S.; Sanders, P.; Simecek, P.
2008. Computer aided verification: Proceedings of the 20th International Conference (CAV 2008), Princeton, NJ, USA, July 7-14, 2008. Ed.: A. Gupta, 530–542, Springer Verlag 
Out of the Box Phrase Indexing
Transier, F.; Sanders, P.
2008. String processing and information retrieval: Proceedings of the 15th International Symposium (SPIRE 2008), Melbourne, Australia, November 10-12, 2008. Ed.: A. Amir, 200–211, Springer Verlag 
Single-Pass List Partitioning
Frias, L.; Singler, J.; Sanders, P.
2008. Scalable Computing: Practice and Experience, 9 (3), 179–184 
Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks
Geisberger, R.; Sanders, P.; Schultes, D.; Delling, D.
2008. Experimental Algorithms. 7th International Workshop, WEA 2008, Provincetown, MA, USA, May 30 - June 1, 2008, proceedings. Ed.: C.C. McGeoch, 319–333, Springer Verlag. doi:10.1007/978-3-540-68552-4_24
Combining Hierarchical and Goal-Directed Speed-Up Techniques for Dijkstra’s Algorithm
Bauer, R.; Delling, D.; Sanders, P.; Schieferdecker, D.; Schultes, D.; Wagner, D.
2008. Experimental Algorithms. 7th International Workshop, WEA 2008, Provincetown, MA, USA, May 30 - June 1, 2008. proceedings Ed.: C.C. McGeoch, 303–318, Springer Verlag Full textFull text of the publication as PDF document
An asymptotic approximation scheme for multigraph edge coloring
Sanders, P.; Steurer, D.
2008. ACM Transactions on Algorithms (TALG), 4 (2), 897–906 
Intersection in integer inverted indices
Sanders, P.; Transier, F.
2008. Proceedings of the Ninth Workshop on Algorithm Engineering and Experiments (ALENEX) 2007, New Orleans, Louisiana, USA, January 6, 2007, 71–83, SIAM 
Computing many-to-many shortest paths using highway hierarchies
Knopp, S.; Sanders, P.; Schultes, D.; Schulz, F.; Wagner, D.
2008. Proceedings of the Ninth Workshop on Algorithm Engineering and Experiments (ALENEX) 2007, New Orleans, Louisiana, USA, January 6, 2007, 36–45, SIAM 
In transit to constant time shortest-path queries in road networks
Bast, H.; Funke, S.; Matijevic, D.; Sanders, P.; Schultes, D.
2008. Proceedings of the Ninth Workshop on Algorithm Engineering and Experiments (ALENEX) 2007, New Orleans, Louisiana, USA, January 6, 2007, 46–59, SIAM 
Compressed inverted indexes for in-memory search engines
Transier, F.; Sanders, P.
2008. 2008 Proceedings of the Ninth Workshop on Algorithm Engineering and Experiments (ALENEX), San Francisco, Ca., USA, January 19, 2008, SIAM 
Better approximation of betweenness centrality
Geisberger, R.; Sanders, P.; Schultes, D.
2008. 2008 Proceedings of the Ninth Workshop on Algorithm Engineering and Experiments (ALENEX), San Francisco, Ca., USA, January 19, 2008, SIAM 
Single-pass list partitioning
Frias, L.; Singler, J.; Sanders, P.
2008. International Workshop on Multi-Core Computing Systems (MuCoCoS’08), Barcelona, Spain, March 7, 2008, Barcelona 
STXXL: Standard template library for XXL data sets
Dementiev, R.; Kettner, L.; Sanders, P.
2008. Software - practice and experience, 38 (6), 589–638 
Better external memory suffix array construction
Dementiev, R.; Kärkkäinen, J.; Mehnert, J.; Sanders, P.
2008. Journal of experimental algorithmics, 12 (June), Art. No. 3.4 Full textFull text of the publication as PDF document
Kürzeste Wege
Sanders, P.; Singler, J.
2008. Taschenbuch der Algorithmen, Hrsg.: B. Vöcking, 345–352, Springer Verlag 
Time Dependent Contraction Hierarchies - Basic Algorithmic Ideas
Batz, G. V.; Geisberger, R.; Sanders, P.
2008. Universität Karlsruhe (TH) 
2007
Computing Many-to-Many Shortest Paths Using Highway Hierarchies
Knopp, S.; Sanders, P.; Schultes, D.; Schulz, F.; Wagner, D.
2007. Proceedings of the 9th Workshop on Algorithm Engineering and Experiments (ALENEX 2007) and the Fourth Workshop on Analytic Algorithmics and Combinatorics, January 6, 2007, New Orleans, Louisana. Ed.: D. Applegate, 36–45, SIAM 
Scalable parallel suffix array construction
Kulla, F.; Sanders, P.
2007. High Performance Computing in Science and Engineering ’06. Transactions of the High Performance Computing Center Stuttgart (HLRS) 2006., 22–29, Springer Verlag 
The random graph threshold for k-orientability and a fast algorithm for optimal multiple-choice allocation
Cain, J. A.; Sanders, P.; Wormald, N.
2007. Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, New Orleans, LA, USA, January 7-9, 2007., Association for Computing Machinery (ACM) 
MCSTL: the multi-core standard template library
Putze, F.; Sanders, P.; Singler, J.
2007. Proceedings of the 2007 ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP ’07), March 14 - 17, 2007, San Jose, California, USA, 144–145, Association for Computing Machinery (ACM) 
Engineering algorithms for approximate weighted matching
Maue, J.; Sanders, P.
2007. Experimental Algorithms. 6th International Workshop, WEA 2007, Rome, Italy, June 6-8, 2007. Proceedings., 242–255, Springer Verlag 
Cache-, hash- and space efficient bloom filters
Putze, F.; Sanders, P.; Singler, J.
2007. Experimental algorithms - 6th International Workshop (WEA 2007), June 6 - 8 2007, Rome, Italy. Ed.: C. Demetrescu, 108–121, Springer Verlag 
Engineering fast route planning algorithms
Sanders, P.; Schultes, D.
2007. Experimental algorithms - 6th International Workshop (WEA 2007), June 6 - 8 2007, Rome, Italy. Ed.: C. Demetrescu, 23–36, Springer Verlag 
Dynamic highway-node routing
Schultes, D.; Sanders, P.
2007. Experimental algorithms - 6th International Workshop (WEA 2007), June 6 - 8 2007, Rome, Italy. Ed.: C. Demetrescu, 66–79, Springer Verlag 
MCSTL: The multi-core standard template library
Singler, J.; Sanders, P.; Putze, F.
2007. Euro-Par 2007, parallel processing. 13th International Euro-Par Conference, Rennes, France, August 28 - 31, 2007. Hrsg.: A.-M.edingsKermarrec, 682–694, Springer Verlag 
Full bandwidth broadcast, reduction and scan with only two trees
Sanders, P.; Speck, J.; Träff, J. L.
2007. Recent advances in parallel virtual machine and message passing interface. 14th European PVM/MPI User’s Group Meeting, Paris, France, September 30 - October 3, 2007. Hrsg.: F. Cappello, 17–26, Springer Verlag 
Scalable parallel suffix array construction
Kulla, F.; Sanders, P.
2007. Parallel computing, 33 (9), 605–612. doi:10.1016/j.parco.2007.06.004
Fast routing in road networks with transit nodes
Bast, H.; Funke, S.; Sanders, P.; Schultes, D.
2007. Science, 316 (5824), 566 
2006
Scalable Parallel Suffix Array Construction
Kulla, F.; Sanders, P.
2006. Recent Advances in Parallel Virtual Machine and Message Passing Interface. Ed.: B. Mohr, 22–29, Springer Verlag. doi:10.1007/11846802_12
Goal directed shortest path queries using precomputed cluster distances
Maue, J.; Sanders, P.; Matijevic, D.
2006. Experimental Algorithms. 5th International Workshop, WEA 2006, Cala Galdana, Menorca, Spain, May 24-27, 2006. Proceedings., 316–327, Springer Verlag Full textFull text of the publication as PDF document
How branch mispredictions affect quicksort
Kaligosi, K.; Sanders, P.
2006. Algorithms – ESA 2006. 14th Annual European Symposium, Zurich, Switzerland, September 11-13, 2006. Proceedings., 780–791, Springer Verlag 
Engineering and applications track - engineering highway hierarchies
Sanders, P.; Schultes, D.
2006. Proceedings / Algorithms - ESA 2006, 14th Annual European Symposium, September 11 - 13, 2006, Zurich, Switzerland. Ed.: Y. Azar, 804–816, Springer Verlag 
Collective communication - parallel prefix (scan) algorithms for MPI
Sanders, P.; Träff, J. L.; Larsson, J.
2006. Proceedings / Recent advances in parallel virtual machine and message passing interface - 13th European PVM/MPI User’s Group Meeting, September 17 - 20, 2006, Bonn, Germany. Ed.: B. Mohr, 49–57, Springer Verlag 
Linear work suffix array construction
Kärkkäinen, J.; Sanders, P.; Burkhardt, S.
2006. Journal of the ACM, 53 (6), 1–19 
2005
Better External Memory Suffix Array Construction
Dementiev, R.; Kärkkäinen, J.; Mehnert, J.; Sanders, P.
2005. Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments and the Second Workshop on Analytic Algorithmics and Combinatorics, ALENEX /ANALCO 2005, Vancouver, BC, Canada, 22 January 2005. Ed.: C. Demetrescu ., 86–97, SIAM 
Highway hierarchies hasten exact shortest path queries
Sanders, P.; Schultes, D.
2005. Proceedings / Algorithms - 13th Annual European Symposium (ESA 2005), October 3 - 6, 2005, Palma de Mallorca, Spain. Ed.: G. S. Brodal, 568–579, Springer Verlag 
Towards optimal multiple selection
Kaligosi, K.; Mehlhorn, K.; Munro, J.; Sanders, P.
2005. Automata, Languages and Programming. 32nd International Colloquium, ICALP 2005, Lisbon, Portugal, July 11-15, 2005. Proceedings., 103–114, Springer Verlag 
An asymptotic approximation scheme for multigraph edge coloring
Sanders, P.; Steurer, D.
2005. Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms, January 23 - 25, 2005, Vancouver, 897–906, Association for Computing Machinery (ACM) 
STXXL: Standard template library for XXL data sets
Dementiev, R.; Kettner, L.; Sanders, P.
2005. Algorithms - ESA 2005: 13th Annual European Symposium, Palma de Mallorca, Spain, October 3-6, 2005. Hrgs.: G.S. Brodal, 640–651, Springer Verlag 
Space efficient hash tables with worst case constant access time
Fotakis, D.; Pagh, R.; Sanders, P.; Spirakis, P.
2005. Theory of computing systems, 38 (2), 229–248 
Duality between prefetching and queued writing with parallel disks
Hutchinson, D. A.; Sanders, P.; Vitter, J. S.
2005. SIAM Journal on computing, 34 (6), 1443–1463 
Polynomial time algorithms for multicast network code construction
Jaggi, S.; Sanders, P.; Chou, P. A.; Effros, M.; Egner, S.; Jain, K.; Tolhuizen, L. M. G. M.
2005. IEEE Transactions on information theory, 51 (6), 1973–1982 
2004
Engineering an External Memory Minimum Spanning Tree Algorithm
Dementiev, R.; Sanders, P.; Schultes, D.; Sibeyn, J. F.
2004. Exploring New Frontiers of Theoretical Informatics: IFIP 18th World Computer Congress, TC1 3rd International Conference on Theoretical Computer Science (TCS2004), 22-27 August 2004, Toulouse, France. Hrsg.: J.-J. Lévy, 195–208, Springer. doi:10.1007/1-4020-8141-3_17
1998
Tree Shaped Computations as a Model for Parallel Applications
Sanders, P.
1998. Workshop on Application Based Load Balancing (ALV ’98), München, 25. - 26. März 1998 - Veranst. vom Sonderforschungsbereich 342 "Werkzeuge und Methoden für die Nutzung paralleler Rechnerarchitekturen". Ed.: A. Bode, 123–132, Technische Universität Full textFull text of the publication as PDF document
1996
On the Competitive Analysis of Randomized Static Load Balancing
Sanders, P.
1996. Proceedings of the First Workshop on Randomized Parallel Algorithms, Honolulu, Hawaii, 16th April 1996. Ed.: S. Rajasekaran, 1–8 Full textFull text of the publication as PDF document