- k-DNF and Acyclic Extensions of pdBfs +12005 | Faculty of Mathematics and Physics
- Knowledge compilation from DNF to switch-list representations2016 | Faculty of Mathematics and Physics
- Recognition of tractable DNFs representable by a constant number of intervals2017 | Faculty of Mathematics and Physics
- Boolean functions with long prime implicants +12012 | Faculty of Mathematics and Physics
- Knowledge compilation and compression using interval representations2015 | Faculty of Mathematics and Physics
- Renamable interval Boolean functions2008 | Faculty of Mathematics and Physics
- Renamable Interval Boolean Functions2006 | Faculty of Mathematics and Physics
- Recognition of interval Boolean functions2008 | Faculty of Mathematics and Physics
- Recognition of Interval Boolean Functions2006 | Faculty of Mathematics and Physics
- Recognition of Positive 2-Interval Boolean Functions +12007 | Faculty of Mathematics and Physics
- Improved Bounds on Fourier Entropy and Min-entropy2021 | Faculty of Mathematics and Physics
- Succinctness of Switch-List Representations of Boolean Functions2018 | Faculty of Mathematics and Physics
- Improved Bounds on Fourier Entropy and Min-Entropy2020 | Faculty of Mathematics and Physics
- Switch-List Representations in a Knowledge Compilation Map2020 | Faculty of Mathematics and Physics
- Properties of Switch-List Representations of Boolean Functions2020 | Faculty of Mathematics and Physics