( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
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)

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 Truffault

Vincent Herrmann

Vincent Fochtman

 

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

Interplay between Telecommunications and Face-to-Face Interactions: A Study Using Mobile Phone Data, , , и . PLoS ONE, 6 (7): e20814+ (13.07.2011)Epidemics on a Stochastic Model of Temporal Network, , и . глава 15, стр. 301--314. Springer New York, New York, NY, (24.04.2012)A survey of results on mobile phone datasets analysis, , и . EPJ Data Science, (05.08.2015)Lyapunov exponents of pairs of matrices, a correction., и . Math. Control. Signals Syst., 10 (4): 381 (1997)Continuous-Time Average-Preserving Opinion Dynamics with Opinion-Dependent Communications., , и . SIAM J. Control and Optimization, 48 (8): 5214-5240 (2010)On the presence of periodic configurations in Turing machines and in counter machines., , и . Theor. Comput. Sci., 289 (1): 573-590 (2002)Quasi-periodic configurations and undecidable dynamics for tilings, infinite words and Turing machines., и . Theor. Comput. Sci., 319 (1-3): 127-143 (2004)PageRank optimization by edge selection., , и . Discret. Appl. Math., (2014)Decidable and Undecidable Problems about Quantum Automata., , , и . SIAM J. Comput., 34 (6): 1464-1473 (2005)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)