( en | de | ru )

 

Disambiguation of "Blondel, Vincent D."

Author of the publication

copydeleteadd this publication to your clipboard
Quasi-periodic configurations and undecidable dynamics for tilings, infinite words and Turing machines.

, and . Theor. Comput. Sci., 319 (1-3): 127-143 (2004)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Christophe Blondel

François-Marie Blondel

Vincent Herrmann

Vincent Fochtman

Vincent Feyen

 

Other publications of authors with the same name

Computing the Growth of the Number of Overlap-Free Words with Spectra of Matrices., , and . LATIN, volume 4957 of Lecture Notes in Computer Science, page 84-93. Springer, (2008)Extracting spatial information from networks with low-order eigenvectors, , and . CoRR, (2011)Weighted Gossip: Distributed Averaging using non-doubly stochastic matrices., , , , and . ISIT, page 1753-1757. IEEE, (2010)Probabilistic solutions to some NP-hard matrix problems., and . Autom., 37 (9): 1397-1405 (2001)How to Decide Consensus? A Combinatorial Necessary and Sufficient Condition and a Proof that Consensus is Decidable but NP-Hard., and . SIAM J. Control and Optimization, 52 (5): 2707-2726 (2014)The Lyapunov exponent and joint spectral radius of pairs of matrices are hard - when not impossible - to compute and to approximate., and . Math. Control. Signals Syst., 10 (1): 31-40 (1997)Joint Spectral Characteristics of Matrices: A Conic Programming Approach., , and . SIAM J. Matrix Anal. Appl., 31 (4): 2146-2162 (2010)Zeros in the Unit Disk (M. Meneguetle).. SIAM Rev., 37 (4): 619 (1995)The Stability of Saturated Linear Dynamical Systems Is Undecidable., , , and . STACS, volume 1770 of Lecture Notes in Computer Science, page 479-490. Springer, (2000)Formation Reorganization by Primitive Operations on Directed Graphs., , , , and . IEEE Trans. Automat. Contr., 53 (4): 968-979 (2008)