Institute of Theoretical Informatics, Algorithmics II

Prof. Dr. rer. nat. Peter Sanders

Office Hours:
Tuesdays 13.45 to 14.45 pm
Room: 217
Phone: +49 721 608-47580
Fax: +49 721 608-43088
sandersMxo4∂kit edu

Karlsruher Institut für Technologie
Fakultät für InformatikPostfach 6980
76128 Karlsruhe

Besucheradresse:
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

DFG Priority Program Algorithms for BIG DATA with subprojects on
Graph Partitioning
Massive Text Indices
DFG Priority Program Algorithm Engineering (finished)
DFG Project Algorithm Engineering for Route Planning (finished)
DFG Project Algorithm Engineering for Large Graphs (finished)

Software

selected older programs

Teaching

current

Publications

2020

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, Saarbrücken/Wadern. doi:10.4230/LIPIcs.SEA.2020.15

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, ACM, New York, NY. doi:10.1145/3350755.3400287

Linear work generation of R-MAT graphs.
Hübschle-Schneider, L.; Sanders, P.
2020. Network science. doi:10.1017/nws.2020.21

2019

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, ACM Press, New York, NY. doi:10.1145/3347146.3359361

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

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, Cham, CH. doi:10.1007/978-3-030-29400-7_12

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

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

Sequential and Parallel Algorithms and Data Structures - The Basic Toolbox.
Sanders, P.; Mehlhorn, K.; Dietzfelbinger, M.; Dementiev, R.
2019. Springer International Publishing, Berlin. 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, Leibniz-Zentrum für Informatik, Wadern. doi:10.4230/LIPIcs.ESA.2019.59

Dynamic Space Efficient Hashing.
Maier, T.; Sanders, P.; Walzer, S.
2019. Algorithmica, 81 (8), 3162–3185. doi:10.1007/s00453-019-00572-x

Communication-free massively distributed graph generation.
Funke, D.; Lamm, S.; Meyer, U.; Penschuck, M.; Sanders, P.; Schulz, C.; Strash, D.; von Looz, M.
2019. Journal of parallel and distributed computing, 131, 200–217. doi:10.1016/j.jpdc.2019.03.011

Novel Parallel Algorithms for Fast Multi-GPU-Based Generation of Massive Scale-Free Networks.
Alam, M.; Perumalla, K. S.; Sanders, P.
2019. Data science and engineering, 4 (1), 61–75. doi:10.1007/s41019-019-0088-6

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

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, Leibnis-Zentrum für Informatik - Schloss Dagstuhl, Wadern. doi:10.4230/LIPIcs.SEA.2018.27

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, Cham. 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, ACM, New York (NY). 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, IEEE, Piscataway (NJ). doi:10.1109/IPDPS.2018.00035

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, IEEE, Picataway (NJ). doi:10.1109/IPDPS.2018.00074

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, IEEE, Piscataway (NJ). 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 fuer Informatik, Wadern, Saarbrücken/Wadern. 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, Cham. 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.7

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, IEEE, Piscataway (NJ). doi:10.1109/CCNC.2018.8319166

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/3157734

2017

Fast OLAP Query Execution in Main Memory on Large Data in a Cluster.
Hespe, D.; Weidner, M.; Dees, J.; Sanders, P.
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 GmbH, Wadern. 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 GmbH, Dagstuhl Publishing, Saarbrücken / Wadern. doi:10.4230/LIPIcs.ESA.2017.9

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, Karlsruhe

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, ACM, New York. 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, Wiley, New York. 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., Philadelphia (PA)

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., Philadelphia (PA). doi:10.1137/1.9781611974768.7

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., Philadelphia (PA). 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., Philadelphia (PA). doi:10.1137/1.9781611974768.17

Engineering Parallel String Sorting.
Bingmann, T.; Eberle, A.; Sanders, P.
2017. Algorithmica, 77 (1), 235–286. doi:10.1007/s00453-015-0071-1

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, Philadelphia (PA). 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, IEEE, Piscataway (NJ). doi:10.1109/BigData.2016.7840603

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, Cham. 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, Cham. 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, IEEE, Piscataway (NJ). doi:10.1109/IPDPS.2016.45

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, IEEE, Piscataway (NJ). 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

Partitioning (hierarchically clustered) complex networks via size-constrained graph clustering.
Meyerhenke, H.; Sanders, P.; Schulz, C.
2016. Journal of heuristics, 22 (5), 759–782. doi:10.1007/s10732-016-9315-8

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, 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, ACM, New York (NY). 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, ACM, New York (NY). 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 GmbH, Wadern. 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, Cham. 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, ACM, New York (NY). doi:10.1145/2755573.2755595

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, ACM, New York (NY). 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, Cahm. 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, IEEE, Piscataway (NJ). 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, Cham. doi:10.1007/978-3-319-20086-6_3

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, New York. 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, New York (NY). 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, New York (NY). doi:10.1007/978-3-319-07959-2_12

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, KIT, Karlsruhe

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, KIT, Karlsruhe

2013

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, IEEE, Piscataway, NJ. doi:10.1109/IPDPS.2013.90

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, Berlin. doi:10.1007/978-3-642-40047-6_66

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, IEEE, Piscataway, NJ. doi:10.1109/BigData.2013.6691549

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, ACM, New York (NY). doi:10.1145/2486159.2486173

Algorithm Engineering.
Sanders, P.; Wagner, D.
2013. Informatik-Spektrum, 36 (2), 131. doi:10.1007/s00287-013-0679-y

Transit Node Routing Reconsidered.
Arz, J.; Duxen, D.; Sanders, P.
2013. Experimental algorithms : 12th international symposium ; proceedings, SEA 2013, Rome, Italy, June 5 - 7, 2013. Ed.: V. Bonifaci, 55–66, Springer, Berlin. 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, Berlin. doi:10.1007/978-3-642-40450-4_15

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, Berlin. 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, IEEE, Piscataway (NJ). doi:10.1109/ICDE.2013.6544838

2012

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, Philadelphia, PA. 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, Berlin. 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, Berlin. 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, Berlin. doi:10.1007/978-3-642-32820-6_18

Time-Dependent Route Planning with Generalized Objective Functions.
Batz, G. V.; Sanders, P.
2012. Algorithms - ESA 2012. Ed.: L. Epstein, 169–180, Springer, Berlin. 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, Berlin. 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, Berlin. doi:10.1007/978-3-642-32820-6_81

Exact Routing in Large Road Networks Using Contraction Hierarchies.
Geisberger, R.; Sanders, P.; Schultes, D.; Vetter, C.
2012. Transportation science, 46 (3), 388–404. doi:10.1287/trsc.1110.0401

2011

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, Berlin. 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, Berlin. 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, Heidelberg. 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, Alaska, USA. Ed.: F. Mueller, 1156–1166, IEEE, Piscataway (NJ)

Hierarchy Decomposition for Faster User Equilibria on Road Networks.
Luxen, D.; Sanders, P.
2011. Experimental Algorithms 10th International Symposium, SEA 2011, Kolimpari, Chania, Crete, Greece, May 5-7, 2011. Proceedings. Ed.: P. M. Pardalos, 242–253, Springer, Berlin

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, ACM, New York

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, Berlin

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, Karlsruhe

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, ACM, New York (NY). doi:10.1145/2093973.2094050

2010

Defining and Computing Alternative Routes in Road Networks.
Dees, J.; Geisberger, R.; Sanders, P.; Bader, R.
2010. doi:10.5445/IR/1000097663

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 fuer Informatik, Dagstuhl. doi:10.4230/OASIcs.ATMOS.2010.88

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 fuer Informatik, Dagstuhl. doi:10.4230/OASIcs.ATMOS.2010.74

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, Berlin

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, Philadelphia (PA)

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, Red Hook (NY)

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, IEEE, Piscataway (NJ)

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, IEEE, Piscataway (NJ)

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, Berlin

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, Berlin

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, IEEE, Piscataway (NJ)

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, Berlin

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

Improved Fast Similarity Search in Dictionaries.
Karch, D.; Luxen, D.; Sanders, P.
2010

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, Berlin

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, Red Hook (NY)

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, Berlin

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, Berlin

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, Berlin

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, Providence (RI)

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, Berlin

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, Philadelphia (PA)

Fast Detour Computation for Ride Sharing.
Geisberger, R.; Luxen, D.; Neubauer, S.; Sanders, P.; Volker, L.
2009. Universität Karlsruhe, Karlsruhe

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, Berlin

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, Berlin

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, Berlin

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, Berlin. 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 Berlin / Heidelberg

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, Society for Industrial and Applied Mathematics

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, Society for Industrial and Applied Mathematics

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, Society for Industrial and Applied Mathematics

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, Philadelphia

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, Philadelphia (PA)

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

Kürzeste Wege.
Sanders, P.; Singler, J.
2008. Taschenbuch der Algorithmen, Hrsg.: B. Vöcking, 345–352, Springer, Berlin

Time Dependent Contraction Hierarchies - Basic Algorithmic Ideas.
Batz, G. V.; Geisberger, R.; Sanders, P.
2008. Univ., Karlsruhe

Algorithms and data structures. The basic toolbox.
Mehlhorn, K.; Sanders, P.
2008. Springer, Berlin

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, Philadelphia (PA)

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, Berlin

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., ACM Press, New York (NY)

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, ACM, New York (NY)

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, Berlin

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, Berlin

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, Berlin

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, Berlin

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, Berlin

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, Berlin

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, Berlin. 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, Berlin

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, Berlin

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, Berlin

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, Berlin

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, Philadelphia (PA)

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, Berlin

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, Berlin

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, New York (NY)

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, Berlin

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, Boston (MA). 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, München

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

1994

Suchalgorithmen auf SIMD-Rechnern – Weitere Ergebnisse zu Polyautomaten. diploma thesis.
Sanders, P.
1994. Universität Karlsruhe, Karlsruhe. doi:10.5445/IR/1000087994

Dissertation Lastverteilungsalgorithmen für parallele Tiefensuche
Publications 1988-2004