default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlexander F. Sidorenko
Person information
- affiliation: Rényi Institute, Budapest, Hungary
- affiliation: Armonk, NY, USA
- affiliation (former): New York University, Courant Institute of Mathematical Sciences, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j22]Alexander F. Sidorenko
:
Turán numbers of r-graphs on r + 1 vertices. J. Comb. Theory B 169: 150-160 (2024)- 2023
- [j21]Alexander F. Sidorenko:
Modified Erdős-Ginzburg-Ziv Constants for $\mathbb {Z}_2^{d}$. Graphs Comb. 39(5): 112 (2023) - [j20]Iliya Bluskov, Jan de Heer, Alexander F. Sidorenko:
Turán numbers T(n,5,3) $T(n,5,3)$ and graphs without induced 5-cycles. J. Graph Theory 104(3): 451-460 (2023) - 2022
- [j19]Alexander F. Sidorenko:
On positive hypergraphs. Eur. J. Comb. 106: 103574 (2022) - 2021
- [j18]Alexander F. Sidorenko:
Inequalities for Doubly Nonnegative Functions. Electron. J. Comb. 28(1): 1 (2021) - [j17]Alexander F. Sidorenko:
On Turán numbers of the complete 4-graphs. Discret. Math. 344(11): 112544 (2021) - 2020
- [j16]Alexander F. Sidorenko:
Weakly Norming Graphs are Edge-Transitive. Comb. 40(4): 601-604 (2020) - [j15]Alexander F. Sidorenko:
On generalized Erdős-Ginzburg-Ziv constants for Z2d. J. Comb. Theory A 174: 105254 (2020)
2010 – 2019
- 2018
- [j14]Alexander F. Sidorenko:
An Erdős-Gallai-Type Theorem for Keyrings. Graphs Comb. 34(4): 633-638 (2018) - [j13]Alexander F. Sidorenko:
Extremal Problems on the Hypercube and the Codegree Turán Density of Complete r-Graphs. SIAM J. Discret. Math. 32(4): 2667-2674 (2018) - [i2]Alexander F. Sidorenko, Kurt S. Riedel:
Adaptive Kernel Estimation of the Spectral Density with Boundary Kernel Analysis. CoRR abs/1803.03906 (2018) - [i1]Kurt S. Riedel, Alexander F. Sidorenko:
Function Estimation Using Data Adaptive Kernel Estimation - How Much Smoothing? CoRR abs/1803.03999 (2018)
1990 – 1999
- 1999
- [j12]Béla Bollobás, Graham R. Brightwell, Alexander F. Sidorenko:
Geometrical Techniques for Estimating Numbers of Linear Extensions. Eur. J. Comb. 20(5): 329-335 (1999) - [j11]David S. Gunderson, Vojtech Rödl, Alexander F. Sidorenko:
Extremal Problems for Sets Forming Boolean Algebras and Complete Partite Hypergraphs. J. Comb. Theory A 88(2): 342-367 (1999) - [j10]Peter Hamburger, Alexandr V. Kostochka, Alexander F. Sidorenko:
Hypercube subgraphs with local detours. J. Graph Theory 30(2): 101-111 (1999) - 1997
- [j9]Alexander F. Sidorenko:
Upper Bounds for Turán Numbers. J. Comb. Theory A 77(1): 134-147 (1997) - 1996
- [j8]Alexander F. Sidorenko:
Randomness friendly graphs. Random Struct. Algorithms 8(3): 229-241 (1996) - 1995
- [j7]Alexander F. Sidorenko:
What we know and what we do not know about Turán numbers. Graphs Comb. 11(2): 179-199 (1995) - [j6]Vojtech Rödl, Alexander F. Sidorenko:
On the Jumping Constant Conjecture for Multigraphs. J. Comb. Theory A 69(2): 347-357 (1995) - [j5]Kurt S. Riedel, Alexander F. Sidorenko:
Minimum bias multiple taper spectral estimation. IEEE Trans. Signal Process. 43(1): 188-195 (1995) - 1994
- [j4]Alexander F. Sidorenko:
A partially ordered set of functionals corresponding to graphs. Discret. Math. 131(1-3): 263-277 (1994) - 1993
- [j3]Alexander F. Sidorenko:
Boundedness of optimal matrices in extremal multigraph and digraph problems. Comb. 13(1): 109-120 (1993) - [j2]Alexander F. Sidorenko:
A correlation inequality for bipartite graphs. Graphs Comb. 9(2-4): 201-204 (1993) - [c1]Kurt S. Riedel, Alexander F. Sidorenko:
Optimal databased complex demodulation for evolutionary spectra. ICASSP (4) 1993: 432-435 - 1992
- [j1]Alexander F. Sidorenko:
Asymptotic solution of the Turán problem for some hypergraphs. Graphs Comb. 8(2): 199-201 (1992)
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-03 20:15 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:
