We stand with Ukraine  

Alexander F. Sidorenko

Orcid: 0000-0002-1755-4013

Affiliations:
  • Rényi Institute, Budapest, Hungary
  • Armonk, NY, USA
  • New York University, Courant Institute of Mathematical Sciences, USA (former)


According to our database1, Alexander F. Sidorenko authored at least 25 papers between 1992 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Turán numbers of r-graphs on r + 1 vertices.
[BibTeX]
[DOI]
Alexander F. Sidorenko
J. Comb. Theory B, 2024

2023
Turán numbers T(n,5,3) $T(n,5,3)$ and graphs without induced 5-cycles.
[BibTeX]
[DOI]
Iliya Bluskov
,
Jan de Heer
,
Alexander F. Sidorenko
J. Graph Theory, November, 2023

Modified Erdős-Ginzburg-Ziv Constants for $\mathbb {Z}_2^{d}$.
[BibTeX]
[DOI]
Alexander F. Sidorenko
Graphs Comb., October, 2023

2022
On positive hypergraphs.
[BibTeX]
[DOI]
Alexander F. Sidorenko
Eur. J. Comb., 2022

2021
On Turán numbers of the complete 4-graphs.
[BibTeX]
[DOI]
Alexander F. Sidorenko
Discret. Math., 2021

Inequalities for Doubly Nonnegative Functions.
[BibTeX]
[DOI]
Alexander F. Sidorenko
Electron. J. Comb., 2021

2020
On generalized Erdős-Ginzburg-Ziv constants for Z2d.
[BibTeX]
[DOI]
Alexander F. Sidorenko
J. Comb. Theory A, 2020

Weakly Norming Graphs are Edge-Transitive.
[BibTeX]
[DOI]
Alexander F. Sidorenko
Comb., 2020

2018
Extremal Problems on the Hypercube and the Codegree Turán Density of Complete r-Graphs.
[BibTeX]
[DOI]
Alexander F. Sidorenko
SIAM J. Discret. Math., 2018

An Erdős-Gallai-Type Theorem for Keyrings.
[BibTeX]
[DOI]
Alexander F. Sidorenko
Graphs Comb., 2018

Function Estimation Using Data Adaptive Kernel Estimation - How Much Smoothing?
[BibTeX]
[DOI]
Kurt S. Riedel
,
Alexander F. Sidorenko
CoRR, 2018

Adaptive Kernel Estimation of the Spectral Density with Boundary Kernel Analysis.
[BibTeX]
[DOI]
Alexander F. Sidorenko
,
Kurt S. Riedel
CoRR, 2018

1999
Hypercube subgraphs with local detours.
[BibTeX]
[DOI]
Peter Hamburger
,
Alexandr V. Kostochka
,
Alexander F. Sidorenko
J. Graph Theory, 1999

Extremal Problems for Sets Forming Boolean Algebras and Complete Partite Hypergraphs.
[BibTeX]
[DOI]
David S. Gunderson
,
Vojtech Rödl
,
Alexander F. Sidorenko
J. Comb. Theory A, 1999

Geometrical Techniques for Estimating Numbers of Linear Extensions.
[BibTeX]
[DOI]
Béla Bollobás
,
Graham R. Brightwell
,
Alexander F. Sidorenko
Eur. J. Comb., 1999

1997
Upper Bounds for Turán Numbers.
[BibTeX]
[DOI]
Alexander F. Sidorenko
J. Comb. Theory A, 1997

1996
Randomness friendly graphs.
[BibTeX]
[DOI]
Alexander F. Sidorenko
Random Struct. Algorithms, 1996

1995
Minimum bias multiple taper spectral estimation.
[BibTeX]
[DOI]
Kurt S. Riedel
,
Alexander F. Sidorenko
IEEE Trans. Signal Process., 1995

On the Jumping Constant Conjecture for Multigraphs.
[BibTeX]
Vojtech Rödl
,
Alexander F. Sidorenko
J. Comb. Theory A, 1995

What we know and what we do not know about Turán numbers.
[BibTeX]
[DOI]
Alexander F. Sidorenko
Graphs Comb., 1995

1994
A partially ordered set of functionals corresponding to graphs.
[BibTeX]
[DOI]
Alexander F. Sidorenko
Discret. Math., 1994

1993
A correlation inequality for bipartite graphs.
[BibTeX]
[DOI]
Alexander F. Sidorenko
Graphs Comb., 1993

Boundedness of optimal matrices in extremal multigraph and digraph problems.
[BibTeX]
[DOI]
Alexander F. Sidorenko
Comb., 1993

Optimal databased complex demodulation for evolutionary spectra.
[BibTeX]
[DOI]
Kurt S. Riedel
,
Alexander F. Sidorenko
Proceedings of the IEEE International Conference on Acoustics, 1993

1992
Asymptotic solution of the Turán problem for some hypergraphs.
[BibTeX]
[DOI]
Alexander F. Sidorenko
Graphs Comb., 1992


  Loading...