Kévin Perrot

Publication Activity (10 Years)

Years Active: 2011-2024
Publications (10 Years): 53

Top Venues

CoRR

Theor. Comput. Sci.

J. Comput. Syst. Sci.

Automata

École normale supérieure de Lyon, France (PHD)

Education History

École normale supérieure de Lyon, France

PHD

Publications

François Doré, Kévin Perrot, Antonio E. Porreca, Sara Riva, Marius Rolland
Roots in the Semiring of Finite Deterministic Dynamical Systems. AUTOMATA (2024)
François Doré, Kévin Perrot, Antonio E. Porreca, Sara Riva, Marius Rolland
Roots in the semiring of finite deterministic dynamical systems. CoRR (2024)
Victor H. Lutfalla, Kévin Perrot
Polygonal corona limit on multigrid dual tilings. CoRR (2024)
Kévin Perrot, Sylvain Sené, Léah Tapin
Combinatorics of Block-Parallel Automata Networks. SOFSEM (2024)
Kévin Perrot, Sylvain Sené, Léah Tapin
Complexity of Boolean Automata Networks Under Block-Parallel Update Modes. SAND (2024)
Kévin Perrot, Sylvain Sené, Léah Tapin
Complexity of Boolean automata networks under block-parallel update modes. CoRR (2024)
Florian Bridoux, Kévin Perrot, Aymeric Picard Marchetto, Adrien Richard
Interaction graphs of isomorphic automata networks I: Complete digraph and minimum in-degree. J. Comput. Syst. Sci. 138 (2023)
Kévin Perrot, Sylvain Sené, Léah Tapin
On countings and enumerations of block-parallel automata networks. CoRR (2023)
Florian Bridoux, Kévin Perrot, Aymeric Picard Marchetto, Adrien Richard
Interaction graphs of isomorphic automata networks I: complete digraph and minimum in-degree. CoRR (2023)
Guilhem Gamard, Pierre Guillon, Kévin Perrot, Guillaume Theyssier
Hardness of monadic second-order formulae over succinct graphs. CoRR (2023)
Florian Bridoux, Amélia Durbec, Kévin Perrot, Adrien Richard
Complexity of fixed point counting problems in Boolean networks. J. Comput. Syst. Sci. 126 (2022)
Pedro Paulo Balbi de Oliveira, Enrico Formenti, Kévin Perrot, Sara Riva, Eurico L. P. Ruivo
Non-maximal sensitivity to synchronism in elementary cellular automata: Exact asymptotic measures. Theor. Comput. Sci. 926 (2022)
Jérémy Fersula, Camille Noûs, Kévin Perrot
Sandpile Toppling on Penrose Tilings: Identity and Isotropic Dynamics. Automata and Complexity (2022)
Viet-Ha Nguyen, Kévin Perrot
Rikudo is NP-complete. Theor. Comput. Sci. 910 (2022)
Kévin Perrot, Pacôme Perrotin, Sylvain Sené
Optimising Attractor Computation in Boolean Automata Networks. LATA (2021)
Eric Goles, Pedro Montealegre, Kévin Perrot
Freezing sandpiles and Boolean threshold networks: equivalence and complexity. CoRR (2021)
Guilhem Gamard, Pierre Guillon, Kévin Perrot, Guillaume Theyssier
Rice-Like Theorems for Automata Networks. STACS (2021)
Viet-Ha Nguyen, Kévin Perrot
Rikudo is NP-complete. CoRR (2021)
Eric Goles, Pedro Montealegre, Kévin Perrot
Freezing sandpiles and Boolean threshold networks: Equivalence and complexity. Adv. Appl. Math. 125 (2021)
Florian Bridoux, Caroline Gaze-Maillot, Kévin Perrot, Sylvain Sené
Complexity of Limit-Cycle Problems in Boolean Networks. SOFSEM (2021)
Kévin Perrot, Pacôme Perrotin, Sylvain Sené
On Boolean Automata Networks (de)Composition. Fundam. Informaticae 181 (2-3) (2021)
Enrico Formenti, Kévin Perrot
How Hard is it to Predict Sandpiles on Lattices? A Survey. Fundam. Informaticae 171 (1-4) (2020)
Florian Bridoux, Caroline Gaze-Maillot, Kévin Perrot, Sylvain Sené
Complexity of limit-cycle problems in Boolean networks. CoRR (2020)
Kévin Perrot, Sylvain Sené, Lucas Venturini
#P-completeness of Counting Update Digraphs, Cacti, and Series-Parallel Decomposition Method. CiE (2020)
Pedro Paulo Balbi de Oliveira, Enrico Formenti, Kévin Perrot, Sara Riva, Eurico L. P. Ruivo
Non-maximal sensitivity to synchronism in periodic elementary cellular automata: exact asymptotic measures. CoRR (2020)
Florian Bridoux, Amélia Durbec, Kévin Perrot, Adrien Richard
Complexity of fixed point counting problems in Boolean Networks. CoRR (2020)
Kévin Perrot, Pacôme Perrotin, Sylvain Sené
Optimising attractor computation in Boolean automata networks. CoRR (2020)
Kévin Perrot, Pacôme Perrotin, Sylvain Sené
On the Complexity of Acyclic Modules in Automata Networks. TAMC (2020)
Kévin Perrot, Éric Rémila
On the emergence of regularities on one-dimensional decreasing sandpiles. Theor. Comput. Sci. 843 (2020)
Viet-Ha Nguyen, Kévin Perrot, Mathieu Vallet
TM. Theor. Comput. Sci. 822 (2020)
Camille Noûs, Kévin Perrot, Sylvain Sené, Lucas Venturini
#P-completeness of counting update digraphs, cacti, and a series-parallel decomposition method. CoRR (2020)
Pedro Paulo Balbi de Oliveira, Enrico Formenti, Kévin Perrot, Sara Riva, Eurico L. P. Ruivo
Non-maximal Sensitivity to Synchronism in Periodic Elementary Cellular Automata: Exact Asymptotic Measures. Automata (2020)
Eurico L. P. Ruivo, Pedro P. B. de Oliveira, Marco Montalva-Medel, Kévin Perrot
Maximum sensitivity to update schedules of elementary cellular automata over infinite configurations. Inf. Comput. 274 (2020)
Kévin Perrot, Marco Montalva-Medel, Pedro Paulo Balbi de Oliveira, Eurico L. P. Ruivo
Maximum sensitivity to update schedules of elementary cellular automata over periodic configurations. Nat. Comput. 19 (1) (2020)
Viet-Ha Nguyen, Kévin Perrot, Mathieu Vallet
NP-completeness of the game Kingdomino. CoRR (2019)
Florian Bridoux, Nicolas Durbec, Kévin Perrot, Adrien Richard
Complexity of Maximum Fixed Point Problem in Boolean Networks. CiE (2019)
Kévin Perrot, Pacôme Perrotin, Sylvain Sené
On the complexity of acyclic modules in automata networks. CoRR (2019)
Kévin Perrot, Enrico Formenti
How hard is it to predict sandpiles on lattices? A survey. CoRR (2019)
Kévin Perrot
On the complexity of counting feedback arc sets. CoRR (2019)
Cedric Berenger, Peter Niebert, Kévin Perrot
Balanced Connected Partitioning of Unweighted Grid Graphs. MFCS (2018)
Kévin Perrot, Pacôme Perrotin, Sylvain Sené
A Framework for (De)composing with Boolean Automata Networks. MCU (2018)
Eric Goles, Pedro Montealegre, Kévin Perrot, Guillaume Theyssier
On the complexity of two-dimensional signed majority cellular automata. J. Comput. Syst. Sci. 91 (2018)
Christophe Crespelle, Tien-Nam Le, Kévin Perrot, Thi Ha Duong Phan
Linearity is Strictly More Powerful than Contiguity for Encoding Graphs. CoRR (2018)
Enrico Formenti, Kévin Perrot, Eric Rémila
Computational complexity of the avalanche problem on one dimensional Kadanoff sandpiles. CoRR (2018)
Enrico Formenti, Kévin Perrot, Eric Rémila
Computational Complexity of the Avalanche Problem for One Dimensional Decreasing Sandpiles. J. Cell. Autom. 13 (3) (2018)
Viet-Ha Nguyen, Kévin Perrot
Any Shape Can Ultimately Cross Information on Two-Dimensional Abelian Sandpile Models. Automata (2018)
Kévin Perrot, Pacôme Perrotin, Sylvain Sené
A framework for (de)composing with Boolean automata networks. CoRR (2018)
Florian Bridoux, Pierre Guillon, Kévin Perrot, Sylvain Sené, Guillaume Theyssier
On the Cost of Simulating a Parallel Boolean Automata Network by a Block-Sequential One. TAMC (2017)
Kévin Perrot, Eric Rémila
Strong Emergence of Wave Patterns on Kadanoff Sandpiles. Electron. J. Comb. 24 (2) (2017)
Florian Bridoux, Pierre Guillon, Kévin Perrot, Sylvain Sené, Guillaume Theyssier
On the cost of simulating a parallel Boolean automata network by a block-sequential one. CoRR (2017)
Christophe Crespelle, Tien-Nam Le, Kévin Perrot, Thi Ha Duong Phan
Linearity is strictly more powerful than contiguity for encoding graphs. Discret. Math. 339 (8) (2016)
Aurore Alcolei, Kévin Perrot, Sylvain Sené
On the Flora of Asynchronous Locally Non-monotonic Boolean Automata Networks. Electron. Notes Theor. Comput. Sci. 326 (2016)
Kévin Perrot, Van Trung Pham
Chip-Firing Game and a Partial Tutte Polynomial for Eulerian Digraphs. Electron. J. Comb. 23 (1) (2016)
Kévin Perrot, Eric Rémila
Emergence on Decreasing Sandpile Models. MFCS (1) (2015)
Kévin Perrot, Eric Rémila
Piles de sable décroissantes 1D. Classification expérimentale d'émergences. Tech. Sci. Informatiques 34 (4) (2015)
Aurore Alcolei, Kévin Perrot, Sylvain Sené
On the flora of asynchronous locally non-monotonic Boolean automata networks. CoRR (2015)
Christophe Crespelle, Tien-Nam Le, Kévin Perrot, Thi Ha Duong Phan
Linearity Is Strictly More Powerful Than Contiguity for Encoding Graphs. WADS (2015)
Enrico Formenti, Kévin Perrot, Eric Rémila
Computational Complexity of the Avalanche Problem on One Dimensional Kadanoff Sandpiles. Automata (2014)
Kévin Perrot, Eric Rémila
Emergence of Wave Patterns on Kadanoff Sandpiles. LATIN (2014)
Kévin Perrot, Eric Rémila
Emergence of wave patterns on Kadanoff Sandpiles. CoRR (2013)
Kévin Perrot, Van Trung Pham
NP-hardness of minimum feedback arc set problem on Eulerian digraphs and minimum recurrent configuration problem of Chip-firing game CoRR (2013)
Kévin Perrot, Eric Rémila
Kadanoff Sand Piles, following the snowball CoRR (2013)
Kévin Perrot, Eric Rémila
Kadanoff sand pile model. Avalanche structure and wave shape. Theor. Comput. Sci. 504 (2013)
Thi Ha Duong Phan, Nguyen-Ngoc Doanh, Kévin Perrot
Effects of migration of three competing species on their distributions in multizone environment. RIVF (2013)
Kévin Perrot, Eric Rémila
Kadanoff Sand Pile Model. Avalanche Structure and Wave Shape CoRR (2013)
Kévin Perrot, Thi Ha Duong Phan, Van Trung Pham
On the set of Fixed Points of the Parallel Symmetric Sand Pile Model CoRR (2012)
Kévin Perrot, Eric Rémila
Avalanche Structure in the Kadanoff Sand Pile Model CoRR (2011)
Kévin Perrot, Eric Rémila
Avalanche Structure in the Kadanoff Sand Pile Model. LATA (2011)
Kévin Perrot, Thi Ha Duong Phan, Van Trung Pham
On the set of Fixed Points of the Parallel Symmetric Sand Pile Model. Automata (2011)
Kévin Perrot, Eric Rémila
Transduction on Kadanoff Sand Pile Model Avalanches, Application to Wave Pattern Emergence CoRR (2011)
Kévin Perrot, Eric Rémila
Transduction on Kadanoff Sand Pile Model Avalanches, Application to Wave Pattern Emergence. MFCS (2011)

Kévin Perrot.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Kévin Perrot