default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJulio Aracena
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j20]Julio Aracena, Luis Cabrera-Crot
, Adrien Richard, Lilian Salinas:
Dynamically equivalent disjunctive networks. Theor. Comput. Sci. 1024: 114899 (2025)- [i9]Arturo Zapata-Cortés, Julio Aracena:
Hamiltonian dynamics of Boolean networks. CoRR abs/2501.03175 (2025) - 2023
- [j19]Julio Aracena, Christopher Thraves Caro:
The weighted sitting closer to friends than enemies problem in the line. J. Comb. Optim. 45(1): 9 (2023) - [j18]Julio Aracena, Adrien Richard, Lilian Salinas:
Synchronizing Boolean networks asynchronously. J. Comput. Syst. Sci. 136: 249-279 (2023) - [j17]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) - 2022
- [c2]Lilian Salinas, Luis Gómez, Julio Aracena:
Existence and Non Existence of Limit Cycles in Boolean Networks. Automata and Complexity 2022: 233-252 - [i8]Julio Aracena, Adrien Richard, Lilian Salinas:
Synchronizing Boolean networks asynchronously. CoRR abs/2203.05298 (2022) - [i7]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
- [j16]Julio Aracena, Luis Cabrera-Crot, Lilian Salinas:
Finding the fixed points of a Boolean network from a positive feedback vertex set. Bioinform. 37(8): 1148-1155 (2021) - [i6]Julio Aracena, Christopher Thraves Caro:
On the Recognition of Strong-Robinsonian Incomplete Matrices. CoRR abs/2101.03033 (2021) - 2020
- [j15]Julio Aracena, Maximilien Gadouleau, Adrien Richard, Lilian Salinas:
Fixing monotone Boolean networks asynchronously. Inf. Comput. 274: 104540 (2020) - [i5]Julio Aracena, Luis Cabrera-Crot, Lilian Salinas:
Finding the fixed points of a Boolean network from a positive feedback vertex set. CoRR abs/2004.01259 (2020)
2010 – 2019
- 2019
- [i4]Julio Aracena, Christopher Thraves Caro:
The Weighted Sitting Closer to Friends than Enemies Problem in the Line. CoRR abs/1906.11812 (2019) - 2018
- [i3]Julio Aracena, Maximilien Gadouleau, Adrien Richard, Lilian Salinas:
Fixing monotone Boolean networks asynchronously. CoRR abs/1802.02068 (2018) - 2017
- [j14]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) - [j13]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
- [j12]Eduardo Palma, Lilian Salinas, Julio Aracena:
Enumeration and extension of non-equivalent deterministic update schedules in Boolean networks. Bioinform. 32(5): 722-729 (2016) - [i2]Julio Aracena, Adrien Richard, Lilian Salinas:
Number of fixed points and disjoint cycles in monotone Boolean networks. CoRR abs/1602.03109 (2016) - 2015
- [i1]Julio Aracena, Adrien Richard, Lilian Salinas:
Fixed points in conjunctive networks and maximal independent sets in graph contractions. CoRR abs/1507.06141 (2015) - 2014
- [j11]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) - 2013
- [j10]Julio Aracena, Luis Gómez, Lilian Salinas:
Limit cycles and update digraphs in Boolean networks. Discret. Appl. Math. 161(1-2): 1-12 (2013) - [j9]Julio Aracena, Jacques Demongeot, Eric Fanchon, Marco Montalva:
On the number of update digraphs and its relation with the feedback arc sets and tournaments. Discret. Appl. Math. 161(10-11): 1345-1355 (2013) - 2011
- [j8]Julio Aracena, Eric Fanchon, Marco Montalva, Mathilde Noual:
Combinatorics on update digraphs in Boolean networks. Discret. Appl. Math. 159(6): 401-409 (2011)
2000 – 2009
- 2009
- [j7]Julio Aracena, Eric Goles Ch., Andrés Moreira, Luis Salinas:
On the robustness of update schedules in Boolean networks. Biosyst. 97(1): 1-8 (2009) - 2008
- [j6]Marco Montalva, Julio Aracena, Anahí Gajardo:
On the complexity of feedback set problems in signed digraphs. Electron. Notes Discret. Math. 30: 249-254 (2008) - 2004
- [j5]Julio Aracena, Jacques Demongeot, Eric Goles Ch.:
Fixed points and maximal independent sets in AND-OR networks. Discret. Appl. Math. 138(3): 277-288 (2004) - [j4]Julio Aracena, Jacques Demongeot, Eric Goles Ch.:
On limit cycles of monotone functions with symmetric connection graph. Theor. Comput. Sci. 322(2): 237-244 (2004) - [j3]Julio Aracena, Jacques Demongeot, Eric Goles Ch.:
Positive and negative circuits in discrete neural networks. IEEE Trans. Neural Networks 15(1): 77-83 (2004) - 2003
- [j2]Julio Aracena, Eric Goles Ch.:
Complexity of perceptron recognition for a class of geometric patterns. Theor. Comput. Sci. 299(1-3): 65-79 (2003) - [j1]Julio Aracena, S. B. Lamine, Marie-Ange Mermet, Olivier Cohen, Jacques Demongeot:
Mathematical modeling in genetic networks: relationships between the genetic expression and both chromosomic breakage and positive circuits. IEEE Trans. Syst. Man Cybern. Part B 33(5): 825-834 (2003) - 2000
- [c1]Julio Aracena, S. B. Lamine, Marie-Ange Mermet, Olivier Cohen, Jacques Demongeot:
The genetic expressions and both chromosomic breakage and positive circuits. BIBE 2000: 141-149
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-02-20 00:50 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:
