The SCEAS System
Navigation Menu

Search the dblp DataBase


Montserrat Hermo: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Montserrat Hermo, Víctor Lavín
    Learning Minimal Covers of Functional Dependencies with Queries. [Citation Graph (0, 0)][DBLP]
    ATL, 1999, pp:291-300 [Conf]
  2. Montserrat Hermo, Víctor Lavín
    Negative Results on Learning Dependencies with Queries. [Citation Graph (0, 0)][DBLP]
    AMAI, 2002, pp:- [Conf]
  3. 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]
  4. 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]
  5. Joxe Gaintzarain, Montserrat Hermo, Marisa Navarro
    Goals in the Propositional Horn Language Are Monotone Boolean Circuits. [Citation Graph (0, 0)][DBLP]
    MFCS, 2005, pp:376-386 [Conf]
  6. Montserrat Hermo
    Degrees and Reducibilities of Easy Tally Sets. [Citation Graph (0, 0)][DBLP]
    MFCS, 1994, pp:403-412 [Conf]
  7. Harry Buhrman, Montserrat Hermo
    On the Sparse Set Conjecture for Sets with Low Denisty. [Citation Graph (0, 0)][DBLP]
    STACS, 1995, pp:609-618 [Conf]
  8. Montserrat Hermo
    Compressibility and Uniform Complexity. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1997, v:62, n:5, pp:259-264 [Journal]
  9. Montserrat Hermo, Elvira Mayordomo
    A Note on Polynomial-Size Circuits with Low Resource-Bounded Kolmogorov Complexity. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1994, v:27, n:4, pp:347-356 [Journal]
  10. 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]
  11. Joxe Gaintzarain, Montserrat Hermo, Paqui Lucio, Marisa Navarro, Fernando Orejas
    A Cut-Free and Invariant-Free Sequent Calculus for PLTL. [Citation Graph (0, 0)][DBLP]
    CSL, 2007, pp:481-495 [Conf]

  12. Systematic Semantic Tableaux for PLTL. [Citation Graph (, )][DBLP]

  13. A Learning Algorithm for Deterministic Finite Automata using JFLAP. [Citation Graph (, )][DBLP]

Search in 0.002secs, Finished in 0.002secs
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
System created by [] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002