Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSergey Tikhonov
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2023
[j13]Feng Dai, A. V. Prymak, A. Shadrin, Vladimir N. Temlyakov, Sergey Tikhonov:
On the cardinality of lower sets and universal discretization. J. Complex. 76: 101726 (2023)- 2021
- [j12]Feng Dai, Dmitry V. Gorbachev, Sergey Tikhonov
:
Estimates of the asymptotic Nikolskii constants for spherical polynomials. J. Complex. 65: 101553 (2021) - 2020
- [j11]Yurii Kolomoitsev, Sergey Tikhonov:
Properties of moduli of smoothness in Lp(Rd). J. Approx. Theory 257: 105423 (2020) - [j10]Dmitry V. Gorbachev, Valerii I. Ivanov, S. Yu. Tikhonov:
Sharp approximation theorems and Fourier inequalities in the Dunkl setting. J. Approx. Theory 258: 105462 (2020) - [j9]Dmitry V. Gorbachev, Valerii I. Ivanov, Sergey Tikhonov:
Uncertainty Principles for Eventually Constant Sign Bandlimited Functions. SIAM J. Math. Anal. 52(5): 4751-4782 (2020) - 2016
- [j8]Dmitry V. Gorbachev, Valerii I. Ivanov, S. Yu. Tikhonov:
Sharp Pitt inequality and logarithmic uncertainty principle for Dunkl transform in L2. J. Approx. Theory 202: 109-118 (2016) - 2015
- [j7]Polina Yu. Glazyrina, Sergey Tikhonov:
Jacobi weights, fractional integration, and sharp Ulyanov inequalities. J. Approx. Theory 195: 122-140 (2015) - 2012
- [j6]Dmitry V. Gorbachev, Sergey Tikhonov:
Moduli of smoothness and growth properties of Fourier transforms: Two-sided estimates. J. Approx. Theory 164(9): 1283-1312 (2012) - 2011
- [j5]Dirk Wall, Sergey Tikhonov, Simon Sindermann, Detlef Spoddig, Christoph Hassel, Michael Horn-von Hoegen, Frank-Joachim Meyer zu Heringdorf:
Shape, orientation, and crystalline composition of silver islands on Si(111). IBM J. Res. Dev. 55(4): 9 (2011) - 2010
- [j4]Boris V. Simonov, Sergey Tikhonov:
Sharp Ul'yanov-type inequalities using fractional smoothness. J. Approx. Theory 162(9): 1654-1684 (2010) - 2008
- [j3]Feng Dai, Zeev Ditzian, S. Yu. Tikhonov:
Sharp Jackson inequalities. J. Approx. Theory 151(1): 86-112 (2008) - [j2]Sergey Tikhonov:
Best approximation and moduli of smoothness: Computation and equivalence theorems. J. Approx. Theory 153(1): 19-39 (2008) - 2005
- [j1]Zeev Ditzian, S. Yu. Tikhonov:
Ul'yanov and Nikol'skii-type inequalities. J. Approx. Theory 133(1): 100-133 (2005)
Informal and Other Publications
- 2022
- [i3]Feng Dai, A. V. Prymak, A. Shadrin, Vladimir N. Temlyakov, Sergey Tikhonov:
On cardinality of the lower sets and universal discretization. CoRR abs/2208.02113 (2022) - 2021
- [i2]Yurii Kolomoitsev, Tetiana Lomako, Sergey Tikhonov:
Sparse grid approximation in weighted Wiener spaces. CoRR abs/2111.06335 (2021) - 2020
- [i1]Feng Dai, Andriy Prymak, A. Shadrin, Vladimir N. Temlyakov, S. Yu. Tikhonov:
Sampling discretization of integral norms. CoRR abs/2001.09320 (2020)
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-04-25 02:08 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:
