Peter Sanders

According to our database1, Peter Sanders authored at least 237 papers between 1993 and 2019.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2019
Concurrent Hash Tables: Fast and General(?)!.
TOPC, 2019

Communication-free massively distributed graph generation.
J. Parallel Distrib. Comput., 2019

Novel Parallel Algorithms for Fast Multi-GPU-Based Generation of Massive Scale-Free Networks.
Data Science and Engineering, 2019

Dynamic Space Efficient Hashing.
Algorithmica, 2019

Load-Balancing for Parallel Delaunay Triangulations.
Proceedings of the Euro-Par 2019: Parallel Processing, 2019

2018
Benchmarking for Graph Clustering and Partitioning.
Proceedings of the Encyclopedia of Social Network Analysis and Mining, 2nd Edition, 2018

Efficient Parallel Random Sampling - Vectorized, Cache-Efficient, and Online.
ACM Trans. Math. Softw., 2018

Proving Equivalence Between Imperative and MapReduce Implementations Using Program Transformations.
Proceedings of the Proceedings Third Workshop on Models for Formal Analysis of Real Systems and Sixth International Workshop on Verification and Program Transformation, 2018

Network Flow-Based Refinement for Multilevel Hypergraph Partitioning.
Proceedings of the 17th International Symposium on Experimental Algorithms, 2018

Real-Time Traffic Assignment Using Fast Queries in Customizable Contraction Hierarchies.
Proceedings of the 17th International Symposium on Experimental Algorithms, 2018

Relational Equivalence Proofs Between Imperative and MapReduce Algorithms.
Proceedings of the Verified Software. Theories, Tools, and Experiments, 2018

Communication Efficient Checking of Big Data Operations.
Proceedings of the 2018 IEEE International Parallel and Distributed Processing Symposium, 2018

Communication-Free Massively Distributed Graph Generation.
Proceedings of the 2018 IEEE International Parallel and Distributed Processing Symposium, 2018

Lightweight MPI Communicators with Applications to Perfectly Balanced Quicksort.
Proceedings of the 2018 IEEE International Parallel and Distributed Processing Symposium, 2018

High-Quality Shared-Memory Graph Partitioning.
Proceedings of the Euro-Par 2018: Parallel Processing, 2018

An equal opportunity concept for the coordinated research effort AESC.
Proceedings of the 12th European Conference on Software Architecture: Companion Proceedings, 2018

Optimizing energy consumption and user experience in a mobile video streaming scenario.
Proceedings of the 15th IEEE Annual Consumer Communications & Networking Conference, 2018

2017
Engineering Parallel String Sorting.
Algorithmica, 2017

Distributed evolutionary k-way node separators.
Proceedings of the Genetic and Evolutionary Computation Conference, 2017

Dynamic Space Efficient Hashing.
Proceedings of the 25th Annual European Symposium on Algorithms, 2017

In-Place Parallel Super Scalar Samplesort (IPSSSSo).
Proceedings of the 25th Annual European Symposium on Algorithms, 2017

Parallel d-D Delaunay Triangulations in Shared and Distributed Memory.
Proceedings of the Ninteenth Workshop on Algorithm Engineering and Experiments, 2017

Robust Massively Parallel Sorting.
Proceedings of the Ninteenth Workshop on Algorithm Engineering and Experiments, 2017

Engineering a direct k-way Hypergraph Partitioning Algorithm.
Proceedings of the Ninteenth Workshop on Algorithm Engineering and Experiments, 2017

Engineering a Distributed Full-Text Index.
Proceedings of the Ninteenth Workshop on Algorithm Engineering and Experiments, 2017

2016
Recent Advances in Graph Partitioning.
Proceedings of the Algorithm Engineering - Selected Results and Surveys, 2016

Route Planning in Transportation Networks.
Proceedings of the Algorithm Engineering - Selected Results and Surveys, 2016

Introduction to the Special Issue on SPAA 2014.
TOPC, 2016

Introduction to Special Issue ALENEX 2013.
ACM Journal of Experimental Algorithmics, 2016

Scalable generation of scale-free graphs.
Inf. Process. Lett., 2016

Partitioning (hierarchically clustered) complex networks via size-constrained graph clustering.
J. Heuristics, 2016

