![](https://dblp.org/img/logo.ua.320x120.png)
![](https://dblp.org/img/dropdown.dark.16x16.png)
![](https://dblp.org/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.org/img/search.dark.16x16.png)
![search dblp](https://dblp.org/img/search.dark.16x16.png)
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
Likely matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 79 matches
- 2024
- 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 - Kévin Perrot, Sylvain Sené, Léah Tapin:
Complexity of Boolean Automata Networks Under Block-Parallel Update Modes. SAND 2024: 19:1-19:19 - Kévin Perrot, Sylvain Sené, Léah Tapin:
Combinatorics of Block-Parallel Automata Networks. SOFSEM 2024: 442-455 - Victor H. Lutfalla, Kévin Perrot:
Polygonal corona limit on multigrid dual tilings. CoRR abs/2402.01257 (2024) - Kévin Perrot, Sylvain Sené, Léah Tapin:
Complexity of Boolean automata networks under block-parallel update modes. CoRR abs/2402.06294 (2024) - 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) - 2023
- 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) - Gino Perrotta, Luca Scheuer, Yocheved Kopel, Max Basescu, Adam Polevoy, Kevin C. Wolfe, Joseph L. Moore:
Planning and Control for a Dynamic Morphing-Wing UAV Using a Vortex Particle Model. IROS 2023: 6949-6954 - 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) - Guilhem Gamard, Pierre Guillon, Kévin Perrot, Guillaume Theyssier:
Hardness of monadic second-order formulae over succinct graphs. CoRR abs/2302.04522 (2023) - Kévin Perrot, Sylvain Sené, Léah Tapin:
On countings and enumerations of block-parallel automata networks. CoRR abs/2304.09664 (2023) - Gino Perrotta, Luca Scheuer, Yocheved Kopel, Max Basescu, Adam Polevoy, Kevin C. Wolfe, Joseph L. Moore:
Planning and Control for a Dynamic Morphing-Wing UAV Using a Vortex Particle Model. CoRR abs/2307.02371 (2023) - 2022
- 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 - Florian Bridoux
, Amélia Durbec
, Kévin Perrot, Adrien Richard
:
Complexity of fixed point counting problems in Boolean networks. J. Comput. Syst. Sci. 126: 138-164 (2022) - Viet-Ha Nguyen, Kévin Perrot:
Rikudo is NP-complete. Theor. Comput. Sci. 910: 34-47 (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: 21-50 (2022) - 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
- Eric Goles, Pedro Montealegre
, Kévin Perrot:
Freezing sandpiles and Boolean threshold networks: Equivalence and complexity. Adv. Appl. Math. 125: 102161 (2021) - Kévin Perrot, Pacôme Perrotin, Sylvain Sené:
On Boolean Automata Networks (de)Composition. Fundam. Informaticae 181(2-3): 163-188 (2021) - Franck Tarpin-Bernard, Joan Fruitet, Jean-Philippe Vigne, Patrick Constant, Hanna Chainay
, Olivier Koenig, Fabien Ringeval, Béatrice Bouchot, Gérard Bailly, François Portet
, Sina Alisamir, Yongxin Zhou, Jean Serre, Vincent Delerue, Hippolyte Fournier, Kévin Berenger, Isabella Zsoldos, Olivier Perrotin
, Frédéric Elisei, Martin Lenglet, Charles Puaux, Léo Pacheco, Mélodie Fouillen, Didier Ghenassia:
THERADIA: Digital Therapies Augmented by Artificial Intelligence. AHFE (1) 2021: 478-485 - Kévin Perrot, Pacôme Perrotin, Sylvain Sené:
Optimising Attractor Computation in Boolean Automata Networks. LATA 2021: 68-80 - Ryan W. Gardner, Gino Perrotta, Anvay Shah, Shivaram Kalyanakrishnan, Kevin A. Wang, Gregory Clark, Timo Bertram, Johannes Fürnkranz, Martin Müller, Brady P. Garrison, Prithviraj Dasgupta, Saeid Rezaei:
The Machine Reconnaissance Blind Chess Tournament of NeurIPS 2022. NeurIPS (Competition and Demos) 2021: 119-132 - Gino Perrotta, Ryan W. Gardner, Corey Lowman, Mohammad Taufeeque, Nitish Tongia, Shivaram Kalyanakrishnan, Gregory Clark, Kevin Wang, Eitan Rothberg, Brady P. Garrison, Prithviraj Dasgupta, Callum Canavan, Lucas McCabe:
The Second NeurIPS Tournament of Reconnaissance Blind Chess. NeurIPS (Competition and Demos) 2021: 53-65 - Florian Bridoux, Caroline Gaze-Maillot, Kévin Perrot, Sylvain Sené:
Complexity of Limit-Cycle Problems in Boolean Networks. SOFSEM 2021: 135-146 - Guilhem Gamard, Pierre Guillon, Kévin Perrot, Guillaume Theyssier:
Rice-Like Theorems for Automata Networks. STACS 2021: 32:1-32:17 - Alonso Castillo-Ramirez
, Pierre Guillon
, Kévin Perrot:
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] - Eric Goles, Pedro Montealegre, Kévin Perrot:
Freezing sandpiles and Boolean threshold networks: equivalence and complexity. CoRR abs/2101.04204 (2021) - Viet-Ha Nguyen, Kévin Perrot:
Rikudo is NP-complete. CoRR abs/2101.09332 (2021) - 2020
- Enrico Formenti
, Kévin Perrot:
How Hard is it to Predict Sandpiles on Lattices? A Survey. Fundam. Informaticae 171(1-4): 189-219 (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: 104538 (2020)
skipping 49 more matches
loading more results
failed to load more results, please try again later
![](https://dblp.org/img/cog.dark.24x24.png)
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.
retrieved on 2024-08-26 22:27 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint