Juan Luis Esteban

Publication Activity (10 Years)

Years Active: 1998-2024
Publications (10 Years): 12

Top Topics

Linear Complexity

Syntactic Dependencies

Top Venues

Inf. Process. Lett.

SIAM J. Comput.

Publications

Lluís Alemany-Puig, Juan Luis Esteban, Ramon Ferrer-i-Cancho
The maximum linear arrangement problem for trees under projectivity and planarity. Inf. Process. Lett. 183 (2024)
Lluís Alemany-Puig, Juan Luis Esteban, Ramon Ferrer-i-Cancho
On The Maximum Linear Arrangement Problem for Trees. CoRR (2023)
Lluís Alemany-Puig, Juan Luis Esteban, Ramon Ferrer-i-Cancho
The Maximum Linear Arrangement Problem for trees under projectivity and planarity. CoRR (2022)
Lluís Alemany-Puig, Juan Luis Esteban, Ramon Ferrer-i-Cancho
Minimum projective linearizations of trees in linear time. Inf. Process. Lett. 174 (2022)
Lluís Alemany-Puig, Juan Luis Esteban, Ramon Ferrer-i-Cancho
The Linear Arrangement Library. A new tool for research on syntactic dependency structures. CoRR (2021)
Lluís Alemany-Puig, Juan Luis Esteban, Ramon Ferrer-i-Cancho
Minimum projective linearizations of trees in linear time. CoRR (2021)
Ramon Ferrer-i-Cancho, Carlos Gómez-Rodríguez, Juan Luis Esteban
The variation of the sum of edge lengths in linear arrangements of trees. CoRR (2020)
Ramon Ferrer-i-Cancho, Carlos Gómez-Rodríguez, Juan Luis Esteban, Lluís Alemany-Puig
The optimality of syntactic dependency distances. CoRR (2020)
Carlos 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. CP (2019)
Ramon Ferrer-i-Cancho, Carlos Gómez-Rodríguez, Juan Luis Esteban
Are crossing dependencies really scarce? CoRR (2017)
Juan Luis Esteban, Ramon Ferrer-i-Cancho
A Correction on Shiloach's Algorithm for Minimum Linear Arrangement of Trees. SIAM J. Comput. 46 (3) (2017)
Juan Luis Esteban, Ramon Ferrer-i-Cancho, Carlos Gómez-Rodríguez
The scaling of the minimum sum of edge lengths in uniformly random trees. CoRR (2016)
Juan Luis Esteban, Ramon Ferrer-i-Cancho
A correction on Shiloach's algorithm for minimum linear arrangement of trees. CoRR (2015)
Juan Luis Esteban, Nicola Galesi, Jochen Messner
On the complexity of resolution with bounded conjunctions. Theor. Comput. Sci. 321 (2-3) (2004)
Juan Luis Esteban, Jacobo Torán
A Combinatorial Characterization of Treelike Resolution Space Electron. Colloquium Comput. Complex. (044) (2003)
Juan Luis Esteban, Jacobo Torán
A combinatorial characterization of treelike resolution space. Inf. Process. Lett. 87 (6) (2003)
Albert Atserias, Maria Luisa Bonet, Juan Luis Esteban
Lower Bounds for the Weak Pigeonhole Principle and Random Formulas beyond Resolution. Inf. Comput. 176 (2) (2002)
Juan Luis Esteban, Nicola Galesi, Jochen Messner
On the Complexity of Resolution with Bounded Conjunctions. ICALP (2002)
Juan Luis Esteban, Jacobo Torán
Space Bounds for Resolution. Inf. Comput. 171 (1) (2001)
S. Baumer, Juan Luis Esteban, Jacobo Torán
Minimally Unsatisfiable CNF Formulas. Bull. EATCS 74 (2001)
Albert Atserias, Maria Luisa Bonet, Juan Luis Esteban
Lower Bounds for the Weak Pigeonhole Principle Beyond Resolution. ICALP (2001)
Sergio Díaz, Juan Luis Esteban, Mitsunori Ogihara
A DNA-Based Random Walk Method for Solving k-SAT. DNA Computing (2000)
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) (2000)
Juan Luis Esteban, Jacobo Torán
Space Bounds for Resolution. STACS (1999)
Maria Luisa Bonet, Juan Luis Esteban, Nicola Galesi, Jan Johannsen
Exponential Separations between Restricted Resolution and Cutting Planes Proof Systems. FOCS (1998)
Maria Luisa Bonet, Juan Luis Esteban, Nicola Galesi, Jan Johannsen
Exponential Separations between Restricted Resolution and Cutting Planes Proof Systems Electron. Colloquium Comput. Complex. 5 (35) (1998)