Follow
Juan Luis Esteban Angeles
Juan Luis Esteban Angeles
Computer Science Department, Universitat Politècnica de Catalunya
Verified email at upc.edu
Title
Cited by
Cited by
Year
Space bounds for resolution
JL Esteban, J Torán
Information and Computation 171 (1), 84-97, 2001
1352001
On the relative complexity of resolution refinements and cutting planes proof systems
ML Bonet, JL Esteban, N Galesi, J Johannsen
SIAM Journal on Computing 30 (5), 1462-1484, 2000
1172000
Lower bounds for the weak pigeonhole principle and random formulas beyond resolution
A Atserias, ML Bonet, JL Esteban
Information and Computation 176 (2), 136-152, 2002
522002
On the complexity of resolution with bounded conjunctions
JL Esteban, N Galesi, J Messner
Theoretical Computer Science 321 (2-3), 347-370, 2004
512004
Exponential separations between restricted resolution and cutting planes proof systems
ML Bonet, JL Esteban, N Galesi, J Johannsen
Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat …, 1998
511998
A combinatorial characterization of treelike resolution space
JL Esteban, J Torán
Information Processing Letters 87 (6), 295-300, 2003
392003
Space bounds for resolution
JL Esteban, J Torán
Annual Symposium on Theoretical Aspects of Computer Science, 551-560, 1999
361999
Are crossing dependencies really scarce?
R Ferrer-i-Cancho, C Gómez-Rodríguez, JL Esteban
Physica A: Statistical Mechanics and its Applications 493, 311-329, 2018
342018
Optimality of syntactic dependency distances
R Ferrer-i-Cancho, C Gómez-Rodríguez, JL Esteban, L Alemany-Puig
Physical Review E 105 (1), 014308, 2022
302022
A DNA-based random walk method for solving k-SAT
S Diaz, JL Esteban, M Ogihara
International Workshop on DNA-Based Computers, 209-220, 2000
232000
On the complexity of resolution with bounded conjunctions
JL Esteban, N Galesi, J Messner
International Colloquium on Automata, Languages, and Programming, 220-231, 2002
172002
The scaling of the minimum sum of edge lengths in uniformly random trees
JL Esteban, R Ferrer-i-Cancho, C Gómez-Rodríguez
Journal of Statistical Mechanics: Theory and Experiment 2016 (6), 063401, 2016
162016
Minimum projective linearizations of trees in linear time
L Alemany-Puig, JL Esteban, R Ferrer-i-Cancho
Information Processing Letters 174, 106204, 2022
132022
Automatic detection of at-most-one and exactly-one relations for improved SAT encodings of pseudo-boolean constraints
C Ansótegui, M Bofill, J Coll, N Dang, JL Esteban, I Miguel, P Nightingale, ...
Principles and Practice of Constraint Programming: 25th International …, 2019
132019
A correction on Shiloach's algorithm for minimum linear arrangement of trees
JL Esteban, R Ferrer-i-Cancho
SIAM Journal on Computing 46 (3), 1146-1151, 2017
132017
Minimally unsatisfiable CNF formulas
S Baumer, JL Esteban, J Torán
Bulletin of the EATCS 74, 190-192, 2001
102001
Lower bounds for the weak pigeonhole principle beyond resolution
A Atserias, ML Bonet, JL Esteban
Automata, Languages and Programming: 28th International Colloquium, ICALP …, 2001
82001
The Linear Arrangement Library. A new tool for research on syntactic dependency structures
L Alemany-Puig, JL Esteban, R Ferrer-i-Cancho
arXiv preprint arXiv:2112.02512, 2021
72021
Bounds of the sum of edge lengths in linear arrangements of trees
R Ferrer-i-Cancho, C Gómez-Rodríguez, JL Esteban
Journal of Statistical Mechanics: Theory and Experiment 2021 (2), 023403, 2021
42021
Complexity measures for Resolution
JL Esteban
Polytechnic University of Catalonia, Spain, 2003
22003
The system can't perform the operation now. Try again later.
Articles 1–20