( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Three and higher dimensional autonomous formations: Rigidity, persistence and structural persistence.

, , , , и . Autom., 43 (3): 387-402 (2007)

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.

Christophe Blondel

François-Marie Blondel

Vincent Saderne

Vincent Liebert

Vincent Tejedor

 

Другие публикации лиц с тем же именем

Weighted Gossip: Distributed Averaging using non-doubly stochastic matrices., , , , и . ISIT, стр. 1753-1757. IEEE, (2010)Probabilistic solutions to some NP-hard matrix problems., и . Autom., 37 (9): 1397-1405 (2001)Joint Spectral Characteristics of Matrices: A Conic Programming Approach., , и . SIAM J. Matrix Anal. Appl., 31 (4): 2146-2162 (2010)Approximating the spectral radius of sets of matrices in the max-algebra is NP-hard., , и . IEEE Trans. Automat. Contr., 45 (9): 1762-1765 (2000)Computing the Growth of the Number of Overlap-Free Words with Spectra of Matrices., , и . LATIN, том 4957 из Lecture Notes in Computer Science, стр. 84-93. Springer, (2008)Extracting spatial information from networks with low-order eigenvectors, , и . CoRR, (2011)The Lyapunov exponent and joint spectral radius of pairs of matrices are hard - when not impossible - to compute and to approximate., и . Math. Control. Signals Syst., 10 (1): 31-40 (1997)Zeros in the Unit Disk (M. Meneguetle).. SIAM Rev., 37 (4): 619 (1995)On the 2R conjecture for multi-agent systems, , и . Proceedings of the European control conference 2007 (ECC 2007), Kos (Greece), (2007)How to Decide Consensus? A Combinatorial Necessary and Sufficient Condition and a Proof that Consensus is Decidable but NP-Hard., и . SIAM J. Control and Optimization, 52 (5): 2707-2726 (2014)