Edificio OMEGA Despacho 110. Campus Nord.
Teléfono:  + 34 93 413 7814
esteban at lsi dot upc dot edu

Dirección postal:
Universitat Politècnica de Catalunya
Dept. Llenguatges i Sistemes Informàtics
c/ Jordi Girona Salgado 1-3, E-08034 Barcelona

Mi página en el DBLP.
Electronic Colloquium on Computational Complexity ECCC.

Mi tesis doctoral se titula Complexity measures for Resolution.
Aquí está en formato PS y aquí en formato PDF.

Publicaciones en revista

Juan Luis Esteban, Nicola Galesi, Jochen Messner. On the Complexity of Resolution with Bounded Conjunctions.
Theoretical Computer Science. Vol 321, núm. 2-3, pp. 347-370.

Juan Luis Esteban, Jacobo Torán. A combinatorial characterization of treelike resolution space. Information Processing Letters. Vol. 87, núm. 6, pp. 295-300.

Albert Atserias, María Luisa Bonet, Juan Luis Esteban. Lower Bounds for the Weak Pigeonhole Principle and Ramdom Formulas Beyond Resolution.Information and Computation. Vol. 176, núm. 2, pp. 136-152.

Juan Luis Esteban, Jacobo Torán. Space Bounds for Resolution. Information and Computation. Vol. 171, núm. 1, pp. 84-97.

María Luisa Bonet, Juan Luis Esteban, Nicola Galesi, Jan Johansen. On the Relative Complexity of Resolution Refinements and Cutting Planes Proof Systems. SIAM Journal of Computing, Vol. 30, núm.5, pp. 1462-1484.

Publicaciones en congreso

Juan Luis Esteban, Nicola Galesi, Jochen Messner. On the Complexity of Resolution with Bounded Conjunctions.
29th International Colloquium, ICALP 2002. Lecture Notes in Computer Science, Vol 2380, pp. 220-231, 2002.

Albert Atserias, María Luisa Bonet, Juan Luis Esteban. Lower Bounds for the Weak Pigeonhole Principle Beyond Resolution.  28th International Colloquium, ICALP 2001. Lecture Notes in Computer Science, Vol 2076, pp. 1005-1016, 2001.

Sergio Díaz, Juan Luis Esteban, Mitsunori Ogihara. A DNA-based random walk method for solving k-SAT. 6th International Workshop on DNA-Based Computers, DNA 2000. Lecture Notes in Computer Science, Vol. 2054, pp. 209-219, 2000.

Juan Luis Esteban,  Jacobo Torán. Space Bounds for Resolution. Proceedings of the16th Annual Symposium on Theoretical Aspects of Computer Science. Lecture Notes in Computer Science, Vol. 1563, pp. 551-560, 1999.

María Luisa Bonet, Juan Luis Esteban, Nicola Galesi, Jan Johansen. Exponential Separations between Restricted Resolution and Cutting Planes Proof Systems.39th IEEE Symposium on Foundations of Computer Science, FOCS'98, pp 638-647.

Publicaciones sin revisor

Sven Baumer, Juan Luis Esteban,  Jacobo Torán. Minimally unsatisfiable CNF formulas. Bulletin of the EATCS 74.