José L. Balcázar - researchr alias

researchr

You are not signed in
Sign in
Sign up

2011

Border Algorithms for Computing Hasse Diagrams of Arbitrary LatticesJosé L. Balcázar, Cristina Tîrnauca. icfca 2011: 49-64 [doi]

Closed-set-based Discovery of Representative Association Rules RevisitedJosé L. Balcázar, Cristina Tîrnauca. f-egc 2011: 635-646

Parameter-free Association Rule Mining with YacareeJosé L. Balcázar. f-egc 2011: 251-254

2010

Special issue for ECML PKDD 2010: Guest editors introductionJosé L. Balcázar, Francesco Bonchi, Aristides Gionis, Michèle Sebag. ml, 81(1):1-4, 2010. [doi]

Guest editors introduction: special issue of selected papers from ECML PKDD 2010José L. Balcázar, Francesco Bonchi, Aristides Gionis, Michèle Sebag. datamine, 21(2):221-223, 2010. [doi]

Mining frequent closed rooted treesJosé L. Balcázar, Albert Bifet, Antoni Lozano. ml, 78(1-2):1-33, 2010. [doi]

Machine Learning and Knowledge Discovery in Databases, European Conference, ECML PKDD 2010, Barcelona, Spain, September 20-24, 2010, Proceedings, Part IJosé L. Balcázar, Francesco Bonchi, Aristides Gionis, Michèle Sebag, editors, Volume 6321 of Lecture Notes in Computer Science, Springer, 2010. [doi]

Machine Learning and Knowledge Discovery in Databases, European Conference, ECML PKDD 2010, Barcelona, Spain, September 20-24, 2010, Proceedings, Part IIIJosé L. Balcázar, Francesco Bonchi, Aristides Gionis, Michèle Sebag, editors, Volume 6323 of Lecture Notes in Computer Science, Springer, 2010. [doi]

Machine Learning and Knowledge Discovery in Databases, European Conference, ECML PKDD 2010, Barcelona, Spain, September 20-24, 2010, Proceedings, Part IIJosé L. Balcázar, Francesco Bonchi, Aristides Gionis, Michèle Sebag, editors, Volume 6322 of Lecture Notes in Computer Science, Springer, 2010. [doi]

Closure-Based Confidence Boost in Association RulesJosé L. Balcázar. jmlr, 11:74-80, 2010. [doi]

2009

Two Measures of Objective Novelty in Association Rule MiningJosé L. Balcázar. pakdd 2010: 76-98 [doi]

2008

2007

2006

Algorithmic Learning Theory, 17th International Conference, ALT 2006, Barcelona, Spain, October 7-10, 2006, ProceedingsJosé L. Balcázar, Philip M. Long, Frank Stephan, editors, Volume 4264 of Lecture Notes in Computer Science, Springer, 2006.

Editors IntroductionJosé L. Balcázar, Philip M. Long, Frank Stephan. alt 2006: 1-9 [doi]

2005

Characterization and Armstrong Relations for Degenerate Multivalued Dependencies Using Formal Concept AnalysisJaume Baixeries, José L. Balcázar. icfca 2005: 162-175 [doi]

On Horn Axiomatizations for Sequential DataJosé L. Balcázar, Gemma Casas-Garriga. icdt 2005: 215-229 [doi]

2004

Characterizations of Multivalued Dependencies and Related ExpressionsJosé L. Balcázar, Jaume Baixeries. dis 2004: 306-313 [doi]

Coproduct Transformations on Lattices of Closed Partial OrdersGemma Casas-Garriga, José L. Balcázar. gg 2004: 336-351 [doi]

2002

A Best-First Strategy for Finding Frequent SetsJaume Baixeries, Gemma Casas-Garriga, José L. Balcázar. f-egc 2002: 101-106

A New Abstract Combinatorial Dimension for Exact Learning via QueriesJosé L. Balcázar, Jorge Castro, David Guijarro. jcss, 64(1):2-21, 2002. [doi]

The consistency dimension and distribution-dependent learning from queriesJosé L. Balcázar, Jorge Castro, David Guijarro, Hans-Ulrich Simon. TCS, 288(2):197-215, 2002.

2001

2000

Abstract Combinatorial Characterizations of Exact Learning via QueriesJosé L. Balcázar, Jorge Castro, David Guijarro. colt 2000: 248-254

Editor s ForewordJosé L. Balcázar. jcss, 60(2):336, 2000.

1999

The Consistency Dimension, Compactness, and Query LearningJosé L. Balcázar. csl 1999: 2-13

The Consistency Dimension and Distribution-Dependent Learning from Queries (Extended Abstract)José L. Balcázar, Jorge Castro, David Guijarro, Hans-Ulrich Simon. alt 1999: 77-92 [doi]

1998

The Structure of Logarithmic Advice Complexity ClassesJosé L. Balcázar, Montserrat Hermo. TCS, 207(1):217-244, 1998. [doi]

1997

1996

