ReP USP - Resultado da busca

Artigo de periodico
Cross-multiplicative coalescent processes and applications (2021)
Kovchegov, Yevgeniy ; Otto, Peter T.; Yambartsev, Anatoli
Source: Latin American Journal of Probability and Mathematical Statistics. Unidade: IME
Subjects: PROCESSOS ESTOCÁSTICOS, MECÂNICA ESTATÍSTICA, GRAFOS ALEATÓRIOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
KOVCHEGOV, Yevgeniy e OTTO, Peter T. e YAMBARTSEV, Anatoli. Cross-multiplicative coalescent processes and applications. Latin American Journal of Probability and Mathematical Statistics, v. 18, p. 81-106, 2021Tradução . . Disponível em: https://doi.org/10.30757/ALEA.V18-05. Acesso em: 28 ago. 2024.
APA
Kovchegov, Y., Otto, P. T., & Yambartsev, A. (2021). Cross-multiplicative coalescent processes and applications. Latin American Journal of Probability and Mathematical Statistics, 18, 81-106. doi:10.30757/ALEA.V18-05
NLM
Kovchegov Y, Otto PT, Yambartsev A. Cross-multiplicative coalescent processes and applications [Internet]. Latin American Journal of Probability and Mathematical Statistics. 2021 ; 18 81-106.[citado 2024 ago. 28 ] Available from: https://doi.org/10.30757/ALEA.V18-05
Vancouver
Kovchegov Y, Otto PT, Yambartsev A. Cross-multiplicative coalescent processes and applications [Internet]. Latin American Journal of Probability and Mathematical Statistics. 2021 ; 18 81-106.[citado 2024 ago. 28 ] Available from: https://doi.org/10.30757/ALEA.V18-05
Artigo de periodico
Sparse partition universal graphs for graphs of bounded degree (2011)
Kohayakawa, Yoshiharu ; Rodl, Vojtech; Schacht, Mathias; Szemerédi, Endre
Source: Advances in Mathematics. Unidade: IME
Assunto: GRAFOS ALEATÓRIOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
KOHAYAKAWA, Yoshiharu et al. Sparse partition universal graphs for graphs of bounded degree. Advances in Mathematics, v. 226, n. 6, p. 5041-5065, 2011Tradução . . Disponível em: https://doi.org/10.1016/j.aim.2011.01.004. Acesso em: 28 ago. 2024.
APA
Kohayakawa, Y., Rodl, V., Schacht, M., & Szemerédi, E. (2011). Sparse partition universal graphs for graphs of bounded degree. Advances in Mathematics, 226( 6), 5041-5065. doi:10.1016/j.aim.2011.01.004
NLM
Kohayakawa Y, Rodl V, Schacht M, Szemerédi E. Sparse partition universal graphs for graphs of bounded degree [Internet]. Advances in Mathematics. 2011 ; 226( 6): 5041-5065.[citado 2024 ago. 28 ] Available from: https://doi.org/10.1016/j.aim.2011.01.004
Vancouver
Kohayakawa Y, Rodl V, Schacht M, Szemerédi E. Sparse partition universal graphs for graphs of bounded degree [Internet]. Advances in Mathematics. 2011 ; 226( 6): 5041-5065.[citado 2024 ago. 28 ] Available from: https://doi.org/10.1016/j.aim.2011.01.004
Artigo de periodico
Regular pairs in sparse random graphs I (2003)
Kohayakawa, Yoshiharu ; Rodl, Vojtech
Source: Random Structures and Algorithms. Unidade: IME
Subjects: ALGORITMOS E ESTRUTURAS DE DADOS, GRAFOS ALEATÓRIOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
KOHAYAKAWA, Yoshiharu e RODL, Vojtech. Regular pairs in sparse random graphs I. Random Structures and Algorithms, v. 22, n. 4, p. 359-434, 2003Tradução . . Disponível em: https://doi.org/10.1002/rsa.10081. Acesso em: 28 ago. 2024.
APA
Kohayakawa, Y., & Rodl, V. (2003). Regular pairs in sparse random graphs I. Random Structures and Algorithms, 22( 4), 359-434. doi:10.1002/rsa.10081
NLM
Kohayakawa Y, Rodl V. Regular pairs in sparse random graphs I [Internet]. Random Structures and Algorithms. 2003 ; 22( 4): 359-434.[citado 2024 ago. 28 ] Available from: https://doi.org/10.1002/rsa.10081
Vancouver
Kohayakawa Y, Rodl V. Regular pairs in sparse random graphs I [Internet]. Random Structures and Algorithms. 2003 ; 22( 4): 359-434.[citado 2024 ago. 28 ] Available from: https://doi.org/10.1002/rsa.10081

USP Schools

ReP

Filtros

Authors