| Publication | Date of Publication | Type |
|---|
| Ordering regular languages and automata: complexity | 2023-02-24 | Paper |
| Solving string problems on graphs using the labeled direct product | 2022-10-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5087788 | 2022-07-01 | Paper |
| Wheeler languages | 2021-11-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5009616 | 2021-08-04 | Paper |
| Regular Languages meet Prefix Sorting | 2021-02-02 | Paper |
| Banishing Ultrafilters from Our Consciousness | 2020-08-06 | Paper |
| From LZ77 to the run-length encoded burrows-wheeler transform, and back | 2020-05-25 | Paper |
| Adding the power-set to description logics | 2020-04-21 | Paper |
| Extending \(\mathcal{ALC}\) with the power-set construct | 2020-02-18 | Paper |
| Logic-Based Multi-objective Design of Chemical Reaction Networks | 2019-12-04 | Paper |
| LZ77 computation based on the run-length encoded BWT | 2018-07-25 | Paper |
| A set-theoretic translation method for (poly)modal logics | 2017-12-04 | Paper |
| On Sets and Graphs | 2017-09-26 | Paper |
| Set-syllogistics meet combinatorics | 2017-04-04 | Paper |
| Mapping Sets and Hypersets into Numbers | 2016-08-15 | Paper |
| Is hyper-extensionality preservable under deletions of graph elements? | 2016-08-05 | Paper |
| Average Linear Time and Compressed Space Construction of the Burrows-Wheeler Transform | 2016-04-08 | Paper |
| Rank and simulation: the well-founded case | 2015-12-28 | Paper |
| Hashing and Indexing: Succinct DataStructures and Smoothed Analysis | 2015-09-11 | Paper |
| Markov chain algorithms for generating sets uniformly at random | 2014-10-22 | Paper |
| The Importance of Being (A Little Bit) Discrete | 2014-03-21 | Paper |
| Stochastic Concurrent Constraint Programming and Differential Equations | 2014-01-17 | Paper |
| Well-quasi-ordering hereditarily finite sets | 2013-10-22 | Paper |
| (Hybrid) automata and (stochastic) programs * The hybrid automata lattice of a stochastic program | 2013-08-27 | Paper |
| Modeling Concurrent systems specified in a Temporal Concurrent Constraint language-I | 2013-05-24 | Paper |
| Rank-Based Symbolic Bisimulation | 2013-04-19 | Paper |
| Counting extensional acyclic digraphs | 2013-04-04 | Paper |
| Infinity, in short | 2013-01-14 | Paper |
| A randomized numerical aligner (rNA) | 2012-11-06 | Paper |
| The Bernays-Schönfinkel-Ramsey class for set theory: decidability | 2012-09-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3172128 | 2011-10-05 | Paper |
| Well-Quasi-Ordering Hereditarily Finite Sets | 2011-06-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3002402 | 2011-05-20 | Paper |
| Hybrid dynamics of stochastic \(\pi \)-calculus | 2011-02-19 | Paper |
| Stochastic Programs and Hybrid Automata for (Biological) Modeling | 2010-07-28 | Paper |
| The Bernays-Schönfinkel-Ramsey class for set theory: semidecidability | 2010-06-24 | Paper |
| A Randomized Numerical Aligner (rNA) | 2010-05-26 | Paper |
| Hybrid dynamics of stochastic programs | 2010-05-11 | Paper |
| Verification: Theory and Practice | 2010-03-23 | Paper |
| Discrete semantics for hybrid automata. Avoiding misleading assumptions in systems biology | 2010-01-18 | Paper |
| Dynamical Systems and Stochastic Programming: To Ordinary Differential Equations and Back | 2009-11-10 | Paper |
| Algorithms and Computation | 2009-08-07 | Paper |
| Inclusion dynamics hybrid automata | 2009-02-03 | Paper |
| A Complete Axiomatic System for a Process-Based Spatial Logic | 2009-02-03 | Paper |
| Hybrid Semantics for Stochastic π-Calculus | 2009-02-03 | Paper |
| Modeling biological systems in stochastic concurrent constraint programming | 2008-09-02 | Paper |
| An Algorithmic Account of Ehrenfeucht Games on Labeled Successor Structures | 2008-05-27 | Paper |
| Symbolic graphs: Linear solutions to connectivity related problems | 2008-02-18 | Paper |
| The axiom of elementary sets on the edge of Peircean expressibility | 2006-01-16 | Paper |
| Relational and Kleene-Algebraic Methods in Computer Science | 2005-12-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4668610 | 2005-04-19 | Paper |
| Ackermann encoding, bisimulations and OBDDs | 2005-04-15 | Paper |
| An efficient algorithm for computing bisimulation equivalence | 2004-10-27 | Paper |
| Three-variable statements of set-pairing | 2004-10-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4472257 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4471346 | 2004-07-28 | Paper |
| From bisimulation to simulation: Coarsest partition problems | 2004-05-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4417490 | 2003-07-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4413206 | 2003-07-17 | Paper |
| Extending Kamp's Theorem to Model Time Granularity | 2003-03-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4783459 | 2002-12-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4536392 | 2002-11-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4551136 | 2002-09-04 | Paper |
| Alternative translation techniques for propositional and first-order modal logics | 2002-08-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2740887 | 2001-09-05 | Paper |
| The taming (timing) of the states | 2001-07-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2721208 | 2001-07-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4518875 | 2000-12-03 | Paper |
| Modal deduction in second-order logic and set theory. II | 2000-11-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4952306 | 2000-05-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4940937 | 2000-02-28 | Paper |
| \(T\)-resolution: Refinements and model elimination | 2000-01-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4268492 | 1999-10-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4264105 | 1999-09-16 | Paper |
| Solvable set/hyperset contexts. II: A goal-driven unification algorithm for the blended case | 1999-06-02 | Paper |
| Theories of -layered metric temporal structures: expressiveness and decidability | 1999-03-30 | Paper |
| Finite families with few symmetric differences | 1999-01-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4385450 | 1998-04-13 | Paper |
| Modal deduction in second-order logic and set theory - I | 1997-06-10 | Paper |
| Decidability results for metric and layered temporal logics | 1997-03-19 | Paper |
| Witnessing differences without redundancies | 1997-02-19 | Paper |
| Complementation in the lattice of equivalence relations | 1996-12-08 | Paper |
| Solvable set/hyperset contexts: I. Some decision procedures for the pure, finite case | 1996-11-04 | Paper |
| \(T\)-theorem proving. I | 1996-06-04 | Paper |
| Decidability of ∀*∀‐Sentences in Membership Theories | 1996-05-02 | Paper |
| A set-theoretic translation method for polymodal logics | 1995-12-20 | Paper |
| Undecidability results for restricted universally quantified formulae of set theory | 1994-10-17 | Paper |
| A derived algorithm for evaluating \(\varepsilon\)-expressions over abstract sets | 1994-09-26 | Paper |
| THE DECISION PROBLEM FOR RESTRICTED UNIVERSAL QUANTIFICATION IN SET THEORY AND THE AXIOM OF FOUNDATION | 1994-07-11 | Paper |
| Expressing infinity without foundation | 1992-06-27 | Paper |
| The automation of syllogistic. II: Optimization and complexity issues | 1992-06-25 | Paper |
| Decision procedures for elementary sublanguages of set theory: XIII. Model graphs, reflection and decidability | 1991-01-01 | Paper |
| Note on "The Logically Simplest Form of the Infinity Axiom" | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3489978 | 1988-01-01 | Paper |
| Decision procedures for elementary sublanguages of set theory IX. Unsolvability of the decision problem for a restricted subclass of the Δ0-formulas in set theory | 1988-01-01 | Paper |
| The Logically Simplest Form of the Infinity Axiom | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4731166 | 1987-01-01 | Paper |
