The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Juan Luis Esteban" ( http://dblp.L3S.de/Authors/Juan_Luis_Esteban )

  Author page on DBLP  Author page in RDF  Community of Juan Luis Esteban in ASPL-2

Publication years (Num. hits)
1998-2016 (15) 2017-2019 (3)
Publication types (Num. hits)
article(12) inproceedings(6)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 3 occurrences of 3 keywords

Results
Found 19 publication records. Showing 18 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Carlos Ansótegui, Miquel Bofill, Jordi Coll, Nguyen Dang, Juan Luis Esteban, Ian Miguel, Peter Nightingale, András Z. Salamon, Josep Suy, Mateu Villaret Automatic Detection of At-Most-One and Exactly-One Relations for Improved SAT Encodings of Pseudo-Boolean Constraints. Search on Bibsonomy CP The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Ramon Ferrer-i-Cancho, Carlos Gómez-Rodríguez, Juan Luis Esteban Are crossing dependencies really scarce? Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
1Juan Luis Esteban, Ramon Ferrer-i-Cancho A Correction on Shiloach's Algorithm for Minimum Linear Arrangement of Trees. Search on Bibsonomy SIAM J. Comput. The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Juan Luis Esteban, Ramon Ferrer-i-Cancho, Carlos Gómez-Rodríguez The scaling of the minimum sum of edge lengths in uniformly random trees. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
1Juan Luis Esteban, Ramon Ferrer-i-Cancho A correction on Shiloach's algorithm for minimum linear arrangement of trees. Search on Bibsonomy CoRR The full citation details ... 2015 DBLP  BibTeX  RDF
1Juan Luis Esteban, Nicola Galesi, Jochen Messner On the complexity of resolution with bounded conjunctions. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Juan Luis Esteban, Jacobo Torán A combinatorial characterization of treelike resolution space. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Juan Luis Esteban, Jacobo Torán A Combinatorial Characterization of Treelike Resolution Space Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2003 DBLP  BibTeX  RDF
1Albert Atserias, Maria Luisa Bonet, Juan Luis Esteban Lower Bounds for the Weak Pigeonhole Principle and Random Formulas beyond Resolution. Search on Bibsonomy Inf. Comput. The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Juan Luis Esteban, Nicola Galesi, Jochen Messner On the Complexity of Resolution with Bounded Conjunctions. Search on Bibsonomy ICALP The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1S. Baumer, Juan Luis Esteban, Jacobo Torán Minimally Unsatisfiable CNF Formulas. Search on Bibsonomy Bulletin of the EATCS The full citation details ... 2001 DBLP  BibTeX  RDF
1Juan Luis Esteban, Jacobo Torán Space Bounds for Resolution. Search on Bibsonomy Inf. Comput. The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Albert Atserias, Maria Luisa Bonet, Juan Luis Esteban Lower Bounds for the Weak Pigeonhole Principle Beyond Resolution. Search on Bibsonomy ICALP The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Maria Luisa Bonet, Juan Luis Esteban, Nicola Galesi, Jan Johannsen On the Relative Complexity of Resolution Refinements and Cutting Planes Proof Systems. Search on Bibsonomy SIAM J. Comput. The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
1Sergio Díaz, Juan Luis Esteban, Mitsunori Ogihara A DNA-Based Random Walk Method for Solving k-SAT. Search on Bibsonomy DNA Computing The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
1Juan Luis Esteban, Jacobo Torán Space Bounds for Resolution. Search on Bibsonomy STACS The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
1Maria Luisa Bonet, Juan Luis Esteban, Nicola Galesi, Jan Johannsen Exponential Separations between Restricted Resolution and Cutting Planes Proof Systems Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 1998 DBLP  BibTeX  RDF
1Maria Luisa Bonet, Juan Luis Esteban, Nicola Galesi, Jan Johannsen Exponential Separations between Restricted Resolution and Cutting Planes Proof Systems. Search on Bibsonomy FOCS The full citation details ... 1998 DBLP  DOI  BibTeX  RDF Cutting Planes proof, tree-like proof, regular resolution, Davis-Putnam resolution, monotone real circuit, real communication complexity, lower bounds, resolution, propositional proof complexity
Displaying result #1 - #18 of 18 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license