E-LIB Suche - Ergebnisse für: Perrot, Kévin

1

Combinatorics of Block-Parallel Automata Networks:

, In: Lecture Notes in Computer Science; SOFSEM 2024: Theory and Practice of Computer Science,

Perrot, Kévin ; Sené, Sylvain ; Tapin, Léah - p. 442-455 , 2024

2

Interaction graphs of isomorphic automata networks I: Compl..:

Bridoux, Florian ; Perrot, Kévin ; Picard Marchetto, Aymeric.
Journal of Computer and System Sciences. 138 (2023) - p. 103458 , 2023

Link: https://doi.org/10.1016/..

3

Rikudo is NP-complete:

Nguyen, Viet-Ha ; Perrot, Kévin
Theoretical Computer Science. 910 (2022) - p. 34-47 , 2022

Link: https://doi.org/10.1016/..

4

Complexity of fixed point counting problems in Boolean netw..:

Bridoux, Florian ; Durbec, Amélia ; Perrot, Kevin.
Journal of Computer and System Sciences. 126 (2022) - p. 138-164 , 2022

Link: https://doi.org/10.1016/..

5

Sandpile Toppling on Penrose Tilings: Identity and Isotropi..:

, In: Automata and Complexity; Emergence, Complexity and Computation,

Fersula, Jérémy ; Noûs, Camille ; Perrot, Kévin - p. 117-143 , 2022

Link: https://doi.org/10.1007/..

6

Non-maximal sensitivity to synchronism in elementary cellul..:

Balbi, Pedro Paulo ; Formenti, Enrico ; Perrot, Kévin..
Theoretical Computer Science. 926 (2022) - p. 21-50 , 2022

Link: https://doi.org/10.1016/..

7

Freezing sandpiles and Boolean threshold networks: Equivale..:

Goles, Eric ; Montealegre, Pedro ; Perrot, Kévin
Advances in Applied Mathematics. 125 (2021) - p. 102161 , 2021

Link: https://doi.org/10.1016/..

8

Complexity of Limit-Cycle Problems in Boolean Networks:

, In: SOFSEM 2021: Theory and Practice of Computer Science; Lecture Notes in Computer Science,

Bridoux, Florian ; Gaze-Maillot, Caroline ; Perrot, Kévin. - p. 135-146 , 2021

Link: https://doi.org/10.1007/..

9

Optimising Attractor Computation in Boolean Automata Networ..:

, In: Language and Automata Theory and Applications; Lecture Notes in Computer Science,

Perrot, Kévin ; Perrotin, Pacôme ; Sené, Sylvain - p. 68-80 , 2021

Link: https://doi.org/10.1007/..

10

Correction to: #P-completeness of Counting Update Digraphs,..:

, In: Lecture Notes in Computer Science; Beyond the Horizon of Computability,

Perrot, Kévin ; Sené, Sylvain ; Venturini, Lucas - p. C1-C1 , 2021

Link: https://doi.org/10.1007/..

11

#P-completeness of Counting Update Digraphs, Cacti, and Ser..:

, In: Lecture Notes in Computer Science; Beyond the Horizon of Computability,

Perrot, Kévin ; Sené, Sylvain ; Venturini, Lucas - p. 326-338 , 2020

Link: https://doi.org/10.1007/..

12

An asynchronous solution to the synchronisation problem for..:

Ruivo, Eurico L.P. ; Balbi, Pedro Paulo ; Perrot, Kévin
Physica D: Nonlinear Phenomena. 413 (2020) - p. 132554 , 2020

Link: https://doi.org/10.1016/..

13

NP-completeness of the game KingdominoTM:

Nguyen, Viet-Ha ; Perrot, Kévin ; Vallet, Mathieu
Theoretical Computer Science. 822 (2020) - p. 23-35 , 2020

Link: https://doi.org/10.1016/..

14

On the emergence of regularities on one-dimensional decreas..:

Perrot, Kévin ; Rémila, Éric
Theoretical Computer Science. 843 (2020) - p. 1-24 , 2020

Link: https://doi.org/10.1016/..

15

Maximum sensitivity to update schedules of elementary cellu..:

Ruivo, Eurico L.P. ; Balbi, Pedro Paulo ; Montalva-Medel, Marco.
Information and Computation. 274 (2020) - p. 104538 , 2020

Link: https://doi.org/10.1016/..