J. Andrés Montoya

发表

La Complejidad Paramétrica de Minar Grafos 1, Resultados Negativos

J. Andrés Montoya, 2009, Rev. Colomb. de Computación.

Computing with Sand: On the Complexity of Recognizing Two-dimensional Sandpile Critical Configurations

J. Andrés Montoya, 2012, UCNC.

On discerning strings with finite automata

Abuzer Yakaryilmaz, J. Andrés Montoya, 2015, 2015 Latin American Computing Conference (CLEI).

Open Problems Related to Palindrome Recognition: Are There Open Problems Related to Palindrome Recognition?

J. Andrés Montoya, 2016, J. Autom. Lang. Comb..

On the Complexity of the Abelian Sandpile Model: Communication Complexity and Statistical Mechanics

J. Andrés Montoya, J. Montoya, 2012, Complex Syst..

Some Remarks on Synchronization, Games and Planar Automata

J. Andrés Montoya, Christian Nolasco, 2017, CLEI Selected Papers.

Looking for Pairs that Hard to Separate: A Quantum Approach

Abuzer Yakaryilmaz, Aleksandrs Belovs, J. Andrés Montoya, 2016, CIAA.

On the Complexity of Sandpile Prediction Problems

J. Andrés Montoya, Carolina Mejía, 2009, Electron. Notes Theor. Comput. Sci..

Linear network coding and the model theory of linear rank inequalities

J. Andrés Montoya, Carolina Mejía, Arley Gomez, 2014, 2014 International Symposium on Network Coding (NetCod).

On the parameterized complexity of approximate counting

J. Andrés Montoya, 2011, RAIRO Theor. Informatics Appl..

Can one quantum bit separate any pair of words with zero-error? pdf

Abuzer Yakaryilmaz, Aleksandrs Belovs, J. Andrés Montoya, 2016, ArXiv.

On the complexity of sandpile critical avalanches

J. Andrés Montoya, Carolina Mejía, J. Montoya, 2011, Theor. Comput. Sci..

Network coding and the model theory of linear information inequalities

J. Andrés Montoya, Carolina Mejía, Arley Gomez, 2014, 2014 International Symposium on Network Coding (NetCod).

Some Remarks Concerning the Algorithmic Analysis of Gene Regulatory Networks

J. Andrés Montoya, Carolina Mejía, 2012, CLEI Selected Papers.

Some Applications of the Schutzenberger-Bertoni Method

J. Andrés Montoya, Luis E. Zambrano, Francisco Gutierrez, 2011, Electron. Notes Discret. Math..

The Complexity of Three-Dimensional Critical Avalanches

J. Andrés Montoya, Carolina Mejía, 2010, ACRI.

On the real-state processing of regular operations and the Sakoda-Sipser problem

J. Andrés Montoya, David Casas, J. Montoya, 2015, 2015 Latin American Computing Conference (CLEI).

On a Conjecture by Christian Choffrut

Abuzer Yakaryilmaz, Aleksandrs Belovs, J. Andrés Montoya, 2017, Int. J. Found. Comput. Sci..

On the real-state processing of regular operations and the Sakoda-Sipser problem

J. Andrés Montoya, David Casas, 2015, CLEI.

The Power of Writing, a Pebble Hierarchy and a Narrative for the Teaching of Automata Theory

J. Andrés Montoya, Carolina Mejía, Christian Nolasco, 2017, CLEI Selected Papers.

On the synchronization of planar automata

J. Andrés Montoya, Christian Nolasco, J. Montoya, 2016, LATA.

The parameterized complexity of probability amplification

J. Andrés Montoya, 2008, Inf. Process. Lett..

Parameterized Random Complexity

Moritz Müller, J. Andrés Montoya, J. Montoya, 2013, Theory of Computing Systems.

La Complejidad Paramétrica de Minar Grafos 2, Resultados Positivos

J. Andrés Montoya, 2009, Rev. Colomb. de Computación.

Defining the almost-entropic regions by algebraic inequalities

J. Andrés Montoya, Carolina Mejía, Arley Gomez, 2017, Int. J. Inf. Coding Theory.