Probabilistic models of diversification
Tselishchev, Mikhail Andreevich, 2016, Candidate of Sciences dissertation
Lomonosov Moscow State University (MSU), Moscow
94 pp.
More works in this specialty
- Disjunctive codes with list decoding
Shchukin, Vladislav Yur'evich · 2016 · Candidate of Sciences · Lomonosov Moscow State University (MSU)
- The Monge–Kantorovich problem with linear constraints
Zaev, Danila Andreevich · 2016 · Candidate of Sciences · National Research University Higher School of Economics
- Limit theorems for infinite-server queueing systems with heavy-tailed service time distributions
Chernavskaya, Ekaterina Aleksandrovna · 2016 · Candidate of Sciences · Lomonosov Moscow State University (MSU)
- Limit theorems in the multiple-access queueing problem and in the infinite urn scheme problem
Chebunin, Mikhail Georgievich · 2016 · Candidate of Sciences · Sobolev Institute of Mathematics of the Siberian Branch of the Russian Academy of Sciences
- Spectral and asymptotic properties of some probabilistic models of mathematical physics and optimization
Yarotskiy, Dmitriy Aleksandrovich · 2015 · Doctor of Sciences · Federal State Budgetary Institution of Science Kharkevich Institute for Information Transmission Problems of the Russian Academy of Sciences