Menu

Filtros : "Financiado pela FINEP" "Algorithmica" Removidos: "Paquistão" "Suíça" "2016" 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: 01 out. 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 out. 01 ] 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 out. 01 ] Available from: https://doi.org/10.1007/s00453-006-1216-z

  • Artigo de periodico

    A new approximation algorithm for finding heavy planar subgraphs (2003)

    Calinescu, Gruia; Fernandes, Cristina Gomes ; Karloff, Howard; Zelikovsky, Alexander

    Source: Algorithmica. Unidade: IME

    Subjects: TEORIA DOS GRAFOS, ALGORITMOS DE APROXIMAÇÃO

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

    • ABNT

      CALINESCU, Gruia et al. A new approximation algorithm for finding heavy planar subgraphs. Algorithmica, v. 36, n. 2, p. 179-205, 2003Tradução . . Disponível em: https://doi.org/10.1007/s00453-002-1020-3. Acesso em: 01 out. 2024.

    • APA

      Calinescu, G., Fernandes, C. G., Karloff, H., & Zelikovsky, A. (2003). A new approximation algorithm for finding heavy planar subgraphs. Algorithmica, 36( 2), 179-205. doi:10.1007/s00453-002-1020-3

    • NLM

      Calinescu G, Fernandes CG, Karloff H, Zelikovsky A. A new approximation algorithm for finding heavy planar subgraphs [Internet]. Algorithmica. 2003 ; 36( 2): 179-205.[citado 2024 out. 01 ] Available from: https://doi.org/10.1007/s00453-002-1020-3

    • Vancouver

      Calinescu G, Fernandes CG, Karloff H, Zelikovsky A. A new approximation algorithm for finding heavy planar subgraphs [Internet]. Algorithmica. 2003 ; 36( 2): 179-205.[citado 2024 out. 01 ] Available from: https://doi.org/10.1007/s00453-002-1020-3
  • 1

1 - 2 (2 records)

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