An Optimal Parallel Algorithm for Learning DFAJosé L. Balcázar, Josep Díaz, Ricard Gavaldà, Osamu Watanabe. jucs, 2(3):97-112, 1996.

The Complexity of Searching Implicit GraphsJosé L. Balcázar. ai, 86(1):171-188, 1996. [doi]

1995

1994

The Query Complexity of Learning DFAJosé L. Balcázar, Josep Díaz, Ricard Gavaldà, Osamu Watanabe. ngc, 12(4):337-358, 1994.

An Optimal Parallel Algorithm for Learning DFAJosé L. Balcázar, Josep Díaz, Ricard Gavaldà, Osamu Watanabe. colt 1994: 208-217 [doi]

1993

A First-Order Isomorphism TheoremEric Allender, José L. Balcázar, Neil Immerman. STACS 1993: 163-174

Some Structural Complexity Aspects of Neural ComputationJosé L. Balcázar, Ricard Gavaldà, Hava T. Siegelmann, Eduardo D. Sontag. cocoon 1993: 253-265

Programacion metodicaJosé L. Balcázar. McGraw-Hill, 1993.

1992

1991

1990

Self-ReducibilityJosé L. Balcázar. jcss, 41(3):367-388, 1990.

Generalized Kolmogorov Complexity in Relativized Separations (Extended Abstract)Ricard Gavaldà, Leen Torenvliet, Osamu Watanabe, José L. Balcázar. mfcs 1990: 269-276

1989

Nondeterministic Witnesses and Nonuniform AdviceJosé L. Balcázar. cocoon 1989: 259-269

Nonuniform Complexity Classes Specified by Lower and Upper BoundsJosé L. Balcázar, Joaquim Gabarró. ita, 23(2):177-194, 1989.

The Complexity of Graph Problems fore Succinctly Represented GraphsAntoni Lozano, José L. Balcázar. criwg 1990: 277-286

Deriving Specifications of Embeddings in Recursive Program DesignCelestí Rosselló, José L. Balcázar, Ricardo Pena. stp, 10(3):133-145, 1989.

1988

Immunity and Simplicity in Relativizations of Probabilistic Complexity ClassesJosé L. Balcázar, David A. Russo. ita, 22(2):227-244, 1988.

Strong and Robustly Strong Polynomial Time Reducibilities to Sparse SetsRicard Gavaldà, José L. Balcázar. mfcs 1988: 300-308

1987

On Characterizations of the Class PSPACE/POLYJosé L. Balcázar, Josep Díaz, Joaquim Gabarró. TCS, 52:251-267, 1987.

Self-ReducibilityJosé L. Balcázar. STACS 1987: 136-147

Optimized Mesh-Connected Networks for SIMD and MIMD ArchitecturesRamón Beivide, Enrique Herrada, José L. Balcázar, Jesús Labarta. isca 1987: 163-170

1986

On Non- uniform Polynomial SpaceJosé L. Balcázar, Josep Díaz, Joaquim Gabarró. cocoon 1986: 35-50

Some comments about notations of orders of manitudeJosé L. Balcázar, Joaquim Gabarró. eatcs, 30:34-42, 1986.

Sparse Sets, Lowness and HighnessJosé L. Balcázar, Ronald V. Book, Uwe Schöning. siamcomp, 15(3):739-747, 1986.

The polynomial-time hierarchy and sparse oraclesJosé L. Balcázar, Ronald V. Book, Uwe Schöning. JACM, 33(3):603-617, 1986. [doi]

On (Greek D)D_P²-ImmunityJosé L. Balcázar. ipl, 23(1):25-28, 1986.

Sets with Small Generalized Kolmogorov ComplexityJosé L. Balcázar, Ronald V. Book. ACTA, 23(6):679-688, 1986.

On Generalized Kolmogorov ComplexityJosé L. Balcázar, Ronald V. Book. STACS 1986: 334-340

1985

Uniform Characterizations of Non-Uniform Complexity MeasuresJosé L. Balcázar, Josep Díaz, Joaquim Gabarró. iandc, 67(1-3):53-69, October/November/December 1985.

Examples of CFI-BI-immune and CF-levelable sets in logspaceJosé L. Balcázar, Josep Díaz, Joaquim Gabarró. eatcs, 25:11-13, 1985.

On Bounded Query MachinesJosé L. Balcázar, Ronald V. Book, Uwe Schöning. TCS, 40:237-243, 1985.

Simplicity, Relativizations and NondeterminismJosé L. Balcázar. siamcomp, 14(1):148-157, 1985.

On some non-uniform complexity measuresJosé L. Balcázar, Josep Díaz, Joaquim Gabarró. fct 1985: 18-27

Bi-Immune Sets for Complexity ClassesJosé L. Balcázar, Uwe Schöning. mst, 18(1):1-10, 1985.

1984

1982

A Note on a Theorem by LadnerJosé L. Balcázar, Josep Díaz. ipl, 15(2):84-86, 1982.