The following pages link to Vincent D. Blondel (Q162832):
Displaying 39 items.
- Overview of complexity and decidability results for three classes of elementary nonlinear systems (Q4227145) (← links)
- Simultaneous Stabilization of Three or More Plants: Conditions on the Positive Real Axis Do Not Suffice (Q4291174) (← links)
- (Q4312506) (← links)
- Unstable ones in understood algebraic questions of modelling for control design (Q4335919) (← links)
- NP-Hardness of Some Linear Control Design Problems (Q4377415) (← links)
- An Elementary Counterexample to the Finiteness Conjecture (Q4443783) (← links)
- (Q4449216) (← links)
- (Q4501556) (← links)
- (Q4529997) (← links)
- A Measure of Similarity between Graph Vertices: Applications to Synonym Extraction and Web Searching (Q4652266) (← links)
- Sensitivity analysis of a branching process evolving on a network with application in epidemiology (Q4689374) (← links)
- Robust stability under a class of nonlinear parametric perturbations (Q4698948) (← links)
- On interval polynomials with no zeros in the unit disc (Q4837474) (← links)
- (Q4865401) (← links)
- On Zero and One Points of Analytic Functions (Q4866967) (← links)
- (Q4895772) (← links)
- Uncovering space-independent communities in spatial networks (Q4907459) (← links)
- PageRank Optimization in Polynomial Time by Stochastic Shortest Path Reformulation (Q4930691) (← links)
- Formation Reorganization by Primitive Operations on Directed Graphs (Q4974205) (← links)
- On Krause's Multi-Agent Consensus Model With State-Dependent Connectivity (Q4974797) (← links)
- How to Decide Consensus? A Combinatorial Necessary and Sufficient Condition and a Proof that Consensus is Decidable but NP-Hard (Q5173258) (← links)
- Cramer-Rao bounds for synchronization of rotations (Q5177861) (← links)
- Fast unfolding of communities in large networks (Q5239436) (← links)
- Fault Tolerant Control: A Simultaneous Stabilization Result (Q5273701) (← links)
- Complexity of Control on Finite Automata (Q5281862) (← links)
- Directed graphs for the analysis of rigidity and persistence in autonomous agent systems (Q5300156) (← links)
- Hybrid Systems: Computation and Control (Q5307467) (← links)
- Decidable and Undecidable Problems about Quantum Automata (Q5317206) (← links)
- Computationally Efficient Approximations of the Joint Spectral Radius (Q5317664) (← links)
- Explicit Solutions for Root Optimization of a Polynomial Family With One Affine Constraint (Q5353038) (← links)
- Long products of matrices (Q5393505) (← links)
- Computing the Growth of the Number of Overlap-Free Words with Spectra of Matrices (Q5458519) (← links)
- A note on convex combinations of polynomials (Q5689965) (← links)
- Machines, Computations, and Universality (Q5710896) (← links)
- A survey of computational complexity results in systems and control (Q5926262) (← links)
- Deciding stability and mortality of piecewise affine dynamical systems (Q5941097) (← links)
- The stability of saturated linear dynamical systems is undecidable (Q5943100) (← links)
- Probabilistic solutions to some NP-hard matrix problems (Q5947649) (← links)
- Descent methods for Nonnegative Matrix Factorization (Q6208172) (← links)
