Florian Bridoux

According to our database, Florian Bridoux authored at least 14 papers between 2015 and 2024.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2024

Asynchronous dynamics of isomorphic Boolean networks.

Florian Bridoux, Aymeric Picard Marchetto, Adrien Richard

CoRR, 2024

2023

Interaction graphs of isomorphic automata networks I: Complete digraph and minimum in-degree.

Florian Bridoux, Kévin Perrot, Aymeric Picard Marchetto, Adrien Richard

J. Comput. Syst. Sci., December, 2023

Complexity of limit cycles with block-sequential update schedules in conjunctive networks.

Julio Aracena, Florian Bridoux, Luis Gómez, Lilian Salinas

Nat. Comput., September, 2023

2022

Sequentialization and procedural complexity in automata networks.

Florian Bridoux

Theor. Comput. Sci., 2022

Complexity of fixed point counting problems in Boolean networks.

Florian Bridoux, Amélia Durbec, Kévin Perrot, Adrien Richard

J. Comput. Syst. Sci., 2022

2021

Complexity of Limit-Cycle Problems in Boolean Networks.

Florian Bridoux, Caroline Gaze-Maillot, Kévin Perrot, Sylvain Sené

Proceedings of the SOFSEM 2021: Theory and Practice of Computer Science, 2021

2020

Expansive automata networks.

Florian Bridoux, Maximilien Gadouleau, Guillaume Theyssier

Theor. Comput. Sci., 2020

Complete simulation of automata networks.

Florian Bridoux, Alonso Castillo-Ramirez, Maximilien Gadouleau

J. Comput. Syst. Sci., 2020

On Simulation in Automata Networks.

Florian Bridoux, Maximilien Gadouleau, Guillaume Theyssier

Proceedings of the Beyond the Horizon of Computability, 2020

Commutative Automata Networks.

Florian Bridoux, Maximilien Gadouleau, Guillaume Theyssier

Proceedings of the Cellular Automata and Discrete Complex Systems, 2020

2019

Simulations intrinsèques et complexités dans les réseaux d'automates. (Intrinsic simulations and complexities in automata networks).

Florian Bridoux

PhD thesis, 2019

Complexity of Maximum Fixed Point Problem in Boolean Networks.

Florian Bridoux, Nicolas Durbec, Kévin Perrot, Adrien Richard

Proceedings of the Computing with Foresight and Industry, 2019

2017

On the Cost of Simulating a Parallel Boolean Automata Network by a Block-Sequential One.

Florian Bridoux, Pierre Guillon, Kévin Perrot, Sylvain Sené, Guillaume Theyssier

Proceedings of the Theory and Applications of Models of Computation, 2017

2015

A reliable and evolutive web application to detect social capitalists.

Nicolas Dugué, Anthony Perez, Maximilien Danisch, Florian Bridoux, Amélie Daviau, Tennessy Kolubako, Simon Munier, Hugo Durbano

Proceedings of the 2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, 2015