The following pages link to Raphaël M. Jungers (Q286066):
Displaying 50 items.
- Lower bounds on complexity of Lyapunov functions for switched linear systems (Q286067) (← links)
- Stability of discrete-time switching systems with constrained switching sequences (Q311969) (← links)
- Efficient method for computing lower bounds on the \(p\)-radius of switched linear systems (Q313316) (← links)
- Lower and upper bounds for the largest Lyapunov exponent of matrices (Q389726) (← links)
- On asymptotic properties of matrix semigroups with an invariant cone (Q442681) (← links)
- Observable graphs (Q548270) (← links)
- (Q591749) (redirect page) (← links)
- (Q665163) (redirect page) (← links)
- Fast computation of minimal elementary decompositions of metabolic flux vectors (Q665165) (← links)
- The continuous Skolem-Pisot problem (Q708215) (← links)
- Overlap-free words and spectra of matrices (Q837157) (← links)
- Resonance and marginal instability of switching systems (Q894302) (← links)
- On primitivity of sets of matrices (Q900654) (← links)
- Testing avoidability on sets of partial words is hard (Q1006080) (← links)
- The synchronizing probability function for primitive sets of matrices (Q1622961) (← links)
- On completely reachable automata and subset reachability (Q1622980) (← links)
- Dynamics of the independence number and automata synchronization (Q1622986) (← links)
- Generalized primitivity of labeled digraphs (Q1689972) (← links)
- Combinatorial methods for invariance and safety of hybrid systems (Q1716585) (← links)
- Improved bound on the worst case complexity of policy iteration (Q1785761) (← links)
- On the quality of first-order approximation of functions with Hölder continuous gradient (Q1985266) (← links)
- Equivalent polyadic decompositions of matrix multiplication tensors (Q2074879) (← links)
- Comparison of path-complete Lyapunov functions via template-dependent lifts (Q2085147) (← links)
- PAC-learning gains of Turing machines over circuits and neural networks (Q2111729) (← links)
- Stabilization of rank-deficient continuous-time switched affine systems (Q2158982) (← links)
- An improved finiteness test and a systematic procedure to compute the strong \(\mathscr{H}_2\) norm of differential algebraic systems with multiple delays (Q2166005) (← links)
- On the \(m\)-dimensional Cayley-Hamilton theorem and its application to an algebraic decision problem inferred from the \(\mathcal{H}_2\) norm analysis of delay systems (Q2173935) (← links)
- Sum-of-squares methods for controlled invariant sets with applications to model-predictive control (Q2178207) (← links)
- Lower bounds and dense discontinuity phenomena for the stabilizability radius of linear switched systems (Q2203461) (← links)
- Characterization of flat outputs of switched linear discrete-time systems: algebraic condition and algorithm (Q2242909) (← links)
- On the number of \(\alpha \)-power-free binary words for \(2<\alpha \leq 7/3\) (Q2271420) (← links)
- Data driven stability analysis of black-box switched linear systems (Q2280933) (← links)
- A Linear Bound on the k-rendezvous time for primitive sets of NZ matrices (Q2327540) (← links)
- On discrete algebraic Riccati equations: a rank characterization of solutions (Q2359564) (← links)
- A complexity analysis of policy iteration through combinatorial matrices arising from unique sink orientations (Q2363352) (← links)
- Deciding the boundedness and dead-beat stability of constrained switching systems (Q2374570) (← links)
- On the interplay between Babai and Černý's conjectures (Q2408802) (← links)
- Tight bound for deciding convergence of consensus systems (Q2410480) (← links)
- Sorting under partial information (without the ellipsoid algorithm). (Q2439837) (← links)
- PageRank optimization by edge selection (Q2449060) (← links)
- Polytopic uncertainty for linear systems: new and old complexity results (Q2454143) (← links)
- On the finiteness property for rational matrices (Q2483265) (← links)
- Efficient algorithms for deciding the type of growth of products of integer matrices (Q2483266) (← links)
- Graph diameter, eigenvalues, and minimum-time consensus (Q2628456) (← links)
- \(p\)-dominant switched linear systems (Q2665658) (← links)
- Geometric control of hybrid systems (Q2677099) (← links)
- On the Synchronizing Probability Function and the Triple Rendezvous Time (Q2799174) (← links)
- On the Synchronizing Probability Function and the Triple Rendezvous Time for Synchronizing Automata (Q2808158) (← links)
- The four bars problem (Q2821957) (← links)
- The Synchronizing Probability Function of an Automaton (Q2902896) (← links)
