Menu

Filtros : "Carleton University - School of Computer Science" "IME" Limpar

Filtros

Refine with date range

  • 1

1 - 2 (2 records)

  • Artigo de periodico

    New BSP/CGM algorithms for spanning trees (2019)

    Vasconcellos, Jucele França de Alencar; Cáceres, Edson Norberto; Mongelli, Henrique; Song, Siang Wun; Dehne, Frank; Szwarcfiter, Jayme Luiz

    Source: The International Journal of High Performance Computing Applications. Unidade: IME

    Assunto: REDES DE COMPUTADORES

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

    • ABNT

      VASCONCELLOS, Jucele França de Alencar et al. New BSP/CGM algorithms for spanning trees. The International Journal of High Performance Computing Applications, v. 33, n. 3, p. 444-461, 2019Tradução . . Disponível em: https://doi.org/10.1177/1094342018803672. Acesso em: 17 nov. 2024.

    • APA

      Vasconcellos, J. F. de A., Cáceres, E. N., Mongelli, H., Song, S. W., Dehne, F., & Szwarcfiter, J. L. (2019). New BSP/CGM algorithms for spanning trees. The International Journal of High Performance Computing Applications, 33( 3), 444-461. doi:10.1177/1094342018803672

    • NLM

      Vasconcellos JF de A, Cáceres EN, Mongelli H, Song SW, Dehne F, Szwarcfiter JL. New BSP/CGM algorithms for spanning trees [Internet]. The International Journal of High Performance Computing Applications. 2019 ; 33( 3): 444-461.[citado 2024 nov. 17 ] Available from: https://doi.org/10.1177/1094342018803672

    • Vancouver

      Vasconcellos JF de A, Cáceres EN, Mongelli H, Song SW, Dehne F, Szwarcfiter JL. New BSP/CGM algorithms for spanning trees [Internet]. The International Journal of High Performance Computing Applications. 2019 ; 33( 3): 444-461.[citado 2024 nov. 17 ] Available from: https://doi.org/10.1177/1094342018803672

  • Artigo de periodico

    Efficient parallel graph algoritms for coarse-grained multicomputers and BSP (2002)

    Dehne, Frank; Ferreira, Afonso Galvão; Cáceres, Edson Norberto; Song, Siang Wun; Roncato, A.

    Source: Algorithmica. Unidade: IME

    Assunto: ALGORITMOS

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

    • ABNT

      DEHNE, Frank et al. Efficient parallel graph algoritms for coarse-grained multicomputers and BSP. Algorithmica, v. 33, n. 2, p. 183-200, 2002Tradução . . Disponível em: https://doi.org/10.1007/s00453-001-0109-4. Acesso em: 17 nov. 2024.

    • APA

      Dehne, F., Ferreira, A. G., Cáceres, E. N., Song, S. W., & Roncato, A. (2002). Efficient parallel graph algoritms for coarse-grained multicomputers and BSP. Algorithmica, 33( 2), 183-200. doi:10.1007/s00453-001-0109-4

    • NLM

      Dehne F, Ferreira AG, Cáceres EN, Song SW, Roncato A. Efficient parallel graph algoritms for coarse-grained multicomputers and BSP [Internet]. Algorithmica. 2002 ; 33( 2): 183-200.[citado 2024 nov. 17 ] Available from: https://doi.org/10.1007/s00453-001-0109-4

    • Vancouver

      Dehne F, Ferreira AG, Cáceres EN, Song SW, Roncato A. Efficient parallel graph algoritms for coarse-grained multicomputers and BSP [Internet]. Algorithmica. 2002 ; 33( 2): 183-200.[citado 2024 nov. 17 ] Available from: https://doi.org/10.1007/s00453-001-0109-4
  • 1

1 - 2 (2 records)

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