default search action
Kévin Perrot
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j19]Eurico L. P. Ruivo
, Kévin Perrot, Pedro P. B. de Oliveira, Pacôme Perrotin:
Negative results on density determination with one-dimensional cellular automata with block-sequential asynchronous updates. J. Comput. Sci. 82: 102430 (2024) - [c24]François Doré, Kévin Perrot, Antonio E. Porreca, Sara Riva, Marius Rolland:
Roots in the Semiring of Finite Deterministic Dynamical Systems. AUTOMATA 2024: 120-132 - [c23]Kévin Perrot, Sylvain Sené, Léah Tapin:
Complexity of Boolean Automata Networks Under Block-Parallel Update Modes. SAND 2024: 19:1-19:19 - [c22]Kévin Perrot, Sylvain Sené, Léah Tapin:
Combinatorics of Block-Parallel Automata Networks. SOFSEM 2024: 442-455 - [i30]Victor H. Lutfalla, Kévin Perrot:
Polygonal corona limit on multigrid dual tilings. CoRR abs/2402.01257 (2024) - [i29]Kévin Perrot, Sylvain Sené, Léah Tapin:
Complexity of Boolean automata networks under block-parallel update modes. CoRR abs/2402.06294 (2024) - [i28]François Doré, Kévin Perrot, Antonio E. Porreca, Sara Riva, Marius Rolland:
Roots in the semiring of finite deterministic dynamical systems. CoRR abs/2405.09236 (2024) - [i27]Aliénor Goubault-Larrecq, Kévin Perrot:
Rice-like complexity lower bounds for Boolean and uniform automata networks. CoRR abs/2409.08762 (2024) - 2023
- [j18]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: 103458 (2023) - [i26]Florian Bridoux, Kévin Perrot, Aymeric Picard Marchetto, Adrien Richard:
Interaction graphs of isomorphic automata networks I: complete digraph and minimum in-degree. CoRR abs/2301.01958 (2023) - [i25]Guilhem Gamard, Pierre Guillon, Kévin Perrot, Guillaume Theyssier:
Hardness of monadic second-order formulae over succinct graphs. CoRR abs/2302.04522 (2023) - [i24]Kévin Perrot, Sylvain Sené, Léah Tapin:
On countings and enumerations of block-parallel automata networks. CoRR abs/2304.09664 (2023) - 2022
- [b2]Kévin Perrot:
Études de la complexité algorithmique des réseaux d'automates. (Studies of the algorithmic complexity of automata networks). Aix-Marseille University, France, 2022 - [j17]Florian Bridoux
Complexity of fixed point counting problems in Boolean networks. J. Comput. Syst. Sci. 126: 138-164 (2022) - [j16]Viet-Ha Nguyen, Kévin Perrot:
Rikudo is NP-complete. Theor. Comput. Sci. 910: 34-47 (2022) - [j15]Pedro Paulo Balbi de Oliveira
Non-maximal sensitivity to synchronism in elementary cellular automata: Exact asymptotic measures. Theor. Comput. Sci. 926: 21-50 (2022) - [c21]Jérémy Fersula, Camille Noûs, Kévin Perrot:
Sandpile Toppling on Penrose Tilings: Identity and Isotropic Dynamics. Automata and Complexity 2022: 117-143 - 2021
- [j14]Eric Goles, Pedro Montealegre
Freezing sandpiles and Boolean threshold networks: Equivalence and complexity. Adv. Appl. Math. 125: 102161 (2021) - [j13]Kévin Perrot, Pacôme Perrotin
On Boolean Automata Networks (de)Composition. Fundam. Informaticae 181(2-3): 163-188 (2021) - [c20]Kévin Perrot, Pacôme Perrotin
Optimising Attractor Computation in Boolean Automata Networks. LATA 2021: 68-80 - [c19]Florian Bridoux, Caroline Gaze-Maillot, Kévin Perrot, Sylvain Sené:
Complexity of Limit-Cycle Problems in Boolean Networks. SOFSEM 2021: 135-146 - [c18]Guilhem Gamard, Pierre Guillon, Kévin Perrot, Guillaume Theyssier:
Rice-Like Theorems for Automata Networks. STACS 2021: 32:1-32:17 - [e1]Alonso Castillo-Ramirez
27th IFIP WG 1.5 International Workshop on Cellular Automata and Discrete Complex Systems, AUTOMATA 2021, July 12-14, 2021, Aix-Marseille University, France. OASIcs 90, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2021, ISBN 978-3-95977-189-4 [contents] - [i23]Eric Goles, Pedro Montealegre, Kévin Perrot:
Freezing sandpiles and Boolean threshold networks: equivalence and complexity. CoRR abs/2101.04204 (2021) - [i22]Viet-Ha Nguyen, Kévin Perrot:
Rikudo is NP-complete. CoRR abs/2101.09332 (2021) - 2020
- [j12]Enrico Formenti
How Hard is it to Predict Sandpiles on Lattices? A Survey. Fundam. Informaticae 171(1-4): 189-219 (2020) - [j11]Eurico L. P. Ruivo
Maximum sensitivity to update schedules of elementary cellular automata over infinite configurations. Inf. Comput. 274: 104538 (2020) - [j10]Kévin Perrot, Marco Montalva-Medel, Pedro Paulo Balbi de Oliveira
Maximum sensitivity to update schedules of elementary cellular automata over periodic configurations. Nat. Comput. 19(1): 51-90 (2020) - [j9]Viet-Ha Nguyen, Kévin Perrot, Mathieu Vallet:
NP-completeness of the game KingdominoTM. Theor. Comput. Sci. 822: 23-35 (2020) - [j8]Kévin Perrot, Éric Rémila:
On the emergence of regularities on one-dimensional decreasing sandpiles. Theor. Comput. Sci. 843: 1-24 (2020) - [c17]Pedro Paulo Balbi de Oliveira
Non-maximal Sensitivity to Synchronism in Periodic Elementary Cellular Automata: Exact Asymptotic Measures. Automata 2020: 14-28 - [c16]Kévin Perrot, Sylvain Sené, Lucas Venturini:
#P-completeness of Counting Update Digraphs, Cacti, and Series-Parallel Decomposition Method. CiE 2020: 326-338 - [c15]Kévin Perrot, Pacôme Perrotin
On the Complexity of Acyclic Modules in Automata Networks. TAMC 2020: 168-180 - [i21]Florian Bridoux, Caroline Gaze-Maillot, Kévin Perrot, Sylvain Sené:
Complexity of limit-cycle problems in Boolean networks. CoRR abs/2001.07391 (2020) - [i20]Camille Noûs, Kévin Perrot, Sylvain Sené, Lucas Venturini:
#P-completeness of counting update digraphs, cacti, and a series-parallel decomposition method. CoRR abs/2004.02129 (2020) - [i19]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 abs/2004.07128 (2020) - [i18]Kévin Perrot, Pacôme Perrotin, Sylvain Sené:
Optimising attractor computation in Boolean automata networks. CoRR abs/2005.14531 (2020) - [i17]Florian Bridoux, Amélia Durbec, Kévin Perrot, Adrien Richard:
Complexity of fixed point counting problems in Boolean Networks. CoRR abs/2012.02513 (2020)
2010 – 2019
- 2019
- [c14]Florian Bridoux, Nicolas Durbec, Kévin Perrot, Adrien Richard:
Complexity of Maximum Fixed Point Problem in Boolean Networks. CiE 2019: 132-143 - [i16]Viet-Ha Nguyen, Kévin Perrot, Mathieu Vallet:
NP-completeness of the game Kingdomino. CoRR abs/1909.02849 (2019) - [i15]Kévin Perrot:
On the complexity of counting feedback arc sets. CoRR abs/1909.03339 (2019) - [i14]Kévin Perrot, Enrico Formenti:
How hard is it to predict sandpiles on lattices? A survey. CoRR abs/1909.12150 (2019) - [i13]Kévin Perrot, Pacôme Perrotin, Sylvain Sené:
On the complexity of acyclic modules in automata networks. CoRR abs/1910.07299 (2019) - 2018
- [j7]Enrico Formenti, Kévin Perrot, Eric Rémila:
Computational Complexity of the Avalanche Problem for One Dimensional Decreasing Sandpiles. J. Cell. Autom. 13(3): 215-228 (2018) - [j6]Eric Goles, Pedro Montealegre
On the complexity of two-dimensional signed majority cellular automata. J. Comput. Syst. Sci. 91: 1-32 (2018) - [c13]Viet-Ha Nguyen, Kévin Perrot:
Any Shape Can Ultimately Cross Information on Two-Dimensional Abelian Sandpile Models. Automata 2018: 127-142 - [c12]Kévin Perrot, Pacôme Perrotin
A Framework for (De)composing with Boolean Automata Networks. MCU 2018: 121-136 - [c11]Cedric Berenger, Peter Niebert, Kévin Perrot:
Balanced Connected Partitioning of Unweighted Grid Graphs. MFCS 2018: 39:1-39:18 - [i12]Kévin Perrot, Pacôme Perrotin, Sylvain Sené:
A framework for (de)composing with Boolean automata networks. CoRR abs/1802.10400 (2018) - [i11]Christophe Crespelle, Tien-Nam Le, Kévin Perrot, Thi Ha Duong Phan:
Linearity is Strictly More Powerful than Contiguity for Encoding Graphs. CoRR abs/1803.05414 (2018) - [i10]Enrico Formenti, Kévin Perrot, Eric Rémila:
Computational complexity of the avalanche problem on one dimensional Kadanoff sandpiles. CoRR abs/1803.05498 (2018) - 2017
- [j5]Kévin Perrot, Eric Rémila:
Strong Emergence of Wave Patterns on Kadanoff Sandpiles. Electron. J. Comb. 24(2): 2 (2017) - [c10]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: 112-128 - [i9]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 abs/1702.03101 (2017) - 2016
- [j4]Kévin Perrot, Van Trung Pham:
Chip-Firing Game and a Partial Tutte Polynomial for Eulerian Digraphs. Electron. J. Comb. 23(1): 1 (2016) - [j3]Christophe Crespelle, Tien-Nam Le
Linearity is strictly more powerful than contiguity for encoding graphs. Discret. Math. 339(8): 2168-2177 (2016) - 2015
- [j2]Kévin Perrot, Eric Rémila:
Piles de sable décroissantes 1D. Classification expérimentale d'émergences. Tech. Sci. Informatiques 34(4): 377-400 (2015) - [c9]Kévin Perrot, Eric Rémila:
Emergence on Decreasing Sandpile Models. MFCS (1) 2015: 419-431 - [c8]Christophe Crespelle, Tien-Nam Le
Linearity Is Strictly More Powerful Than Contiguity for Encoding Graphs. WADS 2015: 212-223 - [c7]Aurore Alcolei, Kévin Perrot, Sylvain Sené:
On the Flora of Asynchronous Locally Non-monotonic Boolean Automata Networks. SASB 2015: 3-25 - [i8]Aurore Alcolei, Kévin Perrot, Sylvain Sené:
On the flora of asynchronous locally non-monotonic Boolean automata networks. CoRR abs/1510.05452 (2015) - 2014
- [c6]Enrico Formenti
Computational Complexity of the Avalanche Problem on One Dimensional Kadanoff Sandpiles. Automata 2014: 21-30 - [c5]Kévin Perrot, Eric Rémila:
Emergence of Wave Patterns on Kadanoff Sandpiles. LATIN 2014: 634-647 - 2013
- [b1]Kévin Perrot:
Les piles de sable Kadanoff. (Kadanoff sandpiles). École normale supérieure de Lyon, France, 2013 - [j1]Kévin Perrot, Eric Rémila:
Kadanoff sand pile model. Avalanche structure and wave shape. Theor. Comput. Sci. 504: 52-72 (2013) - [c4]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: 227-232 - [i7]Kévin Perrot, Eric Rémila:
Kadanoff Sand Piles, following the snowball. CoRR abs/1301.0997 (2013) - [i6]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 abs/1303.3708 (2013) - [i5]Kévin Perrot, Eric Rémila:
Kadanoff Sand Pile Model. Avalanche Structure and Wave Shape. CoRR abs/1304.5109 (2013) - [i4]Kévin Perrot, Eric Rémila:
Emergence of wave patterns on Kadanoff Sandpiles. CoRR abs/1312.4066 (2013) - 2012
- [i3]Kévin Perrot, Thi Ha Duong Phan, Van Trung Pham:
On the set of Fixed Points of the Parallel Symmetric Sand Pile Model. CoRR abs/1207.0654 (2012) - 2011
- [c3]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: 17-28 - [c2]Kévin Perrot, Eric Rémila:
Avalanche Structure in the Kadanoff Sand Pile Model. LATA 2011: 427-439 - [c1]Kévin Perrot, Eric Rémila:
Transduction on Kadanoff Sand Pile Model Avalanches, Application to Wave Pattern Emergence. MFCS 2011: 508-519 - [i2]Kévin Perrot, Eric Rémila:
Avalanche Structure in the Kadanoff Sand Pile Model. CoRR abs/1101.5940 (2011) - [i1]Kévin Perrot, Eric Rémila:
Transduction on Kadanoff Sand Pile Model Avalanches, Application to Wave Pattern Emergence. CoRR abs/1106.2670 (2011)
Coauthor Index
aka: Éric Rémila
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-14 23:32 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: