A Note on a Theorem by Ladner. - José L. Balcázar; Josep Díaz (Inf. Process. Lett., 1982)

Sparse Oracles and Uniform Complexity Classes - José L. Balcázar; Ronald V. Book; Timothy J. Long; Uwe Schöning; Alan L. Selman (FOCS, 1984)

Separating, Strongly Separating, and Collapsing Relativized Complexity Classes. - José L. Balcázar (MFCS, 1984)

Sparse Oracles, Lowness, and Highness. - José L. Balcázar; Ronald V. Book; Uwe Schöning (MFCS, 1984)

Some results about Logspace complexity measures. - José L. Balcázar; Josep Díaz; Joaquim Gabarró (Bull. EATCS, 1984)

On some "non-uniform" complexity measures. - José L. Balcázar; Josep Díaz; Joaquim Gabarró (FCT, 1985)

Examples of CFI-BI-immune and CF-levelable sets in logspace. - José L. Balcázar; Josep Díaz; Joaquim Gabarró (Bull. EATCS, 1985)

Uniform Characterizations of Non-Uniform Complexity Measures - José L. Balcázar; Josep Díaz; Joaquim Gabarró (Inf. Control., 1985)

Bi-Immune Sets for Complexity Classes. - José L. Balcázar; Uwe Schöning (Math. Syst. Theory, 1985)

Simplicity, Relativizations and Nondeterminism. - José L. Balcázar (SIAM J. Comput., 1985)

On Bounded Query Machines. - José L. Balcázar; Ronald V. Book; Uwe Schöning (Theor. Comput. Sci., 1985)

On Non- uniform Polynomial Space. - José L. Balcázar; Josep Díaz; Joaquim Gabarró (SCT, 1986)

On Generalized Kolmogorov Complexity. - José L. Balcázar; Ronald V. Book (STACS, 1986)

Sets with Small Generalized Kolmogorov Complexity. - José L. Balcázar; Ronald V. Book (Acta Informatica, 1986)

Some comments about notations of orders of manitude. - José L. Balcázar; Joaquim Gabarró (Bull. EATCS, 1986)

On (Greek D)D_P²-Immunity. - José L. Balcázar (Inf. Process. Lett., 1986)

The polynomial-time hierarchy and sparse oracles. - José L. Balcázar; Ronald V. Book; Uwe Schöning (J. ACM, 1986)

Sparse Sets, Lowness and Highness. - José L. Balcázar; Ronald V. Book; Uwe Schöning (SIAM J. Comput., 1986)

Optimized Mesh-Connected Networks for SIMD and MIMD Architectures. - Ramón Beivide; Enrique Herrada; José L. Balcázar; Jesús Labarta (ISCA, 1987)

On Characterizations of the Class PSPACE/POLY. - José L. Balcázar; Josep Díaz; Joaquim Gabarró (Theor. Comput. Sci., 1987)

Structural complexity, 1st Edition. - José Luis Balcázar; Josep Díaz; Joaquim Gabarró (Springer, 1988)

Logspace self-reducibility. - José L. Balcázar (SCT, 1988)

Immunity and Simplicity in Relativizations of Probabilistic Complexity Classes. - José L. Balcázar; David A. Russo (RAIRO Theor. Informatics Appl., 1988)

Nondeterministic Witnesses and Nonuniform Advice. - José L. Balcázar (SCT, 1989)

The Complexity of Graph Problems for Succinctly Represented Graphs. - Antoni Lozano; José L. Balcázar (WG, 1989)

Nonuniform Complexity Classes Specified by Lower and Upper Bounds. - José L. Balcázar; Joaquim Gabarró (RAIRO Theor. Informatics Appl., 1989)

Deriving Specifications of Embeddings in Recursive Program Design. - Celestí Rosselló; José L. Balcázar; Ricardo Pena (Struct. Program., 1989)

Generalized Kolmogorov Complexity in Relativized Separations (Extended Abstract). - Ricard Gavaldà; Leen Torenvliet; Osamu Watanabe 001; José L. Balcázar (MFCS, 1990)

Self-Reducibility. - José L. Balcázar (J. Comput. Syst. Sci., 1990)

