97 citations · 392 across the 64 of their papers we have counts for
4 papers · 2 filters
Communication Efficient Checking of Big Data Operations
Lorenz Hübschle-Schneider, Peter Sanders
We propose fast probabilistic algorithms with low (i.e., sublinear in the input size) communication volume to check the correctness of operations in Big Data processing frameworks…
High-Quality Shared-Memory Graph Partitioning
Yaroslav Akhremtsev, Peter Sanders, Christian Schulz
Partitioning graphs into blocks of roughly equal size such that few edges run between blocks is a frequently needed operation in processing graphs. Recently, size, variety, and str…
Dynamic Space Efficient Hashing
Tobias Maier, Peter Sanders
We consider space efficient hash tables that can grow and shrink dynamically and are always highly space efficient, i.e., their space consumption is always close to the lower bound…
Engineering DFS-Based Graph Algorithms
Kurt Mehlhorn, Stefan Näher, Peter Sanders
Depth-first search (DFS) is the basis for many efficient graph algorithms. We introduce general techniques for the efficient implementation of DFS-based graph algorithms and exempl…