Evaluation of Strategies of Key Categories of Actors in the Functioning of the Free Port of Vladivostok and Other Development Programs of the Far East Based on the Determination of... von Krivelevich, M, Berezhnova, E

Volltext

Testing Reed-Muller codes von Alon, N., Kaufman, T., Krivelevich, M., Litsyn, S., Ron, D.

Volltext

Upper bounds on the rate of LDPC codes von Burshtein, D., Krivelevich, M., Litsyn, S., Miller, G.

Volltext

Expansion in supercritical random subgraphs of the hypercube and its consequences von Erde, Joshua, Kang, Mihyun, Krivelevich, Michael

Volltext

Spanning Trees at the Connectivity Threshold von Alon, Yahav, Krivelevich, Michael, Michaeli, Peleg

Volltext

Large Subgraphs without Short Cycles von Foucaud, F., Krivelevich, M., Perarnau, G.

Volltext

Bounds on distance distributions in codes of known size von Ashikhmin, A.E., Cohen, G.D., Krivelevich, M., Litsyn, S.N.

Volltext

Covering codes with improved density von Krivelevich, M., Sudakov, B., Vu, V.H.

Volltext

The Largest Eigenvalue of Sparse Random Graphs von KRIVELEVICH, MICHAEL, SUDAKOV, BENNY

Volltext

Tight bounds for testing bipartiteness in general graphs von KAUFMAN, Tali, KRIVELEVICH, Michael, RON, Dana

Volltext

Efficient Testing of Large Graphs von Alon, Noga, Fischer, Eldar, Krivelevich, Michael, Szegedy, Mario

Volltext

On the Edge Distribution in Triangle-free Graphs von Krivelevich, M.

Volltext

On packing Hamilton cycles in ε -regular graphs von Frieze, Alan, Krivelevich, Michael

Volltext

Turán Numbers of Bipartite Graphs and Related Ramsey-Type Questions von Alon, Noga, Krivelevich, Michael, Sudakov, Benny

Volltext

On Rainbow Trees and Cycles von Frieze, Alan, Krivelevich, Michael

Volltext

Sparse pseudo-random graphs are Hamiltonian von Krivelevich, Michael, Sudakov, Benny

Volltext

Maximum cuts and judicious partitions in graphs without short cycles von Alon, Noga, Bollobás, Béla, Krivelevich, Michael, Sudakov, Benny

Volltext

Adding random edges to dense graphs von Bohman, Tom, Frieze, Alan, Krivelevich, Michael, Martin, Ryan

Volltext

Regular languages are testable with a constant number of queries von ALON, Noga, KRIVELEVICH, Michael, NEWMAN, Ilan, SZEGEDY, Mario

Volltext

Deciding k-colorability in expected polynomial time von Krivelevich, Michael

Volltext