Menu

Filtros : "Alves, Carlos Eduardo Rodrigues" "Financiado pela FINEP" Removidos: "GONCALVES, VERA LUCIA MIRA" "ALBUQUERQUE, IVONE FREIRE DA MOTA E" "af" Limpar

Filtros

Refine with date range

  • 1

1 - 2 (2 records)

  • Artigo de periodico

    A coarse-grained parallel algorithm for the all-substrings longest common subsequence problem (2006)

    Alves, Carlos Eduardo Rodrigues; Cáceres, Edson Norberto; Song, Siang Wun

    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

      ALVES, Carlos Eduardo Rodrigues e CÁCERES, Edson Norberto e SONG, Siang Wun. A coarse-grained parallel algorithm for the all-substrings longest common subsequence problem. Algorithmica, v. 45, n. 3, p. 301-335, 2006Tradução . . Disponível em: https://doi.org/10.1007/s00453-006-1216-z. Acesso em: 11 jun. 2024.

    • APA

      Alves, C. E. R., Cáceres, E. N., & Song, S. W. (2006). A coarse-grained parallel algorithm for the all-substrings longest common subsequence problem. Algorithmica, 45( 3), 301-335. doi:10.1007/s00453-006-1216-z

    • NLM

      Alves CER, Cáceres EN, Song SW. A coarse-grained parallel algorithm for the all-substrings longest common subsequence problem [Internet]. Algorithmica. 2006 ; 45( 3): 301-335.[citado 2024 jun. 11 ] Available from: https://doi.org/10.1007/s00453-006-1216-z

    • Vancouver

      Alves CER, Cáceres EN, Song SW. A coarse-grained parallel algorithm for the all-substrings longest common subsequence problem [Internet]. Algorithmica. 2006 ; 45( 3): 301-335.[citado 2024 jun. 11 ] Available from: https://doi.org/10.1007/s00453-006-1216-z

  • Trabalho de evento

    Parallel dynamic programing for solving the string editing problem on a CGM/BSP (2002)

    Alves, Carlos Eduardo Rodrigues; Cáceres, Edson Norberto; Dehne, Frank; Song, Siang Wun

    Source: Proceedings. Conference titles: ACM Symposium on Parallelism in Algorithms and Architectures - SPAA. Unidade: IME

    Subjects: ALGORITMOS, PROGRAMAÇÃO DINÂMICA

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

    • ABNT

      ALVES, Carlos Eduardo Rodrigues et al. Parallel dynamic programing for solving the string editing problem on a CGM/BSP. 2002, Anais.. New York: ACM, 2002. Disponível em: https://doi.org/10.1145/564870.564916. Acesso em: 11 jun. 2024.

    • APA

      Alves, C. E. R., Cáceres, E. N., Dehne, F., & Song, S. W. (2002). Parallel dynamic programing for solving the string editing problem on a CGM/BSP. In Proceedings. New York: ACM. doi:10.1145/564870.564916

    • NLM

      Alves CER, Cáceres EN, Dehne F, Song SW. Parallel dynamic programing for solving the string editing problem on a CGM/BSP [Internet]. Proceedings. 2002 ;[citado 2024 jun. 11 ] Available from: https://doi.org/10.1145/564870.564916

    • Vancouver

      Alves CER, Cáceres EN, Dehne F, Song SW. Parallel dynamic programing for solving the string editing problem on a CGM/BSP [Internet]. Proceedings. 2002 ;[citado 2024 jun. 11 ] Available from: https://doi.org/10.1145/564870.564916
  • 1

1 - 2 (2 records)

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