Inicio

Publications



Published, accepted, submitted

  1. J. Andres Montoya, Moritz Mueller. Parameterized Random Complexity. Accepted Theory of computing systems.
  2. J. Andres Montoya. A note concerning the algorithmic analysis of Polymer Thermodynamics. MATCH Communications in mathematics and computer chemistry, 67(3):761-772, 2012.
  3. J. Andres Montoya, Carolina Mejia. The computational Complexity of Sandpile Group Computations. Theoretical Computer Science 412: 3964-3974, 2011. (preprint)
  4. J. Andres Montoya. The parameterized complexity of approximate counting. Theoretical Informatics and Applications, 45(2):197-223, 2011. (preprint)
  5. J. Andres Montoya, Francisco Gutierrez, Luis Zambrano. Applications of Schutzenberger-Bertoni method: counting polyominoes. Electronic Notes in Discrete Mathematics, 37(1):93-98, 2011. (preprint)
  6. J. Andres Montoya, Carolina Mejia. The Complexity of Three-dimensional Critical Avalanches. LNCS.6350:153-162, 2010. (preprint)
  7. J. Andres Montoya, Carolina Mejia. On the complexity of Sandpile Prediction problems. Electronic Notes In Theoretical Computer Science 252: 229 - 245, 2009.(preprint)
  8. J. Andres Montoya. The Parameterized Complexity of Probability Amplification. Information processing letters 109(1) p.46 - 53 ,2008. (preprint)
  9. J. Andres Montoya. Cayley's Theorem Revisited. Colombian Journal of Mathematics 43(1): 19-34, 2009.
  10. J. Andres Montoya. The Parameterized Complexity of Mining Graphs I: Upper Bounds. Colombian Journal of Computation, 10(1):61-83, 2009.
  11. J. Andres Montoya. The Parameterized Complexity of Mining Graphs II: Lower Bounds. Colombian Journal of Computation, 10(1):84-109, 2009.
  12. J. Andres Montoya. On Parameterized Counting. Ph.D thesis, Freiburg University 2008.
  13. J. Andres Montoya. The Model Theory of Sheaves. Lectures in Mathematics, Sociedad Colombiana de Matematicas, 28(1): 5 - 37, 2007.
  14. J. Andres Montoya, Carolina Mejia. Schanuel’s Effective Reals. Matematicas Enseñanza Universitaria 15(1): 85 - 108, 2007.
  15. J. Andres Montoya. The Permanent Complexity of The Permanent. Bulletin of the Colombian Mathematical Society. 14(2): 68 - 82, 2007.
  16. J. Andres Montoya. The Complexity of Sudoku. Revista integracion:temas de Matematica 24(1): 1 - 15, 2006.
  17. J. Andres Montoya. Intuitionist Model Theory: Kripke Models. Bulletin of the Colombian Mathematical Society 10(2): 92 - 109, 2003.
  18. J. Andres Montoya. Model theory of topological structures. Master thesis, universidad nacional de Colombia, Bogota.

 

Submmited

 1. J. Andres Montoya. On the complexity of the two-dimensional abelain sandpile model (Physica D)

 2. J. Andres Montoya, Carolina Mejia. Two tapes do not suffice. (LATIN conference).

 3.  J. Andres Montoya. The recognition of two-dimensional critical configurations (Complex systems)

 

Finished, not yet submited.

 1. J. Andres Montoya. The work of Leslie Valiant: alle die Strassen fuhren nach Strassen

 2. J. Andres Montoya, Carolina Mejia. Open problems related to palindrome recognition: are there open problems related   to palindrome recognition?

 

 
 
Miscellaneous
  1. J. Andres Montoya. Automata, palindrome and real time computations. (draft of a book, spanish).
  2. J. Andres Montoya. A note on Freivalds’ algorithm.
  3. J. Andres Montoya. Non-elementary applications of an elementary theorem
  4. Francisco gutierrez, J. Andres Montoya, Luis E. Zambrano. Applications of Schutzenberger-Bertoni method: counting hamiltonian structures.
  5. J. Andres Montoya, Carolina Mejia. Lecture notes on the abelian sandpile model (draft)
  6. J. Andres Montoya. The complexity of predicting.
  7. J. Andres Montoya. Topology vs. Logic = Convergence. Booklet, published by Colombian Mathematical Society. 2001.
  8. J. Andres Montoya. Matemiotika 1. Undergradute thesis, Universidad Nacional, Bogota, 2000.
  9.  J. Andres Montoya. ¿Que es la complejidad computacional? El punto de vista de Euclides.

 

In preparation

  1. J. Andres Montoya. Cellular Automata and Palindrome Recognition: Kutrib's problem.
  2. J. Andres Montoya. The power of two-way deterministic pushdown automata: Manacher's problem
  3. J. Andres Montoya. Which are the context-free languages that requires nonlinear time: Galil´s problem.
  4. J. Andres Montoya. Matemiotika III.