Advanced Multilevel Node Separator Algorithms.
Proceedings of the Experimental Algorithms - 15th International Symposium, 2016

Accelerating Local Search for the Maximum Independent Set Problem.
Proceedings of the Experimental Algorithms - 15th International Symposium, 2016

Concurrent hash tables: fast and general?(!).
Proceedings of the 21st ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2016

Generating semi-synthetic validation benchmarks for embryomics.
Proceedings of the 13th IEEE International Symposium on Biomedical Imaging, 2016

Communication Efficient Algorithms for Top-k Selection Problems.
Proceedings of the 2016 IEEE International Parallel and Distributed Processing Symposium, 2016

Fast Parallel Operations on Search Trees.
Proceedings of the 23rd IEEE International Conference on High Performance Computing, 2016

Thrill: High-performance algorithmic distributed batch data processing with C++.
Proceedings of the 2016 IEEE International Conference on Big Data, 2016

k-way Hypergraph Partitioning via n-Level Recursive Bisection.
Proceedings of the Eighteenth Workshop on Algorithm Engineering and Experiments, 2016

Finding Near-Optimal Independent Sets at Scale.
Proceedings of the Eighteenth Workshop on Algorithm Engineering and Experiments, 2016

2015
Graph Partitioning for Independent Sets.
Proceedings of the Experimental Algorithms - 14th International Symposium, 2015

A Bulk-Parallel Priority Queue in External Memory with STXXL.
Proceedings of the Experimental Algorithms - 14th International Symposium, 2015

Parallel Algorithms Reconsidered (Invited Talk).
Proceedings of the 32nd International Symposium on Theoretical Aspects of Computer Science, 2015

Faster Exact Search Using Document Clustering.
Proceedings of the String Processing and Information Retrieval, 2015

Brief Announcement: MultiQueues: Simple Relaxed Concurrent Priority Queues.
Proceedings of the 27th ACM on Symposium on Parallelism in Algorithms and Architectures, 2015

Practical Massively Parallel Sorting.
Proceedings of the 27th ACM on Symposium on Parallelism in Algorithms and Architectures, 2015

Cache-Efficient Aggregation: Hashing Is Sorting.
Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data, Melbourne, Victoria, Australia, May 31, 2015

HordeSat: A Massively Parallel Portfolio SAT Solver.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2015, 2015

Parallel Graph Partitioning for Complex Networks.
Proceedings of the 2015 IEEE International Parallel and Distributed Processing Symposium, 2015

Locality Aware DAG-Scheduling for LU-Decomposition.
Proceedings of the 2015 IEEE International Parallel and Distributed Processing Symposium, 2015

Report from Dagstuhl: SocioPaths - Multimodal Door-to-Door Route Planning via Social Paths.
Proceedings of the 2nd International Workshop on Mining Urban Data co-located with 32nd International Conference on Machine Learning (ICML 2015), 2015

Incorporating road networks into territory design.
Proceedings of the 23rd SIGSPATIAL International Conference on Advances in Geographic Information Systems, 2015

Operating Power Grids with Few Flow Control Buses.
Proceedings of the 2015 ACM Sixth International Conference on Future Energy Systems, 2015

(Semi-)External Algorithms for Graph Partitioning and Clustering.
Proceedings of the Seventeenth Workshop on Algorithm Engineering and Experiments, 2015

2014
Benchmarking for Graph Clustering and Partitioning.
Encyclopedia of Social Network Analysis and Mining, 2014

Engineering Parallel Algorithms: The multicore transformation (Ubiquity symposium).
Ubiquity, 2014

Partitioning Complex Networks via Size-Constrained Clustering.
Proceedings of the Experimental Algorithms - 13th International Symposium, 2014

Parallel Bi-objective Shortest Paths Using Weight-Balanced B-trees with Bulk Updates.
Proceedings of the Experimental Algorithms - 13th International Symposium, 2014

Retrieval and Perfect Hashing Using Fingerprinting.
Proceedings of the Experimental Algorithms - 13th International Symposium, 2014

Algorithm Engineering for Big Data.
Proceedings of the 44. Jahrestagung der Gesellschaft für Informatik, Informatik 2014, Big Data, 2014

PReaCH: A Fast Lightweight Reachability Index Using Pruning and Contraction Hierarchies.
Proceedings of the Algorithms - ESA 2014, 2014

