Kévin Perrot

According to our database, Kévin Perrot authored at least 50 papers between 2011 and 2024.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2024

Complexity of Boolean automata networks under block-parallel update modes.

Kévin Perrot, Sylvain Sené, Léah Tapin

CoRR, 2024

Polygonal corona limit on multigrid dual tilings.

Victor H. Lutfalla, Kévin Perrot

CoRR, 2024

Combinatorics of Block-Parallel Automata Networks.

Kévin Perrot, Sylvain Sené, Léah Tapin

Proceedings of the SOFSEM 2024: Theory and Practice of Computer Science, 2024

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., December, 2023

On countings and enumerations of block-parallel automata networks.

Kévin Perrot, Sylvain Sené, Léah Tapin

CoRR, 2023

Hardness of monadic second-order formulae over succinct graphs.

Guilhem Gamard, Pierre Guillon, Kévin Perrot, Guillaume Theyssier

CoRR, 2023

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

Rikudo is NP-complete.

Viet-Ha Nguyen, Kévin Perrot

Theor. Comput. Sci., 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

Sandpile Toppling on Penrose Tilings: Identity and Isotropic Dynamics.

Jérémy Fersula, Camille Noûs, Kévin Perrot

Proceedings of the Automata and Complexity, 2022

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

Kévin Perrot

, 2022

2021

On Boolean Automata Networks (de)Composition.

Kévin Perrot, Pacôme Perrotin, Sylvain Sené

Fundam. Informaticae, 2021

Freezing sandpiles and Boolean threshold networks: Equivalence and complexity.

Eric Goles, Pedro Montealegre, Kévin Perrot

Adv. Appl. Math., 2021

Rice-Like Theorems for Automata Networks.

Guilhem Gamard, Pierre Guillon, Kévin Perrot, Guillaume Theyssier

Proceedings of the 38th International Symposium on Theoretical Aspects of Computer Science, 2021

Complexity of Limit-Cycle Problems in Boolean Networks.

Florian Bridoux, Caroline Gaze-Maillot, Kévin Perrot, Sylvain Sené

Proceedings of the SOFSEM 2021: Theory and Practice of Computer Science, 2021

Optimising Attractor Computation in Boolean Automata Networks.

Kévin Perrot, Pacôme Perrotin, Sylvain Sené

Proceedings of the Language and Automata Theory and Applications, 2021

2020

On the emergence of regularities on one-dimensional decreasing sandpiles.

Kévin Perrot, Éric Rémila

Theor. Comput. Sci., 2020

NP-completeness of the game <i>Kingdomino</i>TM.

Viet-Ha Nguyen, Kévin Perrot, Mathieu Vallet

Theor. Comput. Sci., 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

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

How Hard is it to Predict Sandpiles on Lattices? A Survey.

Enrico Formenti, Kévin Perrot

Fundam. Informaticae, 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

On the Complexity of Acyclic Modules in Automata Networks.

Kévin Perrot, Pacôme Perrotin, Sylvain Sené

Proceedings of the Theory and Applications of Models of Computation, 2020

#P-completeness of Counting Update Digraphs, Cacti, and Series-Parallel Decomposition Method.

Kévin Perrot, Sylvain Sené, Lucas Venturini

Proceedings of the Beyond the Horizon of Computability, 2020

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

Proceedings of the Cellular Automata and Discrete Complex Systems, 2020

2019

On the complexity of counting feedback arc sets.

Kévin Perrot

CoRR, 2019

NP-completeness of the game Kingdomino.

Viet-Ha Nguyen, Kévin Perrot, Mathieu Vallet

CoRR, 2019

Complexity of Maximum Fixed Point Problem in Boolean Networks.

Florian Bridoux, Nicolas Durbec, Kévin Perrot, Adrien Richard

Proceedings of the Computing with Foresight and Industry, 2019

2018

On the complexity of two-dimensional signed majority cellular automata.

Eric Goles, Pedro Montealegre, Kévin Perrot, Guillaume Theyssier

J. Comput. Syst. Sci., 2018

Computational Complexity of the Avalanche Problem for One Dimensional Decreasing Sandpiles.

Enrico Formenti, Kévin Perrot, Eric Rémila

J. Cell. Autom., 2018

Balanced Connected Partitioning of Unweighted Grid Graphs.

Cedric Berenger, Peter Niebert, Kévin Perrot

Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science, 2018

A Framework for (De)composing with Boolean Automata Networks.

Kévin Perrot, Pacôme Perrotin, Sylvain Sené

Proceedings of the Machines, Computations, and Universality - 8th International Conference, 2018

Any Shape Can Ultimately Cross Information on Two-Dimensional Abelian Sandpile Models.

Viet-Ha Nguyen, Kévin Perrot

Proceedings of the Cellular Automata and Discrete Complex Systems, 2018

2017

Strong Emergence of Wave Patterns on Kadanoff Sandpiles.

Kévin Perrot, Eric Rémila

Electron. J. Comb., 2017

On the Cost of Simulating a Parallel Boolean Automata Network by a Block-Sequential One.

Florian Bridoux, Pierre Guillon, Kévin Perrot, Sylvain Sené, Guillaume Theyssier

Proceedings of the Theory and Applications of Models of Computation, 2017

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

Chip-Firing Game and a Partial Tutte Polynomial for Eulerian Digraphs.

Kévin Perrot, Van Trung Pham

Electron. J. Comb., 2016

2015

Piles de sable décroissantes 1D. Classification expérimentale d'émergences.

Kévin Perrot, Eric Rémila

Tech. Sci. Informatiques, 2015

On the Flora of Asynchronous Locally Non-monotonic Boolean Automata Networks.

Aurore Alcolei, Kévin Perrot, Sylvain Sené

Proceedings of the 6th International Workshop on Static Analysis and Systems Biology, 2015

Emergence on Decreasing Sandpile Models.

Kévin Perrot, Eric Rémila

Proceedings of the Mathematical Foundations of Computer Science 2015, 2015

2014

Emergence of Wave Patterns on Kadanoff Sandpiles.

Kévin Perrot, Eric Rémila

Proceedings of the LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31, 2014

Computational Complexity of the Avalanche Problem on One Dimensional Kadanoff Sandpiles.

Enrico Formenti, Kévin Perrot, Eric Rémila

Proceedings of the Cellular Automata and Discrete Complex Systems, 2014

2013

Les piles de sable Kadanoff. (Kadanoff sandpiles).

Kévin Perrot

PhD thesis, 2013

Kadanoff sand pile model. Avalanche structure and wave shape.

Kévin Perrot, Eric Rémila

Theor. Comput. Sci., 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 Piles, following the snowball

Kévin Perrot, Eric Rémila

CoRR, 2013

Effects of migration of three competing species on their distributions in multizone environment.

Thi Ha Duong Phan, Nguyen-Ngoc Doanh, Kévin Perrot

Proceedings of the 2013 IEEE RIVF International Conference on Computing and Communication Technologies, 2013

2011

Transduction on Kadanoff Sand Pile Model Avalanches, Application to Wave Pattern Emergence.

Kévin Perrot, Eric Rémila

Proceedings of the Mathematical Foundations of Computer Science 2011, 2011

Avalanche Structure in the Kadanoff Sand Pile Model.

Kévin Perrot, Eric Rémila

Proceedings of the Language and Automata Theory and Applications, 2011

On the set of Fixed Points of the Parallel Symmetric Sand Pile Model.

Kévin Perrot, Thi Ha Duong Phan, Van Trung Pham

Proceedings of the 17th International Workshop on Cellular Automata and Discrete Complex Systems, 2011