We stand with Ukraine  

A. F. Sidorenko

According to our database1, A. F. Sidorenko authored at least 9 papers between 1988 and 1993.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

1993
Lyapounov Functions for Jackson Networks.
[BibTeX]
[DOI]
Guy Fayolle
,
V. A. Malyshev
,
M. V. Menshikov
,
A. F. Sidorenko
Math. Oper. Res., 1993

The Ramsey Number of an <i>N</i>-Edge Graph versus Triangle Is at Most 2<i>N</i> + 1.
[BibTeX]
[DOI]
A. F. Sidorenko
J. Comb. Theory, Ser. B, 1993

1992
On ramsey-tuŕan numbers for 3-graphs.
[BibTeX]
[DOI]
A. F. Sidorenko
J. Graph Theory, 1992

1991
Inequalities in Probability Theory and Turán-Type Problems for Graphs with Colored Vertices.
[BibTeX]
[DOI]
A. F. Sidorenko
Random Struct. Algorithms, 1991

An upper bound on the ramsey number <i>R</i>(<i>K</i><sub>3</sub>, <i>G</i>) depending only on the size of the graph <i>G</i>.
[BibTeX]
[DOI]
A. F. Sidorenko
J. Graph Theory, 1991

Triangle-free regular graphs.
[BibTeX]
[DOI]
A. F. Sidorenko
Discret. Math., 1991

Probabilistic methods for Jackson networks.
[BibTeX]
Guy Fayolle
,
V. A. Malyshev
,
M. V. Menshikov
,
A. F. Sidorenko
Proceedings of the Performance of Distributed Systems and Integrated Communication Networks, 1991

1989
Asymptotic solution for a new class of forbidden r-graphs.
[BibTeX]
[DOI]
A. F. Sidorenko
Comb., 1989

1988
An infinite permutation without arithmetic progressions.
[BibTeX]
[DOI]
A. F. Sidorenko
Discret. Math., 1988


  Loading...