default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVladimir Protasov
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j33]Vladimir Yu. Protasov, Rinat Kamalov:
How do the lengths of switching intervals influence the stability of a dynamical system? Autom. 171: 111929 (2025)- 2024
- [i8]Vladimir Yu. Protasov, Rinat Kamalov:
Algorithms of constrained uniform approximation. CoRR abs/2403.16330 (2024) - 2023
- [j32]Vladimir Yu. Protasov
, Tatyana Zaitseva:
Complete Characterization of Polyhedral Self-Affine Tiles. Discret. Comput. Geom. 70(3): 931-950 (2023) - [j31]Nicola Guglielmi, Vladimir Protasov:
Computing the spectral gap of a family of matrices. Math. Comput. 93(345): 259-291 (2023) - [j30]Vladimir Yu. Protasov, Rinat Kamalov:
Stability of Continuous Time Linear Systems with Bounded Switching Intervals. SIAM J. Control. Optim. 61(5): 3051-3075 (2023) - [i7]Vladimir Yu. Protasov, Tatyana Zaitseva:
Anisotropic refinable functions and the tile B-splines. CoRR abs/2312.11182 (2023) - 2022
- [j29]Aleksandar Cvetkovic, Vladimir Yu. Protasov:
The greedy strategy for optimizing the Perron eigenvalue. Math. Program. 193(1): 1-31 (2022) - [j28]Vladimir Yu. Protasov:
The Barabanov Norm is Generically Unique, Simple, and Easily Computed. SIAM J. Control. Optim. 60(4): 2246-2267 (2022) - 2021
- [j27]Vladimir Yu. Protasov:
Analytic methods for reachability problems. J. Comput. Syst. Sci. 120: 1-13 (2021) - [i6]Thomas Mejstrik, Vladimir Yu. Protasov:
Elliptic polytopes and invariant norms of linear operators. CoRR abs/2107.02610 (2021) - 2020
- [j26]Vladimir Yu. Protasov:
Surface Dimension, Tiles, and Synchronizing Automata. SIAM J. Math. Anal. 52(4): 3463-3486 (2020) - [j25]Yurii E. Nesterov, Vladimir Yu. Protasov:
Computing Closest Stable Nonnegative Matrix. SIAM J. Matrix Anal. Appl. 41(1): 1-28 (2020) - [j24]Aleksandar Cvetkovic, Vladimir Yu. Protasov:
Maximal Acyclic Subgraphs and Closest Stable Matrices. SIAM J. Matrix Anal. Appl. 41(3): 1167-1182 (2020)
2010 – 2019
- 2019
- [j23]Vladimir Yu. Protasov:
Comprehensive Lyapunov functions for linear switching systems. Autom. 109 (2019) - [c7]Vladimir Yu. Protasov:
Primitivity and Synchronizing Automata: A Functional Analytic Approach. RP 2019: 13-21 - [i5]Maria Charina, Nira Dyn, Vladimir Yu. Protasov:
Analytic functions in shift-invariant spaces and analytic limits of level dependent subdivision. CoRR abs/1907.05658 (2019) - [i4]Yacine Chitour, Nicola Guglielmi, Mario Sigalotti, Vladimir Protasov:
Switching systems with dwell time: computation of the maximal Lyapunov exponent. CoRR abs/1912.10214 (2019) - 2018
- [j22]Nicola Guglielmi, Vladimir Yu. Protasov:
On the Closest Stable/Unstable Nonnegative Matrix and Related Stability Radii. SIAM J. Matrix Anal. Appl. 39(4): 1642-1669 (2018) - 2017
- [j21]Nicola Guglielmi, Linda Laglia, Vladimir Protasov:
Polytope Lyapunov Functions for Stable and for Stabilizable LSS. Found. Comput. Math. 17(2): 567-623 (2017) - [j20]Vladimir Yu. Protasov:
The Euler binary partition function and subdivision schemes. Math. Comput. 86(305): 1499-1524 (2017) - [j19]Maria Charina, Costanza Conti, Nicola Guglielmi, Vladimir Protasov:
Regularity of non-stationary subdivision: a matrix approach. Numerische Mathematik 135(3): 639-678 (2017) - 2016
- [j18]Maria Charina, Costanza Conti, Nicola Guglielmi, Vladimir Protasov:
Limits of level and parameter dependent subdivision schemes: A matrix approach. Appl. Math. Comput. 272: 20-27 (2016) - [j17]Vladimir Yu. Protasov:
Spectral simplex method. Math. Program. 156(1-2): 485-511 (2016) - [j16]Jan Brinkhuis, Vladimir Protasov:
A new proof of the Lagrange multiplier rule. Oper. Res. Lett. 44(3): 400-402 (2016) - [j15]Vladimir Yu. Protasov:
Linear switching systems with slow growth of trajectories. Syst. Control. Lett. 90: 54-60 (2016) - [j14]Nicola Guglielmi, Vladimir Yu. Protasov:
Invariant Polytopes of Sets of Matrices with Application to Regularity of Wavelets and Subdivisions. SIAM J. Matrix Anal. Appl. 37(1): 18-52 (2016) - [j13]Vladimir Protasov, Raphaël M. Jungers:
Analysing the Stability of Linear Systems via Exponential Chebyshev Polynomials. IEEE Trans. Autom. Control. 61(3): 795-798 (2016) - 2014
- [j12]Vladimir Yu. Protasov, Dmitrii O. Logofet:
Rank-One Corrections of Nonnegative Matrices, With an Application to Matrix Population Models. SIAM J. Matrix Anal. Appl. 35(2): 749-764 (2014) - 2013
- [j11]Nicola Guglielmi, Vladimir Protasov:
Exact Computation of Joint Spectral Characteristics of Linear Operators. Found. Comput. Math. 13(1): 37-97 (2013) - [j10]Yurii E. Nesterov, Vladimir Protasov:
Optimizing the Spectral Radius. SIAM J. Matrix Anal. Appl. 34(3): 999-1013 (2013) - [j9]Vladimir Protasov:
Classification of k-Primitive Sets of Matrices. SIAM J. Matrix Anal. Appl. 34(3): 1174-1188 (2013) - [c6]Vladimir Protasov, Raphaël M. Jungers:
Is switching systems stability harder for continuous time systems? CDC 2013: 704-709 - [c5]Vladimir Yu. Protasov, Raphaël M. Jungers:
Convex optimization methods for computing the Lyapunov exponent of matrices. ECC 2013: 3191-3196 - 2011
- [j8]Raphaël M. Jungers, Vladimir Protasov:
Fast Methods for Computing the p-Radius of Matrices. SIAM J. Sci. Comput. 33(3): 1246-1266 (2011) - 2010
- [j7]Vladimir Protasov, Raphaël M. Jungers, Vincent D. Blondel:
Joint Spectral Characteristics of Matrices: A Conic Programming Approach. SIAM J. Matrix Anal. Appl. 31(4): 2146-2162 (2010) - [c4]Raphaël M. Jungers, Vladimir Protasov:
Weak stability of switching dynamical systems and fast computation of the p-radius of matrices. CDC 2010: 7328-7333
2000 – 2009
- 2009
- [j6]Raphaël M. Jungers, Vladimir Protasov:
Counterexamples to the Complex Polytope Extremality Conjecture. SIAM J. Matrix Anal. Appl. 31(2): 404-409 (2009) - [j5]Raphaël M. Jungers, Vladimir Protasov, Vincent D. Blondel:
Overlap-free words and spectra of matrices. Theor. Comput. Sci. 410(38-40): 3670-3684 (2009) - 2008
- [c3]Raphaël M. Jungers, Vladimir Protasov, Vincent D. Blondel:
Computing the Growth of the Number of Overlap-Free Words with Spectra of Matrices. LATIN 2008: 84-93 - 2007
- [i3]Raphaël M. Jungers, Vladimir Protasov, Vincent D. Blondel:
Overlap-free words and spectra of matrices. CoRR abs/0709.1794 (2007) - 2006
- [j4]Vladimir Protasov:
Refinement Equations and Corresponding Linear Operators. Int. J. Wavelets Multiresolution Inf. Process. 4(3): 461-474 (2006) - [j3]Vincent D. Blondel, Raphaël M. Jungers, Vladimir Protasov:
On the Complexity of Computing the Capacity of Codes That Avoid Forbidden Difference Patterns. IEEE Trans. Inf. Theory 52(11): 5122-5127 (2006) - [i2]Vincent D. Blondel, Raphaël M. Jungers, Vladimir Protasov:
On the complexity of computing the capacity of codes that avoid forbidden difference patterns. CoRR abs/cs/0601036 (2006) - [i1]Raphaël M. Jungers, Vladimir Protasov, Vincent D. Blondel:
Efficient algorithms for deciding the type of growth of products of integer matrices. CoRR abs/cs/0604047 (2006) - 2005
- [c2]Vladimir Protasov:
The Geometric Approach for Computing the Joint Spectral Radius. CDC/ECC 2005: 3001-3006 - [c1]Vladimir Protasov:
Applications of the Joint Spectral Radius to Some Problems of Functional Analysis, Probability and Combinatorics. CDC/ECC 2005: 3025-3030 - 2001
- [j2]Vladimir Protasov:
The Stability of Subdivision Operator at Its Fixed Point. SIAM J. Math. Anal. 33(2): 448-460 (2001) - 2000
- [j1]Vladimir Protasov:
A Complete Solution Characterizing Smooth Refinable Functions. SIAM J. Math. Anal. 31(6): 1332-1350 (2000)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:08 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
