Peter Sanders

Peter Sanders, Dorothea Wagner: Algorithm Engineering. Informatik Spektrum 36(2): 131 (2013)

Peter Sanders: Algorithmenbibliotheken. Informatik Spektrum 36(2): 174-179 (2013)

Peter Sanders, Dorothea Wagner: Algorithm Engineering. Informatik Spektrum 36(2): 187-190 (2013)

Peter Sanders, Johannes Singler, Rob van Stee: Real-time integrated prefetching and caching. J. Scheduling 16(1): 47-58 (2013)

Peter Sanders: Engineering Algorithms for Large Data Sets. SOFSEM 2013: 29-32

Peter Sanders, Norbert Zeh (Eds.): Proceedings of the 15th Meeting on Algorithm Engineering and Experiments, ALENEX 2013, New Orleans, Louisiana, USA, January 7, 2013. SIAM 2013

Johannes Fischer, Peter Sanders (Eds.): Combinatorial Pattern Matching, 24th Annual Symposium, CPM 2013, Bad Herrenalb, Germany, June 17-19, 2013. Proceedings. Lecture Notes in Computer Science 7922, Springer 2013, isbn 978-3-642-38904-7

David A. Bader, Henning Meyerhenke, Peter Sanders, Dorothea Wagner (Eds.): Graph Partitioning and Graph Clustering - 10th DIMACS Implementation Challenge Workshop, Georgia Institute of Technology, Atlanta, GA, USA, February 13-14, 2012. Proceedings. Contemporary Mathematics 588, American Mathematical Society 2013, isbn 978-0-8218-9038-7

Marcel Birn, Vitaly Osipov, Peter Sanders, Christian Schulz, Nodari Sitchinava: Efficient Parallel and External Matching. CoRR abs/1302.4587 (2013)

Julian Arz, Dennis Luxen, Peter Sanders: Transit Node Routing Reconsidered. CoRR abs/1302.5611 (2013)

Robert Geisberger, Michael N. Rice, Peter Sanders, Vassilis J. Tsotras: Route planning with flexible edge restrictions. ACM Journal of Experimental Algorithmics 17(1) (2012)

Peter Sanders, Dominik Schultes: Engineering highway hierarchies. ACM Journal of Experimental Algorithmics 17(1) (2012)

Robert Geisberger, Peter Sanders, Dominik Schultes, Christian Vetter: Exact Routing in Large Road Networks Using Contraction Hierarchies. Transportation Science 46(3): 388-404 (2012)

Peter Sanders, Christian Schulz: Distributed Evolutionary Graph Partitioning. ALENEX 2012: 16-29

Peter Sanders, Christian Schulz: High quality graph partitioning. Graph Partitioning and Graph Clustering 2012: 1-18

Gernot Veit Batz, Peter Sanders: Time-Dependent Route Planning with Generalized Objective Functions. ESA 2012: 169-180

Peter Sanders, Jochen Speck: Energy Efficient Frequency Scaling and Scheduling for Malleable Tasks. Euro-Par 2012: 167-178

Jonas Fietz, Mathias J. Krause, Christian Schulz, Peter Sanders, Vincent Heuveline: Optimized Hybrid Parallel Lattice Boltzmann Fluid Flow Simulations on Complex Geometries. Euro-Par 2012: 818-829

Gernot Veit Batz, Robert Geisberger, Dennis Luxen, Peter Sanders, Roman Zubkov: Efficient Route Compression for Hybrid Route Planning. MedAlg 2012: 93-107

Vitaly Osipov, Peter Sanders, Christian Schulz: Engineering Graph Partitioning Algorithms. SEA 2012: 18-26

Ilya Safro, Peter Sanders, Christian Schulz: Advanced Coarsening Schemes for Graph Partitioning. SEA 2012: 369-380

Ilya Safro, Peter Sanders, Christian Schulz: Advanced Coarsening Schemes for Graph Partitioning. CoRR abs/1201.6488 (2012)

Peter Sanders, Christian Schulz: Think Locally, Act Globally: Perfectly Balanced Graph Partitioning. CoRR abs/1210.0477 (2012)

