MPI-INF Logo

MPI-INF D1 Publications

Search the publication database
.
Return

Your search returned the following 74 documents:

  1. Peter Sanders, Johannes Singler, and Rob van Stee
    Real-time prefetching and caching
    Journal of Scheduling 16 (1): 47-58, 2013
    [PDF: Download: fetch.pdf]
  2. Rene Beier, Stefan Funke, Domagoj Matijevic, and Peter Sanders
    Energy-Efficient Paths in Radio Networks
    Algorithmica 61 (2): 298-319, 2011
  3. Peter Sanders, Naveen Sivadasan, and Martin Skutella
    Online scheduling with bounded migration
    Mathematics of Operations Research 34 (2): 481-498, 2009
  4. Kurt Mehlhorn and Peter Sanders
    Algorithms and Data Structures: The Basic Toolbox
    , Springer, Berlin, 2008, 300 p.
  5. Holger Bast, Stefan Funke, Peter Sanders, and Dominik Schultes
    Fast Routing in Road Networks using Transit Nodes
    Science 316 (5824): 566 p., 2007
  6. Holger Bast, Stefan Funke, Domagoj Matijevic, Peter Sanders, and Dominik Schultes
    In Transit to Constant Time Shortest-Path Queries in Road Networks
    In: 9th Workshop on Algorithm Enginneering and Experiments (ALENEX'07), New Orleans, USA, 2007, 46-59
  7. Jens Maue, Peter Sanders, and Domagoj Matijevic
    Goal Directed Shortest Path Queries Using Precomputed Cluster Distances
    In: Experimental Algorithms, 5th International Workshop, WEA 2006, Cala Galdana, Menorca, Spain, 2006, 316-327
  8. Kanela Kaligosi and Peter Sanders
    How Branch Mispredictions Affect Quicksort
    In: Algorithms - ESA 2006, 14th Annual European Symposium, Zürich, Switzerland, 2006, 780-791
  9. Peter Sanders and David Steurer
    An Asymptotic Approximation Scheme for Multigraph Edge Coloring
    In: Proceedings of the sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-05), Vancouver, Canada, 2005, 897-906
  10. Roman Dementiev, Juha Kärkkäinen, Jens Mehnert, and Peter Sanders
    Better External Memory Suffix Array Construction
    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]
  11. Seth Pettie and Peter Sanders
    Computing Approximate Matchings in External Memory, Streaming, Parallel, and Distributed Network Models

  12. David A. Hutchinson, Peter Sanders, and Jeffrey Scott Vitter
    Duality Between Prefetching and Queued Writing with Parallel Disks
    SIAM Journal on Computing 34 (6): 1443-1463, 2005
  13. Dimitris Fotakis, Rasmus Pagh, Peter Sanders, and Paul G. Spirakis
    Space Efficient Hash Tables With Worst Case Constant Access Time
    Theory of Computing Systems 38 (2): 229-248, 2005
  14. Kanela Kaligosi, Kurt Mehlhorn, J. Ian Munro, and Peter Sanders
    Towards Optimal Multiple Selection
    In: Automata, languages and programming : 32nd International Colloquim, ICALP 2005, Lisbon, Portugal, 2005, 103-114
    [PDF: Download: Mehlhorn_a_2005_o.pdf]
  15. Roman Dementiev, Lutz Kettner, and Peter Sanders
    STXXL: Standard Template Library for XXL Data Sets
    Fakultät für Informatik, University of Karlsruhe, Karlsruhe, 2005/18, Technical Report
  16. Roman Dementiev, Lutz Kettner, and Peter Sanders
    STXXL: Standard Template Library for XXL Data Sets
    In: Algorithms - ESA 2005 : 13th Annual European Symposium (ESA 2005), Palma de Mallorca, Spain, 2005, 640-651
  17. Seth Pettie and Peter Sanders
    A simpler linear time 2/3 - eps approximation for maximum weight matching
    Information Processing Letters 91 (6): 271-276, 2004
    [PS: Download: twothirds.ps]
  18. Peter Sanders and Seth Pettie
    A Simpler Linear Time 2/3 - epsilon Approximation for Maximum Weight Matching
    Max-Planck-Institut für Informatik, Stuhlsatzenhausweg 85, MPI-I-2004-1-002, Research Report
    [PS: Download: MPI-I-2004-1-002.ps]
  19. Peter Sanders
    Algorithms for Scalable Storage Servers
    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
  20. Stefan Funke, Domagoj Matijevic, and Peter Sanders
    Constant Time Queries for Energy Efficient Paths in Multi-Hop Wireless Networks
    In: First International Workshop on Algorithms for Wireless and Mobile Networks, Boston, USA, 2004, 97-111
    [PDF: Download: aswan.pdf]
  21. Roman Dementiev, Lutz Kettner, Jens Mehnert, and Peter Sanders
    Engineering a Sorted List Data Structure for 32 Bit Key
    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
  22. Roman Dementiev, Peter Sanders, Dominik Schultes, and Jop F. Sibeyn
    Engineering an External Memory Minimum Spanning Tree Algorithm
    In: 3rd IFIP International Conference on Theoretical Computer Science (TSC2004), Toulouse, France, 2004, 195-208
    [PDF: Download: emst.pdf]
  23. Peter Sanders, Naveen Sivadasan, and Martin Skutella
    Online scheduling with bounded migration
    In: Automata, languages and programming : 31st International Colloquium, ICALP 2004, Turku, Finnland, 2004, 1111-1122
    [PS: Download: icalp04.ps]
  24. Naveen Sivadasan, Peter Sanders, and Martin Skutella
    Online Scheduling with Bounded Migration
    Max-Planck-Institut für Informatik, Stuhlsatzenhausweg 85, MPI-I-2004-1-004, Research Report
    [PDF: Download: MPI-I-2004-1-004.pdf]
  25. Peter Sanders
    Super Scalar Sample Sort
    In: Algorithms – ESA 2004: 12th Annual European Symposium, Bergen, Norway, 2004, 784-796
  26. Ulrich Meyer and Peter Sanders
    $\Delta$-stepping: a parallelizable shortest path algorithm
    Journal of Algorithms 49: 114-152, 2003
  27. Peter Sanders and Jop F. Sibeyn
    A Bandwidth Latency Tradeoff for Broadcast and Reduction
    Information Processing Letters 86 (1): 33-38, 2003
  28. Irit Katriel, Peter Sanders, and Jesper Larsson Träff
    A Practical Minimum Spanning Tree Algorithm Using the Cycle Property
    In: Algorithms - ESA 2003: 11th Annual European Symposium, Budapest, Hungary, September, 16-19, 2003, 679-690
  29. Stefan Funke, Domagoj Matijevic, and Peter Sanders
    Approximating Energy Efficient Paths in Wireless Multi-hop Networks
    In: Algorithms - ESA 2003: 11th Annual European Symposium, Budapest, Hungary, September 2003, 2003, 230-241
    [PS: Download: RadioESA03long.ps.gz]
  30. Roman Dementiev and Peter Sanders
    Asynchronous Parallel Disk Sorting
    In: Proceedings of the 15th ACM Symposium on Parallel Algorithms and Architectures (SPAA-03), San Diego, USA, June, 7 - Jun, 9, 2003, 138-148
  31. Peter Sanders
    Asynchronous Scheduling of Redundant Disk Arrays
    IEEE Transactions on Computers 52 (9): 1170-1184, 2003
  32. Peter Sanders
    Memory hierarchies - models and lower bounds
    In: Algorithms for memory hierarchies, 2003, 1-10
  33. Peter Sanders, Sebastian Egner, and Ludo Tolhuizen
    Polynomial Time Algorithms For Network Information Flow
    In: Proceedings of the 15th ACM Symposium on Parallel Algorithms and Architectures (SPAA-03), San Diego, USA, June, 7 - Jun, 9, 2003, 286-294
  34. Kurt Mehlhorn and Peter Sanders
    Scanning Multiple Sequences via Cache Memory
    Algorithmica 35 (1): 75-93, 2003

  35. Piotr Krysta, Peter Sanders, and Berthold Vöcking
    Scheduling and Traffic Allocation for Tasks with Bounded Splittability
    In: Mathematical foundations of computer science 2003 : 28th International Symposium, MFCS 2003, Bratislava, Agust, 25 - August, 29, 2003, 500-510
  36. Juha Kärkkäinen and Peter Sanders
    Simple Linear Work Suffix Array Construction
    In: Automata, languages and programming : 30th International Colloquium, ICALP 2003, Eindhoven, The Netherlands, June 30 - July 4, 2003, 2003, 943-955
  37. Dimitris Fotakis, Rasmus Pagh, Peter Sanders, and Paul G. Spirakis
    Space Efficient Hash Tables with Worst Case Constant Access Time
    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]
  38. Peter Sanders and Berthold Vöcking
    Tail bounds and expectations for random arc allocation and applications
    Combinatorics, Probability and Computing 12 (3): 225-244, 2003
  39. David Bader, Bernard Moret, and Peter Sanders
    Algorithm Engineering for Parallel Computation
    In: Experimental Algorithmics, 2002, 1-23
  40. Rene Beier, Peter Sanders, and Naveen Sivadasan
    Energy Optimal Routing in Radio Networks Using Geometric Data Structures
    In: Automata, Languages and Programming : 29th International Colloquium, ICALP 2002, Málaga, Spain, 2002, 366-376
  41. Peter Sanders, R. Vollmar, and T. Worsch
    Feasible models of computation: Three-dimensionality and energy consumption
    Fundamenta Informaticae 52 (1-3): 233-248, 2002
  42. Peter Sanders
    Presenting Data from Experiments in Algorithmics
    In: Experimental Algorithmics, 2002, 181-196
  43. Peter Sanders and Berthold Vöcking
    Random Arc Allocation and Applications to Disks, Drums and DRAMs
    In: Algorithm theory, SWAT 2002 : 8th Scandinavian Workshop on Algorithm Theory, Turku, 2002, 121-130
  44. Peter Sanders
    Randomized Receiver Initiated Load Balancing Algorithms for Tree Shaped Computations
    The Computer Journal 45 (5): 561-573, 2002
  45. Peter Sanders
    Reconciling simplicity and realism in parallel disk models
    Parallel Computing 28 (5): 705-723, 2002
  46. Peter Sanders and Jesper Larsson Träff
    The factor algorithm for regular all-to-all communication on clusters of SMP nodes
    In: Proceedings of the 8th International Euro-Par Conference, Paderborn, 2002, 799-803
  47. Rolf Niedermeier, Klaus Reinhard, and Peter Sanders
    Towards Optimal Locality in Mesh-Indexings
    Discrete Applied Mathematics 117 (1-3): 211-237, 2002
  48. Catherine McGeoch, Peter Sanders, Rudolf Fleischer, Paul R. Cohen, and Doina Precup
    Using Finite Experiments to Study Asymptotic Performance
    In: Experimental Algorithmics, 2002, 93-126
  49. David A. Hutchinson, Peter Sanders, and Jeffrey Scott Vitter
    Duality Between Prefetching and Queued Writing with Parallel Disks
    In: Proceedings of the 9th Annual European Symposium on Algorithms (ESA-01), Aarhus, Denmark, August 28 - 31, 2001, 62-73
  50. Peter Sanders and Roberto Solis-Oba
    How Helpers Hasten h-Relations
    Journal of Algorithms 41: 86-98, 2001
  51. Peter Sanders
    Reconciling Simplicity and Realism in Parallel Disk Models
    In: Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-01), Waschington DC, USA, January 7- January 9, 2001, 67-76
  52. David A. Hutchinson, Peter Sanders, and Jeffrey Scott Vitter
    The Power of Duality for Prefetching and Sorting with Parallel Disks
    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
  53. Peter Sanders and Jop F. Sibeyn
    A Bandwidth Latency Tradeoff for Broadcast and Reduction
    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
  54. Peter Sanders
    Asynchronous Scheduling of Redundant Disk Arrays
    In: Proceedings of the 12th Annual ACM Symposium on Parallel Algorithms and Architecture (SPAA-00), Bar Harbor, Maine, July 9-12, 2000, 89-98
  55. Peter Sanders, Sebastian Egner, and Jan Korst
    Fast Concurrent Access to Parallel Disks
    In: Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-00), San Francisco, USA, January 9-11, 2000, 849-858
  56. Peter Sanders
    Fast Priority Queues for Cached Memory
    Journal of Experimental Algorithmics 5: 1-25, 2000
  57. Peter Sanders and Roberto Solis-Oba
    How Helpers Hasten h-Relations
    In: Algorithms - ESA 2000, Proceedings of the 8th Annual European Symposium (ESA-00), Saarbrücken, Germany, September, 5-8, 2000, 392-402
  58. Ulrich Meyer and Peter Sanders
    Parallel Shortest Path for Arbitrary Graphs
    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
  59. Ulrich Rathe, Peter Sanders, and Peter Knight
    A case study in scalability: an ADI method for the two-dimensional time-dependent Dirac equation
    Parallel Computing 25 (5): 525-534, 1999
  60. Peter Sanders
    Accessing Multiple Sequences Through Set Associative Caches
    In: Proceedings of the 26th International Colloquium on Automata, Languages and Programming (ICALP-99), Prague, Czech Republic, July, 11-15, 1999, 655-664
  61. Peter Sanders
    Analysis of nearest neighbor load balancing algorithms for random loads
    Parallel Computing 25: 1013-1033, 1999
  62. Peter Sanders
    Asynchronous Random Polling Dynamic Load Balancing
    In: Algorithms and computation : 10th International Symposium, ISAAC'99, Chennai, India, December, 16-18, 1999, 37-48
  63. Peter Sanders
    Berechnungen mit großen Datenmengen
    In: Jahrbuch der Max-Planck-Gesellschaft 1999, 1999, 534-540
  64. Peter Sanders
    Fast Priority Queues for Cached Memory
    In: Selected papers of the International Workshop on Algorithm Engineering and Experimentation (ALENEX-99), Baltimore, USA, January, 15-16, 1999, 312-327
  65. Peter Sanders, Tuomo Takkula, and Dag Wedelin
    High performance integer optimization for crew scheduling
    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
  66. Ulrich Meyer and Peter Sanders
    $\Delta$-Stepping: A Parallel Single Source Shortest Path Algorithm
    In: Proceedings of the 6th Annual European Symposium on Algorithms (ESA-98), Venice, Italy, August, 24 - 26, 1998, 393-404
  67. Andreas Crauser, Kurt Mehlhorn, Ulrich Meyer, and Peter Sanders
    A Parallelization of Dijkstra's Shortest Path Algorithm
    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

  68. Torben Hagerup, Peter Sanders, and Jesper Larsson Träff
    An Implementation of the Binary Blocking Flow Algorithm
    In: Proceedings of the 2nd Workshop on Algorithm Engineering (WAE-98), Saarbrücken, Germany, August 20-22, 1998, 143-154
  69. Panayiotis Alefragis, Christos Goumopoulos, Peter Sanders, Tuomo Takkula, and Dag Wedelin
    Parallel Crew Scheduling in PAROS
    In: Proceedings of the 4th International Euro-Par Conference (Euro-Par-98), Southhampton, UK, September, 1-4, 1998, 1104-1113
  70. Peter Sanders
    Random Permutations on Distributed, External and Hierarchical Memory
    PARS-Mitteilungen 1998 (17): 160-165, 1998
  71. Peter Sanders
    Random Permutations on Distributed, External and Hierarchical Memory
    Information Processing Letters 67 (6): 305-309, 1998
  72. Peter Sanders
    Randomized Priority Queues for Fast Parallel Access
    Journal Parallel and Distributed Computing 49 (1): 86-97, 1998
  73. Peter Sanders, Ralf Reussner, Lutz Prechelt, and Matthias Müller
    SKaMPI: A Detailed, Accurate MPI Benchmark
    In: Proceedings of the 5th European PVM/MPI Users' Group Meeting, Liverpool, UK, September, 7-9, 1998, 52-59
  74. Peter Sanders
    Tree Shaped Computations as a Model for Parallel Applications
    In: Anwendungsbezogene Lastverteilung (ALV), München, March 25-26, 1998, 123-132