Steffan Christ Sølvsten
soelvsten@cs.au.dkDepartment of Computer Science, Aarhus University
Projects
Adiar
Following up on the work of Lars Arge in 1996, Adiar is a Binary Decision Diagrams library that make use of Time-Forward Processing to achieve I/O-efficient manipulation of BDDs. This allows it to compute on BDDs that far outgrow the memory limit of the given machine.
Wordrow
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
- Core principles of I/O-efficient BDD Manipulation ( conference version )
- Extension to I/O-efficient ZDD Manipulation
- Predicting Memory Demands of BDD Operations using Maximum Graph Cuts
- Using Random Access on Narrow Decision Diagrams
- Using Nested Sweeps for Multi-variable Quantification
- Combining And, Exist, and Substitution operations into the Relational Product
- Proving Correctness of Time-forward Processing Algorithms.
Algorithmic Game Theory
Security
Publications
Conference Proceedings
2026 |
|
2024 |
|
2023 |
|
| |
|
2022 |
|
2020 |
|
Workshow Proceedings
2026 |
|