default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSergei P. Sidorov
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c16]Sergei P. Sidorov
, Sergei V. Mironov, Alexey A. Grigoriev:
Limit Distributions of Friendship Index in Scale-Free Networks. AIST 2023: 325-337- 2022
- [j11]Sergei P. Sidorov, Sergei V. Mironov, Alexey Grigoriev, Sophia Tikhonova:
An Investigation into the Trend Stationarity of Local Characteristics in Media and Social Networks. Syst. 10(6): 249 (2022) - 2021
- [j10]Sergei P. Sidorov, Sergei V. Mironov, Alexey A. Grigoriev:
Friendship paradox in growth networks: analytical and empirical analysis. Appl. Netw. Sci. 6(1): 51 (2021) - [j9]Sergei P. Sidorov, Sergei V. Mironov, Nina Agafonova, Dmitry Kadomtsev:
Temporal Behavior of Local Characteristics in Complex Networks with Preferential Attachment-Based Growth. Symmetry 13(9): 1567 (2021) - [c15]Sergei P. Sidorov, Sergei V. Mironov, Sergei Tyshkevich:
Surprising Behavior of the Average Degree for a Node's Neighbors in Growth Networks. COMPLEX NETWORKS 2021: 463-474 - [c14]Sergei P. Sidorov, Kirill Spiridinov:
Duality Gap Estimates for a Class of Greedy Optimization Algorithms in Banach Spaces. MOTOR 2021: 192-205 - 2020
- [c13]Sergei P. Sidorov, Sergei V. Mironov, Igor Malinskii, Dmitry Kadomtsev:
Local Degree Asymmetry for Preferential Attachment Model. COMPLEX NETWORKS (2) 2020: 450-461 - [c12]Michael Pleshakov, Sergei P. Sidorov, Kirill Spiridonov:
Convergence Analysis of Penalty Decomposition Algorithm for Cardinality Constrained Convex Optimization in Hilbert Spaces. MOTOR 2020: 141-153
2010 – 2019
- 2019
- [c11]Anastasia Stepanova, Sergei V. Mironov, Sergei P. Sidorov, Alexey Faizliev:
Modification of the k-MXT Algorithm and Its Application to the Geotagged Data Clustering. LOD 2019: 296-307 - 2018
- [j8]Sergei P. Sidorov, Alexey R. Faizliev, Vladimir A. Balash:
A long memory property of economic and financial news flows. Int. J. Data Anal. Tech. Strateg. 10(4): 406-420 (2018) - [c10]Vladimir A. Balash, Alfia Chekmareva, Alexey Faizliev, Sergei P. Sidorov, Sergei V. Mironov, Daniil Volkov:
Analysis of News Flow Dynamics Based on the Company Co-mention Network Characteristics. COMPLEX NETWORKS (2) 2018: 521-533 - [c9]Sergei P. Sidorov, Alexey R. Faizliev, Alexander A. Gudkov, Sergei V. Mironov:
Algorithms for Sparse k-Monotone Regression. CPAIOR 2018: 546-556 - [c8]Sergei P. Sidorov, Alexey R. Faizliev, Michael Levshunov, Alfia Chekmareva, Alexander A. Gudkov, Eugene Korobov:
Graph-Based Clustering Approach for Economic and Financial Event Detection Using News Analytics Data. SocInfo (2) 2018: 271-280 - [c7]Michael Levshunov, Sergei V. Mironov, Alexey R. Faizliev, Sergei P. Sidorov:
Restoring the Succession of Magistrates in Ancient Greek Poleis: How to Reduce It to Travelling Salesman Problem Using Heuristic Approach. SocInfo (1) 2018: 336-347 - [c6]Sergei P. Sidorov, Alexey Faizliev, Vladimir A. Balash, Alexandre Gudkov, A. Z. Chekmareva, Michael Levshunov, Sergei V. Mironov:
QAP Analysis of Company Co-mention Network. WAW 2018: 83-98 - 2017
- [j7]Sergei P. Sidorov, Alexey Faizliev, Andrew A. Khomchenko:
Algorithms for l1-norm minimisation of index tracking error and their performance. Int. J. Math. Oper. Res. 11(4): 497-519 (2017) - [c5]Sergei P. Sidorov, Sergei V. Mironov:
Duality Gap Analysis of Weak Relaxed Greedy Algorithms. LION 2017: 251-262 - [c4]Sergei P. Sidorov, Sergei V. Mironov, Michael Pleshakov:
Dual Convergence Estimates for a Family of Greedy Algorithms in Banach Spaces. MOD 2017: 109-120 - 2016
- [c3]Sergei V. Mironov, Alexey Faizliev, Sergei P. Sidorov, Alexandre Gudkov:
Stochastic Optimal Growth Model with S-Shaped Utility Function. DOOR (Supplement) 2016: 234-241 - [c2]Sergei P. Sidorov, Sergei V. Mironov, Michael Pleshakov:
Dual Greedy Algorithm for Conic Optimization Problem. DOOR (Supplement) 2016: 276-283 - 2015
- [c1]Sergei P. Sidorov:
Linear k-Monotonicity Preserving Algorithms and Their Approximation Properties. MACIS 2015: 93-106 - 2014
- [j6]Sergei P. Sidorov:
Linear Relative n-Widths for Linear Operators Preserving an Intersection of Cones. Int. J. Math. Math. Sci. 2014: 409219:1-409219:7 (2014) - 2011
- [j5]Maksim U. Kalmykov, Sergei P. Sidorov:
A Moment Problem for Discrete Nonpositive Measures on a Finite Interval. Int. J. Math. Math. Sci. 2011: 545780:1-545780:8 (2011)
2000 – 2009
- 2007
- [j4]Sergei P. Sidorov:
Optimal interpolation of convergent algebraic series. Numer. Algorithms 44(3): 273-279 (2007) - 2003
- [j3]Sergei P. Sidorov:
Negative property of shape-preserving finite-dimensional linear operators. Appl. Math. Lett. 16(2): 257-261 (2003) - [j2]Sergei P. Sidorov:
Approximation of the rth differential operator by means of linear shape preserving operators of finite rank. J. Approx. Theory 124(2): 232-241 (2003) - 2002
- [j1]Sergei P. Sidorov:
On Some Extremal Properties of Lagrange Interpolatory Polynomials. J. Approx. Theory 118(2): 188-201 (2002)
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 2024-08-05 21:14 CEST 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:
