Filtros : "POPOV, SERGUEI" "2005" "IME" Removidos: "Topologia Conjuntística" "IP" Limpar

Filtros



Refine with date range


  • Source: Markov Processes and Related Fields. Unidade: IME

    Assunto: PROCESSOS DE MARKOV

    How to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      MENSHIKOV, Mikhail Vasil'evich e PETRITIS, D. e POPOV, Serguei Yu. A note on matrix multiplicative cascades and bindweeds. Markov Processes and Related Fields, v. 11, n. 1, p. 37-54, 2005Tradução . . Acesso em: 28 jun. 2024.
    • APA

      Menshikov, M. V. 'evich, Petritis, D., & Popov, S. Y. (2005). A note on matrix multiplicative cascades and bindweeds. Markov Processes and Related Fields, 11( 1), 37-54.
    • NLM

      Menshikov MV'evich, Petritis D, Popov SY. A note on matrix multiplicative cascades and bindweeds. Markov Processes and Related Fields. 2005 ; 11( 1): 37-54.[citado 2024 jun. 28 ]
    • Vancouver

      Menshikov MV'evich, Petritis D, Popov SY. A note on matrix multiplicative cascades and bindweeds. Markov Processes and Related Fields. 2005 ; 11( 1): 37-54.[citado 2024 jun. 28 ]
  • Source: Random Structures & Algorithms. Unidade: IME

    Subjects: PROCESSOS DE MARKOV, ALGORITMOS E ESTRUTURAS DE DADOS

    Acesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      POPOV, Serguei Yu. Random Bulgarian solitaire. Random Structures & Algorithms, v. 27, n. 3, p. 310-330, 2005Tradução . . Disponível em: https://doi.org/10.1002/rsa.20076. Acesso em: 28 jun. 2024.
    • APA

      Popov, S. Y. (2005). Random Bulgarian solitaire. Random Structures & Algorithms, 27( 3), 310-330. doi:10.1002/rsa.20076
    • NLM

      Popov SY. Random Bulgarian solitaire [Internet]. Random Structures & Algorithms. 2005 ; 27( 3): 310-330.[citado 2024 jun. 28 ] Available from: https://doi.org/10.1002/rsa.20076
    • Vancouver

      Popov SY. Random Bulgarian solitaire [Internet]. Random Structures & Algorithms. 2005 ; 27( 3): 310-330.[citado 2024 jun. 28 ] Available from: https://doi.org/10.1002/rsa.20076
  • Source: Journal of Statistical Physics. Unidade: IME

    Assunto: PROBABILIDADE

    Acesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      LEBENSZTAYN, Élcio e MACHADO, Fábio Prates e POPOV, Serguei Yu. An improved upper bound for the critical probability of the frog model on homogeneous trees. Journal of Statistical Physics, v. 119, n. 1-2, p. 331-345, 2005Tradução . . Disponível em: https://doi.org/10.1007/s10955-004-2051-8. Acesso em: 28 jun. 2024.
    • APA

      Lebensztayn, É., Machado, F. P., & Popov, S. Y. (2005). An improved upper bound for the critical probability of the frog model on homogeneous trees. Journal of Statistical Physics, 119( 1-2), 331-345. doi:10.1007/s10955-004-2051-8
    • NLM

      Lebensztayn É, Machado FP, Popov SY. An improved upper bound for the critical probability of the frog model on homogeneous trees [Internet]. Journal of Statistical Physics. 2005 ; 119( 1-2): 331-345.[citado 2024 jun. 28 ] Available from: https://doi.org/10.1007/s10955-004-2051-8
    • Vancouver

      Lebensztayn É, Machado FP, Popov SY. An improved upper bound for the critical probability of the frog model on homogeneous trees [Internet]. Journal of Statistical Physics. 2005 ; 119( 1-2): 331-345.[citado 2024 jun. 28 ] Available from: https://doi.org/10.1007/s10955-004-2051-8

Digital Library of Intellectual Production of Universidade de São Paulo     2012 - 2024