| Publication | Date of Publication | Type |
|---|
| https://portal.mardi4nfdi.de/entity/Q5079753 | 2022-05-28 | Paper |
| Experiments and long-term high-performance computations on amplitude modulations of strato-rotational flows | 2022-03-22 | Paper |
| Non-normality increases variance of gravity waves trapped in a tilted box | 2022-03-22 | Paper |
| Team semantics for the specification and verification of hyperproperties | 2021-08-04 | Paper |
| Wreath products of distributive forest algebras | 2021-01-20 | Paper |
| A unified method for placing problems in polylogarithmic depth | 2020-11-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5129940 | 2020-11-03 | Paper |
| Diminishable parameterized problems and strict polynomial kernelization | 2020-09-08 | Paper |
| On the Complexity of Bounded Context Switching. | 2020-05-27 | Paper |
| Better complexity bounds for cost register automata | 2020-05-26 | Paper |
| Stone duality and the substitution principle | 2020-05-26 | Paper |
| Skew circuits of small width | 2020-04-22 | Paper |
| Difference hierarchies and duality with an application to formal languages | 2020-04-06 | Paper |
| A topological approach to non-uniform complexity | 2019-12-18 | Paper |
| Small depth proof systems | 2019-12-06 | Paper |
| The model checking fingerprints of CTL operators | 2019-08-13 | Paper |
| Better complexity bounds for cost register automata | 2019-06-27 | Paper |
| Diminishable parameterized problems and strict polynomial kernelization | 2018-09-06 | Paper |
| Problems on finite automata and the exponential time hypothesis | 2018-08-20 | Paper |
| The algebraic theory of Parikh automata | 2018-07-23 | Paper |
| Deciding regular intersection emptiness of complete problems for PSPACE and the polynomial hierarchy | 2018-06-26 | Paper |
| Universal covers, color refinement, and two-variable counting logic: lower bounds for the depth | 2018-04-23 | Paper |
| Two-variable logic with a between relation | 2018-04-23 | Paper |
| An Effective Characterization of the Alternation Hierarchy in Two-Variable Logic | 2018-03-22 | Paper |
| Non-definability of Languages by Generalized First-order Formulas over (N,+) | 2017-05-16 | Paper |
| Computing best discrete least-squares approximations by first-degree splines with free knots | 2017-04-19 | Paper |
| DLOGTIME proof systems | 2017-02-21 | Paper |
| Bounds for the quantifier depth in finite-variable logics: alternation hierarchy | 2017-02-02 | Paper |
| An effective characterization of the alternation hierarchy in two-variable logic | 2017-01-26 | Paper |
| Visibly counter languages and constant depth circuits | 2017-01-24 | Paper |
| The complexity of intersecting finite automata having few final states | 2016-11-30 | Paper |
| Problems on finite automata and the exponential time hypothesis | 2016-11-09 | Paper |
| Cost register automata for nested words | 2016-09-02 | Paper |
| A language-theoretical approach to descriptive complexity | 2016-08-30 | Paper |
| Using duality in circuit complexity | 2016-04-13 | Paper |
| Positive and negative proofs for circuits and branching programs | 2015-12-10 | Paper |
| Ultrafilters on words for a fragment of logic | 2015-12-10 | Paper |
| On distinguishing \(\mathbf {NC^1}\) and \(\mathbf {NL}\) | 2015-11-10 | Paper |
| Skew circuits of small width | 2015-10-29 | Paper |
| Quasi-optimal degree distribution for a quadratic programming problem arising from the \(p\)-version finite element method for a one-dimensional obstacle problem | 2015-09-22 | Paper |
| EF+EX forest algebras | 2015-09-22 | Paper |
| Bounds for the quantifier depth in finite-variable logics: alternation hierarchy | 2015-09-17 | Paper |
| A circuit complexity approach to transductions | 2015-09-16 | Paper |
| Visibly counter languages and the structure of \(\mathrm {NC}^{1}\) | 2015-09-16 | Paper |
| Sheet-like and plume-like thermal flow in a spherical convection experiment performed under microgravity | 2014-08-29 | Paper |
| From ultrafilters on words to the expressive power of a fragment of logic | 2014-08-07 | Paper |
| Positive and negative proofs for circuits and branching programs | 2014-08-07 | Paper |
| Naive configurations | 2014-07-03 | Paper |
| Non-symmetric lexicographic configurations | 2014-06-24 | Paper |
| Linear circuits, two-variable logic and weakly blocked monoids | 2014-01-10 | Paper |
| A quadratic programming problem arising from the \(p\)-version for obstacle problems | 2013-11-08 | Paper |
| The algebraic theory of Parikh automata | 2013-09-20 | Paper |
| Small depth proof systems | 2013-09-20 | Paper |
| Counting paths in VPA is complete for \(\#\mathrm{NC}^1\) | 2012-11-21 | Paper |
| Dense completeness | 2012-11-02 | Paper |
| The lower reaches of circuit uniformity | 2012-09-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3108038 | 2011-12-28 | Paper |
| Streaming algorithms for recognizing nearly well-parenthesized expressions | 2011-08-17 | Paper |
| Typed monoids -- an Eilenberg-like theorem for non regular languages | 2011-07-08 | Paper |
| On solving nonlinear variational inequalities by \(p\)-version finite elements. | 2011-03-29 | Paper |
| Counting paths in VPA is complete for \#NC\(^{1}\) | 2010-07-20 | Paper |
| Adaptive FEM-BEM coupling with a Schur complement error indicator | 2010-06-25 | Paper |
| Regular Languages Definable by Majority Quantifiers with Two Variables | 2009-07-07 | Paper |
| Non-solvable Groups Are Not in FO+MOD+MÂJ2[REG] | 2009-04-02 | Paper |
| Linear Circuits, Two-Variable Logic and Weakly Blocked Monoids | 2008-09-17 | Paper |
| A partial plane of order 6 constructed from the icosahedron | 2007-09-13 | Paper |
| Languages with Bounded Multiparty Communication Complexity | 2007-09-03 | Paper |
| Characterizing \(\text{TC}^{0}\) in terms of infinite groups | 2007-08-23 | Paper |
| A \(p\)-version finite element method for nonlinear elliptic variational inequalities in 2D | 2007-01-30 | Paper |
| STACS 2005 | 2005-12-02 | Paper |