Structural Complexity I - José L. Balcázar; Josep Díaz; Joaquim Gabarró (Springer, 1990)

Structural Complexity II - José L. Balcázar; Josep Díaz; Joaquim Gabarró (Springer, 1990)

Adaptive Logspace and Depth-Bounded Reducibilities. - José L. Balcázar (SCT, 1991)

Parallel Complexity in the Design and Analysis on Conurrent Systems. - Carme Àlvarez; José L. Balcázar; Joaquim Gabarró; Miklos Santha (PARLE (1), 1991)

Functional Oracle Queries as a Measure of Parallel Time. - Carme Àlvarez; José L. Balcázar; Birgit Jenner (STACS, 1991)

Optimal Distance Networks of Low Degree for Parallel Computers. - Ramón Beivide; Enrique Herrada; José L. Balcázar; Agustin Arruabarrena (IEEE Trans. Computers, 1991)

Strong and Robustly Strong Polynomial-Time Reducibilities to Sparse Sets. - Ricard Gavaldà; José L. Balcázar (Theor. Comput. Sci., 1991)

A Note on the Query Complexity of Learning DFA (Extended Abstract). - José L. Balcázar; Josep Díaz; Ricard Gavaldà; Osamu Watanabe 001 (ALT, 1992)

Characterizations of Logarithmic Advice Complexity Classes. - José L. Balcázar; Montserrat Hermo; Elvira Mayordomo (IFIP Congress (1), 1992)

Deciding Bisimilarity is P-Complete. - José L. Balcázar; Joaquim Gabarró; Miklos Santha (Formal Aspects Comput., 1992)

Logarithmic Advice Classes. - José L. Balcázar; Uwe Schöning (Theor. Comput. Sci., 1992)

Programacion metodica. - José L. Balcázar (McGraw-Hill, 1993)

Some Structural Complexity Aspects of Neural Computation. - José L. Balcázar; Ricard Gavaldà; Hava T. Siegelmann; Eduardo D. Sontag (SCT, 1993)

The Query Complexity of Learning DFA. - José L. Balcázar; Josep Díaz; Ricard Gavaldà; Osamu Watanabe 001 (New Gener. Comput., 1994)

Simple PAC Learning of Simple Decision Lists. - Jorge Castro; José L. Balcázar (ALT, 1995)

A Note on Genericity and Bi-Immunity. - José L. Balcázar; Elvira Mayordomo (SCT, 1995)

Learnability of Kolmogorov-easy circuit expressions via queries. - José L. Balcázar; Harry Buhrman; Montserrat Hermo (EuroCOLT, 1995)

The Complexity of Searching Succinctly Represented Graphs. - José L. Balcázar (ICALP, 1995)

Adaptive Logspace Reducibility and Parallel Time. - Carme Àlvarez; José L. Balcázar; Birgit Jenner (Math. Syst. Theory, 1995)

Structural Complexity I, Second Edition - José L. Balcázar; Josep Díaz; Joaquim Gabarró (Springer, 1995)

The Complexity of Searching Implicit Graphs. - José L. Balcázar (Artif. Intell., 1996)

An Optimal Parallel Algorithm for Learning DFA. - José L. Balcázar; Josep Díaz; Ricard Gavaldà; Osamu Watanabe 001 (J. Univers. Comput. Sci., 1996)

Algorithms for Learning Finite Automata from Queries: A Unified View. - José L. Balcázar; Josep Díaz; Ricard Gavaldà (Advances in Algorithms, Languages, and Complexity, 1997)

Coding Complexity: The Computational Complexity of Succinct Descriptions. - José L. Balcázar; Ricard Gavaldà; Osamu Watanabe 001 (Advances in Algorithms, Languages, and Complexity, 1997)

A First-Order Isomorphism Theorem. - Eric Allender; José L. Balcázar; Neil Immerman (SIAM J. Comput., 1997)

Computational power of neural networks: a characterization in terms of Kolmogorov complexity. - José L. Balcázar; Ricard Gavaldà; Hava T. Siegelmann (IEEE Trans. Inf. Theory, 1997)

The Structure of Logarithmic Advice Complexity Classes. - José L. Balcázar; Montserrat Hermo (Theor. Comput. Sci., 1998)

