Structural complexity 2 JL Balcázar, J Díaz, J Gabarró Springer-Verlag New York, Inc., 1990 | 1705* | 1990 |
Structural complexity 2 JL Balcázar, J Díaz, J Gabarró Springer-Verlag New York, Inc., 1990 | 1648* | 1990 |
Structural Complexity I, volume 11 of EATCS Monographs on Theoretical Computer Science JL Balcázar, J Dıaz, J Gabarró Springer Verlag, Berlin, 1988 | 1627* | 1988 |
Machine learning and knowledge discovery in databases JL Balcázar, F Bonchi, A Gionis, M Sebag Lecture notes in computer science 6321, 2010 | 173 | 2010 |
Optimal distance networks of low degree for parallel computers R Beivide, E Herrada, JL Balcazar, A Arruabarrena IEEE Transactions on Computers 40 (10), 1109-1124, 1991 | 170* | 1991 |
Provably fast training algorithms for support vector machines JL Balcázar, Y Dai, J Tanaka, O Watanabe Theory of Computing Systems 42, 568-595, 2008 | 153* | 2008 |
Bi-immune sets for complexity classes JL Balcázar, U Schöning Mathematical Systems Theory 18 (1), 1-10, 1985 | 139 | 1985 |
The polynomial-time hierarchy and sparse oracles JL Balcázar, RV Book, U Schöning Journal of the ACM (JACM) 33 (3), 603-617, 1986 | 122 | 1986 |
Deciding bisimilarity isP-complete J Balcázar, J Gabarro, M Santha Formal aspects of computing 4, 638-648, 1992 | 119 | 1992 |
Algorithms for learning finite automata from queries: A unified view JL Balcázar, J Díaz, R Gavalda, O Watanabe Advances in Algorithms, Languages, and Complexity, 53-72, 1997 | 107 | 1997 |
Self-reducibility JL Balcázar Journal of Computer and System Sciences 41 (3), 367-388, 1990 | 102 | 1990 |
Sparse sets, lowness and highness JL Balcázar, RV Book, U Schöning SIAM Journal on Computing 15 (3), 739-747, 1986 | 100 | 1986 |
Computational power of neural networks: A characterization in terms of Kolmogorov complexity JL Balcázar, R Gavalda, HT Siegelmann IEEE Transactions on Information Theory 43 (4), 1175-1183, 1997 | 97 | 1997 |
Sets with small generalized Kolmogorov complexity JL Balcázar, RV Book Acta Informatica 23 (6), 679-688, 1986 | 91* | 1986 |
The complexity of algorithmic problems on succinct instances JL Balcázar, A Lozano, J Torán Computer science: research and applications, 351-377, 1992 | 82 | 1992 |
Redundancy, deduction schemes, and minimum-size bases for association rules JL Balcázar Logical Methods in Computer Science 6 (2 (arXiv:1002.4286)), 2010 | 74* | 2010 |
The complexity of graph problems for succinctly represented graphs A Lozano, JL Balcázar International Workshop on Graph-Theoretic Concepts in Computer Science, 277-286, 1989 | 69 | 1989 |
A first-order isomorphism theorem E Allender, J Balcázar, N Immerman SIAM Journal on Computing 26 (2), 557-567, 1997 | 62 | 1997 |
Mining frequent closed rooted trees JL Balcázar, A Bifet, A Lozano Machine Learning 78, 1-33, 2010 | 51* | 2010 |
Logarithmic advice classes JL Balcázar, U Schöning Theoretical Computer Science 99 (2), 279-290, 1992 | 45 | 1992 |