Menu

Filtros : "Financiado pelo MCTI" "2000" Removido: "2015" Limpar

Filtros

Refine with date range

  • 1

1 - 4 (4 records)

  • Artigo de periodico

    Essentially infinite colourings of graphs (2000)

    Bollobás, Béla ; Kohayakawa, Yoshiharu ; Schelp, Richard H.

    Source: Journal of the London Mathematical Society. Second Series. 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

      BOLLOBÁS, Béla e KOHAYAKAWA, Yoshiharu e SCHELP, Richard H. Essentially infinite colourings of graphs. Journal of the London Mathematical Society. Second Series, v. 61, n. 3, p. 658-670, 2000Tradução . . Disponível em: https://doi-org.ez67.periodicos.capes.gov.br/10.1112/S0024610700008796. Acesso em: 04 ago. 2024.

    • APA

      Bollobás, B., Kohayakawa, Y., & Schelp, R. H. (2000). Essentially infinite colourings of graphs. Journal of the London Mathematical Society. Second Series, 61( 3), 658-670. doi:10.1112/S0024610700008796

    • NLM

      Bollobás B, Kohayakawa Y, Schelp RH. Essentially infinite colourings of graphs [Internet]. Journal of the London Mathematical Society. Second Series. 2000 ; 61( 3): 658-670.[citado 2024 ago. 04 ] Available from: https://doi-org.ez67.periodicos.capes.gov.br/10.1112/S0024610700008796

    • Vancouver

      Bollobás B, Kohayakawa Y, Schelp RH. Essentially infinite colourings of graphs [Internet]. Journal of the London Mathematical Society. Second Series. 2000 ; 61( 3): 658-670.[citado 2024 ago. 04 ] Available from: https://doi-org.ez67.periodicos.capes.gov.br/10.1112/S0024610700008796

  • Trabalho de evento

    Universality and tolerance (2000)

    Alon, Noga; Capalbo, Michael; Kohayakawa, Yoshiharu ; Rodl, Vojtech; Ruciânski, Andrzej; Szemerédi, Endre

    Conference titles: Annual Symposium on Foundations of Computer Science. Unidade: IME

    Assunto: COMPUTAÇÃO GRÁFICA

    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. Universality and tolerance. 2000, Anais.. Los alamitos: IEEE Computer Society, 2000. Disponível em: https://doi.org/10.1109/SFCS.2000.892007. Acesso em: 04 ago. 2024.

    • APA

      Alon, N., Capalbo, M., Kohayakawa, Y., Rodl, V., Ruciânski, A., & Szemerédi, E. (2000). Universality and tolerance. In . Los alamitos: IEEE Computer Society. doi:10.1109/SFCS.2000.892007

    • NLM

      Alon N, Capalbo M, Kohayakawa Y, Rodl V, Ruciânski A, Szemerédi E. Universality and tolerance [Internet]. 2000 ;[citado 2024 ago. 04 ] Available from: https://doi.org/10.1109/SFCS.2000.892007

    • Vancouver

      Alon N, Capalbo M, Kohayakawa Y, Rodl V, Ruciânski A, Szemerédi E. Universality and tolerance [Internet]. 2000 ;[citado 2024 ago. 04 ] Available from: https://doi.org/10.1109/SFCS.2000.892007

  • Artigo de periodico

    Finding skew partitions efficiently (2000)

    Figueiredo, Celina Miraglia Herrera de; Klein, Sulamita; Kohayakawa, Yoshiharu ; Reed, Bruce A.

    Source: Journal of Algorithms. Unidade: IME

    Subjects: ALGORITMOS E ESTRUTURAS DE DADOS, ALGORITMOS

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

    • ABNT

      FIGUEIREDO, Celina Miraglia Herrera de et al. Finding skew partitions efficiently. Journal of Algorithms, v. 37, n. 2, p. 505-521, 2000Tradução . . Disponível em: https://doi.org/10.1006/jagm.1999.1122. Acesso em: 04 ago. 2024.

    • APA

      Figueiredo, C. M. H. de, Klein, S., Kohayakawa, Y., & Reed, B. A. (2000). Finding skew partitions efficiently. Journal of Algorithms, 37( 2), 505-521. doi:10.1006/jagm.1999.1122

    • NLM

      Figueiredo CMH de, Klein S, Kohayakawa Y, Reed BA. Finding skew partitions efficiently [Internet]. Journal of Algorithms. 2000 ; 37( 2): 505-521.[citado 2024 ago. 04 ] Available from: https://doi.org/10.1006/jagm.1999.1122

    • Vancouver

      Figueiredo CMH de, Klein S, Kohayakawa Y, Reed BA. Finding skew partitions efficiently [Internet]. Journal of Algorithms. 2000 ; 37( 2): 505-521.[citado 2024 ago. 04 ] Available from: https://doi.org/10.1006/jagm.1999.1122

  • Artigo de periodico

    The length of random subsets of Boolean lattices (2000)

    Kohayakawa, Yoshiharu ; Kreuter, Bernd; Osthus, Deryk

    Source: Random Structures & Algorithms. Unidade: IME

    Subjects: TEORIA DOS GRAFOS, COMBINATÓRIA

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

    • ABNT

      KOHAYAKAWA, Yoshiharu e KREUTER, Bernd e OSTHUS, Deryk. The length of random subsets of Boolean lattices. Random Structures & Algorithms, v. 16, n. 2, p. 177-194, 2000Tradução . . Disponível em: https://doi.org/10.1002/(SICI)1098-2418(200003)16:2<177::AID-RSA4>3.0.CO;2-9. Acesso em: 04 ago. 2024.

    • APA

      Kohayakawa, Y., Kreuter, B., & Osthus, D. (2000). The length of random subsets of Boolean lattices. Random Structures & Algorithms, 16( 2), 177-194. doi:10.1002/(SICI)1098-2418(200003)16:2<177::AID-RSA4>3.0.CO;2-9

    • NLM

      Kohayakawa Y, Kreuter B, Osthus D. The length of random subsets of Boolean lattices [Internet]. Random Structures & Algorithms. 2000 ; 16( 2): 177-194.[citado 2024 ago. 04 ] Available from: https://doi.org/10.1002/(SICI)1098-2418(200003)16:2<177::AID-RSA4>3.0.CO;2-9

    • Vancouver

      Kohayakawa Y, Kreuter B, Osthus D. The length of random subsets of Boolean lattices [Internet]. Random Structures & Algorithms. 2000 ; 16( 2): 177-194.[citado 2024 ago. 04 ] Available from: https://doi.org/10.1002/(SICI)1098-2418(200003)16:2<177::AID-RSA4>3.0.CO;2-9
  • 1

1 - 4 (4 records)

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