| * | 2009 |
| 31 | EE | 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) |
| 30 | EE | Raphael M. Jungers,
Vladimir Protasov,
Vincent D. Blondel:
Overlap-free words and spectra of matrices.
Theor. Comput. Sci. 410(38-40): 3670-3684 (2009) |
| 2008 |
| 29 | 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 |
| 28 | EE | Ngoc-Diep Ho,
Paul Van Dooren,
Vincent D. Blondel:
Descent methods for Nonnegative Matrix Factorization
CoRR abs/0801.3199: (2008) |
| 27 | EE | Vincent D. Blondel,
Jean-Loup Guillaume,
Renaud Lambiotte,
Etienne Lefebvre:
Fast unfolding of community hierarchies in large networks
CoRR abs/0803.0476: (2008) |
| 26 | EE | Vincent D. Blondel,
Julien M. Hendrickx,
John N. Tsitsiklis:
On Krause's consensus formation model with state-dependent connectivity
CoRR abs/0807.2028: (2008) |
| 2007 |
| 25 | EE | Changbin Yu,
Julien M. Hendrickx,
Baris Fidan,
Brian D. O. Anderson,
Vincent D. Blondel:
Three and higher dimensional autonomous formations: Rigidity, persistence and structural persistence.
Automatica 43(3): 387-402 (2007) |
| 24 | EE | Raphael M. Jungers,
Vladimir Protasov,
Vincent D. Blondel:
Overlap-free words and spectra of matrices
CoRR abs/0709.1794: (2007) |
| 23 | EE | Raphael M. Jungers,
Vincent D. Blondel:
Observable Graphs
CoRR abs/cs/0702091: (2007) |
| 22 | EE | Vincent D. Blondel,
Julien M. Hendrickx,
Raphael M. Jungers:
Linear time algorithms for Clobber
CoRR abs/cs/0703054: (2007) |
| 2006 |
| 21 | 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) |
| 20 | 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) |
| 19 | EE | Julien M. Hendrickx,
Baris Fidan,
Changbin Yu,
Brian D. O. Anderson,
Vincent D. Blondel:
Primitive operations for the construction and reorganization of minimally persistent formations
CoRR abs/cs/0609041: (2006) |
| 18 | EE | Jean-Charles Delvenne,
Petr Kurka,
Vincent D. Blondel:
Decidability and Universality in Symbolic Dynamical Systems.
Fundam. Inform. 74(4): 463-490 (2006) |
| 17 | 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) |
| 2005 |
| 16 | EE | Vincent D. Blondel,
Emmanuel Jeandel,
Pascal Koiran,
Natacha Portier:
Decidable and Undecidable Problems about Quantum Automata.
SIAM J. Comput. 34(6): 1464-1473 (2005) |
| 2004 |
| 15 | EE | Vincent D. Blondel,
Yurii Nesterov,
Jacques Theys:
Approximations of the Rate of Growth of Switched Linear Systems.
HSCC 2004: 173-186 |
| 14 | EE | Jean-Charles Delvenne,
Petr Kurka,
Vincent D. Blondel:
Computational Universality in Symbolic Dynamical Systems.
MCU 2004: 104-115 |
| 13 | EE | Jean-Charles Delvenne,
Petr Kurka,
Vincent D. Blondel:
Computational Universality in Symbolic Dynamical Systems
CoRR cs.CC/0404021: (2004) |
| 12 | EE | Vincent D. Blondel,
Anahí Gajardo,
Maureen Heymans,
Pierre Senellart,
Paul Van Dooren:
A measure of similarity between graph vertices
CoRR cs.IR/0407061: (2004) |
| 11 | EE | Jean-Charles Delvenne,
Vincent D. Blondel:
Quasi-periodic configurations and undecidable dynamics for tilings, infinite words and Turing machines.
Theor. Comput. Sci. 319(1-3): 127-143 (2004) |
| 2003 |
| 10 | EE | Vincent D. Blondel,
Paul Van Dooren:
Similarity Matrices for Pairs of Graphs.
ICALP 2003: 739-750 |
| 9 | EE | Vincent D. Blondel,
Vincent Canterini:
Undecidable Problems for Probabilistic Automata of Fixed Dimension.
Theory Comput. Syst. 36(3): 231-245 (2003) |
| 2002 |
| 8 | | Vincent D. Blondel,
Julien Cassaigne,
Codrin M. Nichitiu:
On the presence of periodic configurations in Turing machines and in counter machines.
Theor. Comput. Sci. 289(1): 573-590 (2002) |
| 2001 |
| 7 | EE | Vincent D. Blondel,
Julien Cassaigne,
Codrin M. Nichitiu:
On a Conjecture of Kurka. A Turing Machine with No Periodic Configurations.
MCU 2001: 165-176 |
| 6 | | Vincent D. Blondel,
Olivier Bournez,
Pascal Koiran,
John N. Tsitsiklis:
The Stability of Saturated Linear Dynamical Systems Is Undecidable.
J. Comput. Syst. Sci. 62(3): 442-462 (2001) |
| 5 | EE | Vincent D. Blondel,
Olivier Bournez,
Pascal Koiran,
Christos H. Papadimitriou,
John N. Tsitsiklis:
Deciding stability and mortality of piecewise affine dynamical systems.
Theor. Comput. Sci. 255(1-2): 687-696 (2001) |
| 2000 |
| 4 | EE | Sabrina Mantaci,
Vincent D. Blondel,
Jean Mairesse:
Bilinear Functions and Trees over the (max, +) Semiring.
MFCS 2000: 549-558 |
| 3 | EE | Vincent D. Blondel,
Olivier Bournez,
Pascal Koiran,
John N. Tsitsiklis:
The Stability of Saturated Linear Dynamical Systems Is Undecidable.
STACS 2000: 479-490 |
| 1998 |
| 2 | EE | Vincent D. Blondel:
Structured Numbers: Properties of a Hierarchy of Operations on Binary Trees.
Acta Inf. 35(1): 1-15 (1998) |
| 1997 |
| 1 | EE | Vincent D. Blondel,
John N. Tsitsiklis:
When is a Pair of Matrices Mortal?
Inf. Process. Lett. 63(5): 283-286 (1997) |