b'Peter Sanders'

research

∙ 03/14/2023

Efficient Yao Graph Construction

Yao graphs are geometric spanners that connect each point of a given poi...

0 Daniel Funke, et al. ∙

research

∙ 03/02/2023

Distributed Deep Multilevel Graph Partitioning

We describe the engineering of the distributed-memory multilevel graph p...

0 Peter Sanders, et al. ∙

research

∙ 02/23/2023

Engineering Massively Parallel MST Algorithms

We develop and extensively evaluate highly scalable distributed-memory a...

0 Peter Sanders, et al. ∙

research

∙ 02/22/2023

Engineering a Distributed-Memory Triangle Counting Algorithm

Counting triangles in a graph and incident to each vertex is a fundament...

0 Peter Sanders, et al. ∙

research

∙ 12/19/2022

High Performance Construction of RecSplit Based Minimal Perfect Hash Functions

A minimal perfect hash function (MPHF) is a bijection from a set of obje...

0 Dominik Bez, et al. ∙

research

∙ 10/04/2022

SicHash – Small Irregular Cuckoo Tables for Perfect Hashing

A Perfect Hash Function (PHF) is a hash function that has no collisions ...

0 Hans-Peter Lehmann, et al. ∙

research

∙ 05/26/2022

More Recent Advances in (Hyper)Graph Partitioning

In recent years, significant advances have been made in the design and e...

0 Umit V. Catalyurek, et al. ∙

research

∙ 05/13/2022

Scalable SAT Solving in the Cloud

Previous efforts on making Satisfiability (SAT) solving fit for high per...

0 Dominik Schreiber, et al. ∙

research

∙ 05/12/2022

Vectorized and performance-portable Quicksort

Recent works showed that implementations of Quicksort using vector CPU i...

0 Mark Blacher, et al. ∙

research

∙ 05/10/2022

PaCHash: Packed and Compressed Hash Tables

We introduce PaCHash, a hash table that stores its objects contiguously ...

0 Florian Kurpicz, et al. ∙

research

∙ 03/02/2022

ReStore: In-Memory REplicated STORagE for Rapid Recovery in Fault-Tolerant Algorithms

Fault-tolerant distributed applications require mechanisms to recover da...

0 Demian Hespe, et al. ∙

research

∙ 01/05/2022

Parallel Flow-Based Hypergraph Partitioning

We present a shared-memory parallelization of flow-based refinement, whi...

0 Lars Gottesbüren, et al. ∙

research

∙ 09/04/2021

Fast Succinct Retrieval and Approximate Membership using Ribbon

A retrieval data structure for a static function f:S→{0,1}^r supports qu...

0 Peter C. Dillinger, et al. ∙

research

∙ 07/03/2021

Engineering MultiQueues: Fast Relaxed Concurrent Priority Queues

Priority queues with parallel access are an attractive data structure fo...

0 Marvin Williams, et al. ∙

research

∙ 06/23/2021

Weighted Random Sampling on GPUs

An alias table is a data structure that allows for efficiently drawing w...

0 Hans-Peter Lehmann, et al. ∙

research

∙ 06/16/2021

High-Quality Hypergraph Partitioning

This paper considers the balanced hypergraph partitioning problem, which...

0 Sebastian Schlag, et al. ∙

research

∙ 05/05/2021

Deep Multilevel Graph Partitioning

Partitioning a graph into blocks of "roughly equal" weight while cutting...

0 Lars Gottesbüren, et al. ∙

research

∙ 04/16/2021

Shared-Memory n-level Hypergraph Partitioning

We present a shared-memory algorithm to compute high-quality solutions t...

0 Lars Gottesbüren, et al. ∙

research

∙ 11/05/2020

Fast, Exact and Scalable Dynamic Ridesharing

We study the problem of servicing a set of ride requests by dispatching ...

0 Valentin Buchhold, et al. ∙

research

∙ 10/20/2020

Scalable Shared-Memory Hypergraph Partitioning

Hypergraph partitioning is an important preprocessing step for optimizin...

0 Lars Gottesbüren, et al. ∙

research

∙ 09/28/2020

Engineering In-place (Shared-memory) Sorting Algorithms

We present sorting algorithms that represent the fastest known technique...

0 Michael Axtmann, et al. ∙

research

∙ 03/02/2020

Recent Advances in Scalable Network Generation

Random graph models are frequently used as a controllable and versatile ...

0 Manuel Penschuck, et al. ∙

research

∙ 02/18/2020

Connecting MapReduce Computations to Realistic Machine Models

We explain how the popular, highly abstract MapReduce model of parallel ...

0 Peter Sanders, et al. ∙

research

∙ 01/23/2020

Communication-Efficient String Sorting

There has been surprisingly little work on algorithms for sorting string...

