| 2008 |
|---|
| 12 | EE | Joxe Gaintzarain,
Montserrat Hermo,
Paqui Lucio,
Marisa Navarro:
Systematic Semantic Tableaux for PLTL.
Electr. Notes Theor. Comput. Sci. 206: 59-73 (2008) |
| 2007 |
|---|
| 11 | EE | 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 |
|---|
| 10 | EE | Joxe Gaintzarain,
Montserrat Hermo,
Marisa Navarro:
Goals in the Propositional Horn Language Are Monotone Boolean Circuits.
MFCS 2005: 376-386 |
| 2002 |
|---|
| 9 | EE | Montserrat Hermo,
Víctor Lavín:
Negative Results on Learning Dependencies with Queries.
AMAI 2002 |
| 1999 |
|---|
| 8 | EE | Montserrat Hermo,
Víctor Lavín:
Learning Minimal Covers of Functional Dependencies with Queries.
ATL 1999: 291-300 |
| 1998 |
|---|
| 7 | EE | José L. Balcázar,
Montserrat Hermo:
The Structure of Logarithmic Advice Complexity Classes.
Theor. Comput. Sci. 207(1): 217-244 (1998) |
| 1997 |
|---|
| 6 | EE | Montserrat Hermo:
Compressibility and Uniform Complexity.
Inf. Process. Lett. 62(5): 259-264 (1997) |
| 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 |
