| 2007 |
|---|
| 10 | EE | Maxime Benoît-Gagné,
Sylvie Hamel:
A New and Faster Method of Sorting by Transpositions.
CPM 2007: 131-141 |
| 2006 |
|---|
| 9 | EE | Olivier Kaczor,
Yann-Gaël Guéhéneuc,
Sylvie Hamel:
Efficient Identification of Design Patterns with Bit-vector Algorithm.
CSMR 2006: 175-184 |
| 8 | EE | Sylvie Hamel:
A Study of Some Easily Parallellizable Automata.
JCIS 2006 |
| 2005 |
|---|
| 7 | EE | Valentin Guignon,
Cedric Chauve,
Sylvie Hamel:
An Edit Distance Between RNA Stem-Loops.
SPIRE 2005: 335-347 |
| 2004 |
|---|
| 6 | EE | Srecko Brlek,
Sylvie Hamel,
Maurice Nivat,
Christophe Reutenauer:
On The Palindromic Complexity Of Infinite Words.
Int. J. Found. Comput. Sci. 15(2): 293-306 (2004) |
| 5 | EE | Anne Bergeron,
Sylvie Hamel:
From cascade decompositions to bit-vector algorithms.
Theor. Comput. Sci. 313(1): 3-16 (2004) |
| 2002 |
|---|
| 4 | EE | Anne Bergeron,
Sylvie Hamel:
Vector Algorithms for Approximate String Matching.
Int. J. Found. Comput. Sci. 13(1): 53-66 (2002) |
| 2001 |
|---|
| 3 | EE | Anne Bergeron,
Sylvie Hamel:
Cascade Decompositions are Bit-Vector Algorithms.
CIAA 2001: 13-26 |
| 2000 |
|---|
| 2 | EE | Anne Bergeron,
Sylvie Hamel:
Fast Implementations of Automata Computations.
CIAA 2000: 47-56 |
| 1 | EE | François Bergeron,
Sylvie Hamel:
Intersection of modules related to Macdonald's polynomials.
Discrete Mathematics 217(1-3): 51-64 (2000) |