0 Timo Bingmann, et al. ∙

research

∙ 11/19/2019

Concurrent Expandable AMQs on the Basis of Quotient Filters

A quotient filter is a cache efficient AMQ data structure. Depending on ...

0 Tobias Maier, et al. ∙

research

∙ 10/24/2019

Communication-Efficient (Weighted) Reservoir Sampling

We consider communication-efficient weighted and unweighted (uniform) ra...

0 Lorenz Hübschle-Schneider, et al. ∙

research

∙ 07/08/2019

More Hierarchy in Route Planning Using Edge Hierarchies

A highly successful approach to route planning in networks (particularly...

0 Demian Hespe, et al. ∙

research

∙ 05/09/2019

Linear Work Generation of R-MAT Graphs

R-MAT is a simple, widely used recursive model for generating `complex n...

0 Lorenz Hübschle-Schneider, et al. ∙

research

∙ 03/01/2019

Parallel Weighted Random Sampling

Data structures for efficient sampling from a set of weighted items are ...

0 Lorenz Hübschle-Schneider, et al. ∙

research

∙ 02/20/2019

Load-Balancing for Parallel Delaunay Triangulations

Computing the Delaunay triangulation (DT) of a given point set in R^D is...

0 Daniel Funke, et al. ∙

research

∙ 08/14/2018

Hashing with Linear Probing and Referential Integrity

We describe a variant of linear probing hash tables that never moves ele...

0 Peter Sanders, et al. ∙

research

∙ 03/27/2018

Proving Equivalence Between Imperative and MapReduce Implementations Using Program Transformations

Distributed programs are often formulated in popular functional framewor...

0 Bernhard Beckert, et al. ∙

research

∙ 02/10/2018

Network Flow-Based Refinement for Multilevel Hypergraph Partitioning

We present a refinement framework for multilevel hypergraph partitioning...

0 Tobias Heuer, et al. ∙

research

∙ 01/26/2018

Relational Equivalence Proofs Between Imperative and MapReduce Algorithms

MapReduce frameworks are widely used for the implementation of distribut...

0 Bernhard Beckert, et al. ∙

research

∙ 10/23/2017

Communication Efficient Checking of Big Data Operations

We propose fast probabilistic algorithms with low (i.e., sublinear in th...

0 Lorenz Hübschle-Schneider, et al. ∙

research

∙ 10/22/2017

Lightweight MPI Communicators with Applications to Perfectly Balanced Schizophrenic Quicksort

MPI uses the concept of communicators to connect groups of processes. It...

0 Michael Axtmann, et al. ∙

research

∙ 10/20/2017

Communication-free Massively Distributed Graph Generation

Analyzing massive complex networks yields promising insights about our e...

0 Daniel Funke, et al. ∙

research

∙ 09/15/2017

Fast OLAP Query Execution in Main Memory on Large Data in a Cluster

Main memory column-stores have proven to be efficient for processing ana...

0 Demian Hespe, et al. ∙

research

∙ 02/06/2017

Distributed Evolutionary k-way Node Separators

Computing high quality node separators in large graphs is necessary for ...

0 Peter Sanders, et al. ∙

research

∙ 10/17/2016

Efficient Random Sampling - Parallel, Vectorized, Cache-Efficient, and Online

We consider the problem of sampling n numbers from the range {1,...,N} w...

0 Peter Sanders, et al. ∙

research

∙ 04/17/2016

Generating Semi-Synthetic Validation Benchmarks for Embryomics

Systematic validation is an essential part of algorithm development. The...

0 Johannes Stegmaier, et al. ∙

research

∙ 09/02/2015

Finding Near-Optimal Independent Sets at Scale

The independent set problem is NP-hard and particularly difficult to sol...

0 Sebastian Lamm, et al. ∙

research

∙ 04/29/2015

Incorporating Road Networks into Territory Design

Given a set of basic areas, the territory design problem asks to create ...

0 Nitin Ahuja, et al. ∙

research

∙ 02/05/2015

Graph Partitioning for Independent Sets

Computing maximum independent sets in graphs is an important problem in ...

0 Sebastian Lamm, et al. ∙

research

∙ 04/18/2014

Parallel Graph Partitioning for Complex Networks

Processing large complex networks like social networks or web graphs has...

0 Henning Meyerhenke, et al. ∙

research

∙ 10/01/2012

Think Locally, Act Globally: Perfectly Balanced Graph Partitioning

We present a novel local improvement scheme for the perfectly balanced g...

0 Peter Sanders, et al. ∙

research

∙ 10/03/2011

Distributed Evolutionary Graph Partitioning

We present a novel distributed evolutionary algorithm, KaFFPaE, to solve...

0 Peter Sanders, et al. ∙

Peter Sanders

Featured Co-authors