SCEAS

The SCEAS System

Search the dblp DataBase

Title:
Author:

Vincent D. Blondel: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

Vincent D. Blondel, Yurii Nesterov, Jacques Theys
Approximations of the Rate of Growth of Switched Linear Systems. [Citation Graph (0, 0)][DBLP]
HSCC, 2004, pp:173-186 [Conf]
Vincent D. Blondel, Paul Van Dooren
Similarity Matrices for Pairs of Graphs. [Citation Graph (0, 0)][DBLP]
ICALP, 2003, pp:739-750 [Conf]
Vincent D. Blondel, Julien Cassaigne, Codrin M. Nichitiu
On a Conjecture of Kurka. A Turing Machine with No Periodic Configurations. [Citation Graph (0, 0)][DBLP]
MCU, 2001, pp:165-176 [Conf]
Jean-Charles Delvenne, Petr Kurka, Vincent D. Blondel
Computational Universality in Symbolic Dynamical Systems. [Citation Graph (0, 0)][DBLP]
MCU, 2004, pp:104-115 [Conf]
Sabrina Mantaci, Vincent D. Blondel, Jean Mairesse
Bilinear Functions and Trees over the (max, +) Semiring. [Citation Graph (0, 0)][DBLP]
MFCS, 2000, pp:549-558 [Conf]
Vincent D. Blondel, Olivier Bournez, Pascal Koiran, John N. Tsitsiklis
The Stability of Saturated Linear Dynamical Systems Is Undecidable. [Citation Graph (0, 0)][DBLP]
STACS, 2000, pp:479-490 [Conf]
Vincent D. Blondel
Structured Numbers: Properties of a Hierarchy of Operations on Binary Trees. [Citation Graph (0, 0)][DBLP]
Acta Inf., 1998, v:35, n:1, pp:1-15 [Journal]
Jean-Charles Delvenne, Petr Kurka, Vincent D. Blondel
Computational Universality in Symbolic Dynamical Systems [Citation Graph (0, 0)][DBLP]
CoRR, 2004, v:0, n:, pp:- [Journal]
Vincent D. Blondel, Anahí Gajardo, Maureen Heymans, Pierre Senellart, Paul Van Dooren
A measure of similarity between graph vertices [Citation Graph (0, 0)][DBLP]
CoRR, 2004, v:0, n:, pp:- [Journal]
Jean-Charles Delvenne, Petr Kurka, Vincent D. Blondel
Decidability and Universality in Symbolic Dynamical Systems. [Citation Graph (0, 0)][DBLP]
Fundam. Inform., 2006, v:74, n:4, pp:463-490 [Journal]
Vincent D. Blondel, John N. Tsitsiklis
When is a Pair of Matrices Mortal? [Citation Graph (0, 0)][DBLP]
Inf. Process. Lett., 1997, v:63, n:5, pp:283-286 [Journal]
Vincent D. Blondel, Olivier Bournez, Pascal Koiran, John N. Tsitsiklis
The Stability of Saturated Linear Dynamical Systems Is Undecidable. [Citation Graph (0, 0)][DBLP]
J. Comput. Syst. Sci., 2001, v:62, n:3, pp:442-462 [Journal]
Vincent D. Blondel, Vincent Canterini
Undecidable Problems for Probabilistic Automata of Fixed Dimension. [Citation Graph (0, 0)][DBLP]
Theory Comput. Syst., 2003, v:36, n:3, pp:231-245 [Journal]
Vincent D. Blondel, Olivier Bournez, Pascal Koiran, Christos H. Papadimitriou, John N. Tsitsiklis
Deciding stability and mortality of piecewise affine dynamical systems. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 2001, v:255, n:1-2, pp:687-696 [Journal]
Vincent D. Blondel, Julien Cassaigne, Codrin M. Nichitiu
On the presence of periodic configurations in Turing machines and in counter machines. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 2002, v:289, n:1, pp:573-590 [Journal]
Jean-Charles Delvenne, Vincent D. Blondel
Quasi-periodic configurations and undecidable dynamics for tilings, infinite words and Turing machines. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 2004, v:319, n:1-3, pp:127-143 [Journal]
Vincent D. Blondel, Raphael M. Jungers, Vladimir Protasov
On the Complexity of Computing the Capacity of Codes That Avoid Forbidden Difference Patterns. [Citation Graph (0, 0)][DBLP]
IEEE Transactions on Information Theory, 2006, v:52, n:11, pp:5122-5127 [Journal]
Raphael M. Jungers, Vincent D. Blondel
Observable Graphs [Citation Graph (0, 0)][DBLP]
CoRR, 2007, v:0, n:, pp:- [Journal]
Vincent D. Blondel, Julien M. Hendrickx, Raphael M. Jungers
Linear time algorithms for Clobber [Citation Graph (0, 0)][DBLP]
CoRR, 2007, v:0, n:, pp:- [Journal]
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 [Citation Graph (0, 0)][DBLP]
CoRR, 2006, v:0, n:, pp:- [Journal]
Vincent D. Blondel, Raphael M. Jungers, Vladimir Protasov
On the complexity of computing the capacity of codes that avoid forbidden difference patterns [Citation Graph (0, 0)][DBLP]
CoRR, 2006, v:0, n:, pp:- [Journal]
Raphael M. Jungers, Vladimir Protasov, Vincent D. Blondel
Efficient algorithms for deciding the type of growth of products of integer matrices [Citation Graph (0, 0)][DBLP]
CoRR, 2006, v:0, n:, pp:- [Journal]
Raphael M. Jungers, Vladimir Protasov, Vincent D. Blondel
Overlap-free words and spectra of matrices [Citation Graph (0, 0)][DBLP]
CoRR, 2007, v:0, n:, pp:- [Journal]
PageRank Optimization in Polynomial Time by Stochastic Shortest Path Reformulation. [Citation Graph (, )][DBLP]
Computing the Growth of the Number of Overlap-Free Words with Spectra of Matrices. [Citation Graph (, )][DBLP]
Scaling Behaviors in the Communication Network between Cities. [Citation Graph (, )][DBLP]
Descent methods for Nonnegative Matrix Factorization [Citation Graph (, )][DBLP]
Fast unfolding of community hierarchies in large networks [Citation Graph (, )][DBLP]
On Krause's consensus formation model with state-dependent connectivity [Citation Graph (, )][DBLP]
PageRank Optimization by Edge Selection [Citation Graph (, )][DBLP]

Search in 0.002secs, Finished in 0.305secs

NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades

NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP