| Publication | Date of Publication | Type |
|---|
| The hexatope and octatope abstract domains for neural network verification | 2025-01-13 | Paper |
| Constrained read-once refutations in UTVPI constraint systems: a parallel perspective | 2024-10-16 | Paper |
| Parameterized and exact-exponential algorithms for the read-once integer refutation problem in UTVPI constraints | 2024-09-16 | Paper |
| Arc-dependent networks: theoretical insights and a computational study | 2024-08-15 | Paper |
| Proving the infeasibility of Horn formulas through read-once resolution | 2024-06-20 | Paper |
| Algebraic properties of soluble posets | 2024-03-27 | Paper |
| Priority-based bin packing with subset constraints | 2024-01-24 | Paper |
| The octatope abstract domain for verification of neural networks | 2023-08-17 | Paper |
| A faster algorithm for determining the linear feasibility of systems of BTVPI constraints | 2023-08-14 | Paper |
| On the parallel complexity of constrained read-once refutations in UTVPI constraint systems | 2023-08-04 | Paper |
| Reachability problems in interval-constrained and cardinality-constrained graphs | 2023-07-15 | Paper |
| Reachability in choice networks | 2023-06-30 | Paper |
| Optimal deterministic controller synthesis from steady-state distributions | 2023-06-14 | Paper |
| On the approximability of path and cycle problems in arc-dependent networks | 2023-05-08 | Paper |
| Integer feasibility and refutations in UTVPI constraints using bit-scaling | 2023-02-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5875680 | 2023-02-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5052996 | 2022-11-25 | Paper |
| Read-once refutations in Horn constraint systems: an algorithmic approach | 2022-09-22 | Paper |
| Analyzing the reachability problem in choice networks | 2022-08-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5091535 | 2022-07-26 | Paper |
| Exact and parameterized algorithms for read-once refutations in Horn constraint systems | 2022-07-01 | Paper |
| Analyzing read-once cutting plane proofs in Horn systems | 2022-06-09 | Paper |
| On the complexity of and solutions to the minimum stopping and trapping set problems | 2022-05-31 | Paper |
| Transitive systems and conclusive partial orders | 2022-04-20 | Paper |
| Algorithmic analysis of priority-based bin packing | 2022-03-24 | Paper |
| On the copy complexity of width 3 Horn constraint systems | 2022-03-24 | Paper |
| Parameterized and exact algorithms for finding a read-once resolution refutation in 2CNF formulas | 2022-02-14 | Paper |
| Analyzing unit read-once refutations in difference constraint systems | 2021-12-01 | Paper |
| Polynomial time algorithms for optimal length tree-like refutations of linear infeasibility in UTVPI constraints | 2021-10-21 | Paper |
| Copy complexity of Horn formulas with respect to unit read-once resolution | 2021-10-21 | Paper |
| Tree-like unit refutations in Horn constraint systems | 2021-10-04 | Paper |
| On finding shortest paths in arc-dependent networks | 2021-02-04 | Paper |
| NAE-resolution: A new resolution refutation technique to prove not-all-equal unsatisfiability | 2021-01-07 | Paper |
| Analyzing fractional Horn constraint systems | 2020-10-21 | Paper |
| Optimal length tree-like refutations of linear feasibility in UTVPI constraints | 2020-07-07 | Paper |
| Restricted cutting plane proofs in Horn constraint systems | 2020-05-13 | Paper |
| Read-once certification of linear infeasibility in UTVPI constraints | 2019-10-15 | Paper |
| Read-once resolutions in Horn formulas | 2019-10-11 | Paper |
| The Complexity of Finding Read-Once NAE-Resolution Refutations | 2019-07-24 | Paper |
| Full algebras of matrices | 2019-07-03 | Paper |
| A fully polynomial time approximation scheme for refutations in weighted difference constraint systems | 2018-06-05 | Paper |
| Finding read-once resolution refutations in systems of 2CNF clauses | 2018-05-17 | Paper |
| A certifying algorithm for lattice point feasibility in a system of UTVPI constraints | 2018-03-01 | Paper |
| On a generalization of Horn constraint systems | 2017-08-22 | Paper |
| Erratum to: ``Analyzing restricted fragments of the theory of linear arithmetic | 2017-07-19 | Paper |
| On the Computational Complexity of Read once Resolution Decidability in 2CNF Formulas | 2017-05-19 | Paper |
| A combinatorial certifying algorithm for linear feasibility in UTVPI constraints | 2017-05-11 | Paper |
| Analyzing restricted fragments of the theory of linear arithmetic | 2017-03-06 | Paper |
| A Bit-Scaling Algorithm for Integer Feasibility in UTVPI Constraints | 2016-09-29 | Paper |
| An Optimal Algorithm for Computing the Integer Closure of UTVPI Constraints | 2016-05-03 | Paper |
| Compositional Bisimulation Minimization for Interval Markov Decision Processes | 2016-04-13 | Paper |
| A Graphical Theorem of the Alternative for UTVPI Constraints | 2016-02-25 | Paper |
| On quantified linear implications | 2015-02-05 | Paper |
| A complexity perspective on entailment of parameterized linear constraints | 2015-01-22 | Paper |
| Feasible algorithms for lattice and directed subspaces | 2015-01-16 | Paper |
| Signature matrix algebras and bipartite graphs | 2014-06-03 | Paper |
| On the complexity of quantified linear systems | 2014-01-13 | Paper |
| On the Additivity of the Minkowski Functionals | 2013-07-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4899770 | 2013-01-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5389277 | 2012-04-26 | Paper |
| Matrix algebras with multiplicative decomposition property | 2011-02-09 | Paper |
| Equivalents for a quasivariety to be generated by a single structure | 2009-03-17 | Paper |
| Embeddings of totally ordered MV-algebras of bounded cardinality | 2009-03-16 | Paper |
| Large-Scale Scientific Computing | 2007-11-15 | Paper |
| Multiplicative bases in matrix algebras | 2007-02-14 | Paper |
| Ordinal Explanation of the Periodic System of Chemical Elements | 2006-05-19 | Paper |
| Lattice orders on matrix algebras. | 2005-04-19 | Paper |
| Directed maximal partial orders of matrices. | 2003-12-04 | Paper |
| A proof of Weinbergâs conjecture on lattice-ordered matrix algebras | 2002-06-17 | Paper |
| \(F^*\)-rings are \(O^*\) | 2000-12-19 | Paper |
| Strict Archimedean \(t\)-norms and \(t\)-conorms as universal approximators | 2000-01-04 | Paper |
| On lattice extensions of partial orders of rings | 1998-04-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4358826 | 1997-10-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4886960 | 1997-02-24 | Paper |
| Images of bilinear mappings into đÂł | 1996-12-10 | Paper |
| Orderpotent \(f\)-rings | 1996-02-08 | Paper |
| Lattice-ordered algebras with polynomial inequalities | 1995-06-11 | Paper |
| Archimedean orderpotent rings | 1994-08-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3142385 | 1993-12-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3490054 | 1989-01-01 | Paper |