René Beier, Stefan Funke, Domagoj Matijevic, Peter Sanders: Energy-Efficient Paths in Radio Networks. Algorithmica 61(2): 298-319 (2011)

Gonzalo Navarro, Rodrigo Paredes, Patricio V. Poblete, Peter Sanders: Stronger Quickheaps. Int. J. Found. Comput. Sci. 22(4): 945-969 (2011)

Peter Sanders, Dorothea Wagner: Algorithm Engineering. it - Information Technology 53(6): 263-265 (2011)

Gerth Stølting Brodal, Beat Gfeller, Allan Grønlund Jørgensen, Peter Sanders: Towards optimal range medians. Theor. Comput. Sci. 412(24): 2588-2601 (2011)

Peter Sanders, Johannes Singler: Shortest Paths. Algorithms Unplugged 2011: 317-324

Peter Sanders, Christian Schulz: Engineering Multilevel Graph Partitioning Algorithms. ESA 2011: 469-480

Jan Wassenberg, Peter Sanders: Engineering a Multi-core Radix Sort. Euro-Par (2) 2011: 160-169

Christian Jung, Daniel Karch, Sebastian Knopp, Dennis Luxen, Peter Sanders: Engineering efficient error-correcting geocoding. GIS 2011: 469-472

Peter Sanders: Algorithm Engineering for Scalable Parallel External Sorting. IPDPS 2011: 1

Peter Sanders, Jochen Speck: Efficient Parallel Scheduling of Malleable Tasks. IPDPS 2011: 1156-1166

Roland Bader, Jonathan Dees, Robert Geisberger, Peter Sanders: Alternative Route Graphs in Road Networks. TAPAS 2011: 21-32

Dennis Luxen, Peter Sanders: Hierarchy Decomposition for Faster User Equilibria on Road Networks. SEA 2011: 242-253

Peter Sanders: Displaying Cell Broadcast messages. WPMC 2011: 1-5

Peter Sanders: Algorithm Engineering. Encyclopedia of Parallel Computing 2011: 33-38

Christian Jung, Daniel Karch, Sebastian Knopp, Dennis Luxen, Peter Sanders: Efficient Error-Correcting Geocoding. CoRR abs/1102.3306 (2011)

Peter Sanders, Christian Schulz: Distributed Evolutionary Graph Partitioning. CoRR abs/1110.0477 (2011)

Peter Sanders: Algorithm Engineering. Informatik Spektrum 33(5): 475-478 (2010)

Reinhard Bauer, Daniel Delling, Peter Sanders, Dennis Schieferdecker, Dominik Schultes, Dorothea Wagner: Combining hierarchical and goal-directed speed-up techniques for dijkstra's algorithm. ACM Journal of Experimental Algorithmics 15 (2010)

Johannes Langguth, Fredrik Manne, Peter Sanders: Heuristic initialization for bipartite matching problems. ACM Journal of Experimental Algorithmics 15 (2010)

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

Marcel Birn, Manuel Holtgrewe, Peter Sanders, Johannes Singler: Simple and Fast Nearest Neighbor Search. ALENEX 2010: 43-54

Peter Sanders: Algorithm Engineering - An Attempt at a Definition Using Sorting as an Example. ALENEX 2010: 55-61

Robert Geisberger, Moritz Kobitzsch, Peter Sanders: Route Planning with Flexible Objective Functions. ALENEX 2010: 124-137

Peter Sanders, Dennis Schieferdecker: Lifetime Maximization of Monitoring Sensor Networks. ALGOSENSORS 2010: 134-147

Robert Geisberger, Peter Sanders: Engineering Time-Dependent Many-to-Many Shortest Paths Computation. ATMOS 2010: 74-87

Robert Geisberger, Dennis Luxen, Sabine Neubauer, Peter Sanders, Lars Völker: Fast Detour Computation for Ride Sharing. ATMOS 2010: 88-99

Vitaly Osipov, Peter Sanders: n-Level Graph Partitioning. ESA (1) 2010: 278-289

Andreas Beckmann, Ulrich Meyer, Peter Sanders, Johannes Singler: Energy-efficient sorting using solid state disks. Green Computing Conference 2010: 191-202

Mirko Rahn, Peter Sanders, Johannes Singler: Scalable distributed-memory external sorting. ICDE 2010: 685-688

