Steffan Christ Sølvsten

soelvsten@cs.au.dk

Department of Computer Science, Aarhus University

Curriculum Vitae
Projects Slides Publications

Projects

Adiar

github.com/ssoelvsten/adiar

Following up on the work of Lars Arge in 1996, Adiar provides an easy-to-use implementation of Binary Decision Diagrams that make use of Time-Forward Processing to achieve efficient manipulation of BDDs, that far outgrow the memory limit of the given machine.

Wordrow

wordrow.io

Wordrow is a reimplementation of the classic internet puzzle game Text Twist as a static React (PWA) webpage with a modern and sleek design. To make it static, all games are pre-computed from the entire dictionary with an implementation of the Anatree data structure in C++.

Slides

Algorithms and Data Structures

Adiar

Algorithmic Game Theory

Formal Methods

Publications

2024
  • Multi-variable Quantification of BDDs in External Memory using Nested Sweeping
    Steffan Christ Sølvsten, Jaco van de Pol
    arXiv

2024
  • Random Access on Narrow Decision Diagrams in External Memory
    Steffan Christ Sølvsten, Casper Moldrup Rysgaard, Jaco van de Pol

2023
  • Predicting Memory Demands of BDD Operations using Maximum Graph Cuts
    Steffan Christ Sølvsten, Jaco van de Pol
    ATVA 23, arXiv
  • Adiar 1.1: Zero-suppressed Decision Diagrams in External Memory
    Steffan Christ Sølvsten, Jaco van de Pol
    NFM 23

2022
  • Adiar: Binary Decision Diagrams in External Memory
    Steffan Christ Sølvsten, Jaco van de Pol, Anna Blume Jakobsen, Mathias Weller Berg Thomasen
    TACAS 22

2021
  • Efficient Binary Decision Diagram Manipulation in External Memory
    Steffan Christ Sølvsten, Jaco van de Pol, Anna Blume Jakobsen, Mathias Weller Berg Thomasen
    arXiv

2020