| Publication | Date of Publication | Type |
|---|
Hardness of monadic second-order formulae over succinct graphs
Logical Methods in Computer Science | 2026-02-13 | Paper |
| Timed prediction problem for sandpile models | 2026-02-10 | Paper |
Foundations of block-parallel automata networks
Theoretical Computer Science | 2025-12-02 | Paper |
| Circuit metaconstruction in logspace for Rice-like complexity lower bounds in ANs and SGRs | 2025-11-19 | Paper |
| Roots in the semiring of finite deterministic dynamical systems | 2024-11-13 | Paper |
Maximum sensitivity to update schedules of elementary cellular automata over periodic configurations
Natural Computing | 2024-02-09 | Paper |
Interaction graphs of isomorphic automata networks. I: Complete digraph and minimum in-degree
Journal of Computer and System Sciences | 2023-08-21 | Paper |
Any Shape Can Ultimately Cross Information on Two-Dimensional Abelian Sandpile Models
Cellular Automata and Discrete Complex Systems | 2023-04-10 | Paper |
On the complexity of acyclic modules in automata networks
(available as arXiv preprint) | 2022-12-22 | Paper |
\#P-completeness of counting update digraphs, cacti, and series-parallel decomposition method
(available as arXiv preprint) | 2022-12-16 | Paper |
Sandpile toppling on Penrose tilings: identity and isotropic dynamics
(available as arXiv preprint) | 2022-10-25 | Paper |
Complexity of counting feedback vertex sets
Chicago Journal of Theoretical Computer Science | 2022-08-10 | Paper |
Non-maximal sensitivity to synchronism in elementary cellular automata: exact asymptotic measures
Theoretical Computer Science | 2022-07-08 | Paper |
Complexity of fixed point counting problems in Boolean networks
Journal of Computer and System Sciences | 2022-03-29 | Paper |
Complexity of limit-cycle problems in Boolean networks
(available as arXiv preprint) | 2022-03-24 | Paper |
Rikudo is NP-complete
Theoretical Computer Science | 2022-03-23 | Paper |
An asynchronous solution to the synchronisation problem for binary one-dimensional cellular automata
Physica D | 2022-02-21 | Paper |
On Boolean automata networks (de)composition
Fundamenta Informaticae | 2021-10-25 | Paper |
Optimising attractor computation in Boolean automata networks
(available as arXiv preprint) | 2021-10-04 | Paper |
| Computational complexity of the avalanche problem for one dimensional decreasing sandpiles | 2021-08-25 | Paper |
| Balanced connected partitioning of unweighted grid graphs | 2021-08-04 | Paper |
Non-maximal sensitivity to synchronism in periodic elementary cellular automata: exact asymptotic measures
(available as arXiv preprint) | 2021-07-08 | Paper |
Freezing sandpiles and Boolean threshold networks: equivalence and complexity
Advances in Applied Mathematics | 2021-04-23 | Paper |
On the emergence of regularities on one-dimensional decreasing sandpiles
Theoretical Computer Science | 2020-10-13 | Paper |
Maximum sensitivity to update schedules of elementary cellular automata over infinite configurations
Information and Computation | 2020-09-17 | Paper |
How hard is it to predict sandpiles on lattices? A survey
Fundamenta Informaticae | 2020-06-21 | Paper |
\(\mathsf{NP}\)-completeness of the game Kingdomino\(^\text{TM}\)
Theoretical Computer Science | 2020-05-23 | Paper |
| Complexity of maximum fixed point problem in Boolean networks | 2020-05-12 | Paper |
Characterisation of the elementary cellular automata in terms of their maximum sensitivity to all possible asynchronous updates
Chaos, Solitons and Fractals | 2019-01-09 | Paper |
A framework for (de)composing with Boolean automata networks
(available as arXiv preprint) | 2018-06-26 | Paper |
On the flora of asynchronous locally non-monotonic Boolean automata networks
(available as arXiv preprint) | 2018-04-23 | Paper |
On the complexity of two-dimensional signed majority cellular automata
Journal of Computer and System Sciences | 2017-10-11 | Paper |
Any shape can ultimately cross information on two-dimensional abelian sandpile models
(available as arXiv preprint) | 2017-08-04 | Paper |
On the cost of simulating a parallel Boolean automata network by a block-sequential one
Lecture Notes in Computer Science | 2017-05-19 | Paper |
Strong emergence of wave patterns on Kadanoff sandpiles
The Electronic Journal of Combinatorics | 2017-05-18 | Paper |
Strong emergence of wave patterns on Kadanoff sandpiles
The Electronic Journal of Combinatorics | 2017-05-18 | Paper |
Linearity is strictly more powerful than contiguity for encoding graphs
Discrete Mathematics | 2016-05-18 | Paper |
Chip-firing game and a partial Tutte polynomial for Eulerian digraphs
The Electronic Journal of Combinatorics | 2016-05-03 | Paper |
Chip-firing game and a partial Tutte polynomial for Eulerian digraphs
The Electronic Journal of Combinatorics | 2016-05-03 | Paper |
On the set of fixed points of the parallel symmetric sand pile model
(available as arXiv preprint) | 2015-11-02 | Paper |
| On the set of fixed points of the parallel symmetric sand pile model | 2015-11-02 | Paper |
Linearity is strictly more powerful than contiguity for encoding graphs
Lecture Notes in Computer Science | 2015-10-30 | Paper |
Emergence on decreasing sandpile models
Mathematical Foundations of Computer Science 2015 | 2015-09-16 | Paper |
Computational Complexity of the Avalanche Problem on One Dimensional Kadanoff Sandpiles
Cellular Automata and Discrete Complex Systems | 2015-08-04 | Paper |
Feedback arc set problem and NP-hardness of minimum recurrent configuration problem of chip-firing game on directed graphs
Annals of Combinatorics | 2015-07-22 | Paper |
Emergence of wave patterns on Kadanoff sandpiles
LATIN 2014: Theoretical Informatics | 2014-03-31 | Paper |
Kadanoff sand pile model. Avalanche structure and wave shape
Theoretical Computer Science | 2014-01-16 | Paper |
| Kadanoff Sand Piles, following the snowball | 2013-01-06 | Paper |
Transduction on Kadanoff sand pile model avalanches, application to wave pattern emergence
Mathematical Foundations of Computer Science 2011 | 2011-08-17 | Paper |
Avalanche structure in the Kadanoff sand pile model
Language and Automata Theory and Applications | 2011-06-03 | Paper |
Polygonal corona limit on multigrid dual tilings
(available as arXiv preprint) | N/A | Paper |
