| Space bounds for resolution JL Esteban, J Torán Information and Computation 171 (1), 84-97, 2001 | 142 | 2001 |
| 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 | 119 | 2000 |
| On the complexity of resolution with bounded conjunctions JL Esteban, N Galesi, J Messner Theoretical Computer Science 321 (2-3), 347-370, 2004 | 53 | 2004 |
| 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 | 52 | 2002 |
| 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 | 52 | 1998 |
| 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 | 48 | 2022 |
| A combinatorial characterization of treelike resolution space JL Esteban, J Torán Information Processing Letters 87 (6), 295-300, 2003 | 43 | 2003 |
| 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 | 38 | 2018 |
| Space bounds for resolution JL Esteban, J Torán Annual Symposium on Theoretical Aspects of Computer Science, 551-560, 1999 | 35 | 1999 |
| 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 | 22 | 2000 |
| 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, ... International Conference on Principles and Practice of Constraint …, 2019 | 19 | 2019 |
| 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 | 17 | 2017 |
| 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 | 17 | 2016 |
| On the complexity of resolution with bounded conjunctions JL Esteban, N Galesi, J Messner International Colloquium on Automata, Languages, and Programming, 220-231, 2002 | 17 | 2002 |
| Minimum projective linearizations of trees in linear time L Alemany-Puig, JL Esteban, R Ferrer-i-Cancho Information Processing Letters 174, 106204, 2022 | 14 | 2022 |
| 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 | 13 | 2021 |
| Minimally unsatisfiable CNF formulas S Baumer, JL Esteban, J Torán Bulletin of the EATCS 74, 190-192, 2001 | 9 | 2001 |
| Lower bounds for the weak pigeonhole principle beyond resolution A Atserias, ML Bonet, JL Esteban International Colloquium on Automata, Languages, and Programming, 1005-1016, 2001 | 8 | 2001 |
| 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 | 6 | 2021 |
| The maximum linear arrangement problem for trees under projectivity and planarity L Alemany-Puig, JL Esteban, R Ferrer-i-Cancho Information Processing Letters 183, 106400, 2024 | 2 | 2024 |
