default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPacôme Perrotin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2021
[b1]Pacôme Perrotin:
Simulation entre modèles de calcul naturel et modularité des réseaux d'automate. (Simulation between natural computation models and automata networks modularity). Aix-Marseille University, France, 2021
Journal Articles
- 2024
- [j3]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) - 2023
- [j2]Pacôme Perrotin:
Associating parallel automata network dynamics and strictly one-way cellular automata. Nat. Comput. 22(3): 453-461 (2023) - 2021
- [j1]Kévin Perrot, Pacôme Perrotin, Sylvain Sené:
On Boolean Automata Networks (de)Composition. Fundam. Informaticae 181(2-3): 163-188 (2021)
Conference and Workshop Papers
- 2023
- [c4]Pacôme Perrotin, Sylvain Sené:
Turning Block-Sequential Automata Networks into Smaller Parallel Networks with Isomorphic Limit Dynamics. CiE 2023: 214-228 - 2021
- [c3]Kévin Perrot, Pacôme Perrotin, Sylvain Sené:
Optimising Attractor Computation in Boolean Automata Networks. LATA 2021: 68-80 - 2020
- [c2]Kévin Perrot, Pacôme Perrotin, Sylvain Sené:
On the Complexity of Acyclic Modules in Automata Networks. TAMC 2020: 168-180 - 2018
- [c1]Kévin Perrot, Pacôme Perrotin, Sylvain Sené:
A Framework for (De)composing with Boolean Automata Networks. MCU 2018: 121-136
Informal and Other Publications
- 2024
- [i7]Pacôme Perrotin, Eurico L. P. Ruivo, Pedro Paulo Balbi de Oliveira:
Fast solutions to k-parity and k-synchronisation using parallel automata networks. CoRR abs/2402.03306 (2024) - [i6]Pacôme Perrotin, Pedro Paulo Balbi de Oliveira, Eurico L. P. Ruivo:
A sequential solution to the density classification task using an intermediate alphabet. CoRR abs/2409.06536 (2024) - [i5]Benjamin Hellouin de Menibus, Pacôme Perrotin:
Alternating hierarchy of sushifts defined by nondeterministic plane-walking automata. CoRR abs/2409.08024 (2024) - 2023
- [i4]Pacôme Perrotin, Sylvain Sené:
Turning block-sequential automata networks into smaller parallel networks with isomorphic limit dynamics. CoRR abs/2304.13550 (2023) - 2020
- [i3]Kévin Perrot, Pacôme Perrotin, Sylvain Sené:
Optimising attractor computation in Boolean automata networks. CoRR abs/2005.14531 (2020) - 2019
- [i2]Kévin Perrot, Pacôme Perrotin, Sylvain Sené:
On the complexity of acyclic modules in automata networks. CoRR abs/1910.07299 (2019) - 2018
- [i1]Kévin Perrot, Pacôme Perrotin, Sylvain Sené:
A framework for (de)composing with Boolean automata networks. CoRR abs/1802.10400 (2018)
Coauthor Index
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-15 00:22 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:
