| 2008 |
|---|
| 81 | EE | M. Arias,
José L. Balcázar:
Query Learning and Certificates in Lattices.
ALT 2008: 303-315 |
| 80 | EE | José L. Balcázar:
Deduction Schemes for Association Rules.
Discovery Science 2008: 124-135 |
| 79 | EE | José L. Balcázar:
Minimum-Size Bases of Association Rules.
ECML/PKDD (1) 2008: 86-101 |
| 78 | | José L. Balcázar,
Albert Bifet,
Antoni Lozano:
Mining Implications from Lattices of Closed Trees.
EGC 2008: 373-384 |
| 77 | EE | José L. Balcázar,
Yang Dai,
Junichi Tanaka,
Osamu Watanabe:
Provably Fast Training Algorithms for Support Vector Machines.
Theory Comput. Syst. 42(4): 568-595 (2008) |
| 2007 |
|---|
| 76 | EE | José L. Balcázar,
Albert Bifet,
Antoni Lozano:
Subtree Testing and Closed Tree Mining Through Natural Representations.
DEXA Workshops 2007: 499-503 |
| 75 | EE | José L. Balcázar,
Albert Bifet,
Antoni Lozano:
Mining Frequent Closed Unordered Trees Through Natural Representations.
ICCS 2007: 347-359 |
| 74 | EE | José L. Balcázar,
Gemma C. Garriga:
Characterizing Implications of Injective Partial Orders.
ICCS 2007: 492-495 |
| 73 | EE | José L. Balcázar,
Jorge Castro,
David Guijarro,
Johannes Köbler,
Wolfgang Lindner:
A general dimension for query learning.
J. Comput. Syst. Sci. 73(6): 924-940 (2007) |
| 72 | EE | José L. Balcázar,
Gemma C. Garriga:
Horn axiomatizations for sequential data.
Theor. Comput. Sci. 371(3): 247-264 (2007) |
| 2006 |
|---|
| 71 | | José L. Balcázar,
Philip M. Long,
Frank Stephan:
Algorithmic Learning Theory, 17th International Conference, ALT 2006, Barcelona, Spain, October 7-10, 2006, Proceedings
Springer 2006 |
| 70 | EE | José L. Balcázar,
Philip M. Long,
Frank Stephan:
Editors' Introduction.
ALT 2006: 1-9 |
| 2005 |
|---|
| 69 | EE | José L. Balcázar,
Gemma Casas-Garriga:
On Horn Axiomatizations for Sequential Data.
ICDT 2005: 215-229 |
| 68 | EE | Jaume Baixeries,
José L. Balcázar:
Characterization and Armstrong Relations for Degenerate Multivalued Dependencies Using Formal Concept Analysis.
ICFCA 2005: 162-175 |
| 2004 |
|---|
| 67 | EE | José L. Balcázar,
Jaume Baixeries:
Characterizations of Multivalued Dependencies and Related Expressions.
Discovery Science 2004: 306-313 |
| 66 | EE | Gemma Casas-Garriga,
José L. Balcázar:
Coproduct Transformations on Lattices of Closed Partial Orders.
ICGT 2004: 336-351 |
| 2002 |
|---|
| 65 | | Jaume Baixeries,
Gemma Casas-Garriga,
José L. Balcázar:
A Best-First Strategy for Finding Frequent Sets.
EGC 2002: 101-106 |
| 64 | EE | José L. Balcázar,
Jorge Castro,
David Guijarro:
A New Abstract Combinatorial Dimension for Exact Learning via Queries.
J. Comput. Syst. Sci. 64(1): 2-21 (2002) |
| 63 | | José L. Balcázar,
Jorge Castro,
David Guijarro,
Hans-Ulrich Simon:
The consistency dimension and distribution-dependent learning from queries.
Theor. Comput. Sci. 288(2): 197-215 (2002) |
| 2001 |
|---|
| 62 | EE | José L. Balcázar,
Yang Dai,
Osamu Watanabe:
A Random Sampling Technique for Training Support Vector Machines.
ALT 2001: 119-134 |
| 61 | EE | José L. Balcázar,
Jorge Castro,
David Guijarro:
A General Dimension for Exact Learning.
COLT/EuroCOLT 2001: 354-367 |
| 60 | EE | Inmaculada Fortes Ruiz,
José L. Balcázar,
Rafael Morales Bueno:
Bounding Negative Information in Frequent Sets Algorithms.
Discovery Science 2001: 50-58 |
| 59 | EE | José L. Balcázar,
Yang Dai,
Osamu Watanabe:
Provably Fast Training Algorithms for Support Vector Machines.
ICDM 2001: 43-50 |
| 2000 |
|---|
| 58 | | José L. Balcázar,
Jorge Castro,
David Guijarro:
Abstract Combinatorial Characterizations of Exact Learning via Queries.
COLT 2000: 248-254 |
| 57 | | José L. Balcázar:
Editor's Foreword.
J. Comput. Syst. Sci. 60(2): 336 (2000) |
| 1999 |
|---|
| 56 | EE | José L. Balcázar,
Jorge Castro,
David Guijarro,
Hans-Ulrich Simon:
The Consistency Dimension and Distribution-Dependent Learning from Queries (Extended Abstract).
ATL 1999: 77-92 |
| 55 | | José L. Balcázar:
The Consistency Dimension, Compactness, and Query Learning.
CSL 1999: 2-13 |
| 1998 |
|---|
| 54 | EE | José L. Balcázar,
Montserrat Hermo:
The Structure of Logarithmic Advice Complexity Classes.
Theor. Comput. Sci. 207(1): 217-244 (1998) |
| 1997 |
|---|
| 53 | | José L. Balcázar,
Josep Díaz,
Ricard Gavaldà:
Algorithms for Learning Finite Automata from Queries: A Unified View.
Advances in Algorithms, Languages, and Complexity 1997: 53-72 |
| 52 | | José L. Balcázar,
Ricard Gavaldà,
Osamu Watanabe:
Coding Complexity: The Computational Complexity of Succinct Descriptions.
Advances in Algorithms, Languages, and Complexity 1997: 73-91 |
| 51 | | José L. Balcázar,
Ricard Gavaldà,
Hava T. Siegelmann:
Computational power of neural networks: a characterization in terms of Kolmogorov complexity.
IEEE Transactions on Information Theory 43(4): 1175-1183 (1997) |
| 50 | | Eric Allender,
José L. Balcázar,
Neil Immerman:
A First-Order Isomorphism Theorem.
SIAM J. Comput. 26(2): 557-567 (1997) |
| 1996 |
|---|
| 49 | EE | José L. Balcázar:
The Complexity of Searching Implicit Graphs.
Artif. Intell. 86(1): 171-188 (1996) |
| 48 | | José L. Balcázar,
Josep Díaz,
Ricard Gavaldà,
Osamu Watanabe:
An Optimal Parallel Algorithm for Learning DFA.
J. UCS 2(3): 97-112 (1996) |
| 1995 |
|---|
| 47 | | Jorge Castro,
José L. Balcázar:
Simple PAC Learning of Simple Decision Lists.
ALT 1995: 239-248 |
| 46 | | José L. Balcázar,
Harry Buhrman,
Montserrat Hermo:
Learnability of Kolmogorov-easy circuit expressions via queries.
EuroCOLT 1995: 112-124 |
| 45 | | José L. Balcázar:
The Complexity of Searching Succinctly Represented Graphs.
ICALP 1995: 208-219 |
| 44 | | José L. Balcázar,
Elvira Mayordomo:
A Note on Genericity and Bi-Immunity.
Structure in Complexity Theory Conference 1995: 193-196 |
| 43 | | Carme Àlvarez,
José L. Balcázar,
Birgit Jenner:
Adaptive Logspace Reducibility and Parallel Time.
Mathematical Systems Theory 28(2): 117-140 (1995) |
| 1994 |
|---|
| 42 | EE | José L. Balcázar,
Josep Díaz,
Ricard Gavaldà,
Osamu Watanabe:
An Optimal Parallel Algorithm for Learning DFA.
COLT 1994: 208-217 |
| 41 | | José L. Balcázar,
Josep Díaz,
Ricard Gavaldà,
Osamu Watanabe:
The Query Complexity of Learning DFA.
New Generation Comput. 12(4): 337-358 (1994) |
| 1993 |
|---|
| 40 | | Eric Allender,
José L. Balcázar,
Neil Immerman:
A First-Order Isomorphism Theorem.
STACS 1993: 163-174 |
| 39 | | José L. Balcázar,
Ricard Gavaldà,
Hava T. Siegelmann,
Eduardo D. Sontag:
Some Structural Complexity Aspects of Neural Computation.
Structure in Complexity Theory Conference 1993: 253-265 |
| 1992 |
|---|
| 38 | | José L. Balcázar,
Josep Díaz,
Ricard Gavaldà,
Osamu Watanabe:
A Note on the Query Complexity of Learning DFA (Extended Abstract).
ALT 1992: 53-62 |
| 37 | | José L. Balcázar,
Montserrat Hermo,
Elvira Mayordomo:
Characterizations of Logarithmic Advice Complexity Classes.
IFIP Congress (1) 1992: 315-321 |
| 36 | | José L. Balcázar,
Joaquim Gabarró,
Miklos Santha:
Deciding Bisimilarity is P-Complete.
Formal Asp. Comput. 4(6A): 638-648 (1992) |
| 35 | | José L. Balcázar,
Uwe Schöning:
Logarithmic Advice Classes.
Theor. Comput. Sci. 99(2): 279-290 (1992) |
| 1991 |
|---|
| 34 | | Carme Àlvarez,
José L. Balcázar,
Joaquim Gabarró,
Miklos Santha:
Parallel Complexity in the Design and Analysis on Conurrent Systems.
PARLE (1) 1991: 288-303 |
| 33 | | Carme Àlvarez,
José L. Balcázar,
Birgit Jenner:
Functional Oracle Queries as a Measure of Parallel Time.
STACS 1991: 422-433 |
| 32 | | José L. Balcázar:
Adaptive Logspace and Depth-Bounded Reducibilities.
Structure in Complexity Theory Conference 1991: 240-254 |
| 31 | | Ramón Beivide,
Enrique Herrada,
José L. Balcázar,
Agustin Arruabarrena:
Optimal Distance Networks of Low Degree for Parallel Computers.
IEEE Trans. Computers 40(10): 1109-1124 (1991) |
| 30 | | Ricard Gavaldà,
José L. Balcázar:
Strong and Robustly Strong Polynomial-Time Reducibilities to Sparse Sets.
Theor. Comput. Sci. 88(1): 1-14 (1991) |
| 1990 |
|---|
| 29 | | Ricard Gavaldà,
Leen Torenvliet,
Osamu Watanabe,
José L. Balcázar:
Generalized Kolmogorov Complexity in Relativized Separations (Extended Abstract).
MFCS 1990: 269-276 |
| 28 | | José L. Balcázar:
Self-Reducibility.
J. Comput. Syst. Sci. 41(3): 367-388 (1990) |
| 1989 |
|---|
| 27 | | José L. Balcázar:
Nondeterministic Witnesses and Nonuniform Advice.
Structure in Complexity Theory Conference 1989: 259-269 |
| 26 | | Antoni Lozano,
José L. Balcázar:
The Complexity of Graph Problems fore Succinctly Represented Graphs.
WG 1989: 277-286 |
| 25 | | José L. Balcázar,
Joaquim Gabarró:
Nonuniform Complexity Classes Specified by Lower and Upper Bounds.
ITA 23(2): 177-194 (1989) |
| 24 | | Celestí Rosselló,
José L. Balcázar,
Ricardo Pena:
Deriving Specifications of Embeddings in Recursive Program Design.
Structured Programming 10(3): 133-145 (1989) |
| 1988 |
|---|
| 23 | | Ricard Gavaldà,
José L. Balcázar:
Strong and Robustly Strong Polynomial Time Reducibilities to Sparse Sets.
MFCS 1988: 300-308 |
| 22 | | José L. Balcázar,
David A. Russo:
Immunity and Simplicity in Relativizations of Probabilistic Complexity Classes.
ITA 22(2): 227-244 (1988) |
| 1987 |
|---|
| 21 | | Ramón Beivide,
Enrique Herrada,
José L. Balcázar,
Jesús Labarta:
Optimized Mesh-Connected Networks for SIMD and MIMD Architectures.
ISCA 1987: 163-170 |
| 20 | | José L. Balcázar:
Self-Reducibility.
STACS 1987: 136-147 |
| 19 | | José L. Balcázar,
Josep Díaz,
Joaquim Gabarró:
On Characterizations of the Class PSPACE/POLY.
Theor. Comput. Sci. 52: 251-267 (1987) |
| 1986 |
|---|
| 18 | | José L. Balcázar,
Ronald V. Book:
On Generalized Kolmogorov Complexity.
STACS 1986: 334-340 |
| 17 | | José L. Balcázar,
Josep Díaz,
Joaquim Gabarró:
On Non- uniform Polynomial Space.
Structure in Complexity Theory Conference 1986: 35-50 |
| 16 | | José L. Balcázar,
Ronald V. Book:
Sets with Small Generalized Kolmogorov Complexity.
Acta Inf. 23(6): 679-688 (1986) |
| 15 | | José L. Balcázar,
Joaquim Gabarró:
Some comments about notations of orders of manitude.
Bulletin of the EATCS 30: 34-42 (1986) |
| 14 | | José L. Balcázar:
On (Greek D)D_P²-Immunity.
Inf. Process. Lett. 23(1): 25-28 (1986) |
| 13 | EE | José L. Balcázar,
Ronald V. Book,
Uwe Schöning:
The polynomial-time hierarchy and sparse oracles.
J. ACM 33(3): 603-617 (1986) |
| 12 | | José L. Balcázar,
Ronald V. Book,
Uwe Schöning:
Sparse Sets, Lowness and Highness.
SIAM J. Comput. 15(3): 739-747 (1986) |
| 1985 |
|---|
| 11 | | José L. Balcázar,
Josep Díaz,
Joaquim Gabarró:
On some "non-uniform" complexity measures.
FCT 1985: 18-27 |
| 10 | | José L. Balcázar,
Josep Díaz,
Joaquim Gabarró:
Examples of CFI-BI-immune and CF-levelable sets in logspace.
Bulletin of the EATCS 25: 11-13 (1985) |
| 9 | | José L. Balcázar,
Josep Díaz,
Joaquim Gabarró:
Uniform Characterizations of Non-Uniform Complexity Measures
Information and Control 67(1-3): 53-69 (1985) |
| 8 | | José L. Balcázar,
Uwe Schöning:
Bi-Immune Sets for Complexity Classes.
Mathematical Systems Theory 18(1): 1-10 (1985) |
| 7 | | José L. Balcázar:
Simplicity, Relativizations and Nondeterminism.
SIAM J. Comput. 14(1): 148-157 (1985) |
| 6 | | José L. Balcázar,
Ronald V. Book,
Uwe Schöning:
On Bounded Query Machines.
Theor. Comput. Sci. 40: 237-243 (1985) |
| 1984 |
|---|
| 5 | | José L. Balcázar,
Ronald V. Book,
Timothy J. Long,
Uwe Schöning,
Alan L. Selman:
Sparse Oracles and Uniform Complexity Classes
FOCS 1984: 308-311 |
| 4 | | José L. Balcázar:
Separating, Strongly Separating, and Collapsing Relativized Complexity Classes.
MFCS 1984: 1-16 |
| 3 | | José L. Balcázar,
Ronald V. Book,
Uwe Schöning:
Sparse Oracles, Lowness, and Highness.
MFCS 1984: 185-193 |
| 2 | | José L. Balcázar,
Josep Díaz,
Joaquim Gabarró:
Some results about Logspace complexity measures.
Bulletin of the EATCS 22: 8 (1984) |
| 1982 |
|---|
| 1 | | José L. Balcázar,
Josep Díaz:
A Note on a Theorem by Ladner.
Inf. Process. Lett. 15(2): 84-86 (1982) |
