| Publication | Date of Publication | Type |
|---|
| On sparse parity check matrices (extended abstract) | 2024-01-29 | Paper |
| Propagation complete encodings of smooth DNNF theories | 2022-09-29 | Paper |
| Bounds on the size of PC and URC formulas | 2021-01-22 | Paper |
| Optimal classification trees | 2020-07-21 | Paper |
| Optimally trained regression trees and Occam's razor | 2020-07-15 | Paper |
| A lower bound on CNF encodings of the at-most-one constraint | 2019-02-28 | Paper |
| Quasi-periodic \(\beta\)-expansions and cut languages | 2018-03-12 | Paper |
| A lower bound on CNF encodings of the at-most-one constraint | 2017-11-15 | Paper |
| Cut languages in rational bases | 2017-06-01 | Paper |
| Generating models of a matched formula with a polynomial delay | 2016-07-05 | Paper |
| Term satisfiability in \(\mathrm{FL}_{\mathrm{ew}}\)-algebras | 2016-05-02 | Paper |
| Boolean functions with a simple certificate for CNF complexity | 2012-05-04 | Paper |
| Remarks on Gödel's code as a hash function | 2011-02-17 | Paper |
| Some typical properties of large AND/OR Boolean formulas | 2010-06-17 | Paper |
| Triangulation Heuristics for BN2O Networks | 2009-07-02 | Paper |
| Distinguishing standard SBL-algebras with involutive negations by propositional formulas | 2008-12-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5384959 | 2008-04-29 | Paper |
| On Product Logic with Truth-constants | 2006-07-03 | Paper |
| On the influence of the variable ordering for algorithmic learning using OBDDs | 2005-10-10 | Paper |
| A hierarchy result for read-once branching programs with restricted parity nondeterminism | 2005-09-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4470521 | 2004-07-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4536401 | 2002-11-04 | Paper |
| On random orderings of variables for parity ordered binary decision diagrams | 2001-01-14 | Paper |
| On P versus NP\(\cap\)co-NP for decision trees and read-once branching programs | 2000-11-20 | Paper |
| DNF tautologies with a limited number of occurrences of every variable | 2000-08-21 | Paper |
| A read-once lower bound and a \((1,+k)\)-hierarchy for branching programs | 2000-08-21 | Paper |
| The number of Boolean functions computed by formulas of a given size | 1999-12-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4699308 | 1999-11-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4699324 | 1999-11-10 | Paper |
| Complexity and Probability of Some Boolean Formulas | 1999-04-13 | Paper |
| On sparse parity check matrices | 1998-12-13 | Paper |
| A lower bound on branching programs reading some bits twice | 1998-07-23 | Paper |
| Efficient algorithms for the transformation between different types of binary decision diagrams | 1997-12-08 | Paper |
| Some typical properties of large AND/OR Boolean formulas | 1997-11-02 | Paper |
| Bent functions and random Boolean formulas | 1996-03-24 | Paper |
| Improved boolean formulas for the Ramsey graphs | 1995-10-31 | Paper |
| On the bent Boolean functions that are symmetric | 1994-10-09 | Paper |
| On shifting networks | 1993-10-17 | Paper |
| One More Occurrence of Variables Makes Satisfiability Jump from Trivial to NP-Complete | 1993-05-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3357196 | 1991-01-01 | Paper |
| Random Boolean formulas representing any Boolean function with asymptotically equal probability | 1990-01-01 | Paper |
| Graph complexity | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3795616 | 1988-01-01 | Paper |
| On CNF formulas irredundant with respect to unit clause propagation | N/A | Paper |
