| | |
Montserrat Hermo Huguet
List of publications from the DBLP Bibliography Server - FAQ
- CSB - MetaPress - Google - Bing - Yahoo
 | 2011 | |
|---|---|---|
| 18 |      | Víctor Lavín Puente, Montserrat Hermo: Negative results on learning multivalued dependencies with queries. Inf. Process. Lett. 111(19): 968-972 (2011) |
| 2010 | ||
| 17 | | 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) |
| 2009 | ||
| 16 | | Mikel Alecha, Montserrat Hermo: A Learning Algorithm for Deterministic Finite Automata using JFLAP. Electr. Notes Theor. Comput. Sci. 248: 47-56 (2009) |
| 15 | | 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 | ||
| 14 | | Joxe Gaintzarain, Montserrat Hermo, Paqui Lucio, Marisa Navarro: Systematic Semantic Tableaux for PLTL. Electr. Notes Theor. Comput. Sci. 206: 59-73 (2008) |
| 2007 | ||
| 13 | | 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 | ||
| 12 | | Joxe Gaintzarain, Montserrat Hermo, Marisa Navarro: Goals in the Propositional Horn Language Are Monotone Boolean Circuits. MFCS 2005: 376-386 |
| 2002 | ||
| 11 | | Montserrat Hermo, Víctor Lavín: Negative Results on Learning Dependencies with Queries. AMAI 2002 |
| 10 | | Montserrat Hermo, Víctor Lavín: Negative Results on Learning Dependencies with Queries. ISAIM 2002 |
| 1999 | ||
| 9 | | Montserrat Hermo, Víctor Lavín: Learning Minimal Covers of Functional Dependencies with Queries. ATL 1999: 291-300 |
| 1998 | ||
| 8 | | José L. Balcázar, Montserrat Hermo: The Structure of Logarithmic Advice Complexity Classes. Theor. Comput. Sci. 207(1): 217-244 (1998) |
| 1997 | ||
| 7 | | Montserrat Hermo: Compressibility and Uniform Complexity. Inf. Process. Lett. 62(5): 259-264 (1997) |
| 1996 | ||
| 6 |  | Montserrat Hermo Huguet: Nonuniform complexity classes with sub-linear advice functions. Universität Barcelona 1996: 1-156 |
| 1995 | ||
| 5 | | José L. Balcázar, Harry Buhrman, Montserrat Hermo: Learnability of Kolmogorov-easy circuit expressions via queries. EuroCOLT 1995: 112-124 |
| 4 | | Harry Buhrman, Montserrat Hermo: On the Sparse Set Conjecture for Sets with Low Denisty. STACS 1995: 609-618 |
| 1994 | ||
| 3 | | Montserrat Hermo: Degrees and Reducibilities of Easy Tally Sets. MFCS 1994: 403-412 |
| 2 | | Montserrat Hermo, Elvira Mayordomo: A Note on Polynomial-Size Circuits with Low Resource-Bounded Kolmogorov Complexity. Mathematical Systems Theory 27(4): 347-356 (1994) |
| 1992 | ||
| 1 | | José L. Balcázar, Montserrat Hermo, Elvira Mayordomo: Characterizations of Logarithmic Advice Complexity Classes. IFIP Congress (1) 1992: 315-321 |
| 1 | Mikel Alecha | [16] |
| 2 | José L. Balcázar | [1] [5] [8] |
| 3 | Harry Buhrman | [4] [5] |
| 4 | Joxe Gaintzarain | [12] [13] [14] [15] [17] |
| 5 | Paqui Lucio | [13] [14] [15] [17] |
| 6 | Elvira Mayordomo | [1] [2] |
| 7 | Marisa Navarro | [12] [13] [14] [15] [17] |
| 8 | Fernando Orejas | [13] [15] |
| 9 | Víctor Lavín Puente (Víctor Lavín) | [9] [10] [11] [18] |
Colors in the list of coauthors
Last update Sat Jun 2 20:57:36 2012 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page