Filtros : "2004" "Financiado pela NSF" Removidos: "FATORES DE RISCO" "Universidade Ibirapuera" "Eckert, Hellmut" "IQSC-SQM" "Livro de resumos" Limpar

Filtros



Refine with date range


  • Source: Combinatorics Probability & Computing. Unidade: IME

    Assunto: TEORIA DOS GRAFOS

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

      KOHAYAKAWA, Yoshiharu e RODL, Vojtech e SCHACHT, Mathias. The Turan theorem for random graphs. Combinatorics Probability & Computing, v. 13, n. 1, p. 61-91, 2004Tradução . . Disponível em: https://doi.org/10.1017/S0963548303005856. Acesso em: 18 nov. 2024.
    • APA

      Kohayakawa, Y., Rodl, V., & Schacht, M. (2004). The Turan theorem for random graphs. Combinatorics Probability & Computing, 13( 1), 61-91. doi:10.1017/S0963548303005856
    • NLM

      Kohayakawa Y, Rodl V, Schacht M. The Turan theorem for random graphs [Internet]. Combinatorics Probability & Computing. 2004 ; 13( 1): 61-91.[citado 2024 nov. 18 ] Available from: https://doi.org/10.1017/S0963548303005856
    • Vancouver

      Kohayakawa Y, Rodl V, Schacht M. The Turan theorem for random graphs [Internet]. Combinatorics Probability & Computing. 2004 ; 13( 1): 61-91.[citado 2024 nov. 18 ] Available from: https://doi.org/10.1017/S0963548303005856
  • Source: Israel Journal of Mathematics. Unidade: IME

    Assunto: TEORIA DOS GRAFOS

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

      KOHAYAKAWA, Yoshiharu e RODL, Vojtech e SISSOKHO, Papa. Embedding graphs with bounded degree in sparse pseudorandom graphs. Israel Journal of Mathematics, v. 139, p. 93-137, 2004Tradução . . Disponível em: https://doi-org.ez67.periodicos.capes.gov.br/10.1007/BF02787543. Acesso em: 18 nov. 2024.
    • APA

      Kohayakawa, Y., Rodl, V., & Sissokho, P. (2004). Embedding graphs with bounded degree in sparse pseudorandom graphs. Israel Journal of Mathematics, 139, 93-137. doi:10.1007/bf02787543
    • NLM

      Kohayakawa Y, Rodl V, Sissokho P. Embedding graphs with bounded degree in sparse pseudorandom graphs [Internet]. Israel Journal of Mathematics. 2004 ; 139 93-137.[citado 2024 nov. 18 ] Available from: https://doi-org.ez67.periodicos.capes.gov.br/10.1007/BF02787543
    • Vancouver

      Kohayakawa Y, Rodl V, Sissokho P. Embedding graphs with bounded degree in sparse pseudorandom graphs [Internet]. Israel Journal of Mathematics. 2004 ; 139 93-137.[citado 2024 nov. 18 ] Available from: https://doi-org.ez67.periodicos.capes.gov.br/10.1007/BF02787543
  • Source: Physics of Fluids. Unidade: IME

    Assunto: MECÂNICA DOS FLUÍDOS

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

      CENICEROS ANGULO, Héctor Daniel e ROMA, Alexandre Megiorin. Study of the long-time dynamics of a viscous vortex sheet with a fully adaptive nonstiff method. Physics of Fluids, v. 16, n. 12, p. 4285-4318, 2004Tradução . . Disponível em: https://doi.org/10.1063/1.1788351. Acesso em: 18 nov. 2024.
    • APA

      Ceniceros Angulo, H. D., & Roma, A. M. (2004). Study of the long-time dynamics of a viscous vortex sheet with a fully adaptive nonstiff method. Physics of Fluids, 16( 12), 4285-4318. doi:10.1063/1.1788351
    • NLM

      Ceniceros Angulo HD, Roma AM. Study of the long-time dynamics of a viscous vortex sheet with a fully adaptive nonstiff method [Internet]. Physics of Fluids. 2004 ; 16( 12): 4285-4318.[citado 2024 nov. 18 ] Available from: https://doi.org/10.1063/1.1788351
    • Vancouver

      Ceniceros Angulo HD, Roma AM. Study of the long-time dynamics of a viscous vortex sheet with a fully adaptive nonstiff method [Internet]. Physics of Fluids. 2004 ; 16( 12): 4285-4318.[citado 2024 nov. 18 ] Available from: https://doi.org/10.1063/1.1788351
  • Source: Annals of Probability. Unidade: IME

    Assunto: PROCESSOS ESTOCÁSTICOS

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

      FONTES, Luiz Renato et al. The Brownian web: characterization and converge. Annals of Probability, v. 32, n. 4, p. 2875-2883, 2004Tradução . . Disponível em: https://doi.org/10.1214/009117904000000568. Acesso em: 18 nov. 2024.
    • APA

      Fontes, L. R., Isopi, M., Newman, C. M., & Ravishankar, K. (2004). The Brownian web: characterization and converge. Annals of Probability, 32( 4), 2875-2883. doi:10.1214/009117904000000568
    • NLM

      Fontes LR, Isopi M, Newman CM, Ravishankar K. The Brownian web: characterization and converge [Internet]. Annals of Probability. 2004 ; 32( 4): 2875-2883.[citado 2024 nov. 18 ] Available from: https://doi.org/10.1214/009117904000000568
    • Vancouver

      Fontes LR, Isopi M, Newman CM, Ravishankar K. The Brownian web: characterization and converge [Internet]. Annals of Probability. 2004 ; 32( 4): 2875-2883.[citado 2024 nov. 18 ] Available from: https://doi.org/10.1214/009117904000000568

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