Scalable Algorithms (ITI)

Supplemental Material

Here you can find additional material, e.g., presentations or source code, related to some of our papers.

The Impact of Heterogeneity and Geometry on the Proof Complexity of Random Satisfiability

Authors: Thomas Bläsius, Tobias Friedrich, Andreas Göbel, Jordi Levy, Ralf Rothenberger

Slides for SODA'21

Video for SODA'21

Additional Slides

One contribution (on the complexity of Voronoi diagrams) of the paper didn't make it into the title, as the title would have been way too long otherwise. To show this poor result some love, I created this presentation:

Hitting Set Enumeration with Partial Information for Unique Column Combination Discovery

Authors: Johann Birnick, Thomas Bläsius, Tobias Friedrich, Felix Naumann,Thorsten Papenbrock, Martin Schirneck

Source Code and Data

The code of our C++ implementation can be found in this GitLab repository. A ZIP-file with the data used for testing can be downloaded here (3.5GB).

Video for VLDB'20