| 2009 |
|---|
| 113 | EE | Vitaly Osipov,
Peter Sanders,
Johannes Singler:
The Filter-Kruskal Minimum Spanning Tree Algorithm.
ALENEX 2009: 52-61 |
| 112 | EE | Gernot Veit Batz,
Daniel Delling,
Peter Sanders,
Christian Vetter:
Time-Dependent Contraction Hierarchies.
ALENEX 2009: 97-105 |
| 111 | EE | Beat Gfeller,
Peter Sanders:
Towards Optimal Range Medians
CoRR abs/0901.1761: (2009) |
| 2008 |
|---|
| 110 | | Kurt Mehlhorn,
Peter Sanders:
Algorithms and Data Structures: The Basic Toolbox.
Springer 2008 |
| 109 | EE | Frederik Transier,
Peter Sanders:
Compressed Inverted Indexes for In-Memory Search Engines.
ALENEX 2008: 3-12 |
| 108 | EE | Robert Geisberger,
Peter Sanders,
Dominik Schultes:
Better Approximation of Betweenness Centrality.
ALENEX 2008: 90-100 |
| 107 | EE | Stefan Edelkamp,
Peter Sanders,
Pavel Simecek:
Semi-external LTL Model Checking.
CAV 2008: 530-542 |
| 106 | EE | Leonor Frias,
Johannes Singler,
Peter Sanders:
Single-Pass List Partitioning.
CISIS 2008: 817-821 |
| 105 | EE | Peter Sanders,
Dominik Schultes,
Christian Vetter:
Mobile Route Planning.
ESA 2008: 732-743 |
| 104 | EE | Frederik Transier,
Peter Sanders:
Out of the Box Phrase Indexing.
SPIRE 2008: 200-211 |
| 103 | EE | 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 |
| 102 | EE | Robert Geisberger,
Peter Sanders,
Dominik Schultes,
Daniel Delling:
Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks.
WEA 2008: 319-333 |
| 101 | EE | Peter Sanders,
Johannes Singler:
Kürzeste Wege.
Taschenbuch der Algorithmen 2008: 345-352 |
| 100 | EE | Roman Dementiev,
Juha Kärkkäinen,
Jens Mehnert,
Peter Sanders:
Better external memory suffix array construction.
ACM Journal of Experimental Algorithmics 12: (2008) |
| 99 | EE | Peter Sanders,
David Steurer:
An asymptotic approximation scheme for multigraph edge coloring.
ACM Transactions on Algorithms 4(2): (2008) |
| 98 | EE | Peter Sanders:
Time Dependent Contraction Hierarchies -- Basic Algorithmic Ideas
CoRR abs/0804.3947: (2008) |
| 97 | EE | Roman Dementiev,
Lutz Kettner,
Peter Sanders:
STXXL: standard template library for XXL data sets.
Softw., Pract. Exper. 38(6): 589-637 (2008) |
| 2007 |
|---|
| 96 | EE | Sebastian Knopp,
Peter Sanders,
Dominik Schultes,
Frank Schulz,
Dorothea Wagner:
Computing Many-to-Many Shortest Paths Using Highway Hierarchies.
ALENEX 2007 |
| 95 | EE | Holger Bast,
Stefan Funke,
Domagoj Matijevic,
Peter Sanders,
Dominik Schultes:
In Transit to Constant Time Shortest-Path Queries in Road Networks.
ALENEX 2007 |
| 94 | EE | Peter Sanders,
Frederik Transier:
Intersection in Integer Inverted Indices.
ALENEX 2007 |
| 93 | EE | Johannes Singler,
Peter Sanders,
Felix Putze:
MCSTL: The Multi-core Standard Template Library.
Euro-Par 2007: 682-694 |
| 92 | EE | Felix Putze,
Peter Sanders,
Johannes Singler:
MCSTL: the multi-core standard template library.
PPOPP 2007: 144-145 |
| 91 | EE | Peter Sanders,
Jochen Speck,
Jesper Larsson Träff:
Full Bandwidth Broadcast, Reduction and Scan with Only Two Trees.
PVM/MPI 2007: 17-26 |
| 90 | EE | 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 |
| 89 | EE | Felix Putze,
Peter Sanders,
Johannes Singler:
Cache-, Hash- and Space-Efficient Bloom Filters.
WEA 2007: 108-121 |
| 88 | EE | Peter Sanders,
Dominik Schultes:
Engineering Fast Route Planning Algorithms.
WEA 2007: 23-36 |
| 87 | EE | Jens Maue,
Peter Sanders:
Engineering Algorithms for Approximate Weighted Matching.
WEA 2007: 242-255 |
| 86 | EE | Dominik Schultes,
Peter Sanders:
Dynamic Highway-Node Routing.
WEA 2007: 66-79 |
| 85 | EE | Fabian Kulla,
Peter Sanders:
Scalable parallel suffix array construction.
Parallel Computing 33(9): 605-612 (2007) |
| 2006 |
|---|
| 84 | EE | Kanela Kaligosi,
Peter Sanders:
How Branch Mispredictions Affect Quicksort.
ESA 2006: 780-791 |
| 83 | EE | Peter Sanders,
Dominik Schultes:
Engineering Highway Hierarchies.
ESA 2006: 804-816 |
| 82 | EE | Fabian Kulla,
Peter Sanders:
Scalable Parallel Suffix Array Construction.
PVM/MPI 2006: 22-29 |
| 81 | EE | Peter Sanders,
Jesper Larsson Träff:
Parallel Prefix (Scan) Algorithms for MPI.
PVM/MPI 2006: 49-57 |
| 80 | EE | Jens Maue,
Peter Sanders,
Domagoj Matijevic:
Goal Directed Shortest Path Queries Using Precomputed Cluster Distances.
WEA 2006: 316-327 |
| 79 | EE | Juha Kärkkäinen,
Peter Sanders,
Stefan Burkhardt:
Linear work suffix array construction.
J. ACM 53(6): 918-936 (2006) |
| 78 | EE | Peter Sanders,
Aravind Srinivasan,
Berthold Vöcking:
Foreword.
Theory Comput. Syst. 39(6): 785 (2006) |
| 2005 |
|---|
| 77 | EE | Roman Dementiev,
Juha Kärkkäinen,
Jens Mehnert,
Peter Sanders:
Better External Memory Suffix Array Construction.
ALENEX/ANALCO 2005: 86-97 |
| 76 | EE | Peter Sanders,
Naveen Sivadasan,
Martin Skutella:
Online Scheduling with Bounded Migration.
Algorithms for Optimization with Incomplete Information 2005 |
| 75 | EE | Peter Sanders,
Dominik Schultes:
Highway Hierarchies Hasten Exact Shortest Path Queries.
ESA 2005: 568-579 |
| 74 | EE | Roman Dementiev,
Lutz Kettner,
Peter Sanders:
: Standard Template Library for XXL Data Sets.
ESA 2005: 640-651 |
| 73 | EE | Kanela Kaligosi,
Kurt Mehlhorn,
J. Ian Munro,
Peter Sanders:
Towards Optimal Multiple Selection.
ICALP 2005: 103-114 |
| 72 | EE | Peter Sanders,
David Steurer:
An asymptotic approximation scheme for multigraph edge coloring.
SODA 2005: 897-906 |
| 71 | EE | 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) |
| 70 | EE | 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) |
| 69 | EE | 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) |
| 2004 |
|---|
| 68 | | Roman Dementiev,
Lutz Kettner,
Jens Mehnert,
Peter Sanders:
Engineering a Sorted List Data Structure for 32 Bit Key.
ALENEX/ANALC 2004: 142-151 |
| 67 | EE | Peter Sanders,
Sebastian Winkel:
Super Scalar Sample Sort.
ESA 2004: 784-796 |
| 66 | EE | Peter Sanders,
Naveen Sivadasan,
Martin Skutella:
Online Scheduling with Bounded Migration.
ICALP 2004: 1111-1122 |
| 65 | | Roman Dementiev,
Peter Sanders,
Dominik Schultes,
Jop F. Sibeyn:
Engineering an External Memory Minimum Spanning Tree Algorithm.
IFIP TCS 2004: 195-208 |
| 64 | EE | Peter Sanders:
Algorithms for Scalable Storage Servers.
SOFSEM 2004: 82-101 |
| 63 | | Peter Sanders:
Algorithms for Memory Hierarchies (Column: Algorithmics).
Bulletin of the EATCS 83: 67-85 (2004) |
| 62 | EE | Seth Pettie,
Peter Sanders:
A simpler linear time 2/3-epsilon approximation for maximum weight matching.
Inf. Process. Lett. 91(6): 271-276 (2004) |
| 2003 |
|---|
| 61 | | Ulrich Meyer,
Peter Sanders,
Jop F. Sibeyn:
Algorithms for Memory Hierarchies, Advanced Lectures [Dagstuhl Research Seminar, March 10-14, 2002]
Springer 2003 |
| 60 | EE | Stefan Funke,
Domagoj Matijevic,
Peter Sanders:
Approximating Energy Efficient Paths in Wireless Multi-hop Networks.
ESA 2003: 230-241 |
| 59 | EE | Irit Katriel,
Peter Sanders,
Jesper Larsson Träff:
A Practical Minimum Spanning Tree Algorithm Using the Cycle Property.
ESA 2003: 679-690 |
| 58 | EE | Juha Kärkkäinen,
Peter Sanders:
Simple Linear Work Suffix Array Construction.
ICALP 2003: 943-955 |
| 57 | EE | Piotr Krysta,
Peter Sanders,
Berthold Vöcking:
Scheduling and Traffic Allocation for Tasks with Bounded Splittability.
MFCS 2003: 500-510 |
| 56 | EE | Roman Dementiev,
Peter Sanders:
Asynchronous parallel disk sorting.
SPAA 2003: 138-148 |
| 55 | EE | Peter Sanders,
Sebastian Egner,
Ludo M. G. M. Tolhuizen:
Polynomial time algorithms for network information flow.
SPAA 2003: 286-294 |
| 54 | EE | Dimitris Fotakis,
Rasmus Pagh,
Peter Sanders,
Paul G. Spirakis:
Space Efficient Hash Tables with Worst Case Constant Access Time.
STACS 2003: 271-282 |
| 53 | EE | Peter Sanders,
Sebastian Egner,
Jan H. M. Korst:
Fast Concurrent Access to Parallel Disks.
Algorithmica 35(1): 21-55 (2003) |
| 52 | EE | Kurt Mehlhorn,
Peter Sanders:
Scanning Multiple Sequences Via Cache Memory.
Algorithmica 35(1): 75-93 (2003) |
| 51 | | Peter Sanders,
Berthold Vöcking:
Tail Bounds And Expectations For Random Arc Allocation And Applications.
Combinatorics, Probability & Computing 12(3): (2003) |
| 50 | EE | Peter Sanders:
Asynchronous Scheduling of Redundant Disk Arrays.
IEEE Trans. Computers 52(9): 1170-1184 (2003) |
| 49 | EE | Peter Sanders,
Jop F. Sibeyn:
A bandwidth latency tradeoff for broadcast and reduction.
Inf. Process. Lett. 86(1): 33-38 (2003) |
| 48 | EE | Ulrich Meyer,
Peter Sanders:
[Delta]-stepping: a parallelizable shortest path algorithm.
J. Algorithms 49(1): 114-152 (2003) |
| 2002 |
|---|
| 47 | EE | Peter Sanders:
Memory Hierarchies - Models and Lower Bounds.
Algorithms for Memory Hierarchies 2002: 1-13 |
| 46 | EE | Peter Sanders,
Jesper Larsson Träff:
The Hierarchical Factor Algorithm for All-to-All Communication (Research Note).
Euro-Par 2002: 799-804 |
| 45 | EE | René Beier,
Peter Sanders,
Naveen Sivadasan:
Energy Optimal Routing in Radio Networks Using Geometric Data Structures.
ICALP 2002: 366-376 |
| 44 | EE | Peter Sanders,
Berthold Vöcking:
Random Arc Allocation and Applications.
SWAT 2002: 121-130 |
| 43 | EE | Peter Sanders:
Randomized Receiver Initiated Load-balancing Algorithms for Tree-shaped Computations.
Comput. J. 45(5): 561-573 (2002) |
| 42 | | Rolf Niedermeier,
Klaus Reinhardt,
Peter Sanders:
Towards optimal locality in mesh-indexings.
Discrete Applied Mathematics 117(1-3): 211-237 (2002) |
| 41 | EE | Peter Sanders,
Roland Vollmar,
Thomas Worsch:
Cellular Automata: Energy Consumption and Physical Feasibility.
Fundam. Inform. 52(1-3): 233-248 (2002) |
| 40 | | Peter Sanders:
Reconciling simplicity and realism in parallel disk models.
Parallel Computing 28(5): 705-723 (2002) |
| 39 | | Ralf Reussner,
Peter Sanders,
Jesper Larsson Träff:
SKaMPI: a comprehensive benchmark for public benchmarking of MPI.
Scientific Programming 10(1): 55-65 (2002) |
| 2001 |
|---|
| 38 | EE | David A. Hutchinson,
Peter Sanders,
Jeffrey Scott Vitter:
Duality between Prefetching and Queued Writing with Parallel Disks.
ESA 2001: 62-73 |
| 37 | EE | Peter Sanders:
Reconciling simplicity and realism in parallel disk models.
SODA 2001: 67-76 |
| 36 | EE | David A. Hutchinson,
Peter Sanders,
Jeffrey Scott Vitter:
The power of duality for prefetching and sorting with parallel disks.
SPAA 2001: 334-335 |
| 35 | | Peter Sanders,
Roberto Solis-Oba:
How Helpers Hasten h-Relations.
J. Algorithms 41(1): 86-98 (2001) |
| 2000 |
|---|
| 34 | EE | Peter Sanders,
Rudolf Fleischer:
Asymptotic Complexity from Experiments? A Case Study for Randomized Algorithms.
Algorithm Engineering 2000: 135-146 |
| 33 | | Peter Sanders,
Roberto Solis-Oba:
How Helpers Hasten h-Relations.
ESA 2000: 392-402 |
| 32 | EE | Ulrich Meyer,
Peter Sanders:
Parallel Shortest Path for Arbitrary Graphs.
Euro-Par 2000: 461-470 |
| 31 | EE | Peter Sanders,
Jop F. Sibeyn:
A Bandwidth Latency Tradeoff for Broadcast and Reduction.
Euro-Par 2000: 918-926 |
| 30 | EE | David A. Bader,
Bernard M. E. Moret,
Peter Sanders:
Algorithm Engineering for Parallel Computation.
Experimental Algorithmics 2000: 1-23 |
| 29 | EE | Peter Sanders:
Presenting Data from Experiments in Algorithmics.
Experimental Algorithmics 2000: 181-196 |
| 28 | EE | Catherine C. McGeoch,
Peter Sanders,
Rudolf Fleischer,
Paul R. Cohen,
Doina Precup:
Using Finite Experiments to Study Asymptotic Performance.
Experimental Algorithmics 2000: 93-126 |
| 27 | EE | Peter Sanders,
Sebastian Egner,
Jan H. M. Korst:
Fast concurrent access to parallel disks.
SODA 2000: 849-858 |
| 26 | EE | Peter Sanders:
Asynchronous scheduling of redundant disk arrays.
SPAA 2000: 89-98 |
| 25 | EE | Peter Sanders:
Fast Priority Queues for Cached Memory.
ACM Journal of Experimental Algorithmics 5: 7 (2000) |
| 1999 |
|---|
| 24 | EE | Peter Sanders:
Fast Priority Queues for Cached Memory.
ALENEX 1999: 312-327 |
| 23 | | Peter Sanders,
Tuomo Takkula,
Dag Wedelin:
High Performance Integer Optimization for Crew Scheduling.
HPCN Europe 1999: 3-12 |
| 22 | EE | Peter Sanders:
Accessing Multiple Sequences Through Set Associative Caches.
ICALP 1999: 655-664 |
| 21 | EE | Peter Sanders:
Asynchronous Random Polling Dynamic Load Balancing.
ISAAC 1999: 37-48 |
| 20 | | 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) |
| 19 | | Peter Sanders:
Analysis of nearest neighbor load balancing algorithms for random loads.
Parallel Computing 25(8): 1013-1033 (1999) |
| 1998 |
|---|
| 18 | | Torben Hagerup,
Peter Sanders,
Jesper Larsson Träff:
An Implementation of the Binary Blocking Flow Algorithm.
Algorithm Engineering 1998: 143-154 |
| 17 | EE | Ulrich Meyer,
Peter Sanders:
Delta-Stepping: A Parallel Single Source Shortest Path Algorithm.
ESA 1998: 393-404 |
| 16 | EE | Panayiotis Alefragis,
Christos Goumopoulos,
Efthymios Housos,
Peter Sanders,
Tuomo Takkula,
Dag Wedelin:
Parallel Crew Scheduling in PAROS.
Euro-Par 1998: 1104-1113 |
| 15 | EE | Andreas Crauser,
Kurt Mehlhorn,
Ulrich Meyer,
Peter Sanders:
A Parallelization of Dijkstra's Shortest Path Algorithm.
MFCS 1998: 722-731 |
| 14 | EE | Ralf Reussner,
Peter Sanders,
Lutz Prechelt,
Matthias Müller:
SKaMPI: A Detailed, Accurate MPI Benchmark.
PVM/MPI 1998: 52-59 |
| 13 | EE | Peter Sanders:
Random Permutations on Distributed, External and Hierarchical Memory.
Inf. Process. Lett. 67(6): 305-309 (1998) |
| 12 | | Peter Sanders:
Randomized Priority Queues for Fast Parallel Access.
J. Parallel Distrib. Comput. 49(1): 86-97 (1998) |
| 1997 |
|---|
| 11 | | Peter Sanders,
Roland Vollmar,
Thomas Worsch:
Feasible Models of Computation: Three-Dimensionality and Energy Consumption.
Euro-Par 1997: 384-388 |
| 10 | | Rolf Niedermeier,
Klaus Reinhardt,
Peter Sanders:
Towards Optimal Locality in Mesh-Indexings.
FCT 1997: 364-375 |
| 9 | | Peter Sanders,
Thomas Hansch:
Efficient Massively Parallel Quicksort.
IRREGULAR 1997: 13-24 |
| 1996 |
|---|
| 8 | | Peter Sanders:
On the Efficiency of Nearest Neighbor Load Balancing for Random Loads.
Parcella 1996: 120-127 |
| 7 | | Peter Sanders:
Optimizing the Emulation of MIMD Behavior on SIMD Machines.
Parcella 1996: 320-321 |
| 1995 |
|---|
| 6 | | Peter Sanders:
Better Algorithms for Parallel Backtracking.
IRREGULAR 1995: 333-347 |
| 5 | | Holger Hopp,
Peter Sanders:
Parallel Game Tree Search on SIMD Machines.
IRREGULAR 1995: 349-361 |
| 4 | | Peter Sanders:
Fast Priority Queues for Parallel Branch-and-Bound.
IRREGULAR 1995: 379-393 |
| 1994 |
|---|
| 3 | | Peter Sanders:
Emulating MIMD Behaviour on SIMD-Machines.
EUROSIM 1994: 313-320 |
| 2 | | Peter Sanders:
Massively Parallel Search for Transition-Tables of Polyautomata.
Parcella 1994: 99-108 |
| 1993 |
|---|
| 1 | | Peter Sanders:
A Case Study in Object Oriented Programming: Algebraic Structures in Eiffel.
TOOLS (11) 1993: 379-388 |
