8 citations · 8 across the 5 of their papers we have counts for
6 papers
The finiteness conjecture for binary matrices
Thomas Mejstrik
The invariant polytope algorithm was a breakthrough in the joint spectral radius computation, allowing to find the exact value of the joint spectral radius for most matrix families…
Constructive solution of the common invariant cone problem
Thomas Mejstrik, Vladimiar Yu. Protasov
Sets of matrices sharing a common invariant cone enjoy special properties, which are widely used in applications. However, finding this cone or even proving its existen…
Stability under dwell time constraints: Discretization revisited
Thomas Mejstrik, Vladimir Yu. Protasov
We decide the stability and compute the Lyapunov exponent of continuous-time linear switching systems with a guaranteed dwell time. The main result asserts that the discretization…
Injection testing backed refactoring
Thomas Mejstrik, Clara Hollomey
Injection-based testing while refactoring is a pattern that minimizes the need for manual editing when altering the behaviour of a code base. Neither does it rely on a compilation…
Elliptic polytopes and invariant norms of linear operators
Thomas Mejstrik, Vladimir Yu. Protasov
We address the problem of constructing elliptic polytopes in R^d, which are convex hulls of finitely many two-dimensional ellipses with a common center. Such sets arise in the stud…
Improved invariant polytope algorithm and applications
Thomas Mejstrik
In several papers of 2013 - 2016, Guglielmi and Protasov made a breakthrough in the problem of the joint spectral radius computation, developing the invariant polytope algorithm wh…