Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Montserrat Hermo
Montserrat Hermo Huguet
2010 – today
- 2013
[j9]Jose Gaintzarain, Montserrat Hermo, Paqui Lucio, Marisa Navarro, Fernando Orejas: Invariant-Free Clausal Temporal Resolution. J. Autom. Reasoning 50(1): 1-49 (2013)- 2011
[j8]Víctor Lavín Puente, Montserrat Hermo: Negative results on learning multivalued dependencies with queries. Inf. Process. Lett. 111(19): 968-972 (2011)- 2010
[j7]Joxe Gaintzarain, Montserrat Hermo, Paqui Lucio, Marisa Navarro: Translating propositional extended conjunctions of Horn clauses into Boolean circuits. Theor. Comput. Sci. 411(16-18): 1723-1733 (2010)
2000 – 2009
- 2009
[j6]Mikel Alecha, Montserrat Hermo: A Learning Algorithm for Deterministic Finite Automata using JFLAP. Electr. Notes Theor. Comput. Sci. 248: 47-56 (2009)
[j5]Joxe Gaintzarain, Montserrat Hermo, Paqui Lucio, Marisa Navarro, Fernando Orejas: Dual Systems of Tableaux and Sequents for PLTL. J. Log. Algebr. Program. 78(8): 701-722 (2009)- 2008
[j4]Joxe Gaintzarain, Montserrat Hermo, Paqui Lucio, Marisa Navarro: Systematic Semantic Tableaux for PLTL. Electr. Notes Theor. Comput. Sci. 206: 59-73 (2008)- 2007
[c9]Joxe Gaintzarain, Montserrat Hermo, Paqui Lucio, Marisa Navarro, Fernando Orejas: A Cut-Free and Invariant-Free Sequent Calculus for PLTL. CSL 2007: 481-495- 2005
[c8]Joxe Gaintzarain, Montserrat Hermo, Marisa Navarro: Goals in the Propositional Horn Language Are Monotone Boolean Circuits. MFCS 2005: 376-386- 2002
[c7]
[c6]
1990 – 1999
- 1999
[c5]Montserrat Hermo, Víctor Lavín: Learning Minimal Covers of Functional Dependencies with Queries. ALT 1999: 291-300- 1998
[j3]José L. Balcázar, Montserrat Hermo: The Structure of Logarithmic Advice Complexity Classes. Theor. Comput. Sci. 207(1): 217-244 (1998)- 1997
[j2]- 1996
[b1]Montserrat Hermo Huguet: Nonuniform complexity classes with sub-linear advice functions. Universität Barcelona 1996, pp. 1-156- 1995
[c4]José L. Balcázar, Harry Buhrman, Montserrat Hermo: Learnability of Kolmogorov-easy circuit expressions via queries. EuroCOLT 1995: 112-124
[c3]Harry Buhrman, Montserrat Hermo: On the Sparse Set Conjecture for Sets with Low Denisty. STACS 1995: 609-618- 1994
[j1]Montserrat Hermo, Elvira Mayordomo: A Note on Polynomial-Size Circuits with Low Resource-Bounded Kolmogorov Complexity. Mathematical Systems Theory 27(4): 347-356 (1994)
[c2]- 1992
[c1]José L. Balcázar, Montserrat Hermo, Elvira Mayordomo: Characterizations of Logarithmic Advice Complexity Classes. IFIP Congress (1) 1992: 315-321
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2012-12-27 18:36 CET by the dblp team



