Search the dblp DataBase
Peter Sanders :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Peter Sanders Fast Priority Queues for Cached Memory. [Citation Graph (0, 0)][DBLP ] ALENEX, 1999, pp:312-327 [Conf ] Roman Dementiev , Juha Kärkkäinen , Jens Mehnert , Peter Sanders Better External Memory Suffix Array Construction. [Citation Graph (0, 0)][DBLP ] ALENEX/ANALCO, 2005, pp:86-97 [Conf ] Roman Dementiev , Lutz Kettner , Jens Mehnert , Peter Sanders Engineering a Sorted List Data Structure for 32 Bit Key. [Citation Graph (0, 0)][DBLP ] ALENEX/ANALC, 2004, pp:142-151 [Conf ] David A. Bader , Bernard M. E. Moret , Peter Sanders Algorithm Engineering for Parallel Computation. [Citation Graph (0, 0)][DBLP ] Experimental Algorithmics, 2000, pp:1-23 [Conf ] Catherine C. McGeoch , Peter Sanders , Rudolf Fleischer , Paul R. Cohen , Doina Precup Using Finite Experiments to Study Asymptotic Performance. [Citation Graph (0, 0)][DBLP ] Experimental Algorithmics, 2000, pp:93-126 [Conf ] Peter Sanders Presenting Data from Experiments in Algorithmics. [Citation Graph (0, 0)][DBLP ] Experimental Algorithmics, 2000, pp:181-196 [Conf ] Peter Sanders Memory Hierarchies - Models and Lower Bounds. [Citation Graph (0, 0)][DBLP ] Algorithms for Memory Hierarchies, 2002, pp:1-13 [Conf ] Peter Sanders , Naveen Sivadasan , Martin Skutella Online Scheduling with Bounded Migration. [Citation Graph (0, 0)][DBLP ] Algorithms for Optimization with Incomplete Information, 2005, pp:- [Conf ] Roman Dementiev , Lutz Kettner , Peter Sanders : Standard Template Library for XXL Data Sets. [Citation Graph (0, 0)][DBLP ] ESA, 2005, pp:640-651 [Conf ] Stefan Funke , Domagoj Matijevic , Peter Sanders Approximating Energy Efficient Paths in Wireless Multi-hop Networks. [Citation Graph (0, 0)][DBLP ] ESA, 2003, pp:230-241 [Conf ] David A. Hutchinson , Peter Sanders , Jeffrey Scott Vitter Duality between Prefetching and Queued Writing with Parallel Disks. [Citation Graph (0, 0)][DBLP ] ESA, 2001, pp:62-73 [Conf ] Kanela Kaligosi , Peter Sanders How Branch Mispredictions Affect Quicksort. [Citation Graph (0, 0)][DBLP ] ESA, 2006, pp:780-791 [Conf ] Irit Katriel , Peter Sanders , Jesper Larsson Träff A Practical Minimum Spanning Tree Algorithm Using the Cycle Property. [Citation Graph (0, 0)][DBLP ] ESA, 2003, pp:679-690 [Conf ] Ulrich Meyer , Peter Sanders Delta-Stepping: A Parallel Single Source Shortest Path Algorithm. [Citation Graph (0, 0)][DBLP ] ESA, 1998, pp:393-404 [Conf ] Peter Sanders , Roberto Solis-Oba How Helpers Hasten h -Relations. [Citation Graph (0, 0)][DBLP ] ESA, 2000, pp:392-402 [Conf ] Peter Sanders , Dominik Schultes Highway Hierarchies Hasten Exact Shortest Path Queries. [Citation Graph (0, 0)][DBLP ] ESA, 2005, pp:568-579 [Conf ] Peter Sanders , Dominik Schultes Engineering Highway Hierarchies. [Citation Graph (0, 0)][DBLP ] ESA, 2006, pp:804-816 [Conf ] Peter Sanders , Sebastian Winkel Super Scalar Sample Sort. [Citation Graph (0, 0)][DBLP ] ESA, 2004, pp:784-796 [Conf ] Panayiotis Alefragis , Christos Goumopoulos , Efthymios Housos , Peter Sanders , Tuomo Takkula , Dag Wedelin Parallel Crew Scheduling in PAROS. [Citation Graph (0, 0)][DBLP ] Euro-Par, 1998, pp:1104-1113 [Conf ] Ulrich Meyer , Peter Sanders Parallel Shortest Path for Arbitrary Graphs. [Citation Graph (0, 0)][DBLP ] Euro-Par, 2000, pp:461-470 [Conf ] Peter Sanders , Jop F. Sibeyn A Bandwidth Latency Tradeoff for Broadcast and Reduction. [Citation Graph (0, 0)][DBLP ] Euro-Par, 2000, pp:918-926 [Conf ] Peter Sanders , Jesper Larsson Träff The Hierarchical Factor Algorithm for All-to-All Communication (Research Note). [Citation Graph (0, 0)][DBLP ] Euro-Par, 2002, pp:799-804 [Conf ] Peter Sanders , Roland Vollmar , Thomas Worsch Feasible Models of Computation: Three-Dimensionality and Energy Consumption. [Citation Graph (0, 0)][DBLP ] Euro-Par, 1997, pp:384-388 [Conf ] Peter Sanders Emulating MIMD Behaviour on SIMD-Machines. [Citation Graph (0, 0)][DBLP ] EUROSIM, 1994, pp:313-320 [Conf ] Rolf Niedermeier , Klaus Reinhardt , Peter Sanders Towards Optimal Locality in Mesh-Indexings. [Citation Graph (0, 0)][DBLP ] FCT, 1997, pp:364-375 [Conf ] Peter Sanders , Tuomo Takkula , Dag Wedelin High Performance Integer Optimization for Crew Scheduling. [Citation Graph (0, 0)][DBLP ] HPCN Europe, 1999, pp:3-12 [Conf ] René Beier , Peter Sanders , Naveen Sivadasan Energy Optimal Routing in Radio Networks Using Geometric Data Structures. [Citation Graph (0, 0)][DBLP ] ICALP, 2002, pp:366-376 [Conf ] Kanela Kaligosi , Kurt Mehlhorn , J. Ian Munro , Peter Sanders Towards Optimal Multiple Selection. [Citation Graph (0, 0)][DBLP ] ICALP, 2005, pp:103-114 [Conf ] Juha Kärkkäinen , Peter Sanders Simple Linear Work Suffix Array Construction. [Citation Graph (0, 0)][DBLP ] ICALP, 2003, pp:943-955 [Conf ] Peter Sanders Accessing Multiple Sequences Through Set Associative Caches. [Citation Graph (0, 0)][DBLP ] ICALP, 1999, pp:655-664 [Conf ] Peter Sanders , Naveen Sivadasan , Martin Skutella Online Scheduling with Bounded Migration. [Citation Graph (0, 0)][DBLP ] ICALP, 2004, pp:1111-1122 [Conf ] Roman Dementiev , Peter Sanders , Dominik Schultes , Jop F. Sibeyn Engineering an External Memory Minimum Spanning Tree Algorithm. [Citation Graph (0, 0)][DBLP ] IFIP TCS, 2004, pp:195-208 [Conf ] Peter Sanders Better Algorithms for Parallel Backtracking. [Citation Graph (0, 0)][DBLP ] IRREGULAR, 1995, pp:333-347 [Conf ] Peter Sanders Fast Priority Queues for Parallel Branch-and-Bound. [Citation Graph (0, 0)][DBLP ] IRREGULAR, 1995, pp:379-393 [Conf ] Peter Sanders , Thomas Hansch Efficient Massively Parallel Quicksort. [Citation Graph (0, 0)][DBLP ] IRREGULAR, 1997, pp:13-24 [Conf ] Holger Hopp , Peter Sanders Parallel Game Tree Search on SIMD Machines. [Citation Graph (0, 0)][DBLP ] IRREGULAR, 1995, pp:349-361 [Conf ] Peter Sanders Asynchronous Random Polling Dynamic Load Balancing. [Citation Graph (0, 0)][DBLP ] ISAAC, 1999, pp:37-48 [Conf ] Andreas Crauser , Kurt Mehlhorn , Ulrich Meyer , Peter Sanders A Parallelization of Dijkstra's Shortest Path Algorithm. [Citation Graph (0, 0)][DBLP ] MFCS, 1998, pp:722-731 [Conf ] Piotr Krysta , Peter Sanders , Berthold Vöcking Scheduling and Traffic Allocation for Tasks with Bounded Splittability. [Citation Graph (0, 0)][DBLP ] MFCS, 2003, pp:500-510 [Conf ] Felix Putze , Peter Sanders , Johannes Singler MCSTL: the multi-core standard template library. [Citation Graph (0, 0)][DBLP ] PPOPP, 2007, pp:144-145 [Conf ] Fabian Kulla , Peter Sanders Scalable Parallel Suffix Array Construction. [Citation Graph (0, 0)][DBLP ] PVM/MPI, 2006, pp:22-29 [Conf ] Ralf Reussner , Peter Sanders , Lutz Prechelt , Matthias Müller SKaMPI: A Detailed, Accurate MPI Benchmark. [Citation Graph (0, 0)][DBLP ] PVM/MPI, 1998, pp:52-59 [Conf ] Peter Sanders , Jesper Larsson Träff Parallel Prefix (Scan) Algorithms for MPI. [Citation Graph (0, 0)][DBLP ] PVM/MPI, 2006, pp:49-57 [Conf ] Peter Sanders Reconciling simplicity and realism in parallel disk models. [Citation Graph (0, 0)][DBLP ] SODA, 2001, pp:67-76 [Conf ] Peter Sanders , Sebastian Egner , Jan H. M. Korst Fast concurrent access to parallel disks. [Citation Graph (0, 0)][DBLP ] SODA, 2000, pp:849-858 [Conf ] Peter Sanders , David Steurer An asymptotic approximation scheme for multigraph edge coloring. [Citation Graph (0, 0)][DBLP ] SODA, 2005, pp:897-906 [Conf ] Peter Sanders Algorithms for Scalable Storage Servers. [Citation Graph (0, 0)][DBLP ] SOFSEM, 2004, pp:82-101 [Conf ] Roman Dementiev , Peter Sanders Asynchronous parallel disk sorting. [Citation Graph (0, 0)][DBLP ] SPAA, 2003, pp:138-148 [Conf ] David A. Hutchinson , Peter Sanders , Jeffrey Scott Vitter The power of duality for prefetching and sorting with parallel disks. [Citation Graph (0, 0)][DBLP ] SPAA, 2001, pp:334-335 [Conf ] Peter Sanders Asynchronous scheduling of redundant disk arrays. [Citation Graph (0, 0)][DBLP ] SPAA, 2000, pp:89-98 [Conf ] Peter Sanders , Sebastian Egner , Ludo M. G. M. Tolhuizen Polynomial time algorithms for network information flow. [Citation Graph (0, 0)][DBLP ] SPAA, 2003, pp:286-294 [Conf ] Dimitris Fotakis , Rasmus Pagh , Peter Sanders , Paul G. Spirakis Space Efficient Hash Tables with Worst Case Constant Access Time. [Citation Graph (0, 0)][DBLP ] STACS, 2003, pp:271-282 [Conf ] Peter Sanders , Berthold Vöcking Random Arc Allocation and Applications. [Citation Graph (0, 0)][DBLP ] SWAT, 2002, pp:121-130 [Conf ] Peter Sanders , Rudolf Fleischer Asymptotic Complexity from Experiments? A Case Study for Randomized Algorithms. [Citation Graph (0, 0)][DBLP ] Algorithm Engineering, 2000, pp:135-146 [Conf ] Torben Hagerup , Peter Sanders , Jesper Larsson Träff An Implementation of the Binary Blocking Flow Algorithm. [Citation Graph (0, 0)][DBLP ] Algorithm Engineering, 1998, pp:143-154 [Conf ] Jens Maue , Peter Sanders , Domagoj Matijevic Goal Directed Shortest Path Queries Using Precomputed Cluster Distances. [Citation Graph (0, 0)][DBLP ] WEA, 2006, pp:316-327 [Conf ] Peter Sanders A Case Study in Object Oriented Programming: Algebraic Structures in Eiffel. [Citation Graph (0, 0)][DBLP ] TOOLS (11), 1993, pp:379-388 [Conf ] Kurt Mehlhorn , Peter Sanders Scanning Multiple Sequences Via Cache Memory. [Citation Graph (0, 0)][DBLP ] Algorithmica, 2003, v:35, n:1, pp:75-93 [Journal ] Peter Sanders , Sebastian Egner , Jan H. M. Korst Fast Concurrent Access to Parallel Disks. [Citation Graph (0, 0)][DBLP ] Algorithmica, 2003, v:35, n:1, pp:21-55 [Journal ] Peter Sanders Randomized Receiver Initiated Load-balancing Algorithms for Tree-shaped Computations. [Citation Graph (0, 0)][DBLP ] Comput. J., 2002, v:45, n:5, pp:561-573 [Journal ] Peter Sanders , Berthold Vöcking Tail Bounds And Expectations For Random Arc Allocation And Applications. [Citation Graph (0, 0)][DBLP ] Combinatorics, Probability & Computing, 2003, v:12, n:3, pp:- [Journal ] Rolf Niedermeier , Klaus Reinhardt , Peter Sanders Towards optimal locality in mesh-indexings. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 2002, v:117, n:1-3, pp:211-237 [Journal ] Peter Sanders Algorithms for Memory Hierarchies (Column: Algorithmics). [Citation Graph (0, 0)][DBLP ] Bulletin of the EATCS, 2004, v:83, n:, pp:67-85 [Journal ] Peter Sanders , Roland Vollmar , Thomas Worsch Cellular Automata: Energy Consumption and Physical Feasibility. [Citation Graph (0, 0)][DBLP ] Fundam. Inform., 2002, v:52, n:1-3, pp:233-248 [Journal ] Seth Pettie , Peter Sanders A simpler linear time 2/3-epsilon approximation for maximum weight matching. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 2004, v:91, n:6, pp:271-276 [Journal ] Peter Sanders Random Permutations on Distributed, External and Hierarchical Memory. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1998, v:67, n:6, pp:305-309 [Journal ] Peter Sanders , Jop F. Sibeyn A bandwidth latency tradeoff for broadcast and reduction. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 2003, v:86, n:1, pp:33-38 [Journal ] Juha Kärkkäinen , Peter Sanders , Stefan Burkhardt Linear work suffix array construction. [Citation Graph (0, 0)][DBLP ] J. ACM, 2006, v:53, n:6, pp:918-936 [Journal ] Ulrich Meyer , Peter Sanders [Delta]-stepping: a parallelizable shortest path algorithm. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 2003, v:49, n:1, pp:114-152 [Journal ] Peter Sanders , Roberto Solis-Oba How Helpers Hasten h-Relations. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 2001, v:41, n:1, pp:86-98 [Journal ] Peter Sanders Fast Priority Queues for Cached Memory. [Citation Graph (0, 0)][DBLP ] ACM Journal of Experimental Algorithms, 2000, v:5, n:, pp:7- [Journal ] Peter Sanders Randomized Priority Queues for Fast Parallel Access. [Citation Graph (0, 0)][DBLP ] J. Parallel Distrib. Comput., 1998, v:49, n:1, pp:86-97 [Journal ] Dimitris Fotakis , Rasmus Pagh , Peter Sanders , Paul G. Spirakis Space Efficient Hash Tables with Worst Case Constant Access Time. [Citation Graph (0, 0)][DBLP ] Theory Comput. Syst., 2005, v:38, n:2, pp:229-248 [Journal ] U. W. Rathe , Peter Sanders , P. L. Knight A case study in scalability: An ADI method for the two-dimensional time-dependent Dirac equation. [Citation Graph (0, 0)][DBLP ] Parallel Computing, 1999, v:25, n:5, pp:525-533 [Journal ] Peter Sanders Reconciling simplicity and realism in parallel disk models. [Citation Graph (0, 0)][DBLP ] Parallel Computing, 2002, v:28, n:5, pp:705-723 [Journal ] Peter Sanders Analysis of nearest neighbor load balancing algorithms for random loads. [Citation Graph (0, 0)][DBLP ] Parallel Computing, 1999, v:25, n:8, pp:1013-1033 [Journal ] Ralf Reussner , Peter Sanders , Jesper Larsson Träff SKaMPI: a comprehensive benchmark for public benchmarking of MPI. [Citation Graph (0, 0)][DBLP ] Scientific Programming, 2002, v:10, n:1, pp:55-65 [Journal ] Peter Sanders Asynchronous Scheduling of Redundant Disk Arrays. [Citation Graph (0, 0)][DBLP ] IEEE Trans. Computers, 2003, v:52, n:9, pp:1170-1184 [Journal ] 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. [Citation Graph (0, 0)][DBLP ] IEEE Transactions on Information Theory, 2005, v:51, n:6, pp:1973-1982 [Journal ] Sebastian Knopp , Peter Sanders , Dominik Schultes , Frank Schulz , Dorothea Wagner Computing Many-to-Many Shortest Paths Using Highway Hierarchies. [Citation Graph (0, 0)][DBLP ] ALENEX, 2007, pp:- [Conf ] Peter Sanders , Frederik Transier Intersection in Integer Inverted Indices. [Citation Graph (0, 0)][DBLP ] ALENEX, 2007, pp:- [Conf ] Holger Bast , Stefan Funke , Domagoj Matijevic , Peter Sanders , Dominik Schultes In Transit to Constant Time Shortest-Path Queries in Road Networks. [Citation Graph (0, 0)][DBLP ] ALENEX, 2007, pp:- [Conf ] Johannes Singler , Peter Sanders , Felix Putze MCSTL: The Multi-core Standard Template Library. [Citation Graph (0, 0)][DBLP ] Euro-Par, 2007, pp:682-694 [Conf ] Peter Sanders , Jochen Speck , Jesper Larsson Träff Full Bandwidth Broadcast, Reduction and Scan with Only Two Trees. [Citation Graph (0, 0)][DBLP ] PVM/MPI, 2007, pp:17-26 [Conf ] Julie Anne Cain , Peter Sanders , Nicholas C. Wormald The random graph threshold for k -orientiability and a fast algorithm for optimal multiple-choice allocation. [Citation Graph (0, 0)][DBLP ] SODA, 2007, pp:469-476 [Conf ] Jens Maue , Peter Sanders Engineering Algorithms for Approximate Weighted Matching. [Citation Graph (0, 0)][DBLP ] WEA, 2007, pp:242-255 [Conf ] Felix Putze , Peter Sanders , Johannes Singler Cache-, Hash- and Space-Efficient Bloom Filters. [Citation Graph (0, 0)][DBLP ] WEA, 2007, pp:108-121 [Conf ] Peter Sanders , Dominik Schultes Engineering Fast Route Planning Algorithms. [Citation Graph (0, 0)][DBLP ] WEA, 2007, pp:23-36 [Conf ] Dominik Schultes , Peter Sanders Dynamic Highway-Node Routing. [Citation Graph (0, 0)][DBLP ] WEA, 2007, pp:66-79 [Conf ] Peter Sanders , Aravind Srinivasan , Berthold Vöcking Foreword. [Citation Graph (0, 0)][DBLP ] Theory Comput. Syst., 2006, v:39, n:6, pp:785- [Journal ] Time-Dependent Contraction Hierarchies. [Citation Graph (, )][DBLP ] The Filter-Kruskal Minimum Spanning Tree Algorithm. [Citation Graph (, )][DBLP ] Compressed Inverted Indexes for In-Memory Search Engines. [Citation Graph (, )][DBLP ] Better Approximation of Betweenness Centrality. [Citation Graph (, )][DBLP ] Simple and Fast Nearest Neighbor Search. [Citation Graph (, )][DBLP ] Route Planning with Flexible Objective Functions. [Citation Graph (, )][DBLP ] Algorithm Engineering - An Attempt at a Definition Using Sorting as an Example. [Citation Graph (, )][DBLP ] Algorithm Engineering - An Attempt at a Definition. [Citation Graph (, )][DBLP ] An Efficient Parallel Algorithm for Graph-Based Image Segmentation. [Citation Graph (, )][DBLP ] Semi-external LTL Model Checking. [Citation Graph (, )][DBLP ] Engineering Route Planning Algorithms. [Citation Graph (, )][DBLP ] Mobile Route Planning. [Citation Graph (, )][DBLP ] n -Level Graph Partitioning. [Citation Graph (, )][DBLP ] Towards Optimal Range Medians. [Citation Graph (, )][DBLP ] Scalable distributed-memory external sorting. [Citation Graph (, )][DBLP ] Optimizing the Emulation of MIMD Behavior on SIMD Machines. [Citation Graph (, )][DBLP ] On the Efficiency of Nearest Neighbor Load Balancing for Random Loads. [Citation Graph (, )][DBLP ] Massively Parallel Search for Transition-Tables of Polyautomata. [Citation Graph (, )][DBLP ] Out of the Box Phrase Indexing. [Citation Graph (, )][DBLP ] Time-Dependent Contraction Hierarchies and Approximation. [Citation Graph (, )][DBLP ] Combining Hierarchical and Goal-Directed Speed-Up Techniques for Dijkstra's Algorithm. [Citation Graph (, )][DBLP ] Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks. [Citation Graph (, )][DBLP ] Distributed Time-Dependent Contraction Hierarchies. [Citation Graph (, )][DBLP ] Single-Pass List Partitioning. [Citation Graph (, )][DBLP ] Time Dependent Contraction Hierarchies -- Basic Algorithmic Ideas [Citation Graph (, )][DBLP ] Towards Optimal Range Medians [Citation Graph (, )][DBLP ] Fast Detour Computation for Ride Sharing [Citation Graph (, )][DBLP ] GPU sample sort [Citation Graph (, )][DBLP ] Engineering a Scalable High Quality Graph Partitioner [Citation Graph (, )][DBLP ] Scalable Distributed-Memory External Sorting [Citation Graph (, )][DBLP ] Defining and Computing Alternative Routes in Road Networks [Citation Graph (, )][DBLP ] n-Level Graph Partitioning [Citation Graph (, )][DBLP ] Improved Fast Similarity Search in Dictionaries [Citation Graph (, )][DBLP ] Faster Radix Sort via Virtual Memory and Write-Combining [Citation Graph (, )][DBLP ] Search in 0.158secs, Finished in 0.163secs