default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAdrien Richard
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j26]Julio Aracena, Luis Cabrera-Crot
, Adrien Richard, Lilian Salinas:
Dynamically equivalent disjunctive networks. Theor. Comput. Sci. 1024: 114899 (2025)- 2024
- [c12]Florian Bridoux, Christophe Crespelle, Thi Ha Duong Phan, Adrien Richard:
Dividing Permutations in the Semiring of Functional Digraphs. AUTOMATA 2024: 95-107 - [i26]Florian Bridoux, Aymeric Picard Marchetto, Adrien Richard:
Asynchronous dynamics of isomorphic Boolean networks. CoRR abs/2402.03092 (2024) - [i25]Florian Bridoux, Aymeric Picard Marchetto, Adrien Richard:
Interaction graphs of isomorphic automata networks II: universal dynamics. CoRR abs/2409.08041 (2024) - 2023
- [j25]Julio Aracena, Adrien Richard, Lilian Salinas:
Synchronizing Boolean networks asynchronously. J. Comput. Syst. Sci. 136: 249-279 (2023) - [j24]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) - [j23]Aurélien Naldi, Adrien Richard, Elisa Tonello:
Linear cuts in Boolean networks. Nat. Comput. 22(3): 431-451 (2023) - [j22]Adrien Richard, Elisa Tonello:
Attractor separation and signed cycles in asynchronous Boolean networks. Theor. Comput. Sci. 947: 113706 (2023) - [i24]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
- [j21]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) - [c11]Enrico Formenti, Christophe Papazian, Adrien Richard, Pierre-Alain Scribot:
From Additive Flowers to Additive Automata Networks. Automata and Complexity 2022: 323-343 - [i23]Adrien Richard:
Nilpotent dynamics on signed interaction graphs and weak converses of Thomas' rules. CoRR abs/2201.08596 (2022) - [i22]Adrien Richard:
Positive and negative cycles in Boolean networks. CoRR abs/2201.08600 (2022) - [i21]Aurélien Naldi, Adrien Richard, Elisa Tonello:
Linear cuts in Boolean networks. CoRR abs/2203.01620 (2022) - [i20]Julio Aracena, Adrien Richard, Lilian Salinas:
Synchronizing Boolean networks asynchronously. CoRR abs/2203.05298 (2022) - [i19]Adrien Richard, Elisa Tonello:
Attractor separation and signed cycles in asynchronous Boolean networks. CoRR abs/2206.11651 (2022) - 2021
- [i18]Aymeric Picard Marchetto, Adrien Richard:
Isomorphic Boolean networks and dense interaction graphs. CoRR abs/2105.01914 (2021) - 2020
- [j20]Julio Aracena, Maximilien Gadouleau, Adrien Richard, Lilian Salinas:
Fixing monotone Boolean networks asynchronously. Inf. Comput. 274: 104540 (2020) - [i17]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
- [j19]Adrien Richard:
Nilpotent dynamics on signed interaction graphs and weak converses of Thomas' rules. Discret. Appl. Math. 267: 160-175 (2019) - [j18]Gilles Bernot, Jean-Paul Comet, Zohra Khalis, Adrien Richard, Olivier F. Roux:
A genetically modified Hoare logic. Theor. Comput. Sci. 765: 145-157 (2019) - [c10]Florian Bridoux, Nicolas Durbec, Kévin Perrot, Adrien Richard:
Complexity of Maximum Fixed Point Problem in Boolean Networks. CiE 2019: 132-143 - 2018
- [j17]Adrien Richard:
Fixed points and connections between positive and negative cycles in Boolean networks. Discret. Appl. Math. 243: 1-10 (2018) - [c9]Maximilien Gadouleau, Adrien Richard:
On Fixable Families of Boolean Networks. ACRI 2018: 396-405 - [i16]Julio Aracena, Maximilien Gadouleau, Adrien Richard, Lilian Salinas:
Fixing monotone Boolean networks asynchronously. CoRR abs/1802.02068 (2018) - [i15]Maximilien Gadouleau, Adrien Richard:
On fixable families of Boolean networks. CoRR abs/1804.01931 (2018) - 2017
- [j16]Julio Aracena, Adrien Richard, Lilian Salinas:
Fixed points in conjunctive networks and maximal independent sets in graph contractions. J. Comput. Syst. Sci. 88: 145-163 (2017) - [j15]Julio Aracena, Adrien Richard, Lilian Salinas:
Number of Fixed Points and Disjoint Cycles in Monotone Boolean Networks. SIAM J. Discret. Math. 31(3): 1702-1725 (2017) - 2016
- [j14]Maximilien Gadouleau, Adrien Richard:
Simple dynamics on graphs. Theor. Comput. Sci. 628: 62-77 (2016) - [j13]Maximilien Gadouleau, Adrien Richard, Eric Fanchon:
Reduction and Fixed Points of Boolean Networks and Linear Network Coding Solvability. IEEE Trans. Inf. Theory 62(5): 2504-2519 (2016) - [c8]Tarek Melliti, Damien Regnault, Adrien Richard, Sylvain Sené:
Asynchronous Simulation of Boolean Networks by Monotone Boolean Networks. ACRI 2016: 182-191 - [i14]Julio Aracena, Adrien Richard, Lilian Salinas:
Number of fixed points and disjoint cycles in monotone Boolean networks. CoRR abs/1602.03109 (2016) - [i13]Tarek Melliti, Damien Regnault, Adrien Richard, Sylvain Sené:
Asynchronous simulation of Boolean networks by monotone Boolean networks. CoRR abs/1606.05172 (2016) - 2015
- [j12]Maximilien Gadouleau, Adrien Richard, Søren Riis:
Fixed Points of Boolean Networks, Guessing Graphs, and Coding Theory. SIAM J. Discret. Math. 29(4): 2312-2335 (2015) - [j11]Adrien Richard:
Fixed point theorems for Boolean networks expressed in terms of forbidden subnetworks. Theor. Comput. Sci. 583: 1-26 (2015) - [i12]Maximilien Gadouleau, Adrien Richard:
Simple dynamics on graphs. CoRR abs/1503.04688 (2015) - [i11]Gilles Bernot, Jean-Paul Comet, Zohra Khalis, Adrien Richard, Olivier F. Roux:
A Genetically Modified Hoare Logic. CoRR abs/1506.05887 (2015) - [i10]Julio Aracena, Adrien Richard, Lilian Salinas:
Fixed points in conjunctive networks and maximal independent sets in graph contractions. CoRR abs/1507.06141 (2015) - [i9]Adrien Richard:
Fixed points and connexions between positive and negative cycles in Boolean networks. CoRR abs/1509.07702 (2015) - 2014
- [j10]Julio Aracena, Adrien Richard, Lilian Salinas:
Maximum number of fixed points in AND-OR-NOT networks. J. Comput. Syst. Sci. 80(7): 1175-1190 (2014) - [i8]Maximilien Gadouleau, Adrien Richard, Søren Riis:
Fixed points of Boolean networks, guessing graphs, and coding theory. CoRR abs/1409.6144 (2014) - [i7]Maximilien Gadouleau, Adrien Richard, Eric Fanchon:
Reduction and Fixed Points of Boolean Networks and Linear Network Coding Solvability. CoRR abs/1412.5310 (2014) - 2013
- [j9]Adrien Richard, Paul Ruet:
From kernels in directed graphs to fixed points and negative cycles in Boolean networks. Discret. Appl. Math. 161(7-8): 1106-1117 (2013) - [c7]Tarek Melliti, Damien Regnault, Adrien Richard, Sylvain Sené:
On the Convergence of Boolean Automata Networks without Negative Cycles. Automata 2013: 124-138 - [i6]Adrien Richard:
Fixed point theorems for Boolean networks expressed in terms of forbidden subnetworks. CoRR abs/1302.6346 (2013) - 2011
- [j8]Adrien Richard:
Local negative circuits and fixed points in non-expansive Boolean networks. Discret. Appl. Math. 159(11): 1085-1093 (2011) - [j7]Mbarka Mabrouki, Marc Aiguier, Jean-Paul Comet, Pascale Le Gall, Adrien Richard:
Embedding of Biological Regulatory Networks and Property Preservation. Math. Comput. Sci. 5(3): 263-288 (2011) - [c6]Adrien Richard:
A fixed point theorem for Boolean networks expressed in terms of forbidden subnetworks. Automata 2011: 1-16 - [c5]Jacques M. Bahi, Jean-François Couchot, Christophe Guyeux, Adrien Richard:
On the Link between Strongly Connected Iteration Graphs and Chaotic Boolean Discrete-Time Dynamical Systems. FCT 2011: 126-137 - [c4]Loïc Paulevé, Adrien Richard:
Static Analysis of Boolean Networks Based on Interaction Graphs: A Survey. SASB 2011: 93-104 - [i5]Jacques M. Bahi, Jean-François Couchot, Christophe Guyeux, Adrien Richard:
On the Link Between Strongly Connected Iteration Graphs and Chaotic Boolean Discrete-Time Dynamical Systems. CoRR abs/1112.1684 (2011) - 2010
- [j6]Adrien Richard:
Negative circuits and sustained oscillations in asynchronous automata networks. Adv. Appl. Math. 44(4): 378-392 (2010)
2000 – 2009
- 2009
- [j5]Adrien Richard:
Positive circuits and maximal number of fixed points in discrete dynamical systems. Discret. Appl. Math. 157(15): 3281-3288 (2009) - [c3]Maxime Dénès, Benjamin Lesage, Yves Bertot, Adrien Richard:
Formal Proof of Theorems on Genetic Regulatory Networks. SYNASC 2009: 69-76 - [i4]Adrien Richard:
Negative circuits and sustained oscillations in asynchronous automata networks. CoRR abs/0907.5096 (2009) - [i3]Adrien Richard:
Local negative circuits and fixed points in Boolean networks. CoRR abs/0910.0750 (2009) - 2008
- [j4]Adrien Richard:
An extension of a combinatorial fixed point theorem of Shih and Dong. Adv. Appl. Math. 41(4): 620-627 (2008) - [j3]Jamil Ahmad, Olivier F. Roux, Gilles Bernot, Jean-Paul Comet, Adrien Richard:
Analysing formal models of genetic regulatory networks with delays. Int. J. Bioinform. Res. Appl. 4(3): 240-262 (2008) - [i2]Adrien Richard:
Positive circuits and maximal number of fixed points in discrete dynamical systems. CoRR abs/0807.4229 (2008) - [i1]Adrien Richard:
On the length of attractors in boolean networks with an interaction graph by layers. CoRR abs/0810.5482 (2008) - 2007
- [j2]Adrien Richard, Jean-Paul Comet:
Necessary conditions for multistationarity in discrete dynamical systems. Discret. Appl. Math. 155(18): 2403-2413 (2007) - 2006
- [c2]Jamil Ahmad, Adrien Richard, Gilles Bernot, Jean-Paul Comet, Olivier F. Roux:
Delays in Biological Regulatory Networks (BRN). International Conference on Computational Science (2) 2006: 887-894 - 2005
- [j1]Adrien Richard, Jean-Paul Comet, Gilles Bernot:
R. Thomas' Modeling of Biological Regulatory Networks: Introduction of Singular States in the Qualitative Dynamics. Fundam. Informaticae 65(4): 373-392 (2005) - 2004
- [c1]Adrien Richard, Jean-Paul Comet, Gilles Bernot:
Graph-Based Modeling of Biological Regulatory Networks: Introduction of Singular States. CMSB 2004: 58-72
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 2025-01-20 23:05 CET 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:
