Kévin Perrot

Available identifiers

zbMath Open perrot.kevinWikidataQ102422795 ScholiaQ102422795MaRDI QIDQ276206

List of research outcomes

Publication	Date of Publication	Type
Maximum sensitivity to update schedules of elementary cellular automata over periodic configurations	2024-02-09	Paper
Interaction graphs of isomorphic automata networks. I: Complete digraph and minimum in-degree	2023-08-21	Paper
Any Shape Can Ultimately Cross Information on Two-Dimensional Abelian Sandpile Models	2023-04-10	Paper
On the complexity of acyclic modules in automata networks	2022-12-22	Paper
\#P-completeness of counting update digraphs, cacti, and series-parallel decomposition method	2022-12-16	Paper
Sandpile toppling on Penrose tilings: identity and isotropic dynamics	2022-10-25	Paper
https://portal.mardi4nfdi.de/entity/Q5095623	2022-08-10	Paper
Non-maximal sensitivity to synchronism in elementary cellular automata: exact asymptotic measures	2022-07-08	Paper
Complexity of fixed point counting problems in Boolean networks	2022-03-29	Paper
Complexity of limit-cycle problems in Boolean networks	2022-03-24	Paper
Rikudo is NP-complete	2022-03-23	Paper
An asynchronous solution to the synchronisation problem for binary one-dimensional cellular automata	2022-02-21	Paper
On Boolean Automata Networks (de)Composition1	2021-10-25	Paper
Optimising attractor computation in Boolean automata networks	2021-10-04	Paper
https://portal.mardi4nfdi.de/entity/Q5010301	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	2021-07-08	Paper
Freezing sandpiles and Boolean threshold networks: equivalence and complexity	2021-04-23	Paper
On the emergence of regularities on one-dimensional decreasing sandpiles	2020-10-13	Paper
Maximum sensitivity to update schedules of elementary cellular automata over infinite configurations	2020-09-17	Paper
How Hard is it to Predict Sandpiles on Lattices? A Survey	2020-06-21	Paper
\(\mathsf{NP}\)-completeness of the game Kingdomino\(^\text{TM}\)	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	2019-01-09	Paper
A framework for (de)composing with Boolean automata networks	2018-06-26	Paper
On the flora of asynchronous locally non-monotonic Boolean automata networks	2018-04-23	Paper
On the complexity of two-dimensional signed majority cellular automata	2017-10-11	Paper
Any shape can ultimately cross information on two-dimensional abelian sandpile models	2017-08-04	Paper
On the Cost of Simulating a Parallel Boolean Automata Network by a Block-Sequential One	2017-05-19	Paper
Strong emergence of wave patterns on Kadanoff sandpiles	2017-05-18	Paper
Linearity is strictly more powerful than contiguity for encoding graphs	2016-05-18	Paper
Chip-firing game and a partial Tutte polynomial for Eulerian digraphs	2016-05-03	Paper
https://portal.mardi4nfdi.de/entity/Q3449993	2015-11-02	Paper
Linearity Is Strictly More Powerful Than Contiguity for Encoding Graphs	2015-10-30	Paper
Emergence on Decreasing Sandpile Models	2015-09-16	Paper
Computational Complexity of the Avalanche Problem on One Dimensional Kadanoff Sandpiles	2015-08-04	Paper
Feedback arc set problem and NP-hardness of minimum recurrent configuration problem of chip-firing game on directed graphs	2015-07-22	Paper
Emergence of Wave Patterns on Kadanoff Sandpiles	2014-03-31	Paper
Kadanoff sand pile model. Avalanche structure and wave shape	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	2011-08-17	Paper
Avalanche Structure in the Kadanoff Sand Pile Model	2011-06-03	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Kévin Perrot