| Title | Author | Source |
|---|---|---|
| Benchmarks for Network Analysis | D. Bader, A. Kappes, H. Meyerhenke, P. Sanders, C. Schulz, D. Wagner |
ESNAM |
| Combinatorial Pattern Matching CPM 2013 | J. Fischer, P. Sanders (eds.) |
2013, Proceedings 24th Annual Symposium on Combinatorial Pattern Matching, Springer-Verlag, ISBN 978-3-642-38904-7 |
| Algorithm Engineering and Experiments ALENEX 2013 | P. Sanders, Norbert Zeh (eds.) |
2013, Proceedings of the 15th Meeting on Algorithm Engineering and Experiments ALENEX, SIAM |
| Graph Partitioning and Graph Clustering | D. A. Bader, H. Meyerhenke, P. Sanders, D. Wagner (eds.) |
2013, 10th DIMACS Implementation Challenge, Volume 588 Contemporary Mathematics AMS |
| Algorithm Engineering | P. Sanders
|
Encyclopedia of Parallel Computing, Volume 1, ISBN 978-0-387-09765-7, pp. 33-38, Springer-Verlag, 2011 |
| Shortest Paths | P. Sanders, J. Singler |
Algorithms Unplugged, ISBN 978-3642153273, pp. 317-324, Springer-Verlag 2011. |
| Algorithm Engineering – An Attempt at a Definition | P. Sanders |
2009, Efficient Algorithms - Essays Dedicated to Kurt Mehlhorn on the Occasion of His 60th Birthday, Springer-Verlag, ISBN 978-3-642-03455-8, 321-340 |
| Engineering Route Planning Algorithms | D. Delling, P. Sanders, D. Schultes, D. Wagner |
2009, Algorithmics of Large and Complex Networks, Springer-Verlag, ISBN 978-3-642-02093-3, 117-139 |
| Algorithms - ESA 2009 Proceedings | P. Sanders, A. Fiat (eds.) |
2009, 17th Annual European Symposium on Algorithms ESA, Springer-Verlag, ISBN 978-3-642-04127-3 |
| Algorithms and Data Structures: The Basic Toolbox | K. Mehlhorn, P. Sanders |
2008, Springer-Verlag, ISBN 978-3540779773 |
| Kürzeste Wege | P. Sanders, J. Singler |
Taschenbuch der Algorithmen, Springer-Verlag, ISBN 978-3540763932, S. 345-352, 2008 |
| Title | Author | Source |
|---|---|---|
| Energy-Efficient Sorting using Solid State Disks | A. Beckmann, U. Meyer, P. Sanders, J. Singler | Sustainable Computing, Elsevier. |
| Duality Between Prefetching and Queued Writing with Parallel Disks | D. A. Hutchinson, P. Sanders, J.S. Vitter | SIAM Journal on Computing 34 (6): 1443-1463, 2005 |
| Space Efficient Hash Tables With Worst Case Constant Access Time | D. Fotakis, R. Pagh, P. Sanders, P. Spirakis | Theory of Computing Systems 38 (2): 229-248, 2005 |
| Scalable Parallel Suffix Array Construction | F. Kulla, P. Sanders |
Parallel Computing, 33 (Special issue on EuroPVM/MPI 2006), 2007, 605-612 |
| Cache-, Hash- and Space-Efficient Bloom Filters | F. Putze, P. Sanders, J. Singler |
ACM Journal of Experimental Algorithmics, Volume 14, 2009 |
| Stronger Quickheaps | G. Navarro, R. Paredes, P. v. Poblete, P. Sanders |
International Journal of Foundations of Computer Science (IJFCS), 22(4), p. 945-969. |
| Minimum Time-Dependent Travel Times with Contraction Hierarchies | G.V. Batz, R. Geisberger, P. Sanders, and C. Vetter |
Journal of Experimental Algorithmics (JEA), Volume 18, Article No. 1.4, 2013. |
| Fast routing in road networks with transit nodes | H. Bast, S. Funke, P. Sanders, D. Schultes |
Science, to appear 2007 |
| Linear Work Suffix Array Construction | J. Kärkkäinen, P. Sanders, S. Burkhardt |
Journal of the ACM 53 (6): 1-19, 2006 |
| Goal directed shortest path queries using Precomputed Cluster Distances | J. Maue, P. Sanders, D. Matijevic |
ACM Journal of Experimental Algorithmics, 2009 |
| Single-Pass List Partitioning | L. Frias, J. Singler, P. Sanders |
Scalable Computing: Practice and Experience, 9 (3), pages 179–184, 2008. |
| Algorithmenbibliotheken | P. Sanders |
Informatik Spektrum, 36(2), p. 174-179, 2013 |
| Engineering highway hierarchies | P. Sanders and D. Schultes |
ACM Journal of Experimental Algorithmics, 17(1), 2012 |
| An Asymptotic Approximation Scheme for Multigraph Edge Coloring | P. Sanders, D. Steurer |
ACM Transactions on Algorithms 4 (2): S. 897-906, 2008 |
| Real-time integrated prefetching and caching | P. Sanders, J. Singler, R. van Stee |
Journal of Scheduling, 16(1), p. 47-58, 2013 |
| Two-tree algorithms for full bandwidth broadcast, reduction and scan | P. Sanders, J. Speck, J. Larsson Träff |
Parallel Computing, 2009 |
| Online Scheduling with Bounded Migration | P. Sanders, N. Sivadasan, M. Skutella |
Mathematics of Operations Research, 34 (2): 481-498, 2009 |
| Energy-efficient paths in radio networks | R. Beier, S. Funke, D. Matijevic, P. Sanders |
Algorithmica |
| Better External Memory Suffix Array Construction | R. Dementiev, J. Kärkkäinen, J. Mehnert, P. Sanders |
ACM Journal of Experimental Algorithmics (to appear in special issue on ALENEX 2005), 2007 |
| STXXL: Standard Template Library for XXL Data Sets | R. Dementiev, L. Kettner, P. Sanders |
Software Practice & Experience, 37(10), 2007 |
| Route planning with flexible edge restrictions | R. Geisberger, M. N. Rice, P. Sanders, V. J. Tsotras |
ACM Journal of Experimental Algorithmics 17(1), 2012 |
| Exact Routing in Large Road Networks Using Contraction Hierarchies | R. Geisberger, P. Sanders, D. Schultes, C. Vetter |
Transportation Science, April 2012 |
| Combining Hierarchical and Goal-Directed Speed-Up Techniques for Dijkstra’s Algorithm | Reinhard Bauer, Daniel Delling, Peter Sanders, Dennis Schieferdecker, Dominik Schultes, Dorothea Wagner |
ACM Journal of Experimental Algorithmics, Volume 15, 2010 |
| Polynomial Time Algorithms for Multicast Network Code Construction | S. Jaggi, P. Sanders et al. | IEEE Transactions on Information Theory 51 (6): 1973-1982, 2005 |
| Title | Author | Conference | Date |
|---|---|---|---|
| Cache-Efficient Aggregation: Hashing Is Sorting | Ingo Müller, Peter Sanders, Arnaud Lacurie, Wolfgang Lehner, Franz Färber |
International Conference on Management of Data (SIGMOD) – 2015 |
May/June 2015 |
| Retrieval and Perfect Hashing using Fingerprinting | Ingo Müller, Peter Sanders, Robert Schulze, Wei Zhou |
Symposium on Experimental Algorithms (SEA) – 2014 |
June/July 2014 |
| Fast olap query execution in main memory on large data in a cluster | M. Weidner, J. Dees, P. Sanders |
IEEE BigData Conference 2013 |
October 2013 |
| Communication Efficient Algorithms for Fundamental Big Data Problems | Peter Sanders, Sebastian Schlag, Ingo Müller |
IEEE BigData Conference 2013 |
October 2013 |
| Parallel String Sample Sort | Timo Bingmann, Peter Sanders |
ESA 2013, 21st European Symposium on Algorithms |
September 2013 |
| Efficient Parallel and External Matching | M. Birn, V. Osipov, P. Sanders, C. Schulz, N. Sitchinava |
Euro-Par 2013 |
August 2013 |
| On (dynamic) range minimum queries in external memory | L. Arge, J. Fischer, P. Sanders, N. Sitchinava |
13th Algorithms and Data Structures Symposium (WADS 2013) |
August 2013 |
| Work-efficient matrix inversion in polylogarithmic time | P. Sanders, J. Speck, R. Steffen |
SPAA 2013 |
July 2013 |
| Transit Node Routing Reconsidered | Julian Arz, Dennis Luxen, Peter Sanders |
12th International Symposium on Experimental Algorithms (SEA 2013) |
June 2013 |
| Think Locally, Act Globally: Highly Balanced Graph Partitioning | P. Sanders, C. Schulz |
SEA 2013 |
June 2013 |
| Parallel label-setting multi-objective shortest path search | P. Sanders, L. Mandow |
27th IEEE International Parallel&Distributed Processing Symposium (IPDPS 2013) |
May 2013 |
| Malleable Sorting | P. Flick, P. Sanders, J. Speck |
IPDPS 2013 |
May 2013 |
| Efficient many-core query execution in main memory column-stores | J. Dees, P. Sanders |
29th IEEE Conference on Data Engineering (ICDE 2013) |
April 2013 |
| High Quality Graph Partitioning | P. Sanders, C. Schulz |
DIMACS 2012 |
April 2013 |
| Engineering algorithms for large data sets | P. Sanders (invited talk) |
39th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2013) |
January 2013 |
| Efficient Route Compression for Hybrid Route Planning | G.V. Batz, R. Geisberger, D. Luxen, P. Sanders, and R. Zubkov |
Mediterranean Conference on Algorithms (MedAlg 2012) |
December 2012 |
| Time-Dependent Route Planning with Generalized Objective Functions | G.V. Batz and P. Sanders |
European Symposium on Algorithms (ESA 2012) |
September 2012 |
| Advanced Coarsening Schemes for Graph Partitioning | Peter Sanders, Christian Schulz |
SEA'12 |
June 2012 |
| Optimized Hybrid Parallel Lattice Boltzmann Fluid Flow Simulations on Complex Geometries | J. Fietz, M. Krause, P. Sanders, C. Schulz, V. Heuveline |
Euro-Par 2012 |
August 2012 |
| Engineering Graph Partitioning Algorithms | Vitaly Osipov, Peter Sanders, Christian Schulz | 11'th International Symposium on Experimental Algorithms (SEA'2012) | Jun 7-9, 2012 |
| Distributed Evolutionary Graph Partitioning | Peter Sanders, Christian Schulz |
Meeting on Algorithm Engineering & Experiments (Alenex12) |
Jan, 16th 2012 |
| Engineering Efficient Error-Correcting Geocoding | Christian Jung, Daniel Karch, Sebastian Knopp, Dennis Luxen, Peter Sanders | ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems (GIS 2011) | November 2011 |
| Engineering Multilevel Graph Partitioning Algorithms | Peter Sanders, Christian Schulz |
ESA 2011 |
September 2011 |
| Engineering a Multi-core Radix Sort | J. Wassenberg, P. Sanders |
Euro-Par 2011 |
August/September 2011 |
| Efficient Parallel Scheduling of Malleable Tasks | P. Sanders, J. Speck |
IPDPS 2011 |
May 2011 |
| Algorithm Engineering for Scalable Parallel External Sorting | P. Sanders |
IPDPS 2011 |
May 2011 |
| Hierarchy Decomposition and Faster User Equilibria on Road Networks | International Symposium on Experimental Algorithms (SEA 2011) |
May 2011 |
|
| Alternative Route Graphs in Road Networks | R. Bader, J. Dees, R. Geisberger, P. Sanders |
International ICST Conference on Theory and Practice of Algorithms |
April 2011 |
| Improved Fast Similarity Search in Dictionaries | Daniel Karch, Dennis Luxen and Peter Sanders |
String Processing and Information Retrieval Symposium (SPIRE 2010) |
October 2010 |
| Engineering Time-Dependent Many-to-Many Shortest Paths Computation | R. Geisberger, P. Sanders |
Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2010) |
September 2010 |
| Fast Detour Computation for Ride Sharing | R. Geisberger, D. Luxen, P. Sanders, S. Neubauer, L. Volker |
ATMOS 2010 |
September 2010 |
| n-Level Graph Partitioning | V. Osipov and P. Sanders |
ESA 2010 |
September 2010 |
| Energy-Efficient Sorting using Solid State Disks | A. Beckmann, U. Meyer, P. Sanders, J. Singler |
International Green Computing Conference (IGCC) |
August 2010 |
| Lifetime Maximization of Monitoring Sensor Networks | Peter Sanders, Dennis Schieferdecker |
International Workshop on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities (ALGOSENSORS 2010) |
July 2010 |
| Distributed Time-Dependent Contraction Hierarchies | T. Kieritz, D. Luxen, P. Sanders, C. Vetter |
International Symposium on Experimental Algorithms (SEA 2010) |
May 2010 |
| Time-Dependent Contraction Hierarchies and Approximation | G.V. Batz, R. Geisberger, S. Neubauer, P. Sanders |
International Symposium on Experimental Algorithms (SEA 2010) |
May 2010 |
| GPU Sample Sort | Nikolaj Leischner, Vitaly Osipov and Peter Sanders |
IPDPS 2010 |
April 2010 |
| Scalable Distributed-Memory External Sorting | M. Rahn, P. Sanders, J. Singler |
International Conference on Data Engineering (ICDE) |
March 2010 |
| Route Planning with Flexible Objective Functions | R. Geisberger, M. Kobitzsch, P. Sanders |
Workshop on Algorithm Engineering and Experiments (ALENEX 2010) |
Januar 2010 |
| Simple and Fast Nearest Neighbor Search | M. Birn, M. Holtgrewe, P. Sanders, J. Singler |
Workshop on Algorithm Engineering and Experiments (ALENEX 2010) |
January 2010 |
| Towards Optimal Range Medians | B. Gfeller, P. Sanders |
International Colloquium Automata, Languages and Programming ICALP 2009 |
July 5-12, 2009 |
| An Efficient Parallel Algorithm for Graph-Based Image Segmentation | J. Wassenberg, W. Middelmann, P. Sanders |
Computer Analysis of Images and Patterns CAIP 2009 |
September 2009 |
| Time-Dependent Contraction Hierarchies | G.V. Batz, D. Delling, P. Sanders, and C. Vetter |
Workshop on Algorithm Engineering and Experiments (ALENEX 2009) |
January 2009 |
| The Filter-Kruskal Minimum Spanning Tree Algorithm | V. Osipov, P. Sanders, J. Singler |
ALENEX 2009 |
January 2009 |
| Out of the box phrase indexing | P. Sanders, F. Transier |
SPIRE 2008 |
November 2008 |
| Semi-external LTL model checking | S. Edelkamp, P. Sanders, P. Simecek |
CAV 2008 |
July 2008 |
| Combining hierarchical and goal-directed speed-up techniques for Dijkstras algorithm | Reinhard Bauer, Daniel Delling, Peter Sanders, Dennis Schieferdecker, Dominik Schultes, Dorothea Wagner |
International Workshop on Experimental Algorithms (WEA 2008) |
May/June 2008 |
| Mobile Route Planning | P. Sanders, D. Schultes, C. Vetter |
ESA 2008 |
September 2008 |
| Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks | R. Geisberger, P. Sanders, D. Schultes, D. Delling |
International Workshop on Experimental Algorithms (WEA 2008) |
May/June 2008 |
| Better Approximation of Betweenness Centrality | R. Geisberger, P. Sanders, D. Schultes |
Workshop on Algorithm Engineering and Experiments (ALENEX 2008) |
January 2008 |
| Compressed Inverted Indexes for In-Memory Search Engines | F. Transier, P. Sanders |
ALENEX 2008 |
January 2008 |
| Single-Pass List Partitioning | L. Frias, J. Singler, P. Sanders |
International Workshop on Multi-Core Computing Systems (MuCoCoS) 2008 | March 2008 |
| Full Bandwidth Broadcast, Reduction and Scan with only two Trees | P. Sanders, J. Speck, J. Larsson Träff |
EuroPVM/MPI 2007 |
30.09.-03.10.2007 |
| MCSTL: The Multi-Core Standard Template Library | J. Singler, P. Sanders, F. Putze |
Euro-Par 2007 |
August 2007 |
| Engineering Algorithms for Approximate Weighted Matching | J. Maue, P. Sanders |
WEA 2007 |
June 2007 |
| Engineering Fast Route Planning Algorithms | P. Sanders, D. Schultes |
6th Workshop on Experimental Algorithms (WEA) |
June 2007 |
| Cache-, Hash- and Space-Efficient Bloom Filters | F. Putze, P. Sanders, J. Singler |
WEA 2007 |
June 2007 |
| Dynamic Highway-Node Routing | P. Sanders, D. Schultes |
6th Workshop on Experimental Algorithms (WEA) | June 2007 |
| MCSTL: The Multi-Core Standard Template Library (Poster) | F. Putze, P. Sanders, J. Singler |
PPoPP 2007 |
March 2007 |
| Intersection in Integer Inverted Indices | P. Sanders, F. Transier |
ALENEX 2007 |
January 2007 |
| The Random Graph Threshold for k-orientiability and a Fast Algorithm for Optimal Multiple-Choice Allocation | J. Cain, P. Sanders, N. Wormald | SODA07 | January 2007 |
| In Transit to Constant Shortest-Path Queries in Road Networks | H. Bast, S. Funke, D. Matijevic, P. Sanders, D. Schultes |
Workshop on Algorithm Engineering and Experiments (ALENEX 2007) |
January 2007 |
| Computing Many-to-Many Shortest Paths Using Highway Hierarchies | S. Knopp, P. Sanders, D. Schultes, F. Schulz, D. Wagner |
Workshop on Algorithm Engineering and Experiments (ALENEX 2007) |
January 2007 |
| Highway Hierarchies Star | D. Delling, P. Sanders, D. Schultes, D. Wagner |
9th DIMACS Challenge on Shortest Paths |
November 2006 |
| Engineering Highway Hierarchies | P. Sanders, D. Schultes |
14th European Symposium on Algorithms (ESA) |
September 2006 |
| Parallel Prefix (Scan) Algorithms for MPI | P. Sanders, J. L.Träff |
EuroPVM/MPI 2006 |
September 2006 |
| Scalable Parallel Suffix Array Construction | F. Kulla, P. Sanders | EuroPVM/MPI 2006 | September 2006 |
| How Branch Mispredictions Affect Quicksort | K. Kaligosi, P. Sanders | ESA 2006 | September 2006 |
| Goal Directed Shortest Path Queries Using Precomputed Cluster Distances | J. Maue, P. Sanders, D. Matijevic | WEA 2006 | May 2006 |
| STXXL: Standard Template Library for XXL Data Sets | R. Dementiev, L. Kettner, P. Sanders | ESA 2005 | October 2005 |
| Highway Hierarchies Hasten Exact Shortest Path Queries | P. Sanders, D. Schultes | ESA 2005 | October 2005 |
| Towards Optimal Multiple Selection | K. Kaligosi, K. Mehlhorn, J. I. Munro, P. Sanders |
ICALP'05 | July 2005 |
| Better External Memory Suffix Array Construction | R. Dementiev, J. Mehnert, J. Kärkkäinen, P. Sanders | ALENEX05 |
January 2005 |
| An Asymptotic Approximation Scheme for Multigraph Edge Coloring | P. Sanders, D. Steurer | SODA05 | January 2005 |
| Title | Author | Source |
|---|---|---|
| Communication Efficient Algorithms for Top-k Selection Problems | Lorenz Hübschle-Schneider, Peter Sanders, and Ingo Müller |
|
| Route Planning in Transportation Networks | H. Bast, D. Delling, A. Goldberg, M. Müller-Hannemann, T. Pajor, P. Sanders, D. Wagner, R. Werneck |
Technical Report 2014, Microsoft Research |
| Recent Advances in Graph Partitioning | A. Buluc, H. Meyerhenke, I. Safro, P. Sanders, C. Schulz |
Technial Report November 2013, arXiv:1311.3144 |
| Parallel String Sample Sort | Timo Bingmann and Peter Sanders |
arXiv:1305.1157 |
| Advanced Coarsening Schemes for Graph Partitioning | I. Safro, P. Sanders, C. Schulz |
CoRR abs/1201.6488 |
| Engineering State-of-the-Art Graph Partitioning Libraries @KIT | Vitaly Osipov, Peter Sanders, Christian Schulz, Manuel Holtgrewe |
SimLab@KIT |
| Compressed Transmission of Route Descriptions | G.V. Batz, R. Geisberger, D. Luxen, P. Sanders |
Technical Report, November 22, 2010, Fakultät für Informatik, Karlsruher Institut für Technologie, arXiv:1011.4465v1 |
| Defining and Computing Alternative Routes in Road Networks | J. Dees, R. Geisberger, P. Sanders, R. Bader |
Technical Report, February 23, 2010, Fakultät für Informatik, Karlsruher Institut für Technologie |
| Engineering a Scalable High Quality Graph Partitioner | M. Holtgrewe, P. Sanders, C. Schulz |
Technical Report, 2009, Fakultät für Informatik, Karlsruher Institut für Technologie |
| Time Dependent Contraction Hierarchies - Basic Algorithmic Ideas | G.V. Batz, R. Geisberger, P. Sanders |
Technical Report, April 24, 2008, Fakultät für Informatik, Universität Karlsruhe |
| STXXL: Standard Template Library for XXL Data Sets | R. Dementiev, L. Kettner, P. Sanders | Technical Report 2005/18, Fakultät für Informatik, Universität Karlsruhe |