Peter Sanders - RankMe

461 papers A* 12A 86B 43C 8Misc 2Journal 207Unranked 82

Year	Rank	Type	Title / Venue / Authors
2026	A	`conf`	BlockFIFO & MultiFIFO: Scalable Relaxed Queues. ALENEX Stefan Koch, Peter Sanders, Marvin Williams
2026	A	`conf`	PHast - Perfect Hashing made fast. ALENEX Piotr Beling, Peter Sanders
2026	J	`jnl`	Ribbon: Fast Succinct Static Retrieval and Approximate Membership. J. ACM Martin Dietzfelbinger, Peter C. Dillinger, Lorenz Hübschle-Schneider, Peter Sanders, Stefan Walzer
2025	J	`jnl`	BlockFIFO & MultiFIFO: Scalable Relaxed Queues. CoRR Stefan Koch, Peter Sanders, Marvin Williams
2025	A	`conf`	Combined Search and Encoding for Seeds, with an Application to Minimal Perfect Hashing. ESA Hans-Peter Lehmann, Peter Sanders, Stefan Walzer, Jonatan Ziegler
2025	J	`jnl`	Combined Search and Encoding for Seeds, with an Application to Minimal Perfect Hashing. CoRR Hans-Peter Lehmann, Peter Sanders, Stefan Walzer, Jonatan Ziegler
2025	J	`jnl`	Customization Meets 2-Hop Labeling: Efficient Routing in Road Networks. Proc. VLDB Endow. Muhammad Farhan, Henning Koehler, Qing Wang, Jiawen Wang, Moritz Laupichler, Peter Sanders
2025	A	`conf`	Engineering Minimal k-Perfect Hash Functions. ESA Stefan Hermann, Sebastian Kirmayer, Hans-Peter Lehmann, Peter Sanders, Stefan Walzer
2025	J	`jnl`	Engineering Minimal k-Perfect Hash Functions. CoRR Stefan Hermann, Sebastian Kirmayer, Hans-Peter Lehmann, Peter Sanders, Stefan Walzer
2025	J	`jnl`	Engineering MultiQueues: Fast Relaxed Concurrent Priority Queues. CoRR Marvin Williams, Peter Sanders
2025	A	`conf`	Engineering Optimal Parallel Task Scheduling. ALENEX Matthew Akram, Nikolai Maas, Peter Sanders, Dominik Schreiber
2025	A	`conf`	Fast and Lightweight Distributed Suffix Array Construction. ESA Manuel Haag, Florian Kurpicz, Peter Sanders, Matthias Schimek
2025	A	`conf`	Linear-Time Multilevel Graph Partitioning via Edge Sparsification. ESA Lars Gottesbüren, Nikolai Maas, Dominik Rosch, Peter Sanders, Daniel Seemaier
2025	J	`jnl`	Linear-Time Multilevel Graph Partitioning via Edge Sparsification. CoRR Lars Gottesbüren, Nikolai Maas, Dominik Rosch, Peter Sanders, Daniel Seemaier
2025	J	`jnl`	Modern Minimal Perfect Hashing: A Survey. CoRR Hans-Peter Lehmann, Thomas Mueller, Rasmus Pagh, Giulio Ermanno Pibiri, Peter Sanders, Sebastiano Vigna, Stefan Walzer
2025	—	`conf`	Optimizing the Variant Calling Pipeline Execution on Human Genomes Using GPU-Enabled Machines. BCB Companion Ajay Kumar, Praveen Rao, Peter Sanders
2025	J	`jnl`	Optimizing the Variant Calling Pipeline Execution on Human Genomes Using GPU-Enabled Machines. CoRR Ajay Kumar, Praveen Rao, Peter Sanders
2025	J	`jnl`	PHast - Perfect Hashing with fast evaluation. CoRR Piotr Beling, Peter Sanders
2025	J	`jnl`	Pareto Sums of Pareto Sets: Lower Bounds and Algorithms. Algorithmica Daniel Funke, Demian Hespe, Peter Sanders, Sabine Storandt, Carina Truschel
2025	J	`jnl`	ShockHash: Near Optimal-Space Minimal Perfect Hashing Beyond Brute-Force. Algorithmica Hans-Peter Lehmann, Peter Sanders, Stefan Walzer
2025	A	`conf`	Synergistic Traffic Assignment. AAMAS Thomas Bläsius, Adrian Feilhauer, Markus Jung, Moritz Laupichler, Peter Sanders, Michael Zündorf
2025	J	`jnl`	Synergistic Traffic Assignment. CoRR Thomas Bläsius, Adrian Feilhauer, Markus Jung, Moritz Laupichler, Peter Sanders, Michael Zündorf
2025	A	`conf`	Tera-Scale Multilevel Graph Partitioning. IPDPS Daniel Salwasser, Daniel Seemaier, Lars Gottesbüren, Peter Sanders
2025	J	`jnl`	Theory Meets Practice for Bit Vectors Supporting Rank and Select. CoRR Florian Kurpicz, Niccolò Rigi-Luperti, Peter Sanders
2024	B	`conf`	Brief Announcement: (Near) Zero-Overhead C++ Bindings for MPI. SPAA Demian Hespe, Lukas Hübner, Florian Kurpicz, Peter Sanders, Matthias Schimek, Daniel Seemaier, Tim Niklas Uhl
2024	B	`conf`	Brief Announcement: Distributed Unconstrained Local Search for Multilevel Graph Partitioning. SPAA Peter Sanders, Daniel Seemaier
2024	J	`jnl`	Brief Announcement: Distributed Unconstrained Local Search for Multilevel Graph Partitioning. CoRR Peter Sanders, Daniel Seemaier
2024	J	`jnl`	Brief Announcement: Parallel Construction of Bumped Ribbon Retrieval. CoRR Matthias Becht, Hans-Peter Lehmann, Peter Sanders
2024	B	`conf`	Brief Announcement: Scalable Distributed String Sorting. SPAA Florian Kurpicz, Pascal Mehnert, Peter Sanders, Matthias Schimek
2024	J	`jnl`	Engineering Optimal Parallel Task Scheduling. CoRR Matthew Akram, Nikolai Maas, Peter Sanders, Dominik Schreiber
2024	A	`conf`	Fast Many-to-Many Routing for Dynamic Taxi Sharing with Meeting Points. ALENEX Moritz Laupichler, Peter Sanders
2024	J	`jnl`	Fast and Lightweight Distributed Suffix Array Construction - First Results. CoRR Manuel Haag, Florian Kurpicz, Peter Sanders, Matthias Schimek
2024	—	`conf`	Formally Verifying an Efficient Sorter. TACAS (1) Bernhard Beckert, Peter Sanders, Mattias Ulbrich, Julian Wiesler, Sascha Witt
2024	A	`conf`	KaMPIng: Flexible and (Near) Zero-Overhead C++ Bindings for MPI. SC Tim Niklas Uhl, Matthias Schimek, Lukas Hübner, Demian Hespe, Florian Kurpicz, Daniel Seemaier, Christoph Stelz, Peter Sanders
2024	J	`jnl`	KaMPIng: Flexible and (Near) Zero-overhead C++ Bindings for MPI. CoRR Demian Hespe, Lukas Hübner, Florian Kurpicz, Peter Sanders, Matthias Schimek, Daniel Seemaier, Christoph Stelz, Tim Niklas Uhl
2024	J	`jnl`	MallobSat: Scalable SAT Solving by Clause Sharing. J. Artif. Intell. Res. Dominik Schreiber, Peter Sanders
2024	—	`conf`	Modern Software Libraries for Graph Partitioning (Abstract). HOPC@SPAA Lars Gottesbüren, Nikolai Maas, Peter Sanders, Daniel Seemaier
2024	A	`conf`	PHOBIC: Perfect Hashing With Optimized Bucket Sizes and Interleaved Coding. ESA Stefan Hermann, Hans-Peter Lehmann, Giulio Ermanno Pibiri, Peter Sanders, Stefan Walzer
2024	J	`jnl`	PHOBIC: Perfect Hashing with Optimized Bucket Sizes and Interleaved Coding. CoRR Stefan Hermann, Hans-Peter Lehmann, Giulio Ermanno Pibiri, Peter Sanders, Stefan Walzer
2024	J	`jnl`	Pareto Sums of Pareto Sets: Lower Bounds and Algorithms. CoRR Daniel Funke, Demian Hespe, Peter Sanders, Sabine Storandt, Carina Truschel
2024	A	`conf`	Scalable Distributed String Sorting. ESA Florian Kurpicz, Pascal Mehnert, Peter Sanders, Matthias Schimek
2024	J	`jnl`	Scalable Distributed String Sorting. CoRR Florian Kurpicz, Pascal Mehnert, Peter Sanders, Matthias Schimek
2024	J	`jnl`	Scalable Fault-Tolerant MapReduce. CoRR Demian Hespe, Lukas Hübner, Charel Mercatoris, Peter Sanders
2024	J	`jnl`	Scalable High-Quality Hypergraph Partitioning. ACM Trans. Algorithms Lars Gottesbüren, Tobias Heuer, Nikolai Maas, Peter Sanders, Sebastian Schlag
2024	—	`conf`	Scalable SAT Solving on Demand (Abstract). HOPC@SPAA Dominik Schreiber, Peter Sanders
2024	A	`conf`	ShockHash: Towards Optimal-Space Minimal Perfect Hashing Beyond Brute-Force. ALENEX Hans-Peter Lehmann, Peter Sanders, Stefan Walzer
2024	B	`conf`	Targeted Branching for the Maximum Independent Set Problem Using Graph Neural Networks. SEA Kenneth Langedal, Demian Hespe, Peter Sanders
2024	J	`jnl`	Tera-Scale Multilevel Graph Partitioning. CoRR Daniel Salwasser, Daniel Seemaier, Lars Gottesbüren, Peter Sanders
2023	A	`conf`	A Sweep-Plane Algorithm for Calculating the Isolation of Mountains. ESA Daniel Funke, Nicolai Hüning, Peter Sanders
2023	J	`jnl`	A Sweep-plane Algorithm for Calculating the Isolation of Mountains. CoRR Daniel Funke, Nicolai Hüning, Peter Sanders
2023	J	`jnl`	Bipartite ShockHash: Pruning ShockHash Search for Efficient Perfect Hashing. CoRR Hans-Peter Lehmann, Peter Sanders, Stefan Walzer
2023	—	`conf`	Distributed Deep Multilevel Graph Partitioning. Euro-Par Peter Sanders, Daniel Seemaier
2023	J	`jnl`	Distributed Deep Multilevel Graph Partitioning. CoRR Peter Sanders, Daniel Seemaier
2023	J	`jnl`	Editorial. Comput. Geom. Martin Held, Martin Nöllenburg, Peter Sanders
2023	B	`conf`	Efficient Yao Graph Construction. SEA Daniel Funke, Peter Sanders
2023	J	`jnl`	Efficient Yao Graph Construction. CoRR Daniel Funke, Peter Sanders
2023	A	`conf`	Engineering Massively Parallel MST Algorithms. IPDPS Peter Sanders, Matthias Schimek
2023	J	`jnl`	Engineering Massively Parallel MST Algorithms. CoRR Peter Sanders, Matthias Schimek
2023	A	`conf`	Engineering a Distributed-Memory Triangle Counting Algorithm. IPDPS Peter Sanders, Tim Niklas Uhl
2023	J	`jnl`	Engineering a Distributed-Memory Triangle Counting Algorithm. CoRR Peter Sanders, Tim Niklas Uhl
2023	J	`jnl`	Fast Many-to-Many Routing for Dynamic Taxi Sharing with Meeting Points. CoRR Moritz Laupichler, Peter Sanders
2023	J	`jnl`	Fast Many-to-Many Routing for Ridesharing with Multiple Pickup and Dropoff Locations. CoRR Moritz Laupichler, Peter Sanders
2023	A	`conf`	High Performance Construction of RecSplit Based Minimal Perfect Hash Functions. ESA Dominik Bez, Florian Kurpicz, Hans-Peter Lehmann, Peter Sanders
2023	A	`conf`	Learned Monotone Minimal Perfect Hashing. ESA Paolo Ferragina, Hans-Peter Lehmann, Peter Sanders, Giorgio Vinciguerra
2023	J	`jnl`	Learned Monotone Minimal Perfect Hashing. CoRR Paolo Ferragina, Hans-Peter Lehmann, Peter Sanders, Giorgio Vinciguerra
2023	J	`jnl`	More Recent Advances in (Hyper)Graph Partitioning. ACM Comput. Surv. Ümit V. Çatalyürek, Karen D. Devine, Marcelo Fonseca Faraj, Lars Gottesbüren, Tobias Heuer, Henning Meyerhenke, Peter Sanders, Sebastian Schlag, Christian Schulz, Daniel Seemaier, Dorothea Wagner
2023	A	`conf`	PaCHash: Packed and Compressed Hash Tables. ALENEX Florian Kurpicz, Hans-Peter Lehmann, Peter Sanders
2023	A	`conf`	Pareto Sums of Pareto Sets. ESA Demian Hespe, Peter Sanders, Sabine Storandt, Carina Truschel
2023	J	`jnl`	Scalable High-Quality Hypergraph Partitioning. CoRR Lars Gottesbüren, Tobias Heuer, Nikolai Maas, Peter Sanders, Sebastian Schlag
2023	J	`jnl`	ShockHash: Towards Optimal-Space Minimal Perfect Hashing Beyond Brute-Force. CoRR Hans-Peter Lehmann, Peter Sanders, Stefan Walzer
2023	A	`conf`	SicHash - Small Irregular Cuckoo Tables for Perfect Hashing. ALENEX Hans-Peter Lehmann, Peter Sanders, Stefan Walzer
2023	J	`jnl`	Sliding Block Hashing (Slick) - Basic Algorithmic Ideas. CoRR Hans-Peter Lehmann, Peter Sanders, Stefan Walzer
2022	A	`conf`	Communication-efficient Massively Distributed Connected Components. IPDPS Sebastian Lamm, Peter Sanders
2022	—	`conf`	Decentralized Online Scheduling of Malleable NP-hard Jobs. Euro-Par Peter Sanders, Dominik Schreiber
2022	J	`jnl`	Engineering In-place (Shared-memory) Sorting Algorithms. ACM Trans. Parallel Comput. Michael Axtmann, Sascha Witt, Daniel Ferizovic, Peter Sanders
2022	B	`conf`	Fast Succinct Retrieval and Approximate Membership Using Ribbon. SEA Peter C. Dillinger, Lorenz Hübschle-Schneider, Peter Sanders, Stefan Walzer
2022	J	`jnl`	High Performance Construction of RecSplit Based Minimal Perfect Hash Functions. CoRR Dominik Bez, Florian Kurpicz, Hans-Peter Lehmann, Peter Sanders
2022	J	`jnl`	High-Quality Hypergraph Partitioning. ACM J. Exp. Algorithmics Sebastian Schlag, Tobias Heuer, Lars Gottesbüren, Yaroslav Akhremtsev, Christian Schulz, Peter Sanders
2022	J	`jnl`	Mallob: Scalable SAT Solving On Demand With Decentralized Job Scheduling. J. Open Source Softw. Peter Sanders, Dominik Schreiber
2022	J	`jnl`	More Recent Advances in (Hyper)Graph Partitioning. CoRR Ümit V. Çatalyürek, Karen D. Devine, Marcelo Fonseca Faraj, Lars Gottesbüren, Tobias Heuer, Henning Meyerhenke, Peter Sanders, Sebastian Schlag, Christian Schulz, Daniel Seemaier, Dorothea Wagner
2022	—	`ch.`	Multi-Objective Shortest Paths. Massive Graph Analytics Stephan Erb, Moritz Kobitzsch, Lawrence Mandow, Peter Sanders
2022	J	`jnl`	PaCHash: Packed and Compressed Hash Tables. CoRR Florian Kurpicz, Hans-Peter Lehmann, Peter Sanders
2022	B	`conf`	Parallel Flow-Based Hypergraph Partitioning. SEA Lars Gottesbüren, Tobias Heuer, Peter Sanders
2022	J	`jnl`	Parallel Flow-Based Hypergraph Partitioning. CoRR Lars Gottesbüren, Tobias Heuer, Peter Sanders
2022	J	`jnl`	Parallel Weighted Random Sampling. ACM Trans. Math. Softw. Lorenz Hübschle-Schneider, Peter Sanders
2022	—	`conf`	ReStore: In-Memory REplicated STORagE for Rapid Recovery in Fault-Tolerant Algorithms. FTXS@SC Lukas Hübner, Demian Hespe, Peter Sanders, Alexandros Stamatakis
2022	J	`jnl`	ReStore: In-Memory REplicated STORagE for Rapid Recovery in Fault-Tolerant Algorithms. CoRR Demian Hespe, Lukas Hübner, Peter Sanders, Alexandros Stamatakis
2022	—	`ch.`	Recent Advances in Scalable Network Generation1. Massive Graph Analytics Manuel Penschuck, Ulrik Brandes, Michael Hamann, Sebastian Lamm, Ulrich Meyer, Ilya Safro, Peter Sanders, Christian Schulz
2022	J	`jnl`	Scalable SAT Solving in the Cloud. CoRR Dominik Schreiber, Peter Sanders
2022	—	`ch.`	Scalable Text Index Construction. Algorithms for Big Data Timo Bingmann, Patrick Dinklage, Johannes Fischer, Florian Kurpicz, Enno Ohlebusch, Peter Sanders
2022	A	`conf`	Shared-Memory n-level Hypergraph Partitioning. ALENEX Lars Gottesbüren, Tobias Heuer, Peter Sanders, Sebastian Schlag
2022	J	`jnl`	SicHash - Small Irregular Cuckoo Tables for Perfect Hashing. CoRR Hans-Peter Lehmann, Peter Sanders, Stefan Walzer
2022	J	`jnl`	Vectorized and performance-portable Quicksort. CoRR Mark Blacher, Joachim Giesen, Peter Sanders, Jan Wassenberg
2022	J	`jnl`	Vectorized and performance-portable quicksort. Softw. Pract. Exp. Jan Wassenberg, Mark Blacher, Joachim Giesen, Peter Sanders
2021	A	`conf`	Deep Multilevel Graph Partitioning. ESA Lars Gottesbüren, Tobias Heuer, Peter Sanders, Christian Schulz, Daniel Seemaier
2021	J	`jnl`	Deep Multilevel Graph Partitioning. CoRR Lars Gottesbüren, Tobias Heuer, Peter Sanders, Christian Schulz, Daniel Seemaier
2021	A	`conf`	Engineering MultiQueues: Fast Relaxed Concurrent Priority Queues. ESA Marvin Williams, Peter Sanders, Roman Dementiev
2021	J	`jnl`	Engineering MultiQueues: Fast Relaxed Concurrent Priority Queues. CoRR Marvin Williams, Peter Sanders, Roman Dementiev
2021	J	`jnl`	Engineering faster sorters for small sets of items. Softw. Pract. Exp. Timo Bingmann, Jasper Marianczuk, Peter Sanders
2021	J	`jnl`	Exploring parallel MPI fault tolerance mechanisms for phylogenetic inference with RAxML-NG. Bioinform. Lukas Hübner, Alexey M. Kozlov, Demian Hespe, Peter Sanders, Alexandros Stamatakis
2021	J	`jnl`	Fast Succinct Retrieval and Approximate Membership using Ribbon. CoRR Peter C. Dillinger, Lorenz Hübschle-Schneider, Peter Sanders, Stefan Walzer
2021	A	`conf`	Fast, Exact and Scalable Dynamic Ridesharing. ALENEX Valentin Buchhold, Peter Sanders, Dorothea Wagner
2021	J	`jnl`	High-Quality Hypergraph Partitioning. CoRR Sebastian Schlag, Tobias Heuer, Lars Gottesbüren, Yaroslav Akhremtsev, Christian Schulz, Peter Sanders
2021	A	`conf`	Scalable SAT Solving in the Cloud. SAT Dominik Schreiber, Peter Sanders
2021	A	`conf`	Scalable Shared-Memory Hypergraph Partitioning. ALENEX Lars Gottesbüren, Tobias Heuer, Peter Sanders, Sebastian Schlag
2021	J	`jnl`	Shared-Memory n-level Hypergraph Partitioning. CoRR Lars Gottesbüren, Tobias Heuer, Peter Sanders, Sebastian Schlag
2021	J	`jnl`	Weighted Random Sampling on GPUs. CoRR Hans-Peter Lehmann, Lorenz Hübschle-Schneider, Peter Sanders
2020	A	`ed.`	28th Annual European Symposium on Algorithms, ESA 2020, Pisa, Italy (Virtual Conference), September 7-9, 2020 ESA Fabrizio Grandoni, Grzegorz Herman, Peter Sanders
2020	A	`conf`	Communication-Efficient String Sorting. IPDPS Timo Bingmann, Peter Sanders, Matthias Schimek
2020	J	`jnl`	Communication-Efficient String Sorting. CoRR Timo Bingmann, Peter Sanders, Matthias Schimek
2020	B	`conf`	Communication-Efficient Weighted Reservoir Sampling from Fully Distributed Data Streams. SPAA Lorenz Hübschle-Schneider, Peter Sanders
2020	B	`conf`	Concurrent Expandable AMQs on the Basis of Quotient Filters. SEA Tobias Maier, Peter Sanders, Robert Williger
2020	—	`conf`	Connecting MapReduce Computations to Realistic Machine Models. IEEE BigData Peter Sanders
2020	J	`jnl`	Connecting MapReduce Computations to Realistic Machine Models. CoRR Peter Sanders
2020	J	`jnl`	Engineering Faster Sorters for Small Sets of Items. CoRR Timo Bingmann, Jasper Marianczuk, Peter Sanders
2020	J	`jnl`	Engineering In-place (Shared-memory) Sorting Algorithms. CoRR Michael Axtmann, Sascha Witt, Daniel Ferizovic, Peter Sanders
2020	J	`jnl`	Fast, Exact and Scalable Dynamic Ridesharing. CoRR Valentin Buchhold, Peter Sanders, Dorothea Wagner
2020	J	`jnl`	High-Quality Shared-Memory Graph Partitioning. IEEE Trans. Parallel Distributed Syst. Yaroslav Akhremtsev, Peter Sanders, Christian Schulz
2020	J	`jnl`	Linear work generation of R-MAT graphs. Netw. Sci. Lorenz Hübschle-Schneider, Peter Sanders
2020	J	`jnl`	Recent Advances in Scalable Network Generation. CoRR Manuel Penschuck, Ulrik Brandes, Michael Hamann, Sebastian Lamm, Ulrich Meyer, Ilya Safro, Peter Sanders, Christian Schulz
2020	J	`jnl`	Scalable Shared-Memory Hypergraph Partitioning. CoRR Lars Gottesbüren, Tobias Heuer, Peter Sanders, Sebastian Schlag
2019	J	`jnl`	Communication-Efficient (Weighted) Reservoir Sampling. CoRR Lorenz Hübschle-Schneider, Peter Sanders
2019	J	`jnl`	Communication-free massively distributed graph generation. J. Parallel Distributed Comput. Daniel Funke, Sebastian Lamm, Ulrich Meyer, Manuel Penschuck, Peter Sanders, Christian Schulz, Darren Strash, Moritz von Looz
2019	J	`jnl`	Concurrent Expandable AMQs on the Basis of Quotient Filters. CoRR Tobias Maier, Peter Sanders, Robert Williger
2019	J	`jnl`	Concurrent Hash Tables: Fast and General(?)! ACM Trans. Parallel Comput. Tobias Maier, Peter Sanders, Roman Dementiev
2019	J	`jnl`	Dynamic Space Efficient Hashing. Algorithmica Tobias Maier, Peter Sanders, Stefan Walzer
2019	—	`conf`	Efficient Calculation of Microscopic Travel Demand Data with Low Calibration Effort. SIGSPATIAL/GIS Valentin Buchhold, Peter Sanders, Dorothea Wagner
2019	J	`jnl`	Linear Work Generation of R-MAT Graphs. CoRR Lorenz Hübschle-Schneider, Peter Sanders
2019	—	`conf`	Load-Balancing for Parallel Delaunay Triangulations. Euro-Par Daniel Funke, Peter Sanders, Vincent Winkler
2019	J	`jnl`	Load-Balancing for Parallel Delaunay Triangulations. CoRR Daniel Funke, Peter Sanders, Vincent Winkler
2019	C	`conf`	More Hierarchy in Route Planning Using Edge Hierarchies. ATMOS Demian Hespe, Peter Sanders
2019	J	`jnl`	More Hierarchy in Route Planning Using Edge Hierarchies. CoRR Demian Hespe, Peter Sanders
2019	J	`jnl`	Network Flow-Based Refinement for Multilevel Hypergraph Partitioning. ACM J. Exp. Algorithmics Tobias Heuer, Peter Sanders, Sebastian Schlag
2019	J	`jnl`	Novel Parallel Algorithms for Fast Multi-GPU-Based Generation of Massive Scale-Free Networks. Data Sci. Eng. Md. Maksudul Alam, Kalyan S. Perumalla, Peter Sanders
2019	A	`conf`	Parallel Weighted Random Sampling. ESA Lorenz Hübschle-Schneider, Peter Sanders
2019	J	`jnl`	Parallel Weighted Random Sampling. CoRR Lorenz Hübschle-Schneider, Peter Sanders
2019	J	`jnl`	Real-time Traffic Assignment Using Engineered Customizable Contraction Hierarchies. ACM J. Exp. Algorithmics Valentin Buchhold, Peter Sanders, Dorothea Wagner
2019	—	`book`	Sequential and Parallel Algorithms and Data Structures - The Basic Toolbox Peter Sanders, Kurt Mehlhorn, Martin Dietzfelbinger, Roman Dementiev
2018	—	`conf`	An equal opportunity concept for the coordinated research effort AESC. ECSA (Companion) Anne Koziolek, Peter Sanders, Dorothea Wagner
2018	—	`ch.`	Benchmarking for Graph Clustering and Partitioning. Encyclopedia of Social Network Analysis and Mining. 2nd Ed. David A. Bader, Andrea Kappes, Henning Meyerhenke, Peter Sanders, Christian Schulz, Dorothea Wagner
2018	A	`conf`	Communication Efficient Checking of Big Data Operations. IPDPS Lorenz Hübschle-Schneider, Peter Sanders
2018	A	`conf`	Communication-Free Massively Distributed Graph Generation. IPDPS Daniel Funke, Sebastian Lamm, Peter Sanders, Christian Schulz, Darren Strash, Moritz von Looz
2018	J	`jnl`	Efficient Parallel Random Sampling - Vectorized, Cache-Efficient, and Online. ACM Trans. Math. Softw. Peter Sanders, Sebastian Lamm, Lorenz Hübschle-Schneider, Emanuel Schrade, Carsten Dachsbacher
2018	J	`jnl`	Hashing with Linear Probing and Referential Integrity. CoRR Peter Sanders
2018	—	`conf`	High-Quality Shared-Memory Graph Partitioning. Euro-Par Yaroslav Akhremtsev, Peter Sanders, Christian Schulz
2018	A	`conf`	Lightweight MPI Communicators with Applications to Perfectly Balanced Quicksort. IPDPS Michael Axtmann, Armin Wiebigke, Peter Sanders
2018	B	`conf`	Network Flow-Based Refinement for Multilevel Hypergraph Partitioning. SEA Tobias Heuer, Peter Sanders, Sebastian Schlag
2018	J	`jnl`	Network Flow-Based Refinement for Multilevel Hypergraph Partitioning. CoRR Tobias Heuer, Peter Sanders, Sebastian Schlag
2018	—	`conf`	Optimizing energy consumption and user experience in a mobile video streaming scenario. CCNC Thomas Breitbach, Peter Sanders, Dominik Schultes
2018	—	`ed.`	Proceedings of the Eighth SIAM Workshop on Combinatorial Scientific Computing, CSC 2018, Bergen, Norway, June 6-8, 2018. CSC Fredrik Manne, Peter Sanders, Sivan Toledo
2018	—	`conf`	Proving Equivalence Between Imperative and MapReduce Implementations Using Program Transformations. MARS/VPT Bernhard Beckert, Timo Bingmann, Moritz Kiefer, Peter Sanders, Mattias Ulbrich, Alexander Weigl
2018	B	`conf`	Real-Time Traffic Assignment Using Fast Queries in Customizable Contraction Hierarchies. SEA Valentin Buchhold, Peter Sanders, Dorothea Wagner
2018	—	`conf`	Relational Equivalence Proofs Between Imperative and MapReduce Algorithms. VSTTE Bernhard Beckert, Timo Bingmann, Moritz Kiefer, Peter Sanders, Mattias Ulbrich, Alexander Weigl
2018	J	`jnl`	Relational Equivalence Proofs Between Imperative and MapReduce Algorithms. CoRR Bernhard Beckert, Timo Bingmann, Moritz Kiefer, Peter Sanders, Mattias Ulbrich, Alexander Weigl
2017	J	`jnl`	3D Cell Nuclei Segmentation with Balanced Graph Partitioning. CoRR Julian Arz, Peter Sanders, Johannes Stegmaier, Ralf Mikut
2017	J	`jnl`	Communication Efficient Checking of Big Data Operations. CoRR Lorenz Hübschle-Schneider, Peter Sanders
2017	J	`jnl`	Communication-free Massively Distributed Graph Generation. CoRR Daniel Funke, Sebastian Lamm, Peter Sanders, Christian Schulz, Darren Strash, Moritz von Looz
2017	J	`jnl`	Distributed Evolutionary k-way Node Separators. CoRR Peter Sanders, Christian Schulz, Darren Strash, Robert Williger
2017	A	`conf`	Distributed evolutionary GECCO Peter Sanders, Christian Schulz, Darren Strash, Robert Williger
2017	A	`conf`	Dynamic Space Efficient Hashing. ESA Tobias Maier, Peter Sanders
2017	J	`jnl`	Dynamic Space Efficient Hashing. CoRR Tobias Maier, Peter Sanders
2017	J	`jnl`	Engineering DFS-Based Graph Algorithms. CoRR Kurt Mehlhorn, Stefan Näher, Peter Sanders
2017	J	`jnl`	Engineering Parallel String Sorting. Algorithmica Timo Bingmann, Andreas Eberle, Peter Sanders
2017	A	`conf`	Engineering a Distributed Full-Text Index. ALENEX Johannes Fischer, Florian Kurpicz, Peter Sanders
2017	A	`conf`	Engineering a direct ALENEX Yaroslav Akhremtsev, Tobias Heuer, Peter Sanders, Sebastian Schlag
2017	J	`jnl`	Fast OLAP Query Execution in Main Memory on Large Data in a Cluster. CoRR Demian Hespe, Martin Weidner, Jonathan Dees, Peter Sanders
2017	J	`jnl`	Finding near-optimal independent sets at scale. J. Heuristics Sebastian Lamm, Peter Sanders, Christian Schulz, Darren Strash, Renato F. Werneck
2017	J	`jnl`	High-Quality Shared-Memory Graph Partitioning. CoRR Yaroslav Akhremtsev, Peter Sanders, Christian Schulz
2017	A	`conf`	In-Place Parallel Super Scalar Samplesort (IPSSSSo). ESA Michael Axtmann, Sascha Witt, Daniel Ferizovic, Peter Sanders
2017	J	`jnl`	In-place Parallel Super Scalar Samplesort (IPSSSSo). CoRR Michael Axtmann, Sascha Witt, Daniel Ferizovic, Peter Sanders
2017	J	`jnl`	Lightweight MPI Communicators with Applications to Perfectly Balanced Schizophrenic Quicksort. CoRR Michael Axtmann, Armin Wiebigke, Peter Sanders
2017	A	`conf`	Parallel ALENEX Daniel Funke, Peter Sanders
2017	J	`jnl`	Parallel Graph Partitioning for Complex Networks. IEEE Trans. Parallel Distributed Syst. Henning Meyerhenke, Peter Sanders, Christian Schulz
2017	A	`conf`	Robust Massively Parallel Sorting. ALENEX Michael Axtmann, Peter Sanders
2016	B	`conf`	Accelerating Local Search for the Maximum Independent Set Problem. SEA Jakob Dahlum, Sebastian Lamm, Peter Sanders, Christian Schulz, Darren Strash, Renato F. Werneck
2016	J	`jnl`	Accelerating Local Search for the Maximum Independent Set Problem. CoRR Jakob Dahlum, Sebastian Lamm, Peter Sanders, Christian Schulz, Darren Strash, Renato F. Werneck
2016	B	`conf`	Advanced Multilevel Node Separator Algorithms. SEA Peter Sanders, Christian Schulz
2016	—	`book`	Algorithm Engineering - Selected Results and Surveys Algorithm Engineering Lasse Kliemann, Peter Sanders
2016	A	`conf`	Communication Efficient Algorithms for Top-k Selection Problems. IPDPS Lorenz Hübschle-Schneider, Peter Sanders
2016	J	`jnl`	Concurrent Hash Tables: Fast and General?(!). CoRR Tobias Maier, Peter Sanders, Roman Dementiev
2016	B	`conf`	Concurrent hash tables: fast PPoPP Tobias Maier, Peter Sanders, Roman Dementiev
2016	J	`jnl`	Efficient Random Sampling - Parallel, Vectorized, Cache-Efficient, and Online. CoRR Peter Sanders, Sebastian Lamm, Lorenz Hübschle-Schneider, Emanuel Schrade, Carsten Dachsbacher
2016	J	`jnl`	Engineering a Distributed Full-Text Index. CoRR Johannes Fischer, Florian Kurpicz, Peter Sanders
2016	Misc	`conf`	Fast Parallel Operations on Search Trees. HiPC Yaroslav Akhremtsev, Peter Sanders
2016	A	`conf`	Finding Near-Optimal Independent Sets at Scale. ALENEX Sebastian Lamm, Peter Sanders, Christian Schulz, Darren Strash, Renato F. Werneck
2016	J	`jnl`	Generating Semi-Synthetic Validation Benchmarks for Embryomics. CoRR Johannes Stegmaier, Julian Arz, Benjamin Schott, Jens C. Otte, Andrei Kobitski, G. Ulrich Nienhaus, Uwe Strähle, Peter Sanders, Ralf Mikut
2016	—	`conf`	Generating semi-synthetic validation benchmarks for embryomics. ISBI Johannes Stegmaier, Julian Arz, Benjamin Schott, Jens C. Otte, Andrei Kobitski, G. Ulrich Nienhaus, Uwe Strähle, Peter Sanders, Ralf Mikut
2016	J	`jnl`	Introduction to Special Issue ALENEX 2013. ACM J. Exp. Algorithmics Peter Sanders, Norbert Zeh
2016	J	`jnl`	Introduction to the Special Issue on SPAA 2014. ACM Trans. Parallel Comput. Friedhelm Meyer auf der Heide, Peter Sanders, Nodari Sitchinava
2016	J	`jnl`	Partitioning (hierarchically clustered) complex networks via size-constrained graph clustering. J. Heuristics Henning Meyerhenke, Peter Sanders, Christian Schulz
2016	—	`ch.`	Recent Advances in Graph Partitioning. Algorithm Engineering Aydin Buluç, Henning Meyerhenke, Ilya Safro, Peter Sanders, Christian Schulz
2016	J	`jnl`	Robust Massively Parallel Sorting. CoRR Michael Axtmann, Peter Sanders
2016	—	`ch.`	Route Planning in Transportation Networks. Algorithm Engineering Hannah Bast, Daniel Delling, Andrew V. Goldberg, Matthias Müller-Hannemann, Thomas Pajor, Peter Sanders, Dorothea Wagner, Renato F. Werneck
2016	J	`jnl`	Scalable Generation of Scale-free Graphs. CoRR Peter Sanders, Christian Schulz
2016	J	`jnl`	Scalable generation of scale-free graphs. Inf. Process. Lett. Peter Sanders, Christian Schulz
2016	J	`jnl`	Thrill: High-Performance Algorithmic Distributed Batch Data Processing with C++. CoRR Timo Bingmann, Michael Axtmann, Emanuel Jöbstl, Sebastian Lamm, Huyen Chau Nguyen, Alexander Noe, Sebastian Schlag, Matthias Stumpp, Tobias Sturm, Peter Sanders
2016	—	`conf`	Thrill: High-performance algorithmic distributed batch data processing with C++. IEEE BigData Timo Bingmann, Michael Axtmann, Emanuel Jöbstl, Sebastian Lamm, Huyen Chau Nguyen, Alexander Noe, Sebastian Schlag, Matthias Stumpp, Tobias Sturm, Peter Sanders
2015	A	`conf`	(Semi-)External Algorithms for Graph Partitioning and Clustering. ALENEX Yaroslav Akhremtsev, Peter Sanders, Christian Schulz
2015	B	`conf`	A Bulk-Parallel Priority Queue in External Memory with STXXL. SEA Timo Bingmann, Thomas Keh, Peter Sanders
2015	J	`jnl`	A Bulk-Parallel Priority Queue in External Memory with STXXL. CoRR Timo Bingmann, Thomas Keh, Peter Sanders
2015	J	`jnl`	Advanced Multilevel Node Separator Algorithms. CoRR Peter Sanders, Christian Schulz
2015	B	`conf`	Brief Announcement: MultiQueues: Simple Relaxed Concurrent Priority Queues. SPAA Hamza Rihani, Peter Sanders, Roman Dementiev
2015	—	`conf`	Cache-Efficient Aggregation: Hashing Is Sorting. SIGMOD Conference Ingo Müller, Peter Sanders, Arnaud Lacurie, Wolfgang Lehner, Franz Färber
2015	J	`jnl`	Communication Efficient Algorithms for Top-k Selection Problems. CoRR Lorenz Hübschle-Schneider, Peter Sanders, Ingo Müller
2015	J	`jnl`	Fast Parallel Operations on Search Trees. CoRR Yaroslav Akhremtsev, Peter Sanders
2015	C	`conf`	Faster Exact Search Using Document Clustering. SPIRE Jonathan Dimond, Peter Sanders
2015	J	`jnl`	Finding Near-Optimal Independent Sets at Scale. CoRR Sebastian Lamm, Peter Sanders, Christian Schulz, Darren Strash, Renato F. Werneck
2015	B	`conf`	Graph Partitioning for Independent Sets. SEA Sebastian Lamm, Peter Sanders, Christian Schulz
2015	J	`jnl`	Graph Partitioning for Independent Sets. CoRR Sebastian Lamm, Peter Sanders, Christian Schulz
2015	A	`conf`	HordeSat: A Massively Parallel Portfolio SAT Solver. SAT Tomás Balyo, Peter Sanders, Carsten Sinz
2015	J	`jnl`	HordeSat: A Massively Parallel Portfolio SAT Solver. CoRR Tomás Balyo, Peter Sanders, Carsten Sinz
2015	J	`jnl`	Incorporating Road Networks into Territory Design. CoRR Nitin Ahuja, Matthias Bender, Peter Sanders, Christian Schulz, Andreas Wagner
2015	—	`conf`	Incorporating road networks into territory design. SIGSPATIAL/GIS Nitin Ahuja, Matthias Bender, Peter Sanders, Christian Schulz, Andreas Wagner
2015	A	`conf`	Locality Aware DAG-Scheduling for LU-Decomposition. IPDPS Tobias Maier, Peter Sanders, Jochen Speck
2015	—	`conf`	Operating Power Grids with Few Flow Control Buses. e-Energy Thomas Leibfried, Tamara Mchedlidze, Nico Meyer-Hübner, Martin Nöllenburg, Ignaz Rutter, Peter Sanders, Dorothea Wagner, Franziska Wegner
2015	J	`jnl`	Operating Power Grids with Few Flow Control Buses. CoRR Thomas Leibfried, Tamara Mchedlidze, Nico Meyer-Hübner, Martin Nöllenburg, Ignaz Rutter, Peter Sanders, Dorothea Wagner, Franziska Wegner
2015	A	`conf`	Parallel Algorithms Reconsidered (Invited Talk). STACS Peter Sanders
2015	A	`conf`	Parallel Graph Partitioning for Complex Networks. IPDPS Henning Meyerhenke, Peter Sanders, Christian Schulz
2015	B	`conf`	Practical Massively Parallel Sorting. SPAA Michael Axtmann, Timo Bingmann, Peter Sanders, Christian Schulz
2015	—	`conf`	Report from Dagstuhl: SocioPaths - Multimodal Door-to-Door Route Planning via Social Paths. MUD@ICML Thomas Liebig, Sabine Storandt, Peter Sanders, Walied Othman, Stefan Funke
2015	J	`jnl`	Route Planning in Transportation Networks. CoRR Hannah Bast, Daniel Delling, Andrew V. Goldberg, Matthias Müller-Hannemann, Thomas Pajor, Peter Sanders, Dorothea Wagner, Renato F. Werneck
2015	J	`jnl`	Work-Efficient Matrix Inversion in Polylogarithmic Time. ACM Trans. Parallel Comput. Peter Sanders, Jochen Speck, Raoul Steffen
2015	J	`jnl`	k-way Hypergraph Partitioning via n-Level Recursive Bisection. CoRR Sebastian Schlag, Vitali Henne, Tobias Heuer, Henning Meyerhenke, Peter Sanders, Christian Schulz
2015	J	`jnl`	n-Level Hypergraph Partitioning. CoRR Vitali Henne, Henning Meyerhenke, Peter Sanders, Sebastian Schlag, Christian Schulz
2014	J	`jnl`	(Semi-)External Algorithms for Graph Partitioning and Clustering. CoRR Yaroslav Akhremtsev, Peter Sanders, Christian Schulz
2014	B	`ed.`	26th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA '14, Prague, Czech Republic - June 23 - 25, 2014 SPAA Guy E. Blelloch, Peter Sanders
2014	J	`jnl`	Advanced Coarsening Schemes for Graph Partitioning. ACM J. Exp. Algorithmics Ilya Safro, Peter Sanders, Christian Schulz
2014	—	`conf`	Algorithm Engineering for Big Data. GI-Jahrestagung Peter Sanders
2014	—	`book`	Algorithmen und Datenstrukturen - die Grundwerkzeuge. Martin Dietzfelbinger, Kurt Mehlhorn, Peter Sanders
2014	—	`ch.`	Benchmarking for Graph Clustering and Partitioning. Encyclopedia of Social Network Analysis and Mining David A. Bader, Henning Meyerhenke, Peter Sanders, Christian Schulz, Andrea Kappes, Dorothea Wagner
2014	J	`jnl`	Engineering Parallel Algorithms: The multicore transformation (Ubiquity symposium). Ubiquity Peter Sanders
2014	J	`jnl`	Engineering Parallel String Sorting. CoRR Timo Bingmann, Andreas Eberle, Peter Sanders
2014	J	`jnl`	Faster Exact Search using Document Clustering. CoRR Jonathan Dimond, Peter Sanders
2014	J	`jnl`	MultiQueues: Simpler, Faster, and Better Relaxed Concurrent Priority Queues. CoRR Hamza Rihani, Peter Sanders, Roman Dementiev
2014	A	`conf`	PReaCH: A Fast Lightweight Reachability Index Using Pruning and Contraction Hierarchies. ESA Florian Merz, Peter Sanders
2014	J	`jnl`	PReaCH: A Fast Lightweight Reachability Index using Pruning and Contraction Hierarchies. CoRR Florian Merz, Peter Sanders
2014	B	`conf`	Parallel Bi-objective Shortest Paths Using Weight-Balanced B-trees with Bulk Updates. SEA Stephan Erb, Moritz Kobitzsch, Peter Sanders
2014	J	`jnl`	Parallel Graph Partitioning for Complex Networks. CoRR Henning Meyerhenke, Peter Sanders, Christian Schulz
2014	B	`conf`	Partitioning Complex Networks via Size-Constrained Clustering. SEA Henning Meyerhenke, Peter Sanders, Christian Schulz
2014	J	`jnl`	Partitioning Complex Networks via Size-constrained Clustering. CoRR Henning Meyerhenke, Peter Sanders, Christian Schulz
2014	J	`jnl`	Practical Massively Parallel Sorting - Basic Algorithmic Ideas. CoRR Michael Axtmann, Timo Bingmann, Peter Sanders, Christian Schulz
2014	B	`conf`	Retrieval and Perfect Hashing Using Fingerprinting. SEA Ingo Müller, Peter Sanders, Robert Schulze, Wei Zhou
2013	J	`jnl`	Algorithm Engineering. Inform. Spektrum Peter Sanders, Dorothea Wagner
2013	J	`jnl`	Algorithm Engineering. Inform. Spektrum Peter Sanders, Dorothea Wagner
2013	J	`jnl`	Algorithmenbibliotheken. Inform. Spektrum Peter Sanders
2013	B	`ed.`	Combinatorial Pattern Matching, 24th Annual Symposium, CPM 2013, Bad Herrenalb, Germany, June 17-19, 2013. Proceedings CPM Johannes Fischer, Peter Sanders
2013	—	`conf`	Communication efficient algorithms for fundamental big data problems. IEEE BigData Peter Sanders, Sebastian Schlag, Ingo Müller
2013	J	`jnl`	Efficient Parallel and External Matching CoRR Marcel Birn, Vitaly Osipov, Peter Sanders, Christian Schulz, Nodari Sitchinava
2013	—	`conf`	Efficient Parallel and External Matching. Euro-Par Marcel Birn, Vitaly Osipov, Peter Sanders, Christian Schulz, Nodari Sitchinava
2013	A*	`conf`	Efficient many-core query execution in main memory column-stores. ICDE Jonathan Dees, Peter Sanders
2013	B	`conf`	Engineering Algorithms for Large Data Sets. SOFSEM Peter Sanders
2013	—	`conf`	Fast OLAP query execution in main memory on large data in a cluster. IEEE BigData Martin Weidner, Jonathan Dees, Peter Sanders
2013	—	`ed.`	Graph Partitioning and Graph Clustering, 10th DIMACS Implementation Challenge Workshop, Georgia Institute of Technology, Atlanta, GA, USA, February 13-14, 2012. Proceedings Graph Partitioning and Graph Clustering David A. Bader, Henning Meyerhenke, Peter Sanders, Dorothea Wagner
2013	J	`jnl`	KaHIP v0.53 - Karlsruhe High Quality Partitioning - User Guide. CoRR Peter Sanders, Christian Schulz
2013	A	`conf`	Malleable Sorting. IPDPS Patrick Flick, Peter Sanders, Jochen Speck
2013	J	`jnl`	Minimum time-dependent travel times with contraction hierarchies. ACM J. Exp. Algorithmics Gernot Veit Batz, Robert Geisberger, Peter Sanders, Christian Vetter
2013	B	`conf`	On (Dynamic) Range Minimum Queries in External Memory. WADS Lars Arge, Johannes Fischer, Peter Sanders, Nodari Sitchinava
2013	A	`conf`	Parallel Label-Setting Multi-objective Shortest Path Search. IPDPS Peter Sanders, Lawrence Mandow
2013	J	`jnl`	Parallel String Sample Sort CoRR Timo Bingmann, Peter Sanders
2013	A	`conf`	Parallel String Sample Sort. ESA Timo Bingmann, Peter Sanders
2013	A	`ed.`	Proceedings of the 15th Meeting on Algorithm Engineering and Experiments, ALENEX 2013, New Orleans, Louisiana, USA, January 7, 2013 ALENEX Peter Sanders, Norbert Zeh
2013	J	`jnl`	Real-time integrated prefetching and caching. J. Sched. Peter Sanders, Johannes Singler, Rob van Stee
2013	J	`jnl`	Recent Advances in Graph Partitioning. CoRR Aydin Buluç, Henning Meyerhenke, Ilya Safro, Peter Sanders, Christian Schulz
2013	B	`conf`	Think Locally, Act Globally: Highly Balanced Graph Partitioning. SEA Peter Sanders, Christian Schulz
2013	J	`jnl`	Transit Node Routing Reconsidered CoRR Julian Arz, Dennis Luxen, Peter Sanders
2013	B	`conf`	Transit Node Routing Reconsidered. SEA Julian Arz, Dennis Luxen, Peter Sanders
2013	B	`conf`	Work-efficient matrix inversion in polylogarithmic time. SPAA Peter Sanders, Jochen Speck, Raoul Steffen
2012	J	`jnl`	Advanced Coarsening Schemes for Graph Partitioning CoRR Ilya Safro, Peter Sanders, Christian Schulz
2012	B	`conf`	Advanced Coarsening Schemes for Graph Partitioning. SEA Ilya Safro, Peter Sanders, Christian Schulz
2012	A	`conf`	Distributed Evolutionary Graph Partitioning. ALENEX Peter Sanders, Christian Schulz
2012	—	`conf`	Efficient Route Compression for Hybrid Route Planning. MedAlg Gernot Veit Batz, Robert Geisberger, Dennis Luxen, Peter Sanders, Roman Zubkov
2012	—	`conf`	Energy Efficient Frequency Scaling and Scheduling for Malleable Tasks. Euro-Par Peter Sanders, Jochen Speck
2012	B	`conf`	Engineering Graph Partitioning Algorithms. SEA Vitaly Osipov, Peter Sanders, Christian Schulz
2012	J	`jnl`	Engineering highway hierarchies. ACM J. Exp. Algorithmics Peter Sanders, Dominik Schultes
2012	J	`jnl`	Exact Routing in Large Road Networks Using Contraction Hierarchies. Transp. Sci. Robert Geisberger, Peter Sanders, Dominik Schultes, Christian Vetter
2012	—	`conf`	High quality graph partitioning. Graph Partitioning and Graph Clustering Peter Sanders, Christian Schulz
2012	—	`conf`	Optimized Hybrid Parallel Lattice Boltzmann Fluid Flow Simulations on Complex Geometries. Euro-Par Jonas Fietz, Mathias J. Krause, Christian Schulz, Peter Sanders, Vincent Heuveline
2012	J	`jnl`	Route planning with flexible edge restrictions. ACM J. Exp. Algorithmics Robert Geisberger, Michael N. Rice, Peter Sanders, Vassilis J. Tsotras
2012	J	`jnl`	Think Locally, Act Globally: Perfectly Balanced Graph Partitioning CoRR Peter Sanders, Christian Schulz
2012	A	`conf`	Time-Dependent Route Planning with Generalized Objective Functions. ESA Gernot Veit Batz, Peter Sanders
2011	A	`conf`	Algorithm Engineering for Scalable Parallel External Sorting. IPDPS Peter Sanders
2011	J	`jnl`	Algorithm Engineering. it Inf. Technol. Peter Sanders, Dorothea Wagner
2011	—	`ch.`	Algorithm Engineering. Encyclopedia of Parallel Computing Peter Sanders
2011	—	`conf`	Alternative Route Graphs in Road Networks. TAPAS Roland Bader, Jonathan Dees, Robert Geisberger, Peter Sanders
2011	—	`conf`	Displaying Cell Broadcast messages. WPMC Peter Sanders
2011	J	`jnl`	Distributed Evolutionary Graph Partitioning CoRR Peter Sanders, Christian Schulz
2011	J	`jnl`	Efficient Error-Correcting Geocoding CoRR Christian Jung, Daniel Karch, Sebastian Knopp, Dennis Luxen, Peter Sanders
2011	A	`conf`	Efficient Parallel Scheduling of Malleable Tasks. IPDPS Peter Sanders, Jochen Speck
2011	J	`jnl`	Energy-Efficient Paths in Radio Networks. Algorithmica René Beier, Stefan Funke, Domagoj Matijevic, Peter Sanders
2011	J	`jnl`	Energy-efficient sorting using solid state disks. Sustain. Comput. Informatics Syst. Andreas Beckmann, Ulrich Meyer, Peter Sanders, Johannes Singler
2011	A	`conf`	Engineering Multilevel Graph Partitioning Algorithms. ESA Peter Sanders, Christian Schulz
2011	—	`conf`	Engineering a Multi-core Radix Sort. Euro-Par (2) Jan Wassenberg, Peter Sanders
2011	—	`conf`	Engineering efficient error-correcting geocoding. GIS Christian Jung, Daniel Karch, Sebastian Knopp, Dennis Luxen, Peter Sanders
2011	B	`conf`	Hierarchy Decomposition for Faster User Equilibria on Road Networks. SEA Dennis Luxen, Peter Sanders
2011	—	`ch.`	Shortest Paths. Algorithms Unplugged Peter Sanders, Johannes Singler
2011	J	`jnl`	Stronger Quickheaps. Int. J. Found. Comput. Sci. Gonzalo Navarro, Rodrigo Paredes, Patricio V. Poblete, Peter Sanders
2011	—	`conf`	The PEPPHER Approach to Programmability and Performance Portability for Heterogeneous many-core Architectures. PARCO Siegfried Benkner, Sabri Pllana, Jesper Larsson Träff, Philippas Tsigas, Andrew Richards, Raymond Namyst, Beverly Bachmayer, Christoph W. Kessler, David Moloney, Peter Sanders
2011	J	`jnl`	Towards optimal range medians. Theor. Comput. Sci. Gerth Stølting Brodal, Beat Gfeller, Allan Grønlund Jørgensen, Peter Sanders
2010	—	`conf`	10261 Abstracts Collection - Algorithm Engineering. Algorithm Engineering Giuseppe F. Italiano, David S. Johnson, Petra Mutzel, Peter Sanders
2010	—	`conf`	10261 Executive Summary - Algorithm Engineering. Algorithm Engineering Giuseppe F. Italiano, David S. Johnson, Petra Mutzel, Peter Sanders
2010	A	`conf`	Algorithm Engineering - An Attempt at a Definition Using Sorting as an Example. ALENEX Peter Sanders
2010	—	`ed.`	Algorithm Engineering, 27.06. - 02.07.2010 Algorithm Engineering Giuseppe F. Italiano, David S. Johnson, Petra Mutzel, Peter Sanders
2010	J	`jnl`	Algorithm Engineering. Inform. Spektrum Peter Sanders
2010	A	`conf`	Algorithm engineering for scalable parallel external sorting. IPDPS Peter Sanders
2010	J	`jnl`	Combining hierarchical and goal-directed speed-up techniques for dijkstra's algorithm. ACM J. Exp. Algorithmics Reinhard Bauer, Daniel Delling, Peter Sanders, Dennis Schieferdecker, Dominik Schultes, Dorothea Wagner
2010	J	`jnl`	Compressed Transmission of Route Descriptions CoRR Gernot Veit Batz, Robert Geisberger, Dennis Luxen, Peter Sanders
2010	J	`jnl`	Defining and Computing Alternative Routes in Road Networks CoRR Jonathan Dees, Robert Geisberger, Peter Sanders, Roland Bader
2010	B	`conf`	Distributed Time-Dependent Contraction Hierarchies. SEA Tim Kieritz, Dennis Luxen, Peter Sanders, Christian Vetter
2010	—	`conf`	Energy-efficient sorting using solid state disks. Green Computing Conference Andreas Beckmann, Ulrich Meyer, Peter Sanders, Johannes Singler
2010	J	`jnl`	Engineering Multilevel Graph Partitioning Algorithms CoRR Peter Sanders, Christian Schulz
2010	C	`conf`	Engineering Time-Dependent Many-to-Many Shortest Paths Computation. ATMOS Robert Geisberger, Peter Sanders
2010	A	`conf`	Engineering a scalable high quality graph partitioner. IPDPS Manuel Holtgrewe, Peter Sanders, Christian Schulz
2010	J	`jnl`	Engineering basic algorithms of an in-memory text search engine. ACM Trans. Inf. Syst. Frederik Transier, Peter Sanders
2010	C	`conf`	Fast Detour Computation for Ride Sharing. ATMOS Robert Geisberger, Dennis Luxen, Sabine Neubauer, Peter Sanders, Lars Völker
2010	J	`jnl`	Faster Radix Sort via Virtual Memory and Write-Combining CoRR Jan Wassenberg, Peter Sanders
2010	A	`conf`	GPU sample sort. IPDPS Nikolaj Leischner, Vitaly Osipov, Peter Sanders
2010	J	`jnl`	Heuristic initialization for bipartite matching problems. ACM J. Exp. Algorithmics Johannes Langguth, Fredrik Manne, Peter Sanders
2010	J	`jnl`	Improved Fast Similarity Search in Dictionaries CoRR Daniel Karch, Dennis Luxen, Peter Sanders
2010	C	`conf`	Improved Fast Similarity Search in Dictionaries. SPIRE Daniel Karch, Dennis Luxen, Peter Sanders
2010	C	`conf`	Lifetime Maximization of Monitoring Sensor Networks. ALGOSENSORS Peter Sanders, Dennis Schieferdecker
2010	A	`conf`	Route Planning with Flexible Objective Functions. ALENEX Robert Geisberger, Moritz Kobitzsch, Peter Sanders
2010	A*	`conf`	Scalable distributed-memory external sorting. ICDE Mirko Rahn, Peter Sanders, Johannes Singler
2010	A	`conf`	Simple and Fast Nearest Neighbor Search. ALENEX Marcel Birn, Manuel Holtgrewe, Peter Sanders, Johannes Singler
2010	B	`conf`	Time-Dependent Contraction Hierarchies and Approximation. SEA Gernot Veit Batz, Robert Geisberger, Sabine Neubauer, Peter Sanders
2010	J	`jnl`	n-Level Graph Partitioning CoRR Vitaly Osipov, Peter Sanders
2009	—	`conf`	09491 Abstracts Collection - Graph Search Engineering. Graph Search Engineering Lubos Brim, Stefan Edelkamp, Eric A. Hansen, Peter Sanders
2009	—	`conf`	Algorithm Engineering - An Attempt at a Definition. Efficient Algorithms Peter Sanders
2009	A	`ed.`	Algorithms - ESA 2009, 17th Annual European Symposium, Copenhagen, Denmark, September 7-9, 2009. Proceedings ESA Amos Fiat, Peter Sanders
2009	C	`conf`	An Efficient Parallel Algorithm for Graph-Based Image Segmentation. CAIP Jan Wassenberg, Wolfgang Middelmann, Peter Sanders
2009	J	`jnl`	Cache-, hash-, and space-efficient bloom filters. ACM J. Exp. Algorithmics Felix Putze, Peter Sanders, Johannes Singler
2009	—	`conf`	Engineering Route Planning Algorithms. Algorithmics of Large and Complex Networks Daniel Delling, Peter Sanders, Dominik Schultes, Dorothea Wagner
2009	J	`jnl`	Engineering a Scalable High Quality Graph Partitioner CoRR Manuel Holtgrewe, Peter Sanders, Christian Schulz
2009	J	`jnl`	Fast Detour Computation for Ride Sharing CoRR Robert Geisberger, Dennis Luxen, Sabine Neubauer, Peter Sanders, Lars Völker
2009	J	`jnl`	GPU sample sort CoRR Nikolaj Leischner, Vitaly Osipov, Peter Sanders
2009	J	`jnl`	Goal-directed shortest-path queries using precomputed cluster distances. ACM J. Exp. Algorithmics Jens Maue, Peter Sanders, Domagoj Matijevic
2009	—	`ed.`	Graph Search Engineering, 29.11. - 04.12.2009 Graph Search Engineering Lubos Brim, Stefan Edelkamp, Eric A. Hansen, Peter Sanders
2009	J	`jnl`	Online Scheduling with Bounded Migration. Math. Oper. Res. Peter Sanders, Naveen Sivadasan, Martin Skutella
2009	J	`jnl`	Scalable Distributed-Memory External Sorting CoRR Mirko Rahn, Peter Sanders, Johannes Singler
2009	A	`conf`	The Filter-Kruskal Minimum Spanning Tree Algorithm. ALENEX Vitaly Osipov, Peter Sanders, Johannes Singler
2009	A	`conf`	Time-Dependent Contraction Hierarchies. ALENEX Gernot Veit Batz, Daniel Delling, Peter Sanders, Christian Vetter
2009	J	`jnl`	Towards Optimal Range Medians CoRR Beat Gfeller, Peter Sanders
2009	—	`conf`	Towards Optimal Range Medians. ICALP (1) Beat Gfeller, Peter Sanders
2009	J	`jnl`	Two-tree algorithms for full bandwidth broadcast, reduction and scan. Parallel Comput. Peter Sanders, Jochen Speck, Jesper Larsson Träff
2008	—	`book`	Algorithms and Data Structures: The Basic Toolbox. Kurt Mehlhorn, Peter Sanders
2008	J	`jnl`	An asymptotic approximation scheme for multigraph edge coloring. ACM Trans. Algorithms Peter Sanders, David Steurer
2008	A	`conf`	Better Approximation of Betweenness Centrality. ALENEX Robert Geisberger, Peter Sanders, Dominik Schultes
2008	J	`jnl`	Better external memory suffix array construction. ACM J. Exp. Algorithmics Roman Dementiev, Juha Kärkkäinen, Jens Mehnert, Peter Sanders
2008	—	`conf`	Combining Hierarchical and Goal-Directed Speed-Up Techniques for Dijkstra's Algorithm. WEA Reinhard Bauer, Daniel Delling, Peter Sanders, Dennis Schieferdecker, Dominik Schultes, Dorothea Wagner
2008	A	`conf`	Compressed Inverted Indexes for In-Memory Search Engines. ALENEX Frederik Transier, Peter Sanders
2008	J	`jnl`	Constant Time Queries for Energy Efficient Paths in Multi-hop Wireless Networks. J. Comput. Inf. Technol. Stefan Funke, Domagoj Matijevic, Peter Sanders
2008	—	`conf`	Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks. WEA Robert Geisberger, Peter Sanders, Dominik Schultes, Daniel Delling
2008	—	`ch.`	Kürzeste Wege. Taschenbuch der Algorithmen Peter Sanders, Johannes Singler
2008	A	`conf`	Mobile Route Planning. ESA Peter Sanders, Dominik Schultes, Christian Vetter
2008	C	`conf`	Out of the Box Phrase Indexing. SPIRE Frederik Transier, Peter Sanders
2008	J	`jnl`	STXXL: standard template library for XXL data sets. Softw. Pract. Exp. Roman Dementiev, Lutz Kettner, Peter Sanders
2008	A*	`conf`	Semi-external LTL Model Checking. CAV Stefan Edelkamp, Peter Sanders, Pavel Simecek
2008	Misc	`conf`	Single-Pass List Partitioning. CISIS Leonor Frias, Johannes Singler, Peter Sanders
2008	J	`jnl`	Single-Pass List Partitioning. Scalable Comput. Pract. Exp. Leonor Frias, Johannes Singler, Peter Sanders
2008	J	`jnl`	Time Dependent Contraction Hierarchies -- Basic Algorithmic Ideas CoRR Peter Sanders
2007	—	`conf`	Cache-, Hash- and Space-Efficient Bloom Filters. WEA Felix Putze, Peter Sanders, Johannes Singler
2007	A	`conf`	Computing Many-to-Many Shortest Paths Using Highway Hierarchies. ALENEX Sebastian Knopp, Peter Sanders, Dominik Schultes, Frank Schulz, Dorothea Wagner
2007	—	`conf`	Dynamic Highway-Node Routing. WEA Dominik Schultes, Peter Sanders
2007	—	`conf`	Engineering Algorithms for Approximate Weighted Matching. WEA Jens Maue, Peter Sanders
2007	—	`conf`	Engineering Fast Route Planning Algorithms. WEA Peter Sanders, Dominik Schultes
2007	—	`conf`	Full Bandwidth Broadcast, Reduction and Scan with Only Two Trees. PVM/MPI Peter Sanders, Jochen Speck, Jesper Larsson Träff
2007	A	`conf`	In Transit to Constant Time Shortest-Path Queries in Road Networks. ALENEX Hannah Bast, Stefan Funke, Domagoj Matijevic, Peter Sanders, Dominik Schultes
2007	A	`conf`	Intersection in Integer Inverted Indices. ALENEX Peter Sanders, Frederik Transier
2007	—	`conf`	MCSTL: The Multi-core Standard Template Library. Euro-Par Johannes Singler, Peter Sanders, Felix Putze
2007	B	`conf`	MCSTL: the multi-core standard template library. PPoPP Felix Putze, Peter Sanders, Johannes Singler
2007	J	`jnl`	Scalable parallel suffix array construction. Parallel Comput. Fabian Kulla, Peter Sanders
2007	A*	`conf`	The random graph threshold for SODA Julie Anne Cain, Peter Sanders, Nicholas C. Wormald
2006	A	`conf`	Engineering Highway Hierarchies. ESA Peter Sanders, Dominik Schultes
2006	J	`jnl`	Foreword. Theory Comput. Syst. Peter Sanders, Aravind Srinivasan, Berthold Vöcking
2006	—	`conf`	Goal Directed Shortest Path Queries Using Precomputed Cluster Distances. WEA Jens Maue, Peter Sanders, Domagoj Matijevic
2006	—	`conf`	Highway Hierarchies Star. The Shortest Path Problem Daniel Delling, Peter Sanders, Dominik Schultes, Dorothea Wagner
2006	A	`conf`	How Branch Mispredictions Affect Quicksort. ESA Kanela Kaligosi, Peter Sanders
2006	J	`jnl`	Linear work suffix array construction. J. ACM Juha Kärkkäinen, Peter Sanders, Stefan Burkhardt
2006	—	`conf`	Parallel Prefix (Scan) Algorithms for MPI. PVM/MPI Peter Sanders, Jesper Larsson Träff
2006	—	`conf`	Robust, Almost Constant Time Shortest-Path Queries in Road Networks. The Shortest Path Problem Peter Sanders, Dominik Schultes
2006	—	`conf`	Scalable Parallel Suffix Array Construction. PVM/MPI Fabian Kulla, Peter Sanders
2005	A	`conf`	: Standard Template Library for XXL Data Sets. ESA Roman Dementiev, Lutz Kettner, Peter Sanders
2005	A*	`conf`	An asymptotic approximation scheme for multigraph edge coloring. SODA Peter Sanders, David Steurer
2005	—	`conf`	Better External Memory Suffix Array Construction. ALENEX/ANALCO Roman Dementiev, Juha Kärkkäinen, Jens Mehnert, Peter Sanders
2005	J	`jnl`	Duality Between Prefetching and Queued Writing with Parallel Disks. SIAM J. Comput. David A. Hutchinson, Peter Sanders, Jeffrey Scott Vitter
2005	A	`conf`	Highway Hierarchies Hasten Exact Shortest Path Queries. ESA Peter Sanders, Dominik Schultes
2005	—	`conf`	Online Scheduling with Bounded Migration. Algorithms for Optimization with Incomplete Information Peter Sanders, Naveen Sivadasan, Martin Skutella
2005	J	`jnl`	Polynomial time algorithms for multicast network code construction. IEEE Trans. Inf. Theory Sidharth Jaggi, Peter Sanders, Philip A. Chou, Michelle Effros, Sebastian Egner, Kamal Jain, Ludo M. G. M. Tolhuizen
2005	J	`jnl`	Space Efficient Hash Tables with Worst Case Constant Access Time. Theory Comput. Syst. Dimitris Fotakis, Rasmus Pagh, Peter Sanders, Paul G. Spirakis
2005	A*	`conf`	Towards Optimal Multiple Selection. ICALP Kanela Kaligosi, Kurt Mehlhorn, J. Ian Munro, Peter Sanders
2004	J	`jnl`	A simpler linear time 2/3-epsilon approximation for maximum weight matching. Inf. Process. Lett. Seth Pettie, Peter Sanders
2004	J	`jnl`	Algorithms for Memory Hierarchies (Column: Algorithmics). Bull. EATCS Peter Sanders
2004	B	`conf`	Algorithms for Scalable Storage Servers. SOFSEM Peter Sanders
2004	—	`conf`	Engineering a Sorted List Data Structure for 32 Bit Key. ALENEX/ANALC Roman Dementiev, Lutz Kettner, Jens Mehnert, Peter Sanders
2004	—	`conf`	Engineering an External Memory Minimum Spanning Tree Algorithm. IFIP TCS Roman Dementiev, Peter Sanders, Dominik Schultes, Jop F. Sibeyn
2004	A*	`conf`	Online Scheduling with Bounded Migration. ICALP Peter Sanders, Naveen Sivadasan, Martin Skutella
2004	A	`conf`	Super Scalar Sample Sort. ESA Peter Sanders, Sebastian Winkel
2003	A	`conf`	A Practical Minimum Spanning Tree Algorithm Using the Cycle Property. ESA Irit Katriel, Peter Sanders, Jesper Larsson Träff
2003	J	`jnl`	A bandwidth latency tradeoff for broadcast and reduction. Inf. Process. Lett. Peter Sanders, Jop F. Sibeyn
2003	—	`ed.`	Algorithms for Memory Hierarchies, Advanced Lectures [Dagstuhl Research Seminar, March 10-14, 2002] Algorithms for Memory Hierarchies Ulrich Meyer, Peter Sanders, Jop F. Sibeyn
2003	A	`conf`	Approximating Energy Efficient Paths in Wireless Multi-hop Networks. ESA Stefan Funke, Domagoj Matijevic, Peter Sanders
2003	J	`jnl`	Asynchronous Scheduling of Redundant Disk Arrays. IEEE Trans. Computers Peter Sanders
2003	B	`conf`	Asynchronous parallel disk sorting. SPAA Roman Dementiev, Peter Sanders
2003	J	`jnl`	Fast Concurrent Access to Parallel Disks. Algorithmica Peter Sanders, Sebastian Egner, Jan H. M. Korst
2003	B	`conf`	Polynomial time algorithms for network information flow. SPAA Peter Sanders, Sebastian Egner, Ludo M. G. M. Tolhuizen
2003	J	`jnl`	Scanning Multiple Sequences Via Cache Memory. Algorithmica Kurt Mehlhorn, Peter Sanders
2003	B	`conf`	Scheduling and Traffic Allocation for Tasks with Bounded Splittability. MFCS Piotr Krysta, Peter Sanders, Berthold Vöcking
2003	A*	`conf`	Simple Linear Work Suffix Array Construction. ICALP Juha Kärkkäinen, Peter Sanders
2003	A	`conf`	Space Efficient Hash Tables with Worst Case Constant Access Time. STACS Dimitris Fotakis, Rasmus Pagh, Peter Sanders, Paul G. Spirakis
2003	J	`jnl`	Tail Bounds And Expectations For Random Arc Allocation And Applications. Comb. Probab. Comput. Peter Sanders, Berthold Vöcking
2003	J	`jnl`	[Delta]-stepping: a parallelizable shortest path algorithm. J. Algorithms Ulrich Meyer, Peter Sanders
2002	J	`jnl`	Cellular Automata: Energy Consumption and Physical Feasibility. Fundam. Informaticae Peter Sanders, Roland Vollmar, Thomas Worsch
2002	A*	`conf`	Energy Optimal Routing in Radio Networks Using Geometric Data Structures. ICALP René Beier, Peter Sanders, Naveen Sivadasan
2002	—	`conf`	Memory Hierarchies - Models and Lower Bounds. Algorithms for Memory Hierarchies Peter Sanders
2002	—	`conf`	Random Arc Allocation and Applications. SWAT Peter Sanders, Berthold Vöcking
2002	J	`jnl`	Randomized Receiver Initiated Load-balancing Algorithms for Tree-shaped Computations. Comput. J. Peter Sanders
2002	J	`jnl`	Reconciling simplicity and realism in parallel disk models. Parallel Comput. Peter Sanders
2002	J	`jnl`	SKaMPI: a comprehensive benchmark for public benchmarking of MPI. Sci. Program. Ralf H. Reussner, Peter Sanders, Jesper Larsson Träff
2002	—	`conf`	The Hierarchical Factor Algorithm for All-to-All Communication (Research Note). Euro-Par Peter Sanders, Jesper Larsson Träff
2002	J	`jnl`	Towards optimal locality in mesh-indexings. Discret. Appl. Math. Rolf Niedermeier, Klaus Reinhardt, Peter Sanders
2001	A	`conf`	Duality between Prefetching and Queued Writing with Parallel Disks. ESA David A. Hutchinson, Peter Sanders, Jeffrey Scott Vitter
2001	J	`jnl`	How Helpers Hasten h-Relations. J. Algorithms Peter Sanders, Roberto Solis-Oba
2001	A*	`conf`	Reconciling simplicity and realism in parallel disk models. SODA Peter Sanders
2001	B	`conf`	The power of duality for prefetching and sorting with parallel disks. SPAA David A. Hutchinson, Peter Sanders, Jeffrey Scott Vitter
2000	—	`conf`	A Bandwidth Latency Tradeoff for Broadcast and Reduction. Euro-Par Peter Sanders, Jop F. Sibeyn
2000	—	`conf`	Algorithm Engineering for Parallel Computation. Experimental Algorithmics David A. Bader, Bernard M. E. Moret, Peter Sanders
2000	—	`conf`	Asymptotic Complexity from Experiments? A Case Study for Randomized Algorithms. WAE Peter Sanders, Rudolf Fleischer
2000	B	`conf`	Asynchronous scheduling of redundant disk arrays. SPAA Peter Sanders
2000	J	`jnl`	Fast Priority Queues for Cached Memory. ACM J. Exp. Algorithmics Peter Sanders
2000	A*	`conf`	Fast concurrent access to parallel disks. SODA Peter Sanders, Sebastian Egner, Jan H. M. Korst
2000	A	`conf`	How Helpers Hasten ESA Peter Sanders, Roberto Solis-Oba
2000	J	`jnl`	Parallel Integer Optimization for Crew Scheduling. Ann. Oper. Res. Panayiotis Alefragis, Peter Sanders, Tuomo Takkula, Dag Wedelin
2000	—	`conf`	Parallel Shortest Path for Arbitrary Graphs. Euro-Par Ulrich Meyer, Peter Sanders
2000	—	`conf`	Presenting Data from Experiments in Algorithmics. Experimental Algorithmics Peter Sanders
2000	—	`conf`	Using Finite Experiments to Study Asymptotic Performance. Experimental Algorithmics Catherine C. McGeoch, Peter Sanders, Rudolf Fleischer, Paul R. Cohen, Doina Precup
1999	J	`jnl`	A case study in scalability: An ADI method for the two-dimensional time-dependent Dirac equation. Parallel Comput. U. W. Rathe, Peter Sanders, P. L. Knight
1999	A*	`conf`	Accessing Multiple Sequences Through Set Associative Caches. ICALP Peter Sanders
1999	J	`jnl`	Analysis of nearest neighbor load balancing algorithms for random loads. Parallel Comput. Peter Sanders
1999	B	`conf`	Asynchronous Random Polling Dynamic Load Balancing. ISAAC Peter Sanders
1999	A	`conf`	Fast Priority Queues for Cached Memory. ALENEX Peter Sanders
1999	—	`conf`	High Performance Integer Optimization for Crew Scheduling. HPCN Europe Peter Sanders, Tuomo Takkula, Dag Wedelin
1998	B	`conf`	A Parallelization of Dijkstra's Shortest Path Algorithm. MFCS Andreas Crauser, Kurt Mehlhorn, Ulrich Meyer, Peter Sanders
1998	—	`conf`	An Implementation of the Binary Blocking Flow Algorithm. WAE Torben Hagerup, Peter Sanders, Jesper Larsson Träff
1998	A	`conf`	Delta-Stepping: A Parallel Single Source Shortest Path Algorithm. ESA Ulrich Meyer, Peter Sanders
1998	—	`conf`	Parallel Crew Scheduling in PAROS. Euro-Par Panayiotis Alefragis, Christos Goumopoulos, Efthymios Housos, Peter Sanders, Tuomo Takkula, Dag Wedelin
1998	J	`jnl`	Random Permutations on Distributed, External and Hierarchical Memory. Inf. Process. Lett. Peter Sanders
1998	J	`jnl`	Randomized Priority Queues for Fast Parallel Access. J. Parallel Distributed Comput. Peter Sanders
1998	—	`conf`	SKaMPI: A Detailed, Accurate MPI Benchmark. PVM/MPI Ralf H. Reussner, Peter Sanders, Lutz Prechelt, Matthias Müller
1997	—	`conf`	Efficient Massively Parallel Quicksort. IRREGULAR Peter Sanders, Thomas Hansch
1997	—	`conf`	Feasible Models of Computation: Three-Dimensionality and Energy Consumption. Euro-Par Peter Sanders, Roland Vollmar, Thomas Worsch
1997	—	`—`	Lastverteilungsalgorithmen für parallele Tiefensuche. Peter Sanders
1997	—	`book`	Parallele Programmierung mit MPI - ein Praktikum, Programmtexte im Internet. Peter Sanders, Thomas Worsch
1997	B	`conf`	Towards Optimal Locality in Mesh-Indexings. FCT Rolf Niedermeier, Klaus Reinhardt, Peter Sanders
1996	—	`conf`	On the Efficiency of Nearest Neighbor Load Balancing for Random Loads. Parcella Peter Sanders
1996	—	`conf`	Optimizing the Emulation of MIMD Behavior on SIMD Machines. Parcella Peter Sanders
1995	—	`conf`	Better Algorithms for Parallel Backtracking. IRREGULAR Peter Sanders
1995	—	`conf`	Fast Priority Queues for Parallel Branch-and-Bound. IRREGULAR Peter Sanders
1995	—	`conf`	Parallel Game Tree Search on SIMD Machines. IRREGULAR Holger Hopp, Peter Sanders
1994	—	`conf`	A detailed analysis of random polling dynamic load balancing. ISPAN Peter Sanders
1994	—	`conf`	Emulating MIMD Behaviour on SIMD-Machines. EUROSIM Peter Sanders
1994	—	`conf`	Massively Parallel Search for Transition-Tables of Polyautomata. Parcella Peter Sanders
1993	—	`conf`	A Case Study in Object Oriented Programming: Algebraic Structures in Eiffel. TOOLS (11) Peter Sanders