Manuel Holtgrewe, Peter Sanders, Christian Schulz: Engineering a scalable high quality graph partitioner. IPDPS 2010: 1-12

Nikolaj Leischner, Vitaly Osipov, Peter Sanders: GPU sample sort. IPDPS 2010: 1-10

Peter Sanders: Algorithm engineering for scalable parallel external sorting. IPDPS 2010: 1-3

Daniel Karch, Dennis Luxen, Peter Sanders: Improved Fast Similarity Search in Dictionaries. SPIRE 2010: 173-178

Tim Kieritz, Dennis Luxen, Peter Sanders, Christian Vetter: Distributed Time-Dependent Contraction Hierarchies. SEA 2010: 83-93

Gernot Veit Batz, Robert Geisberger, Sabine Neubauer, Peter Sanders: Time-Dependent Contraction Hierarchies and Approximation. SEA 2010: 166-177

Jonathan Dees, Robert Geisberger, Peter Sanders, Roland Bader: Defining and Computing Alternative Routes in Road Networks. CoRR abs/1002.4330 (2010)

Vitaly Osipov, Peter Sanders: n-Level Graph Partitioning. CoRR abs/1004.4024 (2010)

Daniel Karch, Dennis Luxen, Peter Sanders: Improved Fast Similarity Search in Dictionaries. CoRR abs/1008.1191 (2010)

Jan Wassenberg, Peter Sanders: Faster Radix Sort via Virtual Memory and Write-Combining. CoRR abs/1008.2849 (2010)

Gernot Veit Batz, Robert Geisberger, Dennis Luxen, Peter Sanders: Compressed Transmission of Route Descriptions. CoRR abs/1011.4465 (2010)

Peter Sanders, Christian Schulz: Engineering Multilevel Graph Partitioning Algorithms. CoRR abs/1012.0006 (2010)

Jens Maue, Peter Sanders, Domagoj Matijevic: Goal-directed shortest-path queries using precomputed cluster distances. ACM Journal of Experimental Algorithmics 14 (2009)

Felix Putze, Peter Sanders, Johannes Singler: Cache-, hash-, and space-efficient bloom filters. ACM Journal of Experimental Algorithmics 14 (2009)

Peter Sanders, Naveen Sivadasan, Martin Skutella: Online Scheduling with Bounded Migration. Math. Oper. Res. 34(2): 481-498 (2009)

Peter Sanders, Jochen Speck, Jesper Larsson Träff: Two-tree algorithms for full bandwidth broadcast, reduction and scan. Parallel Computing 35(12): 581-594 (2009)

Vitaly Osipov, Peter Sanders, Johannes Singler: The Filter-Kruskal Minimum Spanning Tree Algorithm. ALENEX 2009: 52-61

Gernot Veit Batz, Daniel Delling, Peter Sanders, Christian Vetter: Time-Dependent Contraction Hierarchies. ALENEX 2009: 97-105

Peter Sanders: Algorithm Engineering - An Attempt at a Definition. Efficient Algorithms 2009: 321-340

Jan Wassenberg, Wolfgang Middelmann, Peter Sanders: An Efficient Parallel Algorithm for Graph-Based Image Segmentation. CAIP 2009: 1003-1010

Daniel Delling, Peter Sanders, Dominik Schultes, Dorothea Wagner: Engineering Route Planning Algorithms. Algorithmics of Large and Complex Networks 2009: 117-139

Beat Gfeller, Peter Sanders: Towards Optimal Range Medians. ICALP (1) 2009: 475-486

Amos Fiat, Peter Sanders (Eds.): Algorithms - ESA 2009, 17th Annual European Symposium, Copenhagen, Denmark, September 7-9, 2009. Proceedings. Lecture Notes in Computer Science 5757, Springer 2009, isbn 978-3-642-04127-3

Beat Gfeller, Peter Sanders: Towards Optimal Range Medians. CoRR abs/0901.1761 (2009)

Robert Geisberger, Dennis Luxen, Sabine Neubauer, Peter Sanders, Lars Völker: Fast Detour Computation for Ride Sharing. CoRR abs/0907.5269 (2009)

