activity
20062022
most citedOn the complexity of computing the capacity of codes that avoid forbidden difference patterns

23 citations · 72 across the 27 of their papers we have counts for

collaborators
Showing 2014 · math.OCShow all

1 paper · 2 filters

math.OC2014★ 1 cited

Stability of linear switching systems and Markov-Bernstein inequalities for exponents

Vladimir Yu. Protasov, Raphael M. Jungers

We analyse the problem of stability of a continuous time linear switching system (LSS) versus the stability of its Euler discretization. It is well-known that the existence of a po…