- Compiling SL representations of Boolean functions into OBDDs2020 | Faculty of Mathematics and Physics
- An exponential lower bound for a constraint propagation proof system based on ordered binary diagrams2008 | Faculty of Mathematics and Physics
- Algebraic and Uniqueness Properties of Parity Ordered Binary Decesion Diagrams and Their Generalization2000 | Faculty of Mathematics and Physics
- A Direct Equivalence-Testing Algorithm for SLRs2022 | Faculty of Mathematics and Physics
- Properties of Switch-List Representations of Boolean Functions2020 | Faculty of Mathematics and Physics
- Succinctness of Switch-List Representations of Boolean Functions2018 | Faculty of Mathematics and Physics
- Switch lists in the landscape of knowledge representations languages2022 | Faculty of Mathematics and Physics
- Switch-List Representations in a Knowledge Compilation Map2020 | Faculty of Mathematics and Physics