ReP USP - Resultado da busca

Relatorio tecnico
Sequential and parallel algorithms for the all-substrings longest common subsequence problem (2003)
Alves, Carlos Eduardo Rodrigues; Cáceres, Edson Norberto; Song, Siang Wun
Unidade: IME
Assunto: ALGORITMOS E ESTRUTURAS DE DADOS
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. Sequential and parallel algorithms for the all-substrings longest common subsequence problem. . São Paulo: IME-USP. Disponível em: https://repositorio.usp.br/directbitstream/4ba5e2d8-e2a9-42ec-9d5a-e69267f5f987/1315979.pdf. Acesso em: 16 out. 2024. , 2003
APA
Alves, C. E. R., Cáceres, E. N., & Song, S. W. (2003). Sequential and parallel algorithms for the all-substrings longest common subsequence problem. São Paulo: IME-USP. Recuperado de https://repositorio.usp.br/directbitstream/4ba5e2d8-e2a9-42ec-9d5a-e69267f5f987/1315979.pdf
NLM
Alves CER, Cáceres EN, Song SW. Sequential and parallel algorithms for the all-substrings longest common subsequence problem [Internet]. 2003 ;[citado 2024 out. 16 ] Available from: https://repositorio.usp.br/directbitstream/4ba5e2d8-e2a9-42ec-9d5a-e69267f5f987/1315979.pdf
Vancouver
Alves CER, Cáceres EN, Song SW. Sequential and parallel algorithms for the all-substrings longest common subsequence problem [Internet]. 2003 ;[citado 2024 out. 16 ] Available from: https://repositorio.usp.br/directbitstream/4ba5e2d8-e2a9-42ec-9d5a-e69267f5f987/1315979.pdf
Trabalho de evento
A range minima parallel algorithm for coarse grained multicomputers (1999)
Mongelli, Henrique ; Song, Siang Wun
Source: Proceedings. Conference titles: International Parallel Processing Symposium. Unidade: IME
Assunto: ALGORITMOS E ESTRUTURAS DE DADOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
MONGELLI, Henrique e SONG, Siang Wun. A range minima parallel algorithm for coarse grained multicomputers. 1999, Anais.. Berlin: Springer, 1999. Disponível em: https://doi.org/10.1007/BFb0097993. Acesso em: 16 out. 2024.
APA
Mongelli, H., & Song, S. W. (1999). A range minima parallel algorithm for coarse grained multicomputers. In Proceedings. Berlin: Springer. doi:10.1007/BFb0097993
NLM
Mongelli H, Song SW. A range minima parallel algorithm for coarse grained multicomputers [Internet]. Proceedings. 1999 ;[citado 2024 out. 16 ] Available from: https://doi.org/10.1007/BFb0097993
Vancouver
Mongelli H, Song SW. A range minima parallel algorithm for coarse grained multicomputers [Internet]. Proceedings. 1999 ;[citado 2024 out. 16 ] Available from: https://doi.org/10.1007/BFb0097993
Artigo de periodico
Parallel range minima on coarse grained multicomputers (1999)
Mongelli, Henrique ; Song, Siang Wun
Source: International Journal of Foundations of Computer Science. Unidade: IME
Assunto: ALGORITMOS E ESTRUTURAS DE DADOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
MONGELLI, Henrique e SONG, Siang Wun. Parallel range minima on coarse grained multicomputers. International Journal of Foundations of Computer Science, v. 10, n. 4, p. 375-389, 1999Tradução . . Disponível em: https://doi.org/10.1142/S0129054199000277. Acesso em: 16 out. 2024.
APA
Mongelli, H., & Song, S. W. (1999). Parallel range minima on coarse grained multicomputers. International Journal of Foundations of Computer Science, 10( 4), 375-389. doi:10.1142/S0129054199000277
NLM
Mongelli H, Song SW. Parallel range minima on coarse grained multicomputers [Internet]. International Journal of Foundations of Computer Science. 1999 ; 10( 4): 375-389.[citado 2024 out. 16 ] Available from: https://doi.org/10.1142/S0129054199000277
Vancouver
Mongelli H, Song SW. Parallel range minima on coarse grained multicomputers [Internet]. International Journal of Foundations of Computer Science. 1999 ; 10( 4): 375-389.[citado 2024 out. 16 ] Available from: https://doi.org/10.1142/S0129054199000277

USP Schools

ReP

Filtros