- Asynchronous Scheduling of Redundant Disk Arrays Peter Sanders \Lambda
- An Asymptotic Approximation Scheme for Multigraph Edge Coloring Peter Sanders, David Steurer
- Scanning Multiple Sequences Via Cache Memory \Lambda Kurt Mehlhorn Peter Sanders
- Randomized Priority Queues for Fast Parallel Access Peter Sanders
- Parallel Shortest Path for Arbitrary Graphs ? U. Meyer and P. Sanders
- A Detailed Analysis of Random Polling Dynamic Load Peter Sanders
- Accessing Multiple Sequences Through Set Associative Caches
- A Bandwidth Latency Tradeoff for Broadcast and Reduction ?
- Super Scalar Sample Sort Peter Sanders 1 and Sebastian Winkel 2
- A Parallelization of Dijkstra's Shortest Path Algorithm c
- On the Efficiency of Nearest Neighbor Load Balancing for Random Loads
- Energy Optimal Routing in Radio Networks Using Geometric Data Structures ?
- Parallelizing NPComplete Problems Using Tree Shaped Computations
- High Performance Integer Optimization for Crew Scheduling ?
- Better Algorithms for Parallel Backtracking Peter Sanders
- A Practical Minimum Spanning Tree Algorithm Using the Cycle Property ?
- Asynchronous Parallel Disk Sorting # Roman Dementiev
- Random Arc Allocation and Applications ? Peter Sanders and Berthold Vocking
- Data Sheet 1 Quicksort with final local sorting
- Tail bounds and Expectations for Random Arc Allocation and Applications
- Towards Optimal Locality in MeshIndexings 1 Rolf Niedermeier 2
- Better Algorithms for Parallel Backtracking Peter Sanders
- Parallel Game Tree Search on SIMD Machines Holger Hopp and Peter Sanders
- Fast Priority Queues for Cached Memory Peter Sanders
- A Case Study in Object Oriented Programming. Algebraic Structures in Eiffel
- The Hierarchical Factor Algorithm for Alltoall Communication
- \DeltaStepping : A Parallel Single Source Shortest Path Algorithm
- Reconciling Simplicity and Realism in Parallel Disk Models Peter Sanders \Lambda
- How Helpers Hasten hRelations Peter Sanders
- Fast Concurrent Access to Parallel Disks Peter Sanders
- Optimizing the Emulation of MIMD Behavior on SIMD Machines
- Konvergente lokale Lastverteilungsverfahren und ihre Modellierung durch Zellularautomaten
- Tree Shaped Computations as a Model for Parallel Applications
- Online Scheduling with Bounded Migration Peter Sanders, Naveen Sivadasan, and Martin Skutella
- Asymptotic Complexity from Experiments? A Case Study for Randomized Algorithms
- Parallel Integer Optimization for Crew Scheduling \Lambda Panayiotis Alefragis, Peter Sanders, Tuomo Takkula, Dag Wedelin
- Asynchronous Random Polling Dynamic Load Peter Sanders
- Emulating MIMD Behavior on SIMD Machines Peter Sanders
- Better External Memory Suffix Array Construction Roman Dementiev, Juha Karkkainen, Jens Mehnert, Peter Sanders
- 1. Searching for BigOh in the Data: Inferring Asymptotic Complexity from Experiments
- Duality Between Prefetching and Queued Writing with Parallel Disks
- Fast Concurrent Access to Parallel Disks Peter Sanders \Lambda , Sebastian Egner and Jan Korst y
- SKaMPI: A Detailed, Accurate MPI Benchmark # SpringerVerlag
- Algorithm Engineering for Parallel Computation David A. Bader 1 , Bernard M.E. Moret 1 , and Peter Sanders 2
- An Asymptotic Approximation Scheme for Multigraph Edge Coloring
- Feasible Models of Computation: ThreeDimensionality and Energy Consumption \Lambda
- Space Efficient Hash Tables With Worst Case Constant Access Time ?
- Presenting Data from Experiments in Algorithmics
- Engineering a Sorted List Data Structure for 32 Bit Keys
- Simple Linear Work Sux Array Construction ? Juha Karkkainen, Peter Sanders
- On the Efficient Implementation of Massively Parallel Quicksort
- Polynomial Time Algorithms for Network Information Flow
- Massively Parallel Search for TransitionTables of Polyautomata
- How Helpers Hasten hRelations \Lambda Peter Sanders y
- On the Competitive Analysis of Randomized Static Load Balancing
- Randomized Receiver Initiated Load Balancing Algorithms for Tree Shaped Computations
- Fast Priority Queues for Cached Memory Peter Sanders
- A Scalable Parallel Tree Search Library Peter Sanders
- Randomized Static Load Balancing for TreeShaped Computations
- Algorithms for Scalable Storage Servers ? Peter Sanders