Nikolaj Leischner, Vitaly Osipov, Peter Sanders: GPU sample sort. CoRR abs/0909.5649 (2009)

Manuel Holtgrewe, Peter Sanders, Christian Schulz: Engineering a Scalable High Quality Graph Partitioner. CoRR abs/0910.2004 (2009)

Mirko Rahn, Peter Sanders, Johannes Singler: Scalable Distributed-Memory External Sorting. CoRR abs/0910.2582 (2009)

Kurt Mehlhorn, Peter Sanders: Algorithms and Data Structures: The Basic Toolbox. Springer 2008, isbn 978-3-540-77977-3

Stefan Funke, Domagoj Matijevic, Peter Sanders: Constant Time Queries for Energy Efficient Paths in Multi-hop Wireless Networks. CIT 16(2): 119-130 (2008)

Roman Dementiev, Juha Kärkkäinen, Jens Mehnert, Peter Sanders: Better external memory suffix array construction. ACM Journal of Experimental Algorithmics 12 (2008)

Leonor Frias, Johannes Singler, Peter Sanders: Single-Pass List Partitioning. Scalable Computing: Practice and Experience 9(3) (2008)

Roman Dementiev, Lutz Kettner, Peter Sanders: STXXL: standard template library for XXL data sets. Softw., Pract. Exper. 38(6): 589-637 (2008)

Peter Sanders, David Steurer: An asymptotic approximation scheme for multigraph edge coloring. ACM Transactions on Algorithms 4(2) (2008)

Frederik Transier, Peter Sanders: Compressed Inverted Indexes for In-Memory Search Engines. ALENEX 2008: 3-12

Robert Geisberger, Peter Sanders, Dominik Schultes: Better Approximation of Betweenness Centrality. ALENEX 2008: 90-100

Stefan Edelkamp, Peter Sanders, Pavel Simecek: Semi-external LTL Model Checking. CAV 2008: 530-542

Leonor Frias, Johannes Singler, Peter Sanders: Single-Pass List Partitioning. CISIS 2008: 817-821

Peter Sanders, Dominik Schultes, Christian Vetter: Mobile Route Planning. ESA 2008: 732-743

Frederik Transier, Peter Sanders: Out of the Box Phrase Indexing. SPIRE 2008: 200-211

Reinhard Bauer, Daniel Delling, Peter Sanders, Dennis Schieferdecker, Dominik Schultes, Dorothea Wagner: Combining Hierarchical and Goal-Directed Speed-Up Techniques for Dijkstra's Algorithm. WEA 2008: 303-318

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

Peter Sanders, Johannes Singler: Kürzeste Wege. Taschenbuch der Algorithmen 2008: 345-352

Peter Sanders: Time Dependent Contraction Hierarchies -- Basic Algorithmic Ideas. CoRR abs/0804.3947 (2008)

Fabian Kulla, Peter Sanders: Scalable parallel suffix array construction. Parallel Computing 33(9): 605-612 (2007)

Holger Bast, Stefan Funke, Domagoj Matijevic, Peter Sanders, Dominik Schultes: In Transit to Constant Time Shortest-Path Queries in Road Networks. ALENEX 2007

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

Peter Sanders, Frederik Transier: Intersection in Integer Inverted Indices. ALENEX 2007

Johannes Singler, Peter Sanders, Felix Putze: MCSTL: The Multi-core Standard Template Library. Euro-Par 2007: 682-694

Felix Putze, Peter Sanders, Johannes Singler: MCSTL: the multi-core standard template library. PPOPP 2007: 144-145

Peter Sanders, Jochen Speck, Jesper Larsson Träff: Full Bandwidth Broadcast, Reduction and Scan with Only Two Trees. PVM/MPI 2007: 17-26

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

Peter Sanders, Dominik Schultes: Engineering Fast Route Planning Algorithms. WEA 2007: 23-36

Dominik Schultes, Peter Sanders: Dynamic Highway-Node Routing. WEA 2007: 66-79

Felix Putze, Peter Sanders, Johannes Singler: Cache-, Hash- and Space-Efficient Bloom Filters. WEA 2007: 108-121

Jens Maue, Peter Sanders: Engineering Algorithms for Approximate Weighted Matching. WEA 2007: 242-255

