Juan Luis Esteban Coauthor index pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Other views: by type - by year (modern) - classic-C
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo
DBLP keys2004
j6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Juan Luis Esteban, Nicola Galesi, Jochen Messner: On the complexity of resolution with bounded conjunctions. Theor. Comput. Sci. 321(2-3): 347-370 (2004)
2003
j5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Juan Luis Esteban, Jacobo Torán: A combinatorial characterization of treelike resolution space. Inf. Process. Lett. 87(6): 295-300 (2003)
i2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Juan Luis Esteban, Jacobo Torán: A Combinatorial Characterization of Treelike Resolution Space. Electronic Colloquium on Computational Complexity (ECCC)(044) (2003)
2002
j4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Albert Atserias, Maria Luisa Bonet, Juan Luis Esteban: Lower Bounds for the Weak Pigeonhole Principle and Random Formulas beyond Resolution. Inf. Comput. 176(2): 136-152 (2002)
c5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Juan Luis Esteban, Nicola Galesi, Jochen Messner: On the Complexity of Resolution with Bounded Conjunctions. ICALP 2002: 220-231
2001
j3no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
S. Baumer, Juan Luis Esteban, Jacobo Torán: Minimally Unsatisfiable CNF Formulas. Bulletin of the EATCS 74: 190-192 (2001)
j2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Juan Luis Esteban, Jacobo Torán: Space Bounds for Resolution. Inf. Comput. 171(1): 84-97 (2001)
c4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Albert Atserias, Maria Luisa Bonet, Juan Luis Esteban: Lower Bounds for the Weak Pigeonhole Principle Beyond Resolution. ICALP 2001: 1005-1016
2000
j1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Maria Luisa Bonet, Juan Luis Esteban, Nicola Galesi, Jan Johannsen: On the Relative Complexity of Resolution Refinements and Cutting Planes Proof Systems. SIAM J. Comput. 30(5): 1462-1484 (2000)
c3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Sergio Díaz, Juan Luis Esteban, Mitsunori Ogihara: A DNA-Based Random Walk Method for Solving k-SAT. DNA Computing 2000: 209-219
1999
c2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Juan Luis Esteban, Jacobo Torán: Space Bounds for Resolution. STACS 1999: 551-560
1998
c1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Maria Luisa Bonet, Juan Luis Esteban, Nicola Galesi, Jan Johannsen: Exponential Separations between Restricted Resolution and Cutting Planes Proof Systems. FOCS 1998: 638-647
i1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Maria Luisa Bonet, Juan Luis Esteban, Nicola Galesi, Jan Johannsen: Exponential Separations between Restricted Resolution and Cutting Planes Proof Systems. Electronic Colloquium on Computational Complexity (ECCC) 5(35) (1998)

Coauthor Index

1Albert Atserias
[j4] [c4]
2S. Baumer
[j3]
3Maria Luisa Bonet
[j4] [c4] [j1] [c1] [i1]
4Sergio Díaz
[c3]
5Nicola Galesi
[j6] [c5] [j1] [c1] [i1]
6Jan Johannsen
[j1] [c1] [i1]
7Jochen Messner (Jochen Meßner)
[j6] [c5]
8Mitsunori Ogihara (Mitsunori Ogiwara)
[c3]
9Jacobo Torán
[j5] [i2] [j3] [j2] [c2]

Colors in the list of coauthors

Last update Tue May 21 17:26:54 2013 CET by the DBLP TeamThis material is Open Data Data released under the ODC-BY 1.0 license — See also our legal information page