The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
José L. Balcázar: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  76. Query Learning and Certificates in Lattices. [Citation Graph (, )][DBLP]


  77. Canonical Horn Representations and Query Learning. [Citation Graph (, )][DBLP]


  78. Deduction Schemes for Association Rules. [Citation Graph (, )][DBLP]


  79. Mining Implications from Lattices of Closed Trees. [Citation Graph (, )][DBLP]


  80. Objective Novelty of Association Rules : Measuring the Confidence Boost. [Citation Graph (, )][DBLP]


  81. Two Measures of Objective Novelty in Association Rule Mining. [Citation Graph (, )][DBLP]


  82. Minimum-Size Bases of Association Rules. [Citation Graph (, )][DBLP]


  83. Redundancy, Deduction Schemes, and Minimum-Size Bases for Association Rules [Citation Graph (, )][DBLP]


Search in 0.008secs, Finished in 0.011secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002