| Publication | Date of Publication | Type |
|---|
| Hierarchically specified unit disk graphs | 2024-01-05 | Paper |
| On the undecidability and descriptional complexity of synchronized regular expressions | 2023-08-16 | Paper |
| Efficient algorithms for solving systems of linear equations and path problems | 2022-08-18 | Paper |
| The complexity of approximating PSPACE-complete problems for hierarchical specifications | 2019-03-29 | Paper |
| Bicriteria Network Design Problems | 2019-01-10 | Paper |
| A note on detecting sneak paths in transistor networks | 2018-09-14 | Paper |
| Strongly-local reductions and the complexity/efficient approximability of algebra and optimization on abstract algebraic structures | 2017-02-03 | Paper |
| Approximation schemes for PSPACE-complete problems for succinct specifications (preliminary version) | 2016-09-01 | Paper |
| Many birds with one stone | 2015-05-07 | Paper |
| Modeling and analyzing social network dynamics using stochastic discrete graphical dynamical systems | 2011-07-18 | Paper |
| Sums-of-Products and Subproblem Independence | 2009-08-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3597159 | 2009-02-09 | Paper |
| Errata for the paper ``Predecessor existence problems for finite discrete dynamical systems. | 2008-05-19 | Paper |
| Predecessor existence problems for finite discrete dynamical systems | 2007-10-25 | Paper |
| Complexity of reachability problems for finite discrete dynamical systems | 2006-12-07 | Paper |
| Resource bounds and subproblem independence | 2006-01-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4818858 | 2004-09-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4470517 | 2004-07-01 | Paper |
| On some special classes of sequential dynamical systems | 2004-03-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4451017 | 2004-02-22 | Paper |
| Reachability problems for sequential dynamical systems with threshold functions. | 2003-08-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4406683 | 2003-06-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4785459 | 2003-03-10 | Paper |
| Parallel approximation schemes for a class of planar and near planar combinatorial optimization problems. | 2003-01-14 | Paper |
| Exploiting structure in quantified formulas | 2002-09-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4331197 | 2002-06-10 | Paper |
| Complexity and approximability of quantified and stochastic constraint satisfaction problems | 2001-09-24 | Paper |
| Efficient algorithms for \(\delta\)-near-planar graph and algebraic problems | 2001-09-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4527194 | 2001-09-06 | Paper |
| Approximation algorithms for degree-constrained minimum-cost network-design problems | 2001-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4258576 | 1999-09-13 | Paper |
| Bicriteria Network Design Problems | 1998-12-02 | Paper |
| Hierarchically specified unit disk graphs | 1998-10-22 | Paper |
| The Complexity of Planar Counting Problems | 1998-09-20 | Paper |
| Approximation Algorithms for PSPACE-Hard Hierarchically and Periodically Specified Problems | 1998-09-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4375775 | 1998-07-13 | Paper |
| NC-Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs | 1998-04-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4375760 | 1998-03-02 | Paper |
| On the size of binary decision diagrams representing Boolean functions | 1997-02-28 | Paper |
| An Algebraic Model for Combinatorial Problems | 1996-08-18 | Paper |
| Efficient approximation algorithms for domatic partition and on-line coloring of circular arc graphs | 1996-08-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4764625 | 1995-07-16 | Paper |
| Simple heuristics for unit disk graphs | 1995-06-12 | Paper |
| The Complexity of Processing Hierarchical Specifications | 1993-09-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4035344 | 1993-05-18 | Paper |
| Matrix multiplication for finite algebraic systems | 1992-06-25 | Paper |
| Compaction of message patterns into succinct representations for multiprocessor interconnection networks | 1992-06-25 | Paper |
| On computing reliability-measures of Boolean circuits | 1991-01-01 | Paper |
| The complexity of equivalence for commutative rings | 1990-01-01 | Paper |
| Power indices and easier hard problems | 1990-01-01 | Paper |
| The Complexity of Very Simple Boolean Formulas with Applications | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4729350 | 1989-01-01 | Paper |
| On the Computational Complexity of Algebra on Lattices | 1987-01-01 | Paper |
| An application of the planar separator theorem to counting problems | 1987-01-01 | Paper |
| Nonlinear Algebra and Optimization on Rings are “Hard” | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3742714 | 1986-01-01 | Paper |
| Recursion Schemes and Recursive Programs are Exponentially Hard to Analyze | 1986-01-01 | Paper |
| On the Equivalence and Containment Problems for Unambiguous Regular Expressions, Regular Grammars and Finite Automata | 1985-01-01 | Paper |
| Testing for grammatical coverings | 1985-01-01 | Paper |
| Algebraic Structures with Hard Equivalence and Minimization Problems | 1984-01-01 | Paper |
| Terminating Turing Machine Computations and the Complexity and/or decidability of Correspondence Problems, Grammars, and Program Schemes | 1984-01-01 | Paper |
| The complexity of monadic recursion schemes: Exponential time bounds | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3730018 | 1983-01-01 | Paper |
| The complexity of monadic recursion schemes: executability problems, nesting depth, and applications | 1983-01-01 | Paper |
| On the Decidability of Grammar Problems | 1982-01-01 | Paper |
| On the Complexity of Flowchart and Loop Program Schemes and Programming Languages | 1982-01-01 | Paper |
| On the Computational Complexity of Program Scheme Equivalence | 1980-01-01 | Paper |
| Observations on the complexity of regular expression problems | 1979-01-01 | Paper |
| Computational Parallels between the Regular and Context-Free Languages | 1978-01-01 | Paper |
| Lower Bounds and Reductions Between Grammar Problems | 1978-01-01 | Paper |
| Corrigendum: `` Lower Bounds and Reductions Between Grammar Problems | 1978-01-01 | Paper |
| Polynomial Algorithms for Deterministic Pushdown Automata | 1978-01-01 | Paper |
| On Equivalence and Containment Problems for Formal Languages | 1977-01-01 | Paper |
| Economy of description by parsers, DPDA's, and PDA's | 1977-01-01 | Paper |
| Operations on sparse relations | 1977-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3868788 | 1977-01-01 | Paper |
| On the equivalence, containment, and covering problems for the regular and context-free languages | 1976-01-01 | Paper |
| The covering problem for linear context-free grammars | 1976-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4140366 | 1976-01-01 | Paper |
| On the complexity of finite, pushdown, and stack automata | 1976-01-01 | Paper |
| Complexity metatheorems for context-free grammar problems | 1976-01-01 | Paper |
| On the complexity of LR(k) testing | 1975-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4134979 | 1975-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4133129 | 1975-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4055193 | 1974-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4133163 | 1974-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4133162 | 1973-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4122837 | 1973-01-01 | Paper |
