Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJ. Andrés Montoya
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2022
[j13]Carolina Mejía, Juan Andrés Montoya
:
Abelian sharing, common informations, and linear rank inequalities. J. Math. Cryptol. 16(1): 233-250 (2022)- [j12]J. Andres Montoya, Carolina Mejía:
On the predictability of the abelian sandpile model. Nat. Comput. 21(1): 69-79 (2022) - 2017
- [j11]Aleksandrs Belovs, J. Andres Montoya, Abuzer Yakaryilmaz:
On a Conjecture by Christian Choffrut. Int. J. Found. Comput. Sci. 28(5): 483-502 (2017) - [j10]Arley Gomez, Carolina Mejía Corredor, J. Andres Montoya:
Defining the almost-entropic regions by algebraic inequalities. Int. J. Inf. Coding Theory 4(1): 1-18 (2017) - 2016
- [j9]J. Andres Montoya:
Open Problems Related to Palindrome Recognition: Are There Open Problems Related to Palindrome Recognition? J. Autom. Lang. Comb. 20(1): 5-25 (2016) - 2013
- [j8]J. Andres Montoya:
On the Complexity of the Abelian Sandpile Model: Communication Complexity and Statistical Mechanics. Complex Syst. 21(4) (2013) - [j7]Juan Andrés Montoya, Moritz Müller:
Parameterized Random Complexity. Theory Comput. Syst. 52(2): 221-270 (2013) - 2011
- [j6]J. Andrés Montoya, Francisco Gutierrez, Luis E. Zambrano:
Some Applications of the Schutzenberger-Bertoni Method. Electron. Notes Discret. Math. 37: 93-98 (2011) - [j5]J. Andrés Montoya:
On the parameterized complexity of approximate counting. RAIRO Theor. Informatics Appl. 45(2): 197-223 (2011) - [j4]Carolina Mejía, J. Andrés Montoya:
On the complexity of sandpile critical avalanches. Theor. Comput. Sci. 412(30): 3964-3974 (2011) - 2009
- [j3]J. Andrés Montoya:
La Complejidad Paramétrica de Minar Grafos 1, Resultados Negativos. Rev. Colomb. de Computación 10(1): 1-17 (2009) - [j2]J. Andrés Montoya:
La Complejidad Paramétrica de Minar Grafos 2, Resultados Positivos. Rev. Colomb. de Computación 10(1): 1-20 (2009) - 2008
- [j1]J. Andrés Montoya:
The parameterized complexity of probability amplification. Inf. Process. Lett. 109(1): 46-53 (2008)
Conference and Workshop Papers
- 2018
- [c13]J. Andres Montoya, Christian Nolasco:
On the Synchronization of Planar Automata. LATA 2018: 93-104 - 2017
- [c12]Juan Andrés Montoya, Christian Nolasco:
Some Remarks on Synchronization, Games and Planar Automata. CLEI Selected Papers 2017: 85-97 - [c11]Carolina Mejía, J. Andres Montoya, Christian Nolasco:
The Power of Writing, a Pebble Hierarchy and a Narrative for the Teaching of Automata Theory. CLEI Selected Papers 2017: 99-110 - 2016
- [c10]Aleksandrs Belovs, J. Andres Montoya, Abuzer Yakaryilmaz:
Looking for Pairs that Hard to Separate: A Quantum Approach. CIAA 2016: 213-223 - 2015
- [c9]J. Andres Montoya, David Casas:
On the real-state processing of regular operations and the Sakoda-Sipser problem. CLEI 2015: 1-9 - [c8]Abuzer Yakaryilmaz, J. Andres Montoya:
On discerning strings with finite automata. CLEI 2015: 1-5 - [c7]J. Andres Montoya, David Casas:
On the Real-state Processing of Regular Operations and The Sakoda-Sipser Problem. CLEI Selected Papers 2015: 23-39 - 2014
- [c6]Arley Gomez, Carolina Mejía, J. Andres Montoya:
Network coding and the model theory of linear information inequalities. NetCod 2014: 1-6 - [c5]Arley Gomez, Carolina Mejía, J. Andrés Montoya:
Linear network coding and the model theory of linear rank inequalities. NetCod 2014: 1-5 - 2012
- [c4]J. Andres Montoya:
Computing with Sand: On the Complexity of Recognizing Two-dimensional Sandpile Critical Configurations. UCNC 2012: 174-185 - [c3]J. Andrés Montoya, Carolina Mejía:
Some Remarks Concerning the Algorithmic Analysis of Gene Regulatory Networks. CLEI Selected Papers 2012: 71-81 - 2010
- [c2]Carolina Mejía, J. Andrés Montoya:
The Complexity of Three-Dimensional Critical Avalanches. ACRI 2010: 153-162 - 2009
- [c1]J. Andrés Montoya, Carolina Mejía:
On the Complexity of Sandpile Prediction Problems. AUTOMATA 2009: 229-245
Informal and Other Publications
- 2024
- [i3]J. Andres Montoya:
L is different from NP. CoRR abs/2404.16562 (2024) - 2016
- [i2]Aleksandrs Belovs, Juan Andrés Montoya, Abuzer Yakaryilmaz:
Can one quantum bit separate any pair of words with zero-error? CoRR abs/1602.07967 (2016) - [i1]J. Andres Montoya, Christian Nolasco:
On the synchronization of planar automata. CoRR abs/1612.04462 (2016)
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-07-09 04:53 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:
