default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRon Ofir
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j6]Ron Ofir, Alexander I. Ovseevich, Michael Margaliot
:
Contraction and k-contraction in Lurie systems with applications to networked systems. Autom. 159: 111341 (2024)- [j5]Ron Ofir, Michael Margaliot:
The k-compound of a difference-algebraic system. Autom. 159: 111387 (2024) - [j4]Omri Dalin, Ron Ofir, Eyal Bar-Shalom, Alexander I. Ovseevich, Francesco Bullo, Michael Margaliot:
Verifying $k$-Contraction Without Computing $k$-Compounds. IEEE Trans. Autom. Control. 69(3): 1492-1506 (2024) - [i8]Ron Ofir, Francesco Bullo, Michael Margaliot:
A sufficient condition for 2-contraction of a feedback interconnection. CoRR abs/2408.12790 (2024) - [i7]Ron Ofir, Michael Margaliot:
A networked small-gain theorem based on discrete-time diagonal stability. CoRR abs/2411.03380 (2024) - 2023
- [j3]Noa Zargari, Ron Ofir, Nilanjan Roy Chowdhury, Juri Belikov, Yoash Levron:
An Optimal Control Method for Storage Systems With Ramp Constraints, Based on an On-Going Trimming Process. IEEE Trans. Control. Syst. Technol. 31(1): 493-496 (2023) - [i6]Ron Ofir, Pietro Lorenzetti, Michael Margaliot:
On singularly perturbed systems that are monotone with respect to a matrix cone of rank k. CoRR abs/2303.11970 (2023) - [i5]Ron Ofir, Jean-Jacques E. Slotine, Michael Margaliot:
k-Contraction in a Generalized Lurie System. CoRR abs/2309.07514 (2023) - 2022
- [j2]Ron Ofir, Francesco Bullo, Michael Margaliot:
Minimum Effort Decentralized Control Design for Contracting Network Systems. IEEE Control. Syst. Lett. 6: 2731-2736 (2022) - [j1]Ron Ofir, Michael Margaliot, Yoash Levron, Jean-Jacques E. Slotine:
A Sufficient Condition for $k$-Contraction of the Series Connection of Two Systems. IEEE Trans. Autom. Control. 67(9): 4994-5001 (2022) - [i4]Ron Ofir, Thomas Kriecherbauer, Lars Grüne, Michael Margaliot:
On the gain of entrainment in the n-dimensional ribosome flow model. CoRR abs/2210.10404 (2022) - [i3]Ron Ofir, Alexander I. Ovseevich, Michael Margaliot:
A sufficient condition for k-contraction in Lurie systems. CoRR abs/2211.05696 (2022) - [i2]Ron Ofir, Alexander I. Ovseevich, Michael Margaliot:
Contraction and k-contraction in Lurie systems with applications to networked systems. CoRR abs/2212.13440 (2022) - 2021
- [c3]Ron Ofir, Michael Margaliot, Yoash Levron, Jean-Jacques E. Slotine:
Serial interconnections of 1-contracting and 2-contracting systems. CDC 2021: 3906-3911 - [i1]Ron Ofir, Michael Margaliot:
The Multiplicative Compound of a Matrix Pencil with Applications to Difference-Algebraic Equations. CoRR abs/2111.01419 (2021) - 2020
- [c2]Noa Zargari, Ron Ofir, Yoash Levron, Juri Belikov:
Using DQ0 Signals based on the Central Angle Reference Frame to Model the Dynamics of Large-scale Power Systems. ISGT-Europe 2020: 1099-1103
2010 – 2019
- 2019
- [c1]Yoash Levron, Ron Ofir, Juri Belikov:
Performance Limits of Low Inertia Power Systems Based on Minimum Energy Control. ECC 2019: 1406-1411
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-09 12:51 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:
