On the set of Fixed Points of the Parallel Symmetric Sand Pile Model. - Kévin Perrot; Thi Ha Duong Phan; Van Trung Pham (Automata, 2011)

Avalanche Structure in the Kadanoff Sand Pile Model. - Kévin Perrot; Eric Rémila (LATA, 2011)

Transduction on Kadanoff Sand Pile Model Avalanches, Application to Wave Pattern Emergence. - Kévin Perrot; Eric Rémila (MFCS, 2011)

Effects of migration of three competing species on their distributions in multizone environment. - Thi Ha Duong Phan; Nguyen-Ngoc Doanh; Kévin Perrot (RIVF, 2013)

Kadanoff Sand Piles, following the snowball - Kévin Perrot; Eric Rémila (CoRR, 2013)

NP-hardness of minimum feedback arc set problem on Eulerian digraphs and minimum recurrent configuration problem of Chip-firing game - Kévin Perrot; Van Trung Pham (CoRR, 2013)

Kadanoff sand pile model. Avalanche structure and wave shape. - Kévin Perrot; Eric Rémila (Theor. Comput. Sci., 2013)

Les piles de sable Kadanoff. (Kadanoff sandpiles). - Kévin Perrot (2013)

Computational Complexity of the Avalanche Problem on One Dimensional Kadanoff Sandpiles. - Enrico Formenti; Kévin Perrot; Eric Rémila (Automata, 2014)

Emergence of Wave Patterns on Kadanoff Sandpiles. - Kévin Perrot; Eric Rémila (LATIN, 2014)

Emergence on Decreasing Sandpile Models. - Kévin Perrot; Eric Rémila (MFCS (1), 2015)

On the Flora of Asynchronous Locally Non-monotonic Boolean Automata Networks. - Aurore Alcolei; Kévin Perrot; Sylvain Sené (SASB, 2015)

Piles de sable décroissantes 1D. Classification expérimentale d'émergences. - Kévin Perrot; Eric Rémila (Tech. Sci. Informatiques, 2015)

Chip-Firing Game and a Partial Tutte Polynomial for Eulerian Digraphs. - Kévin Perrot; Van Trung Pham (Electron. J. Comb., 2016)

Linearity is strictly more powerful than contiguity for encoding graphs. - Christophe Crespelle; Tien-Nam Le; Kévin Perrot; Thi Ha Duong Phan (Discret. Math., 2016)

On the Cost of Simulating a Parallel Boolean Automata Network by a Block-Sequential One. - Florian Bridoux; Pierre Guillon 001; Kévin Perrot; Sylvain Sené; Guillaume Theyssier (TAMC, 2017)

Strong Emergence of Wave Patterns on Kadanoff Sandpiles. - Kévin Perrot; Eric Rémila (Electron. J. Comb., 2017)

Any Shape Can Ultimately Cross Information on Two-Dimensional Abelian Sandpile Models. - Viet-Ha Nguyen 004; Kévin Perrot (Automata, 2018)

A Framework for (De)composing with Boolean Automata Networks. - Kévin Perrot; Pacôme Perrotin; Sylvain Sené (MCU, 2018)

Balanced Connected Partitioning of Unweighted Grid Graphs. - Cedric Berenger; Peter Niebert; Kévin Perrot (MFCS, 2018)

Computational Complexity of the Avalanche Problem for One Dimensional Decreasing Sandpiles. - Enrico Formenti; Kévin Perrot; Eric Rémila (J. Cell. Autom., 2018)

On the complexity of two-dimensional signed majority cellular automata. - Eric Goles 001; Pedro Montealegre 001; Kévin Perrot; Guillaume Theyssier (J. Comput. Syst. Sci., 2018)

Complexity of Maximum Fixed Point Problem in Boolean Networks. - Florian Bridoux; Nicolas Durbec; Kévin Perrot; Adrien Richard (CiE, 2019)

NP-completeness of the game Kingdomino. - Viet-Ha Nguyen 004; Kévin Perrot; Mathieu Vallet (CoRR, 2019)

On the complexity of counting feedback arc sets. - Kévin Perrot (CoRR, 2019)

Non-maximal Sensitivity to Synchronism in Periodic Elementary Cellular Automata: Exact Asymptotic Measures. - Pedro Paulo Balbi de Oliveira; Enrico Formenti; Kévin Perrot; Sara Riva; Eurico L. P. Ruivo (Automata, 2020)

#P-completeness of Counting Update Digraphs, Cacti, and Series-Parallel Decomposition Method. - Kévin Perrot; Sylvain Sené; Lucas Venturini (CiE, 2020)

On the Complexity of Acyclic Modules in Automata Networks. - Kévin Perrot; Pacôme Perrotin; Sylvain Sené (TAMC, 2020)

#P-completeness of counting update digraphs, cacti, and a series-parallel decomposition method. - Camille Noûs; Kévin Perrot; Sylvain Sené; Lucas Venturini (CoRR, 2020)

How Hard is it to Predict Sandpiles on Lattices? A Survey. - Enrico Formenti; Kévin Perrot (Fundam. Informaticae, 2020)

Maximum sensitivity to update schedules of elementary cellular automata over infinite configurations. - Eurico L. P. Ruivo; Pedro P. B. de Oliveira; Marco Montalva-Medel; Kévin Perrot (Inf. Comput., 2020)

Maximum sensitivity to update schedules of elementary cellular automata over periodic configurations. - Kévin Perrot; Marco Montalva-Medel; Pedro Paulo Balbi de Oliveira; Eurico L. P. Ruivo (Nat. Comput., 2020)

NP-completeness of the game KingdominoTM. - Viet-Ha Nguyen 004; Kévin Perrot; Mathieu Vallet (Theor. Comput. Sci., 2020)

On the emergence of regularities on one-dimensional decreasing sandpiles. - Kévin Perrot; Éric Rémila (Theor. Comput. Sci., 2020)

Optimising Attractor Computation in Boolean Automata Networks. - Kévin Perrot; Pacôme Perrotin; Sylvain Sené (LATA, 2021)

Complexity of Limit-Cycle Problems in Boolean Networks. - Florian Bridoux; Caroline Gaze-Maillot; Kévin Perrot; Sylvain Sené (SOFSEM, 2021)

Rice-Like Theorems for Automata Networks. - Guilhem Gamard; Pierre Guillon 001; Kévin Perrot; Guillaume Theyssier (STACS, 2021)

Freezing sandpiles and Boolean threshold networks: Equivalence and complexity. - Eric Goles 001; Pedro Montealegre 001; Kévin Perrot (Adv. Appl. Math., 2021)

On Boolean Automata Networks (de)Composition. - Kévin Perrot; Pacôme Perrotin; Sylvain Sené (Fundam. Informaticae, 2021)

Études de la complexité algorithmique des réseaux d'automates. (Studies of the algorithmic complexity of automata networks). - Kévin Perrot (2022)

Sandpile Toppling on Penrose Tilings: Identity and Isotropic Dynamics. - Jérémy Fersula; Camille Noûs; Kévin Perrot (Automata and Complexity, 2022)

Complexity of fixed point counting problems in Boolean networks. - Florian Bridoux; Amélia Durbec; Kévin Perrot; Adrien Richard (J. Comput. Syst. Sci., 2022)

Rikudo is NP-complete. - Viet-Ha Nguyen 004; Kévin Perrot (Theor. Comput. Sci., 2022)

Non-maximal sensitivity to synchronism in elementary cellular automata: Exact asymptotic measures. - Pedro Paulo Balbi de Oliveira; Enrico Formenti; Kévin Perrot; Sara Riva; Eurico L. P. Ruivo (Theor. Comput. Sci., 2022)

Hardness of monadic second-order formulae over succinct graphs. - Guilhem Gamard; Pierre Guillon 001; Kévin Perrot; Guillaume Theyssier (CoRR, 2023)

On countings and enumerations of block-parallel automata networks. - Kévin Perrot; Sylvain Sené; Léah Tapin (CoRR, 2023)

Interaction graphs of isomorphic automata networks I: Complete digraph and minimum in-degree. - Florian Bridoux; Kévin Perrot; Aymeric Picard Marchetto; Adrien Richard (J. Comput. Syst. Sci., 2023)

Roots in the Semiring of Finite Deterministic Dynamical Systems. - François Doré; Kévin Perrot; Antonio E. Porreca; Sara Riva; Marius Rolland (AUTOMATA, 2024)

Complexity of Boolean Automata Networks Under Block-Parallel Update Modes. - Kévin Perrot; Sylvain Sené; Léah Tapin (SAND, 2024)

Combinatorics of Block-Parallel Automata Networks. - Kévin Perrot; Sylvain Sené; Léah Tapin (SOFSEM, 2024)

Rice-like complexity lower bounds for Boolean and uniform automata networks. - Aliénor Goubault-Larrecq; Kévin Perrot (CoRR, 2024)

Negative results on density determination with one-dimensional cellular automata with block-sequential asynchronous updates. - Eurico L. P. Ruivo; Kévin Perrot; Pedro P. B. de Oliveira; Pacôme Perrotin (J. Comput. Sci., 2024)

Circuit Metaconstruction in Logspace for Rice-Like Complexity Lower Bounds in ANs and SGRs. - Aliénor Goubault-Larrecq; Kévin Perrot (CiE, 2025)

Foundations of block-parallel automata networks. - Kévin Perrot; Sylvain Sené; Léah Tapin (CoRR, 2025)

Sandpiles prediction and crossover on $ mathbb {Z}^2$ within Moore neighborhood. - Pablo Concha-Vega; Eric Goles 001; Pedro Montealegre 001; Kévin Perrot (Nat. Comput., 2025)

Creation of fixed points in block-parallel Boolean automata networks. - Kévin Perrot; Sylvain Sené; Léah Tapin (CoRR, 2025)

Timed Prediction Problem for Sandpile Models. - Pablo Concha-Vega; Kévin Perrot (CoRR, 2025)

Polygonal corona limit on multigrid dual tilings. - Victor H. Lutfalla; Kévin Perrot (Nat. Comput., 2025)