| Publication | Date of Publication | Type |
|---|
Transformations that preserve malignness of universal distributions
Lecture Notes in Computer Science | 2023-12-12 | Paper |
Nonexistence of minimal-time solutions for some variations of the firing squad synchronization problem having simple geometric configurations
(available as arXiv preprint) | 2021-08-25 | Paper |
| Nonexistence of minimal-time solutions for some variations of the firing squad synchronization problem having simple geometric configurations | 2021-08-25 | Paper |
| Minimum firing times of firing squad synchronization problems for paths in grid spaces | 2019-09-05 | Paper |
| The firing squad synchronization problem for squares with holes | 2019-09-05 | Paper |
The minimum firing time of the generalized firing squad synchronization problem for squares
Theoretical Computer Science | 2014-07-25 | Paper |
On the possible patterns of inputs for block sorting in the Burrows-Wheeler transformation
Information Processing Letters | 2013-03-28 | Paper |
On minimal-time solutions of firing squad synchronization problems for networks
SIAM Journal on Computing | 2012-09-12 | Paper |
On the Complexity of the “Most General” Undirected Firing Squad Synchronization Problem
Algorithms and Computation | 2008-05-27 | Paper |
On the Complexity of the “Most General” Firing Squad Synchronization Problem
STACS 2006 | 2008-03-19 | Paper |
Unconventional Computation
Lecture Notes in Computer Science | 2006-07-07 | Paper |
On the Complexity of Network Synchronization
SIAM Journal on Computing | 2006-06-01 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2005-12-22 | Paper |
On time optimal solutions of the firing squad synchronization problem for two-dimensional paths
Theoretical Computer Science | 2001-08-20 | Paper |
| scientific article; zbMATH DE number 1301096 (Why is no real title available?) | 1999-06-15 | Paper |
Transformations that preserve malignness of universal distributions
Theoretical Computer Science | 1998-07-22 | Paper |
The Kolmogorov complexity, universal distribution, and coding theorem for generalized length functions
IEEE Transactions on Information Theory | 1997-10-28 | Paper |
\(\Sigma^ 0_ n\)-complete properties of programs and Martin-Löf randomness
Information Processing Letters | 1993-05-23 | Paper |
| scientific article; zbMATH DE number 4049050 (Why is no real title available?) | 1987-01-01 | Paper |
Characterization of \(\omega\)-regular languages by monadic second-order formulas
Theoretical Computer Science | 1986-01-01 | Paper |
On the structure of one-tape nondeterministic Turing machine time hierarchy
Theoretical Computer Science | 1985-01-01 | Paper |
On proving time constructibility of functions
Theoretical Computer Science | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3918353 (Why is no real title available?) | 1985-01-01 | Paper |
Characterization of \(\omega\)-regular languages by first-order formulas
Theoretical Computer Science | 1984-01-01 | Paper |
The firing squad synchronization problem for a class of polyautomata networks
Journal of Computer and System Sciences | 1978-01-01 | Paper |
On the minimal firing time of the firing squad synchronization problem for polyautomata networks
Theoretical Computer Science | 1978-01-01 | Paper |
The firing squad synchronization problem for two-dimensional arrays
Information and Control | 1977-01-01 | Paper |
A note on extending equivalence theories of algorithms
Information Processing Letters | 1974-01-01 | Paper |
Some unsolvable problems on context-free languages and their application to on-line language recognizers
Information and Control | 1968-01-01 | Paper |
On the Class of Predicates Decidable by Two-Way Multitape Finite Automata
Journal of the ACM | 1966-01-01 | Paper |
