Följ
Juan Andres Montoya
Juan Andres Montoya
Matematicas, universidad nacional sede Bogota
Verifierad e-postadress på unal.edu.co
Titel
Citeras av
Citeras av
År
Parameterized random complexity
JA Montoya, M Müller
Theory of Computing Systems 52 (2), 221-270, 2013
182013
Can one quantum bit separate any pair of words with zero-error?
A Belovs, JA Montoya, A Yakaryılmaz
arXiv preprint arXiv:1602.07967, 2016
112016
On the stability analysis of chiral networks and the emergence of homochirality
JA Montoya, C Mejía, RD Bourdón, E Cruz, J Ágreda
MATCH Commun. Math. Comput. Chem 80 (2), 311-344, 2018
92018
Clima organizacional y su relación con la satisfacción laboral en el servicio de emergencia. Hospital de Alta Complejidad Virgen de la Puerta–EsSalud. La Libertad, Perú. 2017
L Acuña, J Montoya
Tesis para obtener el grado académico de Maestro en Gestión de los Servicios …, 2018
82018
On the linear algebra of biological homochirality
J Ágreda, C Mejía, JA Montoya
Journal of Mathematical Chemistry 56 (6), 1782-1810, 2018
72018
On a conjecture by Christian Choffrut
A Belovs, JA Montoya, A Yakaryılmaz
International Journal of Foundations of Computer Science 28 (05), 483-501, 2017
72017
Network coding and the model theory of linear information inequalities
A Gómez, C Mejía, JA Montoya
2014 International Symposium on Network Coding (NetCod), 1-6, 2014
72014
On the information rates of homomorphic secret sharing schemes
C Mejia, JA Montoya
Journal of Information and Optimization Sciences 39 (7), 1463-1482, 2018
62018
The parameterized complexity of probability amplification
JA Montoya
Information processing letters 109 (1), 46-53, 2008
62008
Defining the almost-entropic regions by algebraic inequalities
A Gomez, C Mejia, JA Montoya
International Journal of Information and Coding Theory 4 (1), 1-18, 2017
52017
Linear network coding and the model theory of linear rank inequalities
A Gómez, C Mejía, JA Montoya
2014 International Symposium on Network Coding (NetCod), 1-5, 2014
52014
On the complexity of sandpile critical avalanches
C Mejia, JA Montoya
Theoretical computer science 412 (30), 3964-3974, 2011
52011
On the complexity of sandpile prediction problems
JA Montoya, C Mejía
Electronic Notes in Theoretical Computer Science 252, 229-245, 2009
52009
On parameterized counting
JA Montoya
Freiburg (Breisgau), Univ., Diss., 2008, 2008
52008
Looking for pairs that hard to separate: A quantum approach
A Belovs, JA Montoya, A Yakaryılmaz
International Conference on Implementation and Application of Automata, 213-223, 2016
42016
Contribuciones a la teoría de modelos de haces
A Montoya
Lecturas matemáticas 28 (1), 5-37, 2007
42007
On the synchronization of small sets of states
J Montoya, C Nolasco
Applied Mathematical Sciences 11 (44), 2151-2173, 2017
32017
On discerning strings with finite automata
A Yakaryilmaz, JA Montoya
2015 Latin American Computing Conference (CLEI), 1-5, 2015
32015
On the parameterized complexity of approximate counting
JA Montoya
RAIRO-Theoretical Informatics and Applications 45 (2), 197-223, 2011
32011
The almost-entropic regions are not semialgebraic
C Mejia, J Andres Montoya
arXiv e-prints, arXiv: 1510.02658, 2015
22015
Systemet kan inte utföra åtgärden just nu. Försök igen senare.
Artiklar 1–20