Algorithmen und Datenstrukturen - die Grundwerkzeuge.
eXamen.press, Springer, ISBN: 978-3-642-05471-6, 2014

2013
Real-time integrated prefetching and caching.
J. Scheduling, 2013

Minimum time-dependent travel times with contraction hierarchies.
ACM Journal of Experimental Algorithmics, 2013

Algorithm Engineering.
Informatik Spektrum, 2013

Algorithm Engineering.
Informatik Spektrum, 2013

Algorithmenbibliotheken.
Informatik Spektrum, 2013

Think Locally, Act Globally: Highly Balanced Graph Partitioning.
Proceedings of the Experimental Algorithms, 12th International Symposium, 2013

Transit Node Routing Reconsidered.
Proceedings of the Experimental Algorithms, 12th International Symposium, 2013

On (Dynamic) Range Minimum Queries in External Memory.
Proceedings of the Algorithms and Data Structures - 13th International Symposium, 2013

Work-efficient matrix inversion in polylogarithmic time.
Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures, 2013

Engineering Algorithms for Large Data Sets.
Proceedings of the SOFSEM 2013: Theory and Practice of Computer Science, 2013

Parallel Label-Setting Multi-objective Shortest Path Search.
Proceedings of the 27th IEEE International Symposium on Parallel and Distributed Processing, 2013

Malleable Sorting.
Proceedings of the 27th IEEE International Symposium on Parallel and Distributed Processing, 2013

Efficient many-core query execution in main memory column-stores.
Proceedings of the 29th IEEE International Conference on Data Engineering, 2013

Efficient Parallel and External Matching.
Proceedings of the Euro-Par 2013 Parallel Processing, 2013

Parallel String Sample Sort.
Proceedings of the Algorithms - ESA 2013, 2013

Fast OLAP query execution in main memory on large data in a cluster.
Proceedings of the 2013 IEEE International Conference on Big Data, 2013

Communication efficient algorithms for fundamental big data problems.
Proceedings of the 2013 IEEE International Conference on Big Data, 2013

2012
Exact Routing in Large Road Networks Using Contraction Hierarchies.
Transportation Science, 2012

Route planning with flexible edge restrictions.
ACM Journal of Experimental Algorithmics, 2012

Advanced Coarsening Schemes for Graph Partitioning.
Proceedings of the Experimental Algorithms - 11th International Symposium, 2012

Engineering Graph Partitioning Algorithms.
Proceedings of the Experimental Algorithms - 11th International Symposium, 2012

Efficient Route Compression for Hybrid Route Planning.
Proceedings of the Design and Analysis of Algorithms, 2012

Energy Efficient Frequency Scaling and Scheduling for Malleable Tasks.
Proceedings of the Euro-Par 2012 Parallel Processing - 18th International Conference, 2012

Optimized Hybrid Parallel Lattice Boltzmann Fluid Flow Simulations on Complex Geometries.
Proceedings of the Euro-Par 2012 Parallel Processing - 18th International Conference, 2012

Time-Dependent Route Planning with Generalized Objective Functions.
Proceedings of the Algorithms - ESA 2012, 2012

High quality graph partitioning.
Proceedings of the Graph Partitioning and Graph Clustering, 2012

Distributed Evolutionary Graph Partitioning.
Proceedings of the 14th Meeting on Algorithm Engineering & Experiments, 2012

2011
Algorithm Engineering.
Proceedings of the Encyclopedia of Parallel Computing, 2011

Towards optimal range medians.
Theor. Comput. Sci., 2011

Algorithm Engineering.
it - Information Technology, 2011

Stronger Quickheaps.
Int. J. Found. Comput. Sci., 2011

Energy-Efficient Paths in Radio Networks.
Algorithmica, 2011

Displaying Cell Broadcast messages.
Proceedings of the 14th International Symposium on Wireless Personal Multimedia Communications, 2011

Hierarchy Decomposition for Faster User Equilibria on Road Networks.
Proceedings of the Experimental Algorithms - 10th International Symposium, 2011

Alternative Route Graphs in Road Networks.
Proceedings of the Theory and Practice of Algorithms in (Computer) Systems, 2011

The PEPPHER Approach to Programmability and Performance Portability for Heterogeneous many-core Architectures.
Proceedings of the Applications, Tools and Techniques on the Road to Exascale Computing, Proceedings of the conference ParCo 2011, 31 August, 2011

Efficient Parallel Scheduling of Malleable Tasks.
Proceedings of the 25th IEEE International Symposium on Parallel and Distributed Processing, 2011

Algorithm Engineering for Scalable Parallel External Sorting.
Proceedings of the 25th IEEE International Symposium on Parallel and Distributed Processing, 2011

Engineering efficient error-correcting geocoding.
Proceedings of the 19th ACM SIGSPATIAL International Symposium on Advances in Geographic Information Systems, 2011

Engineering a Multi-core Radix Sort.
Proceedings of the Euro-Par 2011 Parallel Processing - 17th International Conference, 2011

Engineering Multilevel Graph Partitioning Algorithms.
Proceedings of the Algorithms - ESA 2011, 2011

Shortest Paths.
Proceedings of the Algorithms Unplugged, 2011

2010
Engineering basic algorithms of an in-memory text search engine.
ACM Trans. Inf. Syst., 2010

Heuristic initialization for bipartite matching problems.
ACM Journal of Experimental Algorithmics, 2010

Algorithm Engineering.
Informatik Spektrum, 2010

Distributed Time-Dependent Contraction Hierarchies.
Proceedings of the Experimental Algorithms, 9th International Symposium, 2010

Time-Dependent Contraction Hierarchies and Approximation.
Proceedings of the Experimental Algorithms, 9th International Symposium, 2010

Improved Fast Similarity Search in Dictionaries.
Proceedings of the String Processing and Information Retrieval, 2010

Algorithm engineering for scalable parallel external sorting.
Proceedings of the 24th IEEE International Symposium on Parallel and Distributed Processing, 2010

GPU sample sort.
Proceedings of the 24th IEEE International Symposium on Parallel and Distributed Processing, 2010

Engineering a scalable high quality graph partitioner.
Proceedings of the 24th IEEE International Symposium on Parallel and Distributed Processing, 2010

Scalable distributed-memory external sorting.
Proceedings of the 26th International Conference on Data Engineering, 2010

Energy-efficient sorting using solid state disks.
Proceedings of the International Green Computing Conference 2010, 2010

n-Level Graph Partitioning.
Proceedings of the Algorithms, 2010

10261 Executive Summary - Algorithm Engineering.
Proceedings of the Algorithm Engineering, 27.06. - 02.07.2010, 2010

10261 Abstracts Collection - Algorithm Engineering.
Proceedings of the Algorithm Engineering, 27.06. - 02.07.2010, 2010

Engineering Time-Dependent Many-to-Many Shortest Paths Computation.
Proceedings of the ATMOS 2010, 2010

Fast Detour Computation for Ride Sharing.
Proceedings of the ATMOS 2010, 2010

Lifetime Maximization of Monitoring Sensor Networks.
Proceedings of the Algorithms for Sensor Systems, 2010

Algorithm Engineering - An Attempt at a Definition Using Sorting as an Example.
Proceedings of the Twelfth Workshop on Algorithm Engineering and Experiments, 2010

Route Planning with Flexible Objective Functions.
Proceedings of the Twelfth Workshop on Algorithm Engineering and Experiments, 2010

Simple and Fast Nearest Neighbor Search.
Proceedings of the Twelfth Workshop on Algorithm Engineering and Experiments, 2010

2009
Two-tree algorithms for full bandwidth broadcast, reduction and scan.
Parallel Computing, 2009

Cache-, hash-, and space-efficient bloom filters.
ACM Journal of Experimental Algorithmics, 2009

Towards Optimal Range Medians.
Proceedings of the Automata, Languages and Programming, 36th International Colloquium, 2009

Engineering Route Planning Algorithms.
Proceedings of the Algorithmics of Large and Complex Networks - Design, 2009

09491 Abstracts Collection - Graph Search Engineering.
Proceedings of the Graph Search Engineering, 29.11. - 04.12.2009, 2009

An Efficient Parallel Algorithm for Graph-Based Image Segmentation.
Proceedings of the Computer Analysis of Images and Patterns, 13th International Conference, 2009

Algorithm Engineering - An Attempt at a Definition.
Proceedings of the Efficient Algorithms, 2009

The Filter-Kruskal Minimum Spanning Tree Algorithm.
Proceedings of the Eleventh Workshop on Algorithm Engineering and Experiments, 2009

Time-Dependent Contraction Hierarchies.
Proceedings of the Eleventh Workshop on Algorithm Engineering and Experiments, 2009

2008
Kürzeste Wege.
Proceedings of the Taschenbuch der Algorithmen, 2008

STXXL: standard template library for XXL data sets.
Softw., Pract. Exper., 2008

Constant Time Queries for Energy Efficient Paths in Multi-hop Wireless Networks.
CIT, 2008

Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks.
Proceedings of the Experimental Algorithms, 7th International Workshop, 2008

Combining Hierarchical and Goal-Directed Speed-Up Techniques for Dijkstra's Algorithm.
Proceedings of the Experimental Algorithms, 7th International Workshop, 2008

Out of the Box Phrase Indexing.
Proceedings of the String Processing and Information Retrieval, 2008

Mobile Route Planning.
Proceedings of the Algorithms, 2008

Single-Pass List Partitioning.
Proceedings of the Second International Conference on Complex, 2008

Semi-external LTL Model Checking.
Proceedings of the Computer Aided Verification, 20th International Conference, 2008

Compressed Inverted Indexes for In-Memory Search Engines.
Proceedings of the Tenth Workshop on Algorithm Engineering and Experiments, 2008

Better Approximation of Betweenness Centrality.
Proceedings of the Tenth Workshop on Algorithm Engineering and Experiments, 2008

Algorithms and Data Structures: The Basic Toolbox.
Springer, ISBN: 978-3-540-77977-3, 2008

2007
Dynamic Highway-Node Routing.
Proceedings of the Experimental Algorithms, 6th International Workshop, 2007

Engineering Fast Route Planning Algorithms.
Proceedings of the Experimental Algorithms, 6th International Workshop, 2007

Cache-, Hash- and Space-Efficient Bloom Filters.
Proceedings of the Experimental Algorithms, 6th International Workshop, 2007

Engineering Algorithms for Approximate Weighted Matching.
Proceedings of the Experimental Algorithms, 6th International Workshop, 2007

The random graph threshold for k-orientiability and a fast algorithm for optimal multiple-choice allocation.
Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

Full Bandwidth Broadcast, Reduction and Scan with Only Two Trees.
Proceedings of the Recent Advances in Parallel Virtual Machine and Message Passing Interface, 14th European PVM/MPI User's Group Meeting, Paris, France, September 30, 2007

MCSTL: the multi-core standard template library.
Proceedings of the 12th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2007

MCSTL: The Multi-core Standard Template Library.
Proceedings of the Euro-Par 2007, 2007

Intersection in Integer Inverted Indices.
Proceedings of the Nine Workshop on Algorithm Engineering and Experiments, 2007

Computing Many-to-Many Shortest Paths Using Highway Hierarchies.
Proceedings of the Nine Workshop on Algorithm Engineering and Experiments, 2007

In Transit to Constant Time Shortest-Path Queries in Road Networks.
Proceedings of the Nine Workshop on Algorithm Engineering and Experiments, 2007

2006
Foreword.
Theory Comput. Syst., 2006

Linear work suffix array construction.
J. ACM, 2006

Goal Directed Shortest Path Queries Using Precomputed Cluster Distances.
Proceedings of the Experimental Algorithms, 5th International Workshop, 2006

Parallel Prefix (Scan) Algorithms for MPI.
Proceedings of the Recent Advances in Parallel Virtual Machine and Message Passing Interface, 2006

Scalable Parallel Suffix Array Construction.
Proceedings of the Recent Advances in Parallel Virtual Machine and Message Passing Interface, 2006

Engineering Highway Hierarchies.
Proceedings of the Algorithms, 2006

How Branch Mispredictions Affect Quicksort.
Proceedings of the Algorithms, 2006

Robust, Almost Constant Time Shortest-Path Queries in Road Networks.
Proceedings of the Shortest Path Problem, 2006

Highway Hierarchies Star.
Proceedings of the Shortest Path Problem, 2006

2005
Polynomial time algorithms for multicast network code construction.
IEEE Trans. Information Theory, 2005

An asymptotic approximation scheme for multigraph edge coloring.
Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

Towards Optimal Multiple Selection.
Proceedings of the Automata, Languages and Programming, 32nd International Colloquium, 2005

Highway Hierarchies Hasten Exact Shortest Path Queries.
Proceedings of the Algorithms, 2005

: Standard Template Library for XXL Data Sets.
Proceedings of the Algorithms, 2005

Online Scheduling with Bounded Migration.
Proceedings of the Algorithms for Optimization with Incomplete Information, 2005

Better External Memory Suffix Array Construction.
Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments and the Second Workshop on Analytic Algorithmics and Combinatorics, 2005

2004
A simpler linear time 2/3-epsilon approximation for maximum weight matching.
Inf. Process. Lett., 2004

Algorithms for Memory Hierarchies (Column: Algorithmics).
Bulletin of the EATCS, 2004

Algorithms for Scalable Storage Servers.
Proceedings of the SOFSEM 2004: Theory and Practice of Computer Science, 2004

Engineering an External Memory Minimum Spanning Tree Algorithm.
Proceedings of the Exploring New Frontiers of Theoretical Informatics, 2004

Online Scheduling with Bounded Migration.
Proceedings of the Automata, Languages and Programming: 31st International Colloquium, 2004

Super Scalar Sample Sort.
Proceedings of the Algorithms, 2004

Engineering a Sorted List Data Structure for 32 Bit Key.
Proceedings of the Sixth Workshop on Algorithm Engineering and Experiments and the First Workshop on Analytic Algorithmics and Combinatorics, 2004

2003
[Delta]-stepping: a parallelizable shortest path algorithm.
J. Algorithms, 2003

Tail Bounds And Expectations For Random Arc Allocation And Applications.
Combinatorics, Probability & Computing, 2003

Scanning Multiple Sequences Via Cache Memory.
Algorithmica, 2003

Space Efficient Hash Tables with Worst Case Constant Access Time.
Proceedings of the STACS 2003, 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27, 2003

Polynomial time algorithms for network information flow.
Proceedings of the SPAA 2003: Proceedings of the Fifteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2003

Asynchronous parallel disk sorting.
Proceedings of the SPAA 2003: Proceedings of the Fifteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2003

Scheduling and Traffic Allocation for Tasks with Bounded Splittability.
Proceedings of the Mathematical Foundations of Computer Science 2003, 2003

Simple Linear Work Suffix Array Construction.
Proceedings of the Automata, Languages and Programming, 30th International Colloquium, 2003

A Practical Minimum Spanning Tree Algorithm Using the Cycle Property.
Proceedings of the Algorithms, 2003

Approximating Energy Efficient Paths in Wireless Multi-hop Networks.
Proceedings of the Algorithms, 2003

2002
SKaMPI: a comprehensive benchmark for public benchmarking of MPI.
Scientific Programming, 2002

Cellular Automata: Energy Consumption and Physical Feasibility.
Fundam. Inform., 2002

Randomized Receiver Initiated Load-balancing Algorithms for Tree-shaped Computations.
Comput. J., 2002

Random Arc Allocation and Applications.
Proceedings of the Algorithm Theory, 2002

Energy Optimal Routing in Radio Networks Using Geometric Data Structures.
Proceedings of the Automata, Languages and Programming, 29th International Colloquium, 2002

The Hierarchical Factor Algorithm for All-to-All Communication (Research Note).
Proceedings of the Euro-Par 2002, 2002

Memory Hierarchies - Models and Lower Bounds.
Proceedings of the Algorithms for Memory Hierarchies, 2002

2001
How Helpers Hasten h-Relations.
J. Algorithms, 2001

The power of duality for prefetching and sorting with parallel disks.
Proceedings of the Thirteenth Annual ACM Symposium on Parallel Algorithms and Architectures, 2001

Reconciling simplicity and realism in parallel disk models.
Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

Duality between Prefetching and Queued Writing with Parallel Disks.
Proceedings of the Algorithms, 2001

2000
Parallel Integer Optimization for Crew Scheduling.
Annals OR, 2000

Asymptotic Complexity from Experiments? A Case Study for Randomized Algorithms.
Proceedings of the Algorithm Engineering, 2000

Asynchronous scheduling of redundant disk arrays.
Proceedings of the Twelfth annual ACM Symposium on Parallel Algorithms and Architectures, 2000

Fast concurrent access to parallel disks.
Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

A Bandwidth Latency Tradeoff for Broadcast and Reduction.
Proceedings of the Euro-Par 2000, Parallel Processing, 6th International Euro-Par Conference, Munich, Germany, August 29, 2000

Parallel Shortest Path for Arbitrary Graphs.
Proceedings of the Euro-Par 2000, Parallel Processing, 6th International Euro-Par Conference, Munich, Germany, August 29, 2000

How Helpers Hasten h-Relations.
Proceedings of the Algorithms, 2000

Presenting Data from Experiments in Algorithmics.
Proceedings of the Experimental Algorithmics, 2000

Using Finite Experiments to Study Asymptotic Performance.
Proceedings of the Experimental Algorithmics, 2000

Algorithm Engineering for Parallel Computation.
Proceedings of the Experimental Algorithmics, 2000

1999
Analysis of nearest neighbor load balancing algorithms for random loads.
Parallel Computing, 1999

A case study in scalability: An ADI method for the two-dimensional time-dependent Dirac equation.
Parallel Computing, 1999

Asynchronous Random Polling Dynamic Load Balancing.
Proceedings of the Algorithms and Computation, 10th International Symposium, 1999

Accessing Multiple Sequences Through Set Associative Caches.
Proceedings of the Automata, 1999

High Performance Integer Optimization for Crew Scheduling.
Proceedings of the High-Performance Computing and Networking, 7th International Conference, 1999

Fast Priority Queues for Cached Memory.
Proceedings of the Algorithm Engineering and Experimentation, 1999

1998
Randomized Priority Queues for Fast Parallel Access.
J. Parallel Distrib. Comput., 1998

Random Permutations on Distributed, External and Hierarchical Memory.
Inf. Process. Lett., 1998

An Implementation of the Binary Blocking Flow Algorithm.
Proceedings of the Algorithm Engineering, 1998

SKaMPI: A Detailed, Accurate MPI Benchmark.
Proceedings of the Recent Advances in Parallel Virtual Machine and Message Passing Interface, 1998

A Parallelization of Dijkstra's Shortest Path Algorithm.
Proceedings of the Mathematical Foundations of Computer Science 1998, 1998

Parallel Crew Scheduling in PAROS.
Proceedings of the Euro-Par '98 Parallel Processing, 1998

Delta-Stepping: A Parallel Single Source Shortest Path Algorithm.
Proceedings of the Algorithms, 1998

1997
Lastverteilungsalgorithmen für parallele Tiefensuche.
PhD thesis, 1997

Efficient Massively Parallel Quicksort.
Proceedings of the Solving Irregularly Structured Problems in Parallel, 1997

Towards Optimal Locality in Mesh-Indexings.
Proceedings of the Fundamentals of Computation Theory, 11th International Symposium, 1997

Feasible Models of Computation: Three-Dimensionality and Energy Consumption.
Proceedings of the Euro-Par '97 Parallel Processing, 1997

Parallele Programmierung mit MPI - ein Praktikum, Programmtexte im Internet.
Logos Verlag, ISBN: 978-3-931216-76-4, 1997

1996
Optimizing the Emulation of MIMD Behavior on SIMD Machines.
Proceedings of the Parcella 1996, 1996

On the Efficiency of Nearest Neighbor Load Balancing for Random Loads.
Proceedings of the Parcella 1996, 1996

1995
Fast Priority Queues for Parallel Branch-and-Bound.
Proceedings of the Parallel Algorithms for Irregularly Structured Problems, 1995

Better Algorithms for Parallel Backtracking.
Proceedings of the Parallel Algorithms for Irregularly Structured Problems, 1995

Parallel Game Tree Search on SIMD Machines.
Proceedings of the Parallel Algorithms for Irregularly Structured Problems, 1995

1994
Massively Parallel Search for Transition-Tables of Polyautomata.
Proceedings of the Parcella 1994, 1994

A detailed analysis of random polling dynamic load balancing.
Proceedings of the International Symposium on Parallel Architectures, 1994

Emulating MIMD Behaviour on SIMD-Machines.
Proceedings of the Massively Parallel Processing Applications and Develompent, 1994

1993
A Case Study in Object Oriented Programming: Algebraic Structures in Eiffel.
Proceedings of the TOOLS 1993: 11th International Conference on Technology of Object-Oriented Languages and Systems, 1993


  Loading...