The Consistency Dimension and Distribution-Dependent Learning from Queries (Extended Abstract). - José L. Balcázar; Jorge Castro; David Guijarro; Hans Ulrich Simon (ALT, 1999)

The Consistency Dimension, Compactness, and Query Learning. - José L. Balcázar (CSL, 1999)

Abstract Combinatorial Characterizations of Exact Learning via Queries. - José L. Balcázar; Jorge Castro; David Guijarro (COLT, 2000)

Editor's Foreword. - José L. Balcázar (J. Comput. Syst. Sci., 2000)

A Random Sampling Technique for Training Support Vector Machines. - José L. Balcázar; Yang Dai; Osamu Watanabe 001 (ALT, 2001)

A General Dimension for Exact Learning. - José L. Balcázar; Jorge Castro; David Guijarro (COLT/EuroCOLT, 2001)

Bounding Negative Information in Frequent Sets Algorithms. - Inmaculada Fortes Ruiz; José L. Balcázar; Rafael Morales Bueno (Discovery Science, 2001)

Provably Fast Training Algorithms for Support Vector Machines. - José L. Balcázar; Yang Dai; Osamu Watanabe 001 (ICDM, 2001)

A Best-First Strategy for Finding Frequent Sets. - Jaume Baixeries; Gemma Casas-Garriga; José L. Balcázar (EGC, 2002)

A New Abstract Combinatorial Dimension for Exact Learning via Queries. - José L. Balcázar; Jorge Castro; David Guijarro (J. Comput. Syst. Sci., 2002)

The consistency dimension and distribution-dependent learning from queries. - José L. Balcázar; Jorge Castro; David Guijarro; Hans Ulrich Simon (Theor. Comput. Sci., 2002)

Characterizations of Multivalued Dependencies and Related Expressions. - José L. Balcázar; Jaume Baixeries (Discovery Science, 2004)

Coproduct Transformations on Lattices of Closed Partial Orders. - Gemma Casas-Garriga; José L. Balcázar (ICGT, 2004)

New Closure Operators and Lattice Representations for Multivalued Dependencies and Related Expressions. - Jaume Baixeries; José Luis Balcázar (CLA, 2005)

Characterization and Armstrong Relations for Degenerate Multivalued Dependencies Using Formal Concept Analysis. - Jaume Baixeries; José L. Balcázar (ICFCA, 2005)

Editors' Introduction. - José L. Balcázar; Philip M. Long; Frank Stephan 001 (ALT, 2006)

Subtree Testing and Closed Tree Mining Through Natural Representations. - José L. Balcázar; Albert Bifet; Antoni Lozano (DEXA Workshops, 2007)

Mining Frequent Closed Unordered Trees Through Natural Representations. - José L. Balcázar; Albert Bifet; Antoni Lozano (ICCS, 2007)

Characterizing Implications of Injective Partial Orders. - José L. Balcázar; Gemma C. Garriga (ICCS, 2007)

A general dimension for query learning. - José L. Balcázar; Jorge Castro; David Guijarro; Johannes Köbler; Wolfgang Lindner 002 (J. Comput. Syst. Sci., 2007)

Horn axiomatizations for sequential data. - José L. Balcázar; Gemma C. Garriga (Theor. Comput. Sci., 2007)

Query Learning and Certificates in Lattices. - Marta Arias; José L. Balcázar (ALT, 2008)

Deduction Schemes for Association Rules. - José L. Balcázar (Discovery Science, 2008)

Mining Implications from Lattices of Closed Trees. - José L. Balcázar; Albert Bifet; Antoni Lozano (EGC, 2008)

Minimum-Size Bases of Association Rules. - José L. Balcázar (ECML/PKDD (1), 2008)

Provably Fast Training Algorithms for Support Vector Machines. - José L. Balcázar; Yang Dai; Junichi Tanaka; Osamu Watanabe 001 (Theory Comput. Syst., 2008)

Canonical Horn Representations and Query Learning. - Marta Arias; José L. Balcázar (ALT, 2009)

Two Measures of Objective Novelty in Association Rule Mining. - José L. Balcázar (PAKDD Workshops, 2009)