Juha Kärkkäinen, Peter Sanders, Stefan Burkhardt: Linear work suffix array construction. J. ACM 53(6): 918-936 (2006)

Peter Sanders, Aravind Srinivasan, Berthold Vöcking: Foreword. Theory Comput. Syst. 39(6): 785 (2006)

Kanela Kaligosi, Peter Sanders: How Branch Mispredictions Affect Quicksort. ESA 2006: 780-791

Peter Sanders, Dominik Schultes: Engineering Highway Hierarchies. ESA 2006: 804-816

Fabian Kulla, Peter Sanders: Scalable Parallel Suffix Array Construction. PVM/MPI 2006: 22-29

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

Jens Maue, Peter Sanders, Domagoj Matijevic: Goal Directed Shortest Path Queries Using Precomputed Cluster Distances. WEA 2006: 316-327

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

David A. Hutchinson, Peter Sanders, Jeffrey Scott Vitter: Duality Between Prefetching and Queued Writing with Parallel Disks. SIAM J. Comput. 34(6): 1443-1463 (2005)

Sidharth Jaggi, Peter Sanders, Philip A. Chou, Michelle Effros, Sebastian Egner, Kamal Jain, Ludo M. G. M. Tolhuizen: Polynomial time algorithms for multicast network code construction. IEEE Transactions on Information Theory 51(6): 1973-1982 (2005)

Roman Dementiev, Juha Kärkkäinen, Jens Mehnert, Peter Sanders: Better External Memory Suffix Array Construction. ALENEX/ANALCO 2005: 86-97

Peter Sanders, Naveen Sivadasan, Martin Skutella: Online Scheduling with Bounded Migration. Algorithms for Optimization with Incomplete Information 2005

Peter Sanders, Dominik Schultes: Highway Hierarchies Hasten Exact Shortest Path Queries. ESA 2005: 568-579

Roman Dementiev, Lutz Kettner, Peter Sanders: : Standard Template Library for XXL Data Sets. ESA 2005: 640-651

Kanela Kaligosi, Kurt Mehlhorn, J. Ian Munro, Peter Sanders: Towards Optimal Multiple Selection. ICALP 2005: 103-114

Peter Sanders, David Steurer: An asymptotic approximation scheme for multigraph edge coloring. SODA 2005: 897-906

Peter Sanders: Algorithms for Memory Hierarchies (Column: Algorithmics). Bulletin of the EATCS 83: 67-85 (2004)

Seth Pettie, Peter Sanders: A simpler linear time 2/3-epsilon approximation for maximum weight matching. Inf. Process. Lett. 91(6): 271-276 (2004)

Roman Dementiev, Lutz Kettner, Jens Mehnert, Peter Sanders: Engineering a Sorted List Data Structure for 32 Bit Key. ALENEX/ANALC 2004: 142-151

Peter Sanders, Sebastian Winkel: Super Scalar Sample Sort. ESA 2004: 784-796

Peter Sanders, Naveen Sivadasan, Martin Skutella: Online Scheduling with Bounded Migration. ICALP 2004: 1111-1122

Roman Dementiev, Peter Sanders, Dominik Schultes, Jop F. Sibeyn: Engineering an External Memory Minimum Spanning Tree Algorithm. IFIP TCS 2004: 195-208

Peter Sanders: Algorithms for Scalable Storage Servers. SOFSEM 2004: 82-101

Peter Sanders, Sebastian Egner, Jan H. M. Korst: Fast Concurrent Access to Parallel Disks. Algorithmica 35(1): 21-55 (2003)

Kurt Mehlhorn, Peter Sanders: Scanning Multiple Sequences Via Cache Memory. Algorithmica 35(1): 75-93 (2003)

Peter Sanders, Berthold Vöcking: Tail Bounds And Expectations For Random Arc Allocation And Applications. Combinatorics, Probability & Computing 12(3): 301-318 (2003)

Peter Sanders, Jop F. Sibeyn: A bandwidth latency tradeoff for broadcast and reduction. Inf. Process. Lett. 86(1): 33-38 (2003)

Ulrich Meyer, Peter Sanders: [Delta]-stepping: a parallelizable shortest path algorithm. J. Algorithms 49(1): 114-152 (2003)

Peter Sanders: Asynchronous Scheduling of Redundant Disk Arrays. IEEE Trans. Computers 52(9): 1170-1184 (2003)

Stefan Funke, Domagoj Matijevic, Peter Sanders: Approximating Energy Efficient Paths in Wireless Multi-hop Networks. ESA 2003: 230-241

Irit Katriel, Peter Sanders, Jesper Larsson Träff: A Practical Minimum Spanning Tree Algorithm Using the Cycle Property. ESA 2003: 679-690

Juha Kärkkäinen, Peter Sanders: Simple Linear Work Suffix Array Construction. ICALP 2003: 943-955

Piotr Krysta, Peter Sanders, Berthold Vöcking: Scheduling and Traffic Allocation for Tasks with Bounded Splittability. MFCS 2003: 500-510

Roman Dementiev, Peter Sanders: Asynchronous parallel disk sorting. SPAA 2003: 138-148

Peter Sanders, Sebastian Egner, Ludo M. G. M. Tolhuizen: Polynomial time algorithms for network information flow. SPAA 2003: 286-294

Dimitris Fotakis, Rasmus Pagh, Peter Sanders, Paul G. Spirakis: Space Efficient Hash Tables with Worst Case Constant Access Time. STACS 2003: 271-282

Ulrich Meyer, Peter Sanders, Jop F. Sibeyn (Eds.): Algorithms for Memory Hierarchies, Advanced Lectures [Dagstuhl Research Seminar, March 10-14, 2002]. Lecture Notes in Computer Science 2625, Springer 2003, isbn 3-540-00883-7

Peter Sanders: Randomized Receiver Initiated Load-balancing Algorithms for Tree-shaped Computations. Comput. J. 45(5): 561-573 (2002)

Rolf Niedermeier, Klaus Reinhardt, Peter Sanders: Towards optimal locality in mesh-indexings. Discrete Applied Mathematics 117(1-3): 211-237 (2002)

Peter Sanders, Roland Vollmar, Thomas Worsch: Cellular Automata: Energy Consumption and Physical Feasibility. Fundam. Inform. 52(1-3): 233-248 (2002)

Peter Sanders: Reconciling simplicity and realism in parallel disk models. Parallel Computing 28(5): 705-723 (2002)

Ralf Reussner, Peter Sanders, Jesper Larsson Träff: SKaMPI: a comprehensive benchmark for public benchmarking of MPI. Scientific Programming 10(1): 55-65 (2002)

Peter Sanders: Memory Hierarchies - Models and Lower Bounds. Algorithms for Memory Hierarchies 2002: 1-13

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

René Beier, Peter Sanders, Naveen Sivadasan: Energy Optimal Routing in Radio Networks Using Geometric Data Structures. ICALP 2002: 366-376

Peter Sanders, Berthold Vöcking: Random Arc Allocation and Applications. SWAT 2002: 121-130

Peter Sanders, Roberto Solis-Oba: How Helpers Hasten h-Relations. J. Algorithms 41(1): 86-98 (2001)

David A. Hutchinson, Peter Sanders, Jeffrey Scott Vitter: Duality between Prefetching and Queued Writing with Parallel Disks. ESA 2001: 62-73

Peter Sanders: Reconciling simplicity and realism in parallel disk models. SODA 2001: 67-76

David A. Hutchinson, Peter Sanders, Jeffrey Scott Vitter: The power of duality for prefetching and sorting with parallel disks. SPAA 2001: 334-335

Peter Sanders: Fast Priority Queues for Cached Memory. ACM Journal of Experimental Algorithmics 5: 7 (2000)

David A. Bader, Bernard M. E. Moret, Peter Sanders: Algorithm Engineering for Parallel Computation. Experimental Algorithmics 2000: 1-23

Catherine C. McGeoch, Peter Sanders, Rudolf Fleischer, Paul R. Cohen, Doina Precup: Using Finite Experiments to Study Asymptotic Performance. Experimental Algorithmics 2000: 93-126

Peter Sanders: Presenting Data from Experiments in Algorithmics. Experimental Algorithmics 2000: 181-196

Peter Sanders, Roberto Solis-Oba: How Helpers Hasten h-Relations. ESA 2000: 392-402

Ulrich Meyer, Peter Sanders: Parallel Shortest Path for Arbitrary Graphs. Euro-Par 2000: 461-470

Peter Sanders, Jop F. Sibeyn: A Bandwidth Latency Tradeoff for Broadcast and Reduction. Euro-Par 2000: 918-926

Peter Sanders, Sebastian Egner, Jan H. M. Korst: Fast concurrent access to parallel disks. SODA 2000: 849-858

Peter Sanders: Asynchronous scheduling of redundant disk arrays. SPAA 2000: 89-98

Peter Sanders, Rudolf Fleischer: Asymptotic Complexity from Experiments? A Case Study for Randomized Algorithms. Algorithm Engineering 2000: 135-146

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

Peter Sanders: Analysis of nearest neighbor load balancing algorithms for random loads. Parallel Computing 25(8): 1013-1033 (1999)

Peter Sanders: Fast Priority Queues for Cached Memory. ALENEX 1999: 312-327

Peter Sanders, Tuomo Takkula, Dag Wedelin: High Performance Integer Optimization for Crew Scheduling. HPCN Europe 1999: 3-12

Peter Sanders: Accessing Multiple Sequences Through Set Associative Caches. ICALP 1999: 655-664

Peter Sanders: Asynchronous Random Polling Dynamic Load Balancing. ISAAC 1999: 37-48

Peter Sanders: Random Permutations on Distributed, External and Hierarchical Memory. Inf. Process. Lett. 67(6): 305-309 (1998)

Peter Sanders: Randomized Priority Queues for Fast Parallel Access. J. Parallel Distrib. Comput. 49(1): 86-97 (1998)

Ulrich Meyer, Peter Sanders: Delta-Stepping: A Parallel Single Source Shortest Path Algorithm. ESA 1998: 393-404

Panayiotis Alefragis, Christos Goumopoulos, Efthymios Housos, Peter Sanders, Tuomo Takkula, Dag Wedelin: Parallel Crew Scheduling in PAROS. Euro-Par 1998: 1104-1113

Andreas Crauser, Kurt Mehlhorn, Ulrich Meyer, Peter Sanders: A Parallelization of Dijkstra's Shortest Path Algorithm. MFCS 1998: 722-731

Ralf Reussner, Peter Sanders, Lutz Prechelt, Matthias Müller: SKaMPI: A Detailed, Accurate MPI Benchmark. PVM/MPI 1998: 52-59

Torben Hagerup, Peter Sanders, Jesper Larsson Träff: An Implementation of the Binary Blocking Flow Algorithm. Algorithm Engineering 1998: 143-154

Peter Sanders, Thomas Worsch: Parallele Programmierung mit MPI - ein Praktikum, Programmtexte im Internet. Logos Verlag 1997, isbn 978-3-931216-76-4, pp. 1-150

Peter Sanders, Roland Vollmar, Thomas Worsch: Feasible Models of Computation: Three-Dimensionality and Energy Consumption. Euro-Par 1997: 384-388

Rolf Niedermeier, Klaus Reinhardt, Peter Sanders: Towards Optimal Locality in Mesh-Indexings. FCT 1997: 364-375

Peter Sanders, Thomas Hansch: Efficient Massively Parallel Quicksort. IRREGULAR 1997: 13-24

Peter Sanders: On the Efficiency of Nearest Neighbor Load Balancing for Random Loads. Parcella 1996: 120-127

Peter Sanders: Optimizing the Emulation of MIMD Behavior on SIMD Machines. Parcella 1996: 320-321

Peter Sanders: Better Algorithms for Parallel Backtracking. IRREGULAR 1995: 333-347

Holger Hopp, Peter Sanders: Parallel Game Tree Search on SIMD Machines. IRREGULAR 1995: 349-361

Peter Sanders: Fast Priority Queues for Parallel Branch-and-Bound. IRREGULAR 1995: 379-393

Peter Sanders: Emulating MIMD Behaviour on SIMD-Machines. EUROSIM 1994: 313-320

Peter Sanders: Massively Parallel Search for Transition-Tables of Polyautomata. Parcella 1994: 99-108

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