Menu

Filtros : "2007" "Financiado pela NSF" Removidos: "FATORES DE RISCO" "Universidade Ibirapuera" "Candido, Denis R." "Eckert, Hellmut" "Livro de resumos" Limpar

Filtros

Refine with date range

  • 1

1 - 5 (5 records)

  • Artigo de periodico

    Essentially infinite colourings of hypergraphs (2007)

    Bollobás, Béla ; Kohayakawa, Yoshiharu ; Rodl, Vojtech; Schacht, Mathias; Taraz, Anusch

    Source: Proceedings of the London Mathematical Society. Unidade: IME

    Subjects: COMBINATÓRIA, TEORIA DOS GRAFOS

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

    • ABNT

      BOLLOBÁS, Béla et al. Essentially infinite colourings of hypergraphs. Proceedings of the London Mathematical Society, v. 95, n. 3, p. 709-734, 2007Tradução . . Disponível em: https://doi.org/10.1112/plms/pdm024. Acesso em: 18 nov. 2024.

    • APA

      Bollobás, B., Kohayakawa, Y., Rodl, V., Schacht, M., & Taraz, A. (2007). Essentially infinite colourings of hypergraphs. Proceedings of the London Mathematical Society, 95( 3), 709-734. doi:10.1112/plms/pdm024

    • NLM

      Bollobás B, Kohayakawa Y, Rodl V, Schacht M, Taraz A. Essentially infinite colourings of hypergraphs [Internet]. Proceedings of the London Mathematical Society. 2007 ; 95( 3): 709-734.[citado 2024 nov. 18 ] Available from: https://doi.org/10.1112/plms/pdm024

    • Vancouver

      Bollobás B, Kohayakawa Y, Rodl V, Schacht M, Taraz A. Essentially infinite colourings of hypergraphs [Internet]. Proceedings of the London Mathematical Society. 2007 ; 95( 3): 709-734.[citado 2024 nov. 18 ] Available from: https://doi.org/10.1112/plms/pdm024

  • Artigo de periodico

    A nonstiff, adaptive mesh refinement-based method for the Cahn-Hilliard equation (2007)

    Ceniceros Angulo, Héctor Daniel; Roma, Alexandre Megiorin

    Source: Journal of Computational Physics. Unidade: IME

    Assunto: MECÂNICA CLÁSSICA

    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. A nonstiff, adaptive mesh refinement-based method for the Cahn-Hilliard equation. Journal of Computational Physics, v. 225, p. 1849-1862, 2007Tradução . . Disponível em: https://doi.org/10.1016/j.jcp.2007.02.019. Acesso em: 18 nov. 2024.

    • APA

      Ceniceros Angulo, H. D., & Roma, A. M. (2007). A nonstiff, adaptive mesh refinement-based method for the Cahn-Hilliard equation. Journal of Computational Physics, 225, 1849-1862. doi:10.1016/j.jcp.2007.02.019

    • NLM

      Ceniceros Angulo HD, Roma AM. A nonstiff, adaptive mesh refinement-based method for the Cahn-Hilliard equation [Internet]. Journal of Computational Physics. 2007 ; 225 1849-1862.[citado 2024 nov. 18 ] Available from: https://doi.org/10.1016/j.jcp.2007.02.019

    • Vancouver

      Ceniceros Angulo HD, Roma AM. A nonstiff, adaptive mesh refinement-based method for the Cahn-Hilliard equation [Internet]. Journal of Computational Physics. 2007 ; 225 1849-1862.[citado 2024 nov. 18 ] Available from: https://doi.org/10.1016/j.jcp.2007.02.019

  • Artigo de periodico

    Small subsets inherit sparse ε-regularity (2007)

    Gerke, Stephanie; Kohayakawa, Yoshiharu ; Rodl, Vojtech; Steger, Angelika

    Source: Journal of Combinatorial Theory. Series B. 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

      GERKE, Stephanie et al. Small subsets inherit sparse ε-regularity. Journal of Combinatorial Theory. Series B, v. 97, n. 1, p. 34-56, 2007Tradução . . Disponível em: https://doi.org/10.1016/j.jctb.2006.03.004. Acesso em: 18 nov. 2024.

    • APA

      Gerke, S., Kohayakawa, Y., Rodl, V., & Steger, A. (2007). Small subsets inherit sparse ε-regularity. Journal of Combinatorial Theory. Series B, 97( 1), 34-56. doi:10.1016/j.jctb.2006.03.004

    • NLM

      Gerke S, Kohayakawa Y, Rodl V, Steger A. Small subsets inherit sparse ε-regularity [Internet]. Journal of Combinatorial Theory. Series B. 2007 ; 97( 1): 34-56.[citado 2024 nov. 18 ] Available from: https://doi.org/10.1016/j.jctb.2006.03.004

    • Vancouver

      Gerke S, Kohayakawa Y, Rodl V, Steger A. Small subsets inherit sparse ε-regularity [Internet]. Journal of Combinatorial Theory. Series B. 2007 ; 97( 1): 34-56.[citado 2024 nov. 18 ] Available from: https://doi.org/10.1016/j.jctb.2006.03.004

  • Artigo de periodico

    Turan's theorem for pseudo-random graphs (2007)

    Kohayakawa, Yoshiharu ; Rodl, Vojtech; Schacht, Mathias; Sissokho, Papa; Skokan, Jozef

    Source: Journal of Combinatorial Theory, Serie A. 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 et al. Turan's theorem for pseudo-random graphs. Journal of Combinatorial Theory, Serie A, v. 114, n. 4, p. 631-657, 2007Tradução . . Disponível em: https://doi.org/10.1016/j.jcta.2006.08.004. Acesso em: 18 nov. 2024.

    • APA

      Kohayakawa, Y., Rodl, V., Schacht, M., Sissokho, P., & Skokan, J. (2007). Turan's theorem for pseudo-random graphs. Journal of Combinatorial Theory, Serie A, 114( 4), 631-657. doi:10.1016/j.jcta.2006.08.004

    • NLM

      Kohayakawa Y, Rodl V, Schacht M, Sissokho P, Skokan J. Turan's theorem for pseudo-random graphs [Internet]. Journal of Combinatorial Theory, Serie A. 2007 ; 114( 4): 631-657.[citado 2024 nov. 18 ] Available from: https://doi.org/10.1016/j.jcta.2006.08.004

    • Vancouver

      Kohayakawa Y, Rodl V, Schacht M, Sissokho P, Skokan J. Turan's theorem for pseudo-random graphs [Internet]. Journal of Combinatorial Theory, Serie A. 2007 ; 114( 4): 631-657.[citado 2024 nov. 18 ] Available from: https://doi.org/10.1016/j.jcta.2006.08.004

  • Artigo de periodico

    Measures of pseudorandomness for finite sequences: typical values (2007)

    Alon, Noga; Kohayakawa, Yoshiharu ; Mauduit, Christian; Moreira, Carlos Gustavo; Rodl, Vojtech

    Source: Proceedings of the London Mathematical Society. Unidade: IME

    Subjects: CIÊNCIA DA COMPUTAÇÃO, MATEMÁTICA DISCRETA, COMBINATÓRIA

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

    • ABNT

      ALON, Noga et al. Measures of pseudorandomness for finite sequences: typical values. Proceedings of the London Mathematical Society, v. 95, n. 3, p. 778-812, 2007Tradução . . Disponível em: https://doi.org/10.1112/plms/pdm027. Acesso em: 18 nov. 2024.

    • APA

      Alon, N., Kohayakawa, Y., Mauduit, C., Moreira, C. G., & Rodl, V. (2007). Measures of pseudorandomness for finite sequences: typical values. Proceedings of the London Mathematical Society, 95( 3), 778-812. doi:10.1112/plms/pdm027

    • NLM

      Alon N, Kohayakawa Y, Mauduit C, Moreira CG, Rodl V. Measures of pseudorandomness for finite sequences: typical values [Internet]. Proceedings of the London Mathematical Society. 2007 ; 95( 3): 778-812.[citado 2024 nov. 18 ] Available from: https://doi.org/10.1112/plms/pdm027

    • Vancouver

      Alon N, Kohayakawa Y, Mauduit C, Moreira CG, Rodl V. Measures of pseudorandomness for finite sequences: typical values [Internet]. Proceedings of the London Mathematical Society. 2007 ; 95( 3): 778-812.[citado 2024 nov. 18 ] Available from: https://doi.org/10.1112/plms/pdm027
  • 1

1 - 5 (5 records)

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