default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRafig P. Agaev
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j9]Rafig P. Agaev, Dmitry K. Khomutov:
On the Boundary Value of the Time-Delay and the Asymptotic Behavior of a Continuous First-Order Consensus Protocol. Autom. Remote. Control. 85(6): 533-542 (2024)- 2023
- [j8]Rafig P. Agaev, Dmitry K. Khomutov:
On the Properties of Orthogonal Projection Method for Reaching Consensus. Autom. Remote. Control. 84(5): 457-469 (2023)
2010 – 2019
- 2019
- [j7]Rafig P. Agaev:
On the Role of the Eigenprojector of the Laplacian Matrix for Reaching Consensus in Multiagent Second-Order Systems. Autom. Remote. Control. 80(11): 2033-2042 (2019) - 2018
- [i12]Rafig Agaev, Pavel Chebotarev:
Two Models of Latent Consensus in Multi-Agent Systems. CoRR abs/1811.10430 (2018) - 2017
- [j6]Rafig P. Agaev, Pavel Yu. Chebotarev:
Models of latent consensus. Autom. Remote. Control. 78(1): 88-99 (2017) - 2016
- [i11]Rafig P. Agaev, Pavel Yu. Chebotarev:
Models of latent consensus. CoRR abs/1612.05201 (2016) - 2015
- [j5]Rafig P. Agaev, Pavel Yu. Chebotarev:
The projection method for continuous-time consensus seeking. Autom. Remote. Control. 76(8): 1436-1445 (2015) - [i10]Rafig P. Agaev, Pavel Yu. Chebotarev:
The projection method for continuous-time consensus seeking. CoRR abs/1507.04177 (2015) - 2014
- [j4]Rafig P. Agaev:
On the convergence domain in the differential model of reaching a consensus. Autom. Remote. Control. 75(3): 563-569 (2014) - [j3]Pavel Chebotarev, Rafig Agaev:
The Forest Consensus Theorem. IEEE Trans. Autom. Control. 59(9): 2475-2479 (2014) - 2013
- [c2]Pavel Chebotarev
, Rafig Agaev:
Matrices of Forests, Analysis of Networks, and Ranking Problems. ITQM 2013: 1134-1141 - [c1]Pavel Yu. Chebotarev, Rafig P. Agaev:
The Projection Method for Reaching Consensus in Discrete-Time Multiagent Systems. MIM 2013: 1158-1163 - [i9]Pavel Chebotarev, Rafig Agaev:
The forest consensus theorem. CoRR abs/1301.1848 (2013) - [i8]Pavel Chebotarev, Rafig Agaev:
Matrices of forests, analysis of networks, and ranking problems. CoRR abs/1305.6441 (2013) - 2011
- [i7]Rafig P. Agaev, Pavel Yu. Chebotarev:
The Projection Method for Reaching Consensus and the Regularized Power Limit of a Stochastic Matrix. CoRR abs/1109.3948 (2011) - [i6]Rafig Agaev, Pavel Chebotarev:
A Cyclic Representation of Discrete Coordination Procedures. CoRR abs/1112.0404 (2011) - 2010
- [j2]Rafig Agaev, Pavel Chebotarev:
Which digraphs with ring structure are essentially cyclic? Adv. Appl. Math. 45(2): 232-251 (2010)
2000 – 2009
- 2009
- [i5]Pavel Chebotarev, Rafig Agaev:
Coordination in multiagent systems and Laplacian spectra of digraphs. CoRR abs/0902.4098 (2009) - [i4]Rafig Agaev, Pavel Chebotarev:
Which Digraphs with Ring Structure are Essentially Cyclic? CoRR abs/0910.3113 (2009) - 2006
- [i3]Rafig Agaev, Pavel Chebotarev:
The Matrix of Maximum Out Forests of a Digraph and Its Applications. CoRR abs/math/0602059 (2006) - [i2]Rafig Agaev, Pavel Chebotarev:
Spanning Forests of a Digraph and Their Applications. CoRR abs/math/0602061 (2006) - 2005
- [i1]Pavel Chebotarev, Rafig Agaev:
Matrices of Forests and the Analysis of Digraphs. CoRR abs/math/0508171 (2005)
1990 – 1999
- 1994
- [j1]Rafig P. Agaev:
Interval Choice under Constraints on Error Functions. Inf. Sci. 80(1-2): 1-14 (1994)
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 13:27 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:
