| 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 |
| Herugolf and Makaro are NP-complete | 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
Algorithms | 2019-03-26 | Paper |
A faster parallel algorithm for \(k\)-connectivity
Information Processing Letters | 2016-05-26 | Paper |
Computational complexity of the \(r\)-visibility guard set problem for polyominoes
Lecture Notes in Computer Science | 2015-09-14 | Paper |
A three-dimensional uniquely parsable array grammar that generates and parses cubes
Electronic Notes in Theoretical Computer Science | 2013-04-26 | Paper |
| scientific article; zbMATH DE number 5914170 (Why is no real title available?) | 2011-06-28 | Paper |
Computational complexity of cast puzzles
Algorithms and Computation | 2009-12-17 | Paper |
| A five-state von Neumann neighbor universal hyperbolic cellular automaton | 2008-03-06 | Paper |
A Time Hierarchy Theorem for Nondeterministic Cellular Automata
Lecture Notes in Computer Science | 2007-11-13 | Paper |
Translational lemmas for DLOGTIME-uniform circuits, alternating TMs, and PRAMs
Acta Informatica | 2007-09-10 | Paper |
Fundamentals of Computation Theory
Lecture Notes in Computer Science | 2006-10-20 | Paper |
Machines, Computations, and Universality
Lecture Notes in Computer Science | 2005-12-08 | Paper |
| scientific article; zbMATH DE number 2113943 (Why is no real title available?) | 2004-11-05 | Paper |
Partially effective randomization in simulations between ARBITRARY and COMMON PRAMs
Journal of Parallel and Distributed Computing | 2004-10-04 | Paper |
| scientific article; zbMATH DE number 2013806 (Why is no real title available?) | 2003-12-07 | Paper |
A quadratic speedup theorem for iterative arrays
Acta Informatica | 2003-09-01 | Paper |
| scientific article; zbMATH DE number 1929952 (Why is no real title available?) | 2003-06-18 | Paper |
| scientific article; zbMATH DE number 1788724 (Why is no real title available?) | 2002-08-26 | Paper |
| scientific article; zbMATH DE number 1738666 (Why is no real title available?) | 2002-05-07 | Paper |
Constructible functions in cellular automata and their applications to hierarchy results
Theoretical Computer Science | 2002-03-03 | Paper |
Generation and recognition of graphs by 3-dimensional uniform analyzable array grammars
RIMS Kokyuroku | 2001-09-17 | Paper |
| scientific article; zbMATH DE number 1555967 (Why is no real title available?) | 2001-01-24 | Paper |
| scientific article; zbMATH DE number 1511682 (Why is no real title available?) | 2000-09-27 | Paper |
| scientific article; zbMATH DE number 1511683 (Why is no real title available?) | 2000-09-27 | Paper |
| scientific article; zbMATH DE number 1398100 (Why is no real title available?) | 2000-02-03 | Paper |
| scientific article; zbMATH DE number 1390074 (Why is no real title available?) | 2000-01-17 | Paper |
| scientific article; zbMATH DE number 1372662 (Why is no real title available?) | 1999-12-01 | Paper |
| scientific article; zbMATH DE number 1322310 (Why is no real title available?) | 1999-11-08 | Paper |
| scientific article; zbMATH DE number 1222593 (Why is no real title available?) | 1999-08-31 | Paper |
A canonical form of vector machines
Information and Computation | 1998-09-01 | Paper |
Time lower bounds do not exist for CRCW PRAMs
Theoretical Computer Science | 1997-02-27 | Paper |
Routing Problems on the Mesh of Buses
Journal of Algorithms | 1996-09-16 | Paper |
Finding Hamiltonian circuits in arrangements of Jordan curves is NP- complete
Information Processing Letters | 1995-01-09 | Paper |
