The parameterized complexity of probability amplification. - J. Andrés Montoya (Inf. Process. Lett., 2008)

On the Complexity of Sandpile Prediction Problems. - J. Andrés Montoya; Carolina Mejía (AUTOMATA, 2009)

La Complejidad Paramétrica de Minar Grafos 1, Resultados Negativos. - J. Andrés Montoya (Rev. Colomb. de Computación, 2009)

La Complejidad Paramétrica de Minar Grafos 2, Resultados Positivos. - J. Andrés Montoya (Rev. Colomb. de Computación, 2009)

The Complexity of Three-Dimensional Critical Avalanches. - Carolina Mejía; J. Andrés Montoya (ACRI, 2010)

Some Applications of the Schutzenberger-Bertoni Method. - J. Andrés Montoya; Francisco Gutierrez; Luis E. Zambrano (Electron. Notes Discret. Math., 2011)

On the parameterized complexity of approximate counting. - J. Andrés Montoya (RAIRO Theor. Informatics Appl., 2011)

On the complexity of sandpile critical avalanches. - Carolina Mejía; J. Andrés Montoya (Theor. Comput. Sci., 2011)

Computing with Sand: On the Complexity of Recognizing Two-dimensional Sandpile Critical Configurations. - J. Andres Montoya (UCNC, 2012)

Some Remarks Concerning the Algorithmic Analysis of Gene Regulatory Networks. - J. Andrés Montoya; Carolina Mejía (CLEI Selected Papers, 2012)

On the Complexity of the Abelian Sandpile Model: Communication Complexity and Statistical Mechanics. - J. Andres Montoya (Complex Syst., 2013)

Parameterized Random Complexity. - Juan Andrés Montoya; Moritz Müller (Theory Comput. Syst., 2013)

Network coding and the model theory of linear information inequalities. - Arley Gomez; Carolina Mejía; J. Andres Montoya (NetCod, 2014)

Linear network coding and the model theory of linear rank inequalities. - Arley Gomez; Carolina Mejía; J. Andrés Montoya (NetCod, 2014)

On discerning strings with finite automata. - Abuzer Yakaryilmaz; J. Andres Montoya (CLEI, 2015)

On the Real-state Processing of Regular Operations and The Sakoda-Sipser Problem. - J. Andres Montoya; David Casas (CLEI Selected Papers, 2015)

Looking for Pairs that Hard to Separate: A Quantum Approach. - Aleksandrs Belovs; J. Andres Montoya; Abuzer Yakaryilmaz (CIAA, 2016)

Can one quantum bit separate any pair of words with zero-error? - Aleksandrs Belovs; Juan Andrés Montoya; Abuzer Yakaryilmaz (CoRR, 2016)

Open Problems Related to Palindrome Recognition: Are There Open Problems Related to Palindrome Recognition? - J. Andres Montoya (J. Autom. Lang. Comb., 2016)

The Power of Writing, a Pebble Hierarchy and a Narrative for the Teaching of Automata Theory. - Carolina Mejía; J. Andres Montoya; Christian Nolasco (CLEI Selected Papers, 2017)

Some Remarks on Synchronization, Games and Planar Automata. - Juan Andrés Montoya; Christian Nolasco (CLEI Selected Papers, 2017)

On a Conjecture by Christian Choffrut. - Aleksandrs Belovs; J. Andres Montoya; Abuzer Yakaryilmaz (Int. J. Found. Comput. Sci., 2017)

Defining the almost-entropic regions by algebraic inequalities. - Arley Gomez; Carolina Mejía Corredor; J. Andres Montoya (Int. J. Inf. Coding Theory, 2017)

On the Synchronization of Planar Automata. - J. Andres Montoya; Christian Nolasco (LATA, 2018)

Abelian sharing, common informations, and linear rank inequalities. - Carolina Mejía; Juan Andrés Montoya (J. Math. Cryptol., 2022)

On the predictability of the abelian sandpile model. - J. Andres Montoya; Carolina Mejía (Nat. Comput., 2022)

L is different from NP. - J. Andres Montoya (CoRR, 2024)

Relative Densities of Formal Languages. - J. Andres Montoya (DCFS, 2025)

Asymptotic Reasoning With Two Variables. - J. Andres Montoya (WoLLIC, 2025)