Your search returned the following 74 documents:

74. Real-time prefetching and caching
    Peter Sanders, Johannes Singler, and Rob van Stee
    Journal of Scheduling 16 (1): 47-58, 2013
    [PDF: Download: fetch.pdf]
    
73. Energy-Efficient Paths in Radio Networks
    Rene Beier, Stefan Funke, Domagoj Matijevic, and Peter Sanders
    Algorithmica 61 (2): 298-319, 2011
    
72. Online scheduling with bounded migration
    Peter Sanders, Naveen Sivadasan, and Martin Skutella
    Mathematics of Operations Research 34 (2): 481-498, 2009
    
71. Algorithms and Data Structures: The Basic Toolbox
    Kurt Mehlhorn and Peter Sanders
    , Springer, Berlin, 2008, 300 p.
    
70. Fast Routing in Road Networks using Transit Nodes
    Holger Bast, Stefan Funke, Peter Sanders, and Dominik Schultes
    Science 316 (5824): 566 p., 2007
    
69. In Transit to Constant Time Shortest-Path Queries in Road Networks
    Holger Bast, Stefan Funke, Domagoj Matijevic, Peter Sanders, and Dominik Schultes
    In: 9th Workshop on Algorithm Enginneering and Experiments (ALENEX'07), New Orleans, USA, 2007, 46-59
    
68. Goal Directed Shortest Path Queries Using Precomputed Cluster Distances
    Jens Maue, Peter Sanders, and Domagoj Matijevic
    In: Experimental Algorithms, 5th International Workshop, WEA 2006, Cala Galdana, Menorca, Spain, 2006, 316-327
    
67. How Branch Mispredictions Affect Quicksort
    Kanela Kaligosi and Peter Sanders
    In: Algorithms - ESA 2006, 14th Annual European Symposium, Zürich, Switzerland, 2006, 780-791
    
66. An Asymptotic Approximation Scheme for Multigraph Edge Coloring
    Peter Sanders and David Steurer
    In: Proceedings of the sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-05), Vancouver, Canada, 2005, 897-906
    
65. Better External Memory Suffix Array Construction
    Roman Dementiev, Juha Kärkkäinen, Jens Mehnert, and Peter Sanders
    In: Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments and the Second Workshop on Analytic Algorithmics and Combinatorics (ALENEX/ANALCO 2005), Vancouver, British Columbia, Canada, 2005, 86-97
    [PDF: Download: DKMS05.pdf]
    
64. Computing Approximate Matchings in External Memory, Streaming, Parallel, and Distributed Network Models
    Seth Pettie and Peter Sanders
    
    
63. Duality Between Prefetching and Queued Writing with Parallel Disks
    David A. Hutchinson, Peter Sanders, and Jeffrey Scott Vitter
    SIAM Journal on Computing 34 (6): 1443-1463, 2005
    
62. Space Efficient Hash Tables With Worst Case Constant Access Time
    Dimitris Fotakis, Rasmus Pagh, Peter Sanders, and Paul G. Spirakis
    Theory of Computing Systems 38 (2): 229-248, 2005
    
61. Towards Optimal Multiple Selection
    Kanela Kaligosi, Kurt Mehlhorn, J. Ian Munro, and Peter Sanders
    In: Automata, languages and programming : 32nd International Colloquim, ICALP 2005, Lisbon, Portugal, 2005, 103-114
    [PDF: Download: Mehlhorn_a_2005_o.pdf]
    
60. STXXL: Standard Template Library for XXL Data Sets
    Roman Dementiev, Lutz Kettner, and Peter Sanders
    Fakultät für Informatik, University of Karlsruhe, Karlsruhe, 2005/18, Technical Report
    
59. STXXL: Standard Template Library for XXL Data Sets
    Roman Dementiev, Lutz Kettner, and Peter Sanders
    In: Algorithms - ESA 2005 : 13th Annual European Symposium (ESA 2005), Palma de Mallorca, Spain, 2005, 640-651
    
58. A simpler linear time 2/3 - eps approximation for maximum weight matching
    Seth Pettie and Peter Sanders
    Information Processing Letters 91 (6): 271-276, 2004
    [PS: Download: twothirds.ps]
    
57. A Simpler Linear Time 2/3 - epsilon Approximation for Maximum Weight Matching
    Peter Sanders and Seth Pettie
    Max-Planck-Institut für Informatik, Stuhlsatzenhausweg 85, MPI-I-2004-1-002, Research Report
    [PS: Download: MPI-I-2004-1-002.ps]
    
56. Algorithms for Scalable Storage Servers
    Peter Sanders
    In: SOFSEM 2004 : theory and practice of computer science ; 30th Conference on Current Trends in Theory and Practice of Computer Science, Merín, Czech Republic, 2004, 82-101
    
55. Constant Time Queries for Energy Efficient Paths in Multi-Hop Wireless Networks
    Stefan Funke, Domagoj Matijevic, and Peter Sanders
    In: First International Workshop on Algorithms for Wireless and Mobile Networks, Boston, USA, 2004, 97-111
    [PDF: Download: aswan.pdf]
    
54. Engineering a Sorted List Data Structure for 32 Bit Key
    Roman Dementiev, Lutz Kettner, Jens Mehnert, and Peter Sanders
    In: Proceedings of the Sixth Workshop on Algorithm Engineering and Experiments and the First Workshop on Analytic Algorithmics and Combinatorics (ALENEX-04), New Orleans, LA, USA, 2004, 142-151
    
53. Engineering an External Memory Minimum Spanning Tree Algorithm
    Roman Dementiev, Peter Sanders, Dominik Schultes, and Jop F. Sibeyn
    In: 3rd IFIP International Conference on Theoretical Computer Science (TSC2004), Toulouse, France, 2004, 195-208
    [PDF: Download: emst.pdf]
    
52. Online scheduling with bounded migration
    Peter Sanders, Naveen Sivadasan, and Martin Skutella
    In: Automata, languages and programming : 31st International Colloquium, ICALP 2004, Turku, Finnland, 2004, 1111-1122
    [PS: Download: icalp04.ps]
    
51. Online Scheduling with Bounded Migration
    Naveen Sivadasan, Peter Sanders, and Martin Skutella
    Max-Planck-Institut für Informatik, Stuhlsatzenhausweg 85, MPI-I-2004-1-004, Research Report
    [PDF: Download: MPI-I-2004-1-004.pdf]
    
50. Super Scalar Sample Sort
    Peter Sanders
    In: Algorithms – ESA 2004: 12th Annual European Symposium, Bergen, Norway, 2004, 784-796
    
49. $\Delta$-stepping: a parallelizable shortest path algorithm
    Ulrich Meyer and Peter Sanders
    Journal of Algorithms 49: 114-152, 2003
    
48. A Bandwidth Latency Tradeoff for Broadcast and Reduction
    Peter Sanders and Jop F. Sibeyn
    Information Processing Letters 86 (1): 33-38, 2003
    
47. A Practical Minimum Spanning Tree Algorithm Using the Cycle Property
    Irit Katriel, Peter Sanders, and Jesper Larsson Träff
    In: Algorithms - ESA 2003: 11th Annual European Symposium, Budapest, Hungary, September, 16-19, 2003, 679-690
    
46. Approximating Energy Efficient Paths in Wireless Multi-hop Networks
    Stefan Funke, Domagoj Matijevic, and Peter Sanders
    In: Algorithms - ESA 2003: 11th Annual European Symposium, Budapest, Hungary, September 2003, 2003, 230-241
    [PS: Download: RadioESA03long.ps.gz]
    
45. Asynchronous Parallel Disk Sorting
    Roman Dementiev and Peter Sanders
    In: Proceedings of the 15th ACM Symposium on Parallel Algorithms and Architectures (SPAA-03), San Diego, USA, June, 7 - Jun, 9, 2003, 138-148
    
44. Asynchronous Scheduling of Redundant Disk Arrays
    Peter Sanders
    IEEE Transactions on Computers 52 (9): 1170-1184, 2003
    
43. Memory hierarchies - models and lower bounds
    Peter Sanders
    In: Algorithms for memory hierarchies, 2003, 1-10
    
42. Polynomial Time Algorithms For Network Information Flow
    Peter Sanders, Sebastian Egner, and Ludo Tolhuizen
    In: Proceedings of the 15th ACM Symposium on Parallel Algorithms and Architectures (SPAA-03), San Diego, USA, June, 7 - Jun, 9, 2003, 286-294
    
41. Scanning Multiple Sequences via Cache Memory
    Kurt Mehlhorn and Peter Sanders
    Algorithmica 35 (1): 75-93, 2003
    
    
40. Scheduling and Traffic Allocation for Tasks with Bounded Splittability
    Piotr Krysta, Peter Sanders, and Berthold Vöcking
    In: Mathematical foundations of computer science 2003 : 28th International Symposium, MFCS 2003, Bratislava, Agust, 25 - August, 29, 2003, 500-510
    
39. Simple Linear Work Suffix Array Construction
    Juha Kärkkäinen and Peter Sanders
    In: Automata, languages and programming : 30th International Colloquium, ICALP 2003, Eindhoven, The Netherlands, June 30 - July 4, 2003, 2003, 943-955
    
38. Space Efficient Hash Tables with Worst Case Constant Access Time
    Dimitris Fotakis, Rasmus Pagh, Peter Sanders, and Paul G. Spirakis
    In: Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science (STACS 2003), Berlin, Germany, February, 27 - March, 1, 2003, 271-282
    [PS: Download: d-cuckoo.ps]
    
37. Tail bounds and expectations for random arc allocation and applications
    Peter Sanders and Berthold Vöcking
    Combinatorics, Probability and Computing 12 (3): 225-244, 2003
    
36. Algorithm Engineering for Parallel Computation
    David Bader, Bernard Moret, and Peter Sanders
    In: Experimental Algorithmics, 2002, 1-23
    
35. Energy Optimal Routing in Radio Networks Using Geometric Data Structures
    Rene Beier, Peter Sanders, and Naveen Sivadasan
    In: Automata, Languages and Programming : 29th International Colloquium, ICALP 2002, Málaga, Spain, 2002, 366-376
    
34. Feasible models of computation: Three-dimensionality and energy consumption
    Peter Sanders, R. Vollmar, and T. Worsch
    Fundamenta Informaticae 52 (1-3): 233-248, 2002
    
33. Presenting Data from Experiments in Algorithmics
    Peter Sanders
    In: Experimental Algorithmics, 2002, 181-196
    
32. Random Arc Allocation and Applications to Disks, Drums and DRAMs
    Peter Sanders and Berthold Vöcking
    In: Algorithm theory, SWAT 2002 : 8th Scandinavian Workshop on Algorithm Theory, Turku, 2002, 121-130
    
31. Randomized Receiver Initiated Load Balancing Algorithms for Tree Shaped Computations
    Peter Sanders
    The Computer Journal 45 (5): 561-573, 2002
    
30. Reconciling simplicity and realism in parallel disk models
    Peter Sanders
    Parallel Computing 28 (5): 705-723, 2002
    
29. The factor algorithm for regular all-to-all communication on clusters of SMP nodes
    Peter Sanders and Jesper Larsson Träff
    In: Proceedings of the 8th International Euro-Par Conference, Paderborn, 2002, 799-803
    
28. Towards Optimal Locality in Mesh-Indexings
    Rolf Niedermeier, Klaus Reinhard, and Peter Sanders
    Discrete Applied Mathematics 117 (1-3): 211-237, 2002
    
27. Using Finite Experiments to Study Asymptotic Performance
    Catherine McGeoch, Peter Sanders, Rudolf Fleischer, Paul R. Cohen, and Doina Precup
    In: Experimental Algorithmics, 2002, 93-126
    
26. Duality Between Prefetching and Queued Writing with Parallel Disks
    David A. Hutchinson, Peter Sanders, and Jeffrey Scott Vitter
    In: Proceedings of the 9th Annual European Symposium on Algorithms (ESA-01), Aarhus, Denmark, August 28 - 31, 2001, 62-73
    
25. How Helpers Hasten h-Relations
    Peter Sanders and Roberto Solis-Oba
    Journal of Algorithms 41: 86-98, 2001
    
24. Reconciling Simplicity and Realism in Parallel Disk Models
    Peter Sanders
    In: Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-01), Waschington DC, USA, January 7- January 9, 2001, 67-76
    
23. The Power of Duality for Prefetching and Sorting with Parallel Disks
    David A. Hutchinson, Peter Sanders, and Jeffrey Scott Vitter
    In: Proceedings of the 13th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA-01), Crete Island, Greece, July 3 - July 6, 2001, 334-335
    
22. A Bandwidth Latency Tradeoff for Broadcast and Reduction
    Peter Sanders and Jop F. Sibeyn
    In: Euro-Par 2000 Parallel Processing, Proceedings of the 6th International Euro-Par Conference (Euro-Par-00), Munich, Germany, August 29 - September 1, 2000, 918-926
    
21. Asynchronous Scheduling of Redundant Disk Arrays
    Peter Sanders
    In: Proceedings of the 12th Annual ACM Symposium on Parallel Algorithms and Architecture (SPAA-00), Bar Harbor, Maine, July 9-12, 2000, 89-98
    
20. Fast Concurrent Access to Parallel Disks
    Peter Sanders, Sebastian Egner, and Jan Korst
    In: Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-00), San Francisco, USA, January 9-11, 2000, 849-858
    
19. Fast Priority Queues for Cached Memory
    Peter Sanders
    Journal of Experimental Algorithmics 5: 1-25, 2000
    
18. How Helpers Hasten h-Relations
    Peter Sanders and Roberto Solis-Oba
    In: Algorithms - ESA 2000, Proceedings of the 8th Annual European Symposium (ESA-00), Saarbrücken, Germany, September, 5-8, 2000, 392-402
    
17. Parallel Shortest Path for Arbitrary Graphs
    Ulrich Meyer and Peter Sanders
    In: Euro-Par 2000 Parallel Processing, Proceedings of the 6th International Euro-Par Conference (Euro-Par-00), Munich, Germany, August, 29 - September, 1, 2000, 461-470
    
16. A case study in scalability: an ADI method for the two-dimensional time-dependent Dirac equation
    Ulrich Rathe, Peter Sanders, and Peter Knight
    Parallel Computing 25 (5): 525-534, 1999
    
15. Accessing Multiple Sequences Through Set Associative Caches
    Peter Sanders
    In: Proceedings of the 26th International Colloquium on Automata, Languages and Programming (ICALP-99), Prague, Czech Republic, July, 11-15, 1999, 655-664
    
14. Analysis of nearest neighbor load balancing algorithms for random loads
    Peter Sanders
    Parallel Computing 25: 1013-1033, 1999
    
13. Asynchronous Random Polling Dynamic Load Balancing
    Peter Sanders
    In: Algorithms and computation : 10th International Symposium, ISAAC'99, Chennai, India, December, 16-18, 1999, 37-48
    
12. Berechnungen mit großen Datenmengen
    Peter Sanders
    In: Jahrbuch der Max-Planck-Gesellschaft 1999, 1999, 534-540
    
11. Fast Priority Queues for Cached Memory
    Peter Sanders
    In: Selected papers of the International Workshop on Algorithm Engineering and Experimentation (ALENEX-99), Baltimore, USA, January, 15-16, 1999, 312-327
    
10. High performance integer optimization for crew scheduling
    Peter Sanders, Tuomo Takkula, and Dag Wedelin
    In: Proceedings of the 7th International Conference on High-Performance Computing and Networking Europe (HPCN Europe-99), Amsterdam, NL, April, 12 - 14, 1999, 3-12
    
9. $\Delta$-Stepping: A Parallel Single Source Shortest Path Algorithm
   Ulrich Meyer and Peter Sanders
   In: Proceedings of the 6th Annual European Symposium on Algorithms (ESA-98), Venice, Italy, August, 24 - 26, 1998, 393-404
   
8. A Parallelization of Dijkstra's Shortest Path Algorithm
   Andreas Crauser, Kurt Mehlhorn, Ulrich Meyer, and Peter Sanders
   In: Proceedings of the 23rd International Symposium on the Mathematical Foundations of Computer Science (MFCS-98), Brno, Czech Republic, August, 24 - August, 28, 1998, 722-731
   
   
7. An Implementation of the Binary Blocking Flow Algorithm
   Torben Hagerup, Peter Sanders, and Jesper Larsson Träff
   In: Proceedings of the 2nd Workshop on Algorithm Engineering (WAE-98), Saarbrücken, Germany, August 20-22, 1998, 143-154
   
6. Parallel Crew Scheduling in PAROS
   Panayiotis Alefragis, Christos Goumopoulos, Peter Sanders, Tuomo Takkula, and Dag Wedelin
   In: Proceedings of the 4th International Euro-Par Conference (Euro-Par-98), Southhampton, UK, September, 1-4, 1998, 1104-1113
   
5. Random Permutations on Distributed, External and Hierarchical Memory
   Peter Sanders
   PARS-Mitteilungen 1998 (17): 160-165, 1998
   
4. Random Permutations on Distributed, External and Hierarchical Memory
   Peter Sanders
   Information Processing Letters 67 (6): 305-309, 1998
   
3. Randomized Priority Queues for Fast Parallel Access
   Peter Sanders
   Journal Parallel and Distributed Computing 49 (1): 86-97, 1998
   
2. SKaMPI: A Detailed, Accurate MPI Benchmark
   Peter Sanders, Ralf Reussner, Lutz Prechelt, and Matthias Müller
   In: Proceedings of the 5th European PVM/MPI Users' Group Meeting, Liverpool, UK, September, 7-9, 1998, 52-59
   
1. Tree Shaped Computations as a Model for Parallel Applications
   Peter Sanders
   In: Anwendungsbezogene Lastverteilung (ALV), München, March 25-26, 1998, 123-132