| 2009 |
|---|
| 9 | EE | Francine Blanchet-Sadri,
Raphael M. Jungers,
Justin Palumbo:
Testing avoidability on sets of partial words is hard.
Theor. Comput. Sci. 410(8-10): 968-972 (2009) |
| 2008 |
|---|
| 8 | EE | Raphael M. Jungers,
Vladimir Protasov,
Vincent D. Blondel:
Computing the Growth of the Number of Overlap-Free Words with Spectra of Matrices.
LATIN 2008: 84-93 |
| 7 | EE | Jean Cardinal,
Samuel Fiorini,
Gwenaël Joret,
Raphael M. Jungers,
J. Ian Munro:
An Efficient Algorithm for Partial Order Production
CoRR abs/0811.2572: (2008) |
| 2007 |
|---|
| 6 | EE | Raphael M. Jungers,
Vladimir Protasov,
Vincent D. Blondel:
Overlap-free words and spectra of matrices
CoRR abs/0709.1794: (2007) |
| 5 | EE | Raphael M. Jungers,
Vincent D. Blondel:
Observable Graphs
CoRR abs/cs/0702091: (2007) |
| 4 | EE | Vincent D. Blondel,
Julien M. Hendrickx,
Raphael M. Jungers:
Linear time algorithms for Clobber
CoRR abs/cs/0703054: (2007) |
| 2006 |
|---|
| 3 | EE | Vincent D. Blondel,
Raphael M. Jungers,
Vladimir Protasov:
On the complexity of computing the capacity of codes that avoid forbidden difference patterns
CoRR abs/cs/0601036: (2006) |
| 2 | EE | Raphael M. Jungers,
Vladimir Protasov,
Vincent D. Blondel:
Efficient algorithms for deciding the type of growth of products of integer matrices
CoRR abs/cs/0604047: (2006) |
| 1 | EE | Vincent D. Blondel,
Raphael M. Jungers,
Vladimir Protasov:
On the Complexity of Computing the Capacity of Codes That Avoid Forbidden Difference Patterns.
IEEE Transactions on Information Theory 52(11): 5122-5127 (2006) |
