| Publication | Date of Publication | Type |
|---|
| A linear time algorithm for the feasibility of pebble motion on trees | 2022-12-09 | Paper |
| Synchronization of 1-way connected processors | 2022-12-09 | Paper |
| Better algorithms for minimum weight vertex-connectivity problems | 2022-11-09 | Paper |
| State complexity of SBTA languages | 2022-08-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4992519 | 2021-06-09 | Paper |
| Model-checking graded computation-tree logic with finite path semantics | 2020-01-16 | Paper |
| Placing resources in a tree: Dynamic and static algorithms | 2019-01-10 | Paper |
| A new approach to optimal planning of robot motion on a tree with obstacles | 2017-12-05 | Paper |
| On a logic for coalitional games with priced-resource agents | 2016-10-07 | Paper |
| Minimum and non-Minimum Time Solutions to the Firing Squad Synchronization Problem | 2015-09-08 | Paper |
| Graded Alternating-Time Temporal Logic | 2011-03-28 | Paper |
| Graded Alternating-Time Temporal Logic | 2011-01-07 | Paper |
| Theoretical Computer Science | 2010-02-23 | Paper |
| Model Checking for Graded CTL | 2010-02-05 | Paper |
| Program Complexity in Hierarchical Module Checking | 2009-01-27 | Paper |
| CTL Model-Checking with Graded Quantifiers | 2008-11-20 | Paper |
| Enriched MU-Calculi Module Checking | 2008-11-13 | Paper |
| Verification of scope-dependent hierarchical state machines | 2008-10-08 | Paper |
| On the Membership Problem for Visibly Pushdown Languages | 2008-09-04 | Paper |
| Enriched μ–Calculus Pushdown Module Checking | 2008-05-15 | Paper |
| Mixed Nash equilibria in selfish routing problems with dynamic constraints | 2008-04-15 | Paper |
| The word problem for visibly pushdown languages described by grammars | 2007-11-28 | Paper |
| THE FIRING SQUAD SYNCHRONIZATION PROBLEM ON SQUARES, TORUSES AND RINGS | 2007-06-05 | Paper |
| Different time solutions for the firing squad synchronization problem on basic grid networks | 2007-04-10 | Paper |
| Developments in Language Theory | 2005-12-22 | Paper |
| Structural Information and Communication Complexity | 2005-09-07 | Paper |
| ON THE VERTEX-CONNECTIVITY PROBLEM FOR GRAPHS WITH SHARPENED TRIANGLE INEQUALITY | 2005-04-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4449219 | 2004-02-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4794305 | 2003-03-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4530005 | 2002-05-07 | Paper |
| A compositional approach to synchronize two-dimensional networks of processors | 2002-01-21 | Paper |
| A 2-Approximation Algorithm for Finding an Optimum 3-Vertex-Connected Spanning Subgraph | 2000-12-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4266540 | 1999-10-03 | Paper |
| A linear-time algorithm for the feasibility of pebble motion on trees | 1999-03-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3842794 | 1998-11-09 | Paper |
| Succinctness of descriptions of SBTA-languages | 1998-07-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4377122 | 1998-07-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4348010 | 1997-11-09 | Paper |
| Dynamic and static algorithms for optimal placement of resources in a tree | 1997-02-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4890704 | 1997-01-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4864792 | 1996-06-27 | Paper |
| Power of interconnections and of nondeterminism in regularY-tree systolic automata | 1995-12-13 | Paper |
| Languages accepted by systolic \(Y\)-tree automata: Structural characterizations | 1994-07-04 | Paper |
| A new model for large memories | 1993-05-24 | Paper |
| SYSTOLIC TREE WITH BASE AUTOMATA | 1992-09-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3832052 | 1989-01-01 | Paper |