Objective Novelty of Association Rules : Measuring the Confidence Boost. - José L. Balcázar (EGC, 2010)

Filtering Association Rules with Negations on the Basis of Their Confidence Boost. - José L. Balcázar; Cristina Tîrnauca; Marta E. Zorrilla (KDIR, 2010)

Redundancy, Deduction Schemes, and Minimum-Size Bases for Association Rules - José L. Balcázar (Log. Methods Comput. Sci., 2010)

Guest editors' introduction: special issue of selected papers from ECML PKDD 2010. - José L. Balcázar; Francesco Bonchi; Aristides Gionis; Michèle Sebag (Data Min. Knowl. Discov., 2010)

Closure-Based Confidence Boost in Association Rules. - José L. Balcázar (WAPA, 2010)

Special issue for ECML PKDD 2010: Guest editors' introduction. - José L. Balcázar; Francesco Bonchi; Aristides Gionis; Michèle Sebag (Mach. Learn., 2010)

Mining frequent closed rooted trees. - José L. Balcázar; Albert Bifet; Antoni Lozano (Mach. Learn., 2010)

Towards Parameter-free Data Mining: Mining Educational Data with Yacaree. - Marta E. Zorrilla; Diego García-Saiz; José L. Balcázar (EDM, 2011)

Parameter-free Association Rule Mining with Yacaree. - José L. Balcázar (EGC, 2011)

Closed-set-based Discovery of Representative Association Rules Revisited. - José L. Balcázar; Cristina Tîrnauca (EGC, 2011)

Border Algorithms for Computing Hasse Diagrams of Arbitrary Lattices. - José L. Balcázar; Cristina Tîrnauca (ICFCA, 2011)

Preface. - Tom Diethe; José L. Balcázar; John Shawe-Taylor; Cristina Tîrnauca (WAPA, 2011)

Construction and learnability of canonical Horn formulas. - Marta Arias; José L. Balcázar (Mach. Learn., 2011)

Evaluation of Association Rule Quality Measures through Feature Extraction. - José L. Balcázar; Francis Dogbey (IDA, 2013)

Formal and computational properties of the confidence boost of association rules. - José L. Balcázar (ACM Trans. Knowl. Discov. Data, 2013)

Quantitative Redundancy in Partial Implications. - José L. Balcázar (ICFCA, 2015)

Entailment among Probabilistic Implications. - Albert Atserias; José L. Balcázar (LICS, 2015)

Learning Propositional Horn Formulas from Closure Queries. - Marta Arias; José L. Balcázar; Cristina Tîrnauca (CoRR, 2015)

Learning definite Horn formulas from closure queries. - Marta Arias; José L. Balcázar; Cristina Tîrnauca (Theor. Comput. Sci., 2017)

Decomposition of Quantitative Gaifman Graphs as a Data Analysis Tool. - José Luis Balcázar; Marie Ely Piceno; Laura Rodríguez-Navas (IDA, 2018)

Global optimality in k-means clustering. - Cristina Tîrnauca; Domingo Gómez-Pérez; José L. Balcázar; José L. Montaña (Inf. Sci., 2018)

Hierarchical Visualization of Co-Occurrence Patterns on Diagnostic Data. - José Luis Balcázar; Marie Ely Piceno; Laura Rodríguez-Navas (CBMS, 2019)

Analysis of Co-Occurrence Patterns in Data through Modular and Clan Decompositions of Gaifman Graphs. - Marie Ely Piceno; José Luis Balcázar (CoRR, 2019)

Relative Entailment Among Probabilistic Implications. - Albert Atserias; José L. Balcázar; Marie Ely Piceno (Log. Methods Comput. Sci., 2019)

Closed-Set-Based Discovery of Representative Association Rules. - Cristina Tîrnauca; José L. Balcázar; Domingo Gómez-Pérez (Int. J. Found. Comput. Sci., 2020)

Co-occurrence patterns in diagnostic data. - Marie Ely Piceno; Laura Rodríguez-Navas; José Luis Balcázar (Comput. Intell., 2021)

Tight Paths and Tight Pairs in Weighted Directed Graphs. - José Luis Balcázar (CoRR, 2025)