 | 2009 |
| 12 |  | Jean Cardinal,
Samuel Fiorini,
Gwenaël Joret,
Raphael M. Jungers,
J. Ian Munro:
An efficient algorithm for partial order production.
STOC 2009: 93-100 |
| 11 |  | Vincent D. Blondel,
Julien Cassaigne,
Raphael M. Jungers:
On the number of alpha-power-free binary words for 2alpha<=7/3.
Theor. Comput. Sci. 410(30-32): 2823-2833 (2009) |
| 10 |  | Raphael M. Jungers,
Vladimir Protasov,
Vincent D. Blondel:
Overlap-free words and spectra of matrices.
Theor. Comput. Sci. 410(38-40): 3670-3684 (2009) |
| 9 |  | 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 |  | 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 |  | 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 |  | Raphael M. Jungers,
Vladimir Protasov,
Vincent D. Blondel:
Overlap-free words and spectra of matrices
CoRR abs/0709.1794: (2007) |
| 5 |  | Raphael M. Jungers,
Vincent D. Blondel:
Observable Graphs
CoRR abs/cs/0702091: (2007) |
| 4 |  | Vincent D. Blondel,
Julien M. Hendrickx,
Raphael M. Jungers:
Linear time algorithms for Clobber
CoRR abs/cs/0703054: (2007) |
| 2006 |
| 3 |  | 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 |  | 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 |  | 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) |