157 citations · 421 across the 63 of their papers we have counts for
10 papers · 1 filter
A strong version of Cobham's theorem
Philipp Hieronymi, Chris Schulz
Let be two multiplicatively independent integers. Cobham's famous theorem states that a set is both -recognizable and -recognizable…
An MPI-based Algorithm for Mapping Complex Networks onto Hierarchical Architectures
Maria Predari, Charilaos Tzovas, Christian Schulz +1
Processing massive application graphs on distributed memory systems requires to map the graphs onto the system's processing elements (PEs). This task becomes all the more important…
High-Quality Hypergraph Partitioning
Sebastian Schlag, Tobias Heuer, Lars Gottesbüren +3
This paper considers the balanced hypergraph partitioning problem, which asks for partitioning the vertices into disjoint blocks of bounded size while minimizing an objective f…
Deep Multilevel Graph Partitioning
Lars Gottesbüren, Tobias Heuer, Peter Sanders +2
Partitioning a graph into blocks of "roughly equal" weight while cutting only few edges is a fundamental problem in computer science with a wide range of applications. In particula…
Fully-dynamic Weighted Matching Approximation in Practice
Eugenio Angriman, Henning Meyerhenke, Christian Schulz +1
Finding large or heavy matchings in graphs is a ubiquitous combinatorial optimization problem. In this paper, we engineer the first non-trivial implementations for approximating th…
Pecan: An Automated Theorem Prover for Automatic Sequences using Büchi Automata
Reed Oei, Dun Ma, Christian Schulz +1
Pecan is an automated theorem prover for reasoning about properties of Sturmian words, an important object in the field of combinatorics on words. It is capable of efficiently prov…