default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFlorian Bridoux
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c7]Florian Bridoux, Christophe Crespelle, Thi Ha Duong Phan, Adrien Richard:
Dividing Permutations in the Semiring of Functional Digraphs. AUTOMATA 2024: 95-107- [i11]Florian Bridoux, Aymeric Picard Marchetto, Adrien Richard:
Asynchronous dynamics of isomorphic Boolean networks. CoRR abs/2402.03092 (2024) - [i10]Florian Bridoux, Aymeric Picard Marchetto, Adrien Richard:
Interaction graphs of isomorphic automata networks II: universal dynamics. CoRR abs/2409.08041 (2024) - 2023
- [j6]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) - [j5]Julio Aracena, Florian Bridoux, Luis Gómez, Lilian Salinas:
Complexity of limit cycles with block-sequential update schedules in conjunctive networks. Nat. Comput. 22(3): 411-429 (2023) - [i9]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) - 2022
- [j4]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) - [j3]Florian Bridoux:
Sequentialization and procedural complexity in automata networks. Theor. Comput. Sci. 898: 92-109 (2022) - [i8]Julio Aracena, Florian Bridoux, Luis Gómez, Lilian Salinas:
Complexity of limit cycles with block-sequential update schedules in conjunctive networks. CoRR abs/2203.11361 (2022) - 2021
- [c6]Florian Bridoux, Caroline Gaze-Maillot, Kévin Perrot, Sylvain Sené:
Complexity of Limit-Cycle Problems in Boolean Networks. SOFSEM 2021: 135-146 - 2020
- [j2]Florian Bridoux, Alonso Castillo-Ramirez, Maximilien Gadouleau:
Complete simulation of automata networks. J. Comput. Syst. Sci. 109: 1-21 (2020) - [j1]Florian Bridoux, Maximilien Gadouleau, Guillaume Theyssier:
Expansive automata networks. Theor. Comput. Sci. 843: 25-44 (2020) - [c5]Florian Bridoux, Maximilien Gadouleau, Guillaume Theyssier:
Commutative Automata Networks. Automata 2020: 43-58 - [c4]Florian Bridoux, Maximilien Gadouleau, Guillaume Theyssier:
On Simulation in Automata Networks. CiE 2020: 277-288 - [i7]Florian Bridoux, Caroline Gaze-Maillot, Kévin Perrot, Sylvain Sené:
Complexity of limit-cycle problems in Boolean networks. CoRR abs/2001.07391 (2020) - [i6]Florian Bridoux, Maximilien Gadouleau, Guillaume Theyssier:
Simulation of automata networks. CoRR abs/2001.09198 (2020) - [i5]Florian Bridoux, Maximilien Gadouleau, Guillaume Theyssier:
Commutative automata networks. CoRR abs/2004.09806 (2020) - [i4]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
- [b1]Florian Bridoux:
Simulations intrinsèques et complexités dans les réseaux d'automates. (Intrinsic simulations and complexities in automata networks). Aix-Marseille University, Marseille, France, 2019 - [c3]Florian Bridoux, Nicolas Durbec, Kévin Perrot, Adrien Richard:
Complexity of Maximum Fixed Point Problem in Boolean Networks. CiE 2019: 132-143 - [i3]Florian Bridoux, Maximilien Gadouleau, Guillaume Theyssier:
Expansive Automata Networks. CoRR abs/1902.08007 (2019) - 2018
- [i2]Florian Bridoux:
Sequentialization and Procedural Complexity in Automata Networks. CoRR abs/1803.00438 (2018) - 2017
- [c2]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 - [i1]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) - 2015
- [c1]Nicolas Dugué, Anthony Perez, Maximilien Danisch, Florian Bridoux, Amélie Daviau, Tennessy Kolubako, Simon Munier, Hugo Durbano:
A reliable and evolutive web application to detect social capitalists. ASONAM 2015: 741-744
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-22 20:09 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:
