J. Andrés Montoya

Nat. Comput., 2022

Abelian sharing, common informations, and linear rank inequalities.

[BibT_eX]

[DOI]

J. Math. Cryptol., 2022

2018

On the Synchronization of Planar Automata.

[BibT_eX]

[DOI]

Christian Nolasco

Proceedings of the Language and Automata Theory and Applications, 2018

2017

Defining the almost-entropic regions by algebraic inequalities.

[BibT_eX]

[DOI]

Arley Gomez

Carolina Mejía Corredor

Int. J. Inf. Coding Theory, 2017

On a Conjecture by Christian Choffrut.

[BibT_eX]

[DOI]

Aleksandrs Belovs

Int. J. Found. Comput. Sci., 2017

Some Remarks on Synchronization, Games and Planar Automata.

[BibT_eX]

[DOI]

Christian Nolasco

Proceedings of the XLIII Latin American Computer Conference - Selected Papers, 2017

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

[BibT_eX]

[DOI]

Christian Nolasco

Proceedings of the XLIII Latin American Computer Conference - Selected Papers, 2017

2016

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

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 2016

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

[BibT_eX]

[DOI]

Aleksandrs Belovs

CoRR, 2016

Looking for Pairs that Hard to Separate: A Quantum Approach.

[BibT_eX]

[DOI]

Aleksandrs Belovs

Proceedings of the Implementation and Application of Automata, 2016

2015

On the Real-state Processing of Regular Operations and The Sakoda-Sipser Problem.

[BibT_eX]

[DOI]

David Casas

Proceedings of the XLI Latin American Computer Conference - Selected Papers, 2015

On discerning strings with finite automata.

[BibT_eX]

[DOI]

Proceedings of the 2015 Latin American Computing Conference, 2015

2014

Linear network coding and the model theory of linear rank inequalities.

[BibT_eX]

[DOI]

Arley Gomez

Proceedings of the International Symposium on Network Coding, 2014

Network coding and the model theory of linear information inequalities.

[BibT_eX]

[DOI]

Arley Gomez

Proceedings of the International Symposium on Network Coding, 2014

2013

Parameterized Random Complexity.

[BibT_eX]

[DOI]

Moritz Müller

Theory Comput. Syst., 2013

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

[BibT_eX]

[DOI]

Complex Syst., 2013

2012

Some Remarks Concerning the Algorithmic Analysis of Gene Regulatory Networks.

[BibT_eX]

[DOI]

Proceedings of the XXXVIII Latin American Computer Conference - Selected Papers, 2012

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

[BibT_eX]

[DOI]

Proceedings of the Unconventional Computation and Natural Computation, 2012

2011

On the complexity of sandpile critical avalanches.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2011

On the parameterized complexity of approximate counting.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2011

Some Applications of the Schutzenberger-Bertoni Method.

[BibT_eX]

[DOI]

Francisco Gutierrez

Luis E. Zambrano

Electron. Notes Discret. Math., 2011

2010

The Complexity of Three-Dimensional Critical Avalanches.

[BibT_eX]

[DOI]

Proceedings of the Cellular Automata, 2010

2009

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

[BibT_eX]

[DOI]

Rev. Colomb. de Computación, 2009

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

[BibT_eX]

[DOI]

Rev. Colomb. de Computación, 2009

On the Complexity of Sandpile Prediction Problems.

[BibT_eX]

[DOI]

Proceedings of the 15th International Workshop on Cellular Automata and Discrete Complex Systems, 2009

2008

The parameterized complexity of probability amplification.

[BibT_eX]

[DOI]