Vincent D. Blondel

According to our database1, Vincent D. Blondel authored at least 62 papers between 1992 and 2015.

Collaborative distances:

Awards

IEEE Fellow

IEEE Fellow 2013, "For contributions to computational analysis of systems and networks".

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2015
A survey of results on mobile phone datasets analysis.
EPJ Data Sci., 2015

Sensitivity analysis of a branching process evolving on a network with application in epidemiology.
J. Complex Networks, 2015

2014
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, 2014

On the Use of Human Mobility Proxies for Modeling Epidemics.
PLoS Computational Biology, 2014

PageRank optimization by edge selection.
Discrete Applied Mathematics, 2014

Urban Sensing Using Mobile Phone Network Data: A Survey of Research.
ACM Comput. Surv., 2014

2013
Bursts of Vertex Activation and Epidemics in Evolving Networks.
PLoS Computational Biology, 2013

An experimental study of approximation algorithms for the joint spectral radius.
Numerical Algorithms, 2013

A Place-Focused Model for Social Networks in Cities.
Proceedings of the International Conference on Social Computing, SocialCom 2013, 2013

On primitivity of sets of matrices.
Proceedings of the 52nd IEEE Conference on Decision and Control, 2013

2012
Explicit Solutions for Root Optimization of a Polynomial Family With One Affine Constraint.
IEEE Trans. Automat. Contr., 2012

Effects of time window size and placement on the structure of an aggregated communication network.
EPJ Data Sci., 2012

On the cost of deciding consensus.
Proceedings of the 51th IEEE Conference on Decision and Control, 2012

2011
The set of realizations of a max-plus linear sequence is semi-polyhedral.
J. Comput. Syst. Sci., 2011

Observable graphs.
Discrete Applied Mathematics, 2011

Fast computation of minimal elementary decompositions of metabolic flux vectors.
Automatica, 2011

2010
The continuous Skolem-Pisot problem.
Theor. Comput. Sci., 2010

Joint Spectral Characteristics of Matrices: A Conic Programming Approach.
SIAM J. Matrix Analysis Applications, 2010

Continuous-Time Average-Preserving Opinion Dynamics with Opinion-Dependent Communications.
SIAM J. Control and Optimization, 2010

Weighted Gossip: Distributed Averaging using non-doubly stochastic matrices.
Proceedings of the IEEE International Symposium on Information Theory, 2010

Opinion dynamics for agents with opinion-dependent connections.
Proceedings of the 49th IEEE Conference on Decision and Control, 2010

Explicit solutions for root optimization of a polynomial family.
Proceedings of the 49th IEEE Conference on Decision and Control, 2010

PageRank Optimization in Polynomial Time by Stochastic Shortest Path Reformulation.
Proceedings of the Algorithmic Learning Theory, 21st International Conference, 2010

2009
Overlap-free words and spectra of matrices.
Theor. Comput. Sci., 2009

On the number of alpha-power-free binary words for 2alpha<=7/3.
Theor. Comput. Sci., 2009

On Krause's Multi-Agent Consensus Model With State-Dependent Connectivity.
IEEE Trans. Automat. Contr., 2009

Polynomial-Time Computation of the Joint Spectral Radius for Some Sets of Nonnegative Matrices.
SIAM J. Matrix Analysis Applications, 2009

Scaling Behaviors in the Communication Network between Cities.
Proceedings of the 12th IEEE International Conference on Computational Science and Engineering, 2009

2008
Formation Reorganization by Primitive Operations on Directed Graphs.
IEEE Trans. Automat. Contr., 2008

Computing the Growth of the Number of Overlap-Free Words with Spectra of Matrices.
Proceedings of the LATIN 2008: Theoretical Informatics, 2008

2007
Three and higher dimensional autonomous formations: Rigidity, persistence and structural persistence.
Automatica, 2007

2006
On the Complexity of Computing the Capacity of Codes That Avoid Forbidden Difference Patterns.
IEEE Trans. Information Theory, 2006

Complexity of control on finite automata.
IEEE Trans. Automat. Contr., 2006

Decidability and Universality in Symbolic Dynamical Systems.
Fundam. Inform., 2006

2005
Computationally Efficient Approximations of the Joint Spectral Radius.
SIAM J. Matrix Analysis Applications, 2005

Decidable and Undecidable Problems about Quantum Automata.
SIAM J. Comput., 2005

2004
Quasi-periodic configurations and undecidable dynamics for tilings, infinite words and Turing machines.
Theor. Comput. Sci., 2004

Fault tolerant control: a simultaneous stabilization result.
IEEE Trans. Automat. Contr., 2004

A Measure of Similarity between Graph Vertices: Applications to Synonym Extraction and Web Searching.
SIAM Review, 2004

Computational Universality in Symbolic Dynamical Systems.
Proceedings of the Machines, Computations, and Universality, 4th International Conference, 2004

Approximations of the Rate of Growth of Switched Linear Systems.
Proceedings of the Hybrid Systems: Computation and Control, 7th International Workshop, 2004

2003
An Elementary Counterexample to the Finiteness Conjecture.
SIAM J. Matrix Analysis Applications, 2003

Undecidable Problems for Probabilistic Automata of Fixed Dimension.
Theory Comput. Syst., 2003

Similarity Matrices for Pairs of Graphs.
Proceedings of the Automata, Languages and Programming, 30th International Colloquium, 2003

2002
On the presence of periodic configurations in Turing machines and in counter machines.
Theor. Comput. Sci., 2002

2001
Deciding stability and mortality of piecewise affine dynamical systems.
Theor. Comput. Sci., 2001

Probabilistic solutions to some NP-hard matrix problems.
Automatica, 2001

On a Conjecture of Kurka. A Turing Machine with No Periodic Configurations.
Proceedings of the Machines, 2001

2000
Approximating the spectral radius of sets of matrices in the max-algebra is NP-hard.
IEEE Trans. Automat. Contr., 2000

A survey of computational complexity results in systems and control.
Automatica, 2000

The Stability of Saturated Linear Dynamical Systems Is Undecidable.
Proceedings of the STACS 2000, 2000

Bilinear Functions and Trees over the (max, +) Semiring.
Proceedings of the Mathematical Foundations of Computer Science 2000, 2000

1999
Complexity of stability and controllability of elementary hybrid systems.
Automatica, 1999

1998
Structured Numbers: Properties of a Hierarchy of Operations on Binary Trees.
Acta Inf., 1998

1997
Lyapunov exponents of pairs of matrices, a correction.
MCSS, 1997

The Lyapunov exponent and joint spectral radius of pairs of matrices are hard - when not impossible - to compute and to approximate.
MCSS, 1997

When is a Pair of Matrices Mortal?
Inf. Process. Lett., 1997

1995
Zeros in the Unit Disk (M. Meneguetle).
SIAM Review, 1995

Survey on the State of Systems and Control.
Eur. J. Control, 1995

A rational test for strong stabilization.
Automatica, 1995

1993
Simultaneous stabilizability of three linear systems is rationally undecidable.
MCSS, 1993

1992
Discrete-time pole placement with stable controller.
Automatica, 1992


  Loading...