| Publication | Date of Publication | Type |
|---|
| Computational complexity of two pencil puzzles: Kurotto and Juosan | 2023-03-31 | Paper |
| Vertex-to-point conflict-free chromatic guarding is NP-hard | 2022-07-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3301014 | 2020-08-11 | Paper |
| Computational complexity of the chromatic art gallery problem for orthogonal polygons | 2020-07-22 | Paper |
| A polynomial-time reduction from the 3SAT problem to the generalized string puzzle problem | 2019-03-26 | Paper |
| A faster parallel algorithm for \(k\)-connectivity | 2016-05-26 | Paper |
| Computational Complexity of the $$r$$-visibility Guard Set Problem for Polyominoes | 2015-09-14 | Paper |
| A Three-Dimensional Uniquely Parsable Array Grammar that Generates and Parses Cubes | 2013-04-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3011193 | 2011-06-28 | Paper |
| Computational Complexity of Cast Puzzles | 2009-12-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5446715 | 2008-03-06 | Paper |
| A Time Hierarchy Theorem for Nondeterministic Cellular Automata | 2007-11-13 | Paper |
| Translational lemmas for DLOGTIME-uniform circuits, alternating TMs, and PRAMs | 2007-09-10 | Paper |
| Fundamentals of Computation Theory | 2006-10-20 | Paper |
| Machines, Computations, and Universality | 2005-12-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4825677 | 2004-11-05 | Paper |
| Partially effective randomization in simulations between ARBITRARY and COMMON PRAMs | 2004-10-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4437094 | 2003-12-07 | Paper |
| A quadratic speedup theorem for iterative arrays | 2003-09-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4708585 | 2003-06-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4548320 | 2002-08-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4530003 | 2002-05-07 | Paper |
| Constructible functions in cellular automata and their applications to hierarchy results | 2002-03-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2743826 | 2001-09-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4525738 | 2001-01-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4505365 | 2000-09-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4505366 | 2000-09-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4937224 | 2000-02-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4934340 | 2000-01-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4703864 | 1999-12-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4253321 | 1999-11-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4218132 | 1999-08-31 | Paper |
| A canonical form of vector machines | 1998-09-01 | Paper |
| Time lower bounds do not exist for CRCW PRAMs | 1997-02-27 | Paper |
| Routing Problems on the Mesh of Buses | 1996-09-16 | Paper |
| Finding Hamiltonian circuits in arrangements of Jordan curves is NP- complete | 1995-01-09 | Paper |
