ReP USP - Resultado da busca

Trabalho de evento
A coarse-grained parallel algorithm for spanning tree and connected components (2004)
Cáceres, Edson Norberto; Dehne, Frank; Mongelli, Henrique ; Song, Siang Wun; Szwarcfiter, Jayme Luiz
Source: Proceedings. Conference titles: European Conference on Parallel Processing - Euro-Par. 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
CÁCERES, Edson Norberto et al. A coarse-grained parallel algorithm for spanning tree and connected components. 2004, Anais.. Berlin: Springer, 2004. Disponível em: https://doi.org/10.1007/978-3-540-27866-5_110. Acesso em: 23 jun. 2024.
APA
Cáceres, E. N., Dehne, F., Mongelli, H., Song, S. W., & Szwarcfiter, J. L. (2004). A coarse-grained parallel algorithm for spanning tree and connected components. In Proceedings. Berlin: Springer. doi:10.1007/978-3-540-27866-5_110
NLM
Cáceres EN, Dehne F, Mongelli H, Song SW, Szwarcfiter JL. A coarse-grained parallel algorithm for spanning tree and connected components [Internet]. Proceedings. 2004 ;[citado 2024 jun. 23 ] Available from: https://doi.org/10.1007/978-3-540-27866-5_110
Vancouver
Cáceres EN, Dehne F, Mongelli H, Song SW, Szwarcfiter JL. A coarse-grained parallel algorithm for spanning tree and connected components [Internet]. Proceedings. 2004 ;[citado 2024 jun. 23 ] Available from: https://doi.org/10.1007/978-3-540-27866-5_110
Trabalho de evento
BSP/CGM algorithms for maximum subsequence and maximum subarray (2004)
Alves, Carlos Eduardo Rodrigues; Cáceres, Edson Norberto; Song, Siang Wun
Source: Proceedings. Conference titles: European Parallel Virtual Machine / Message Passing Interface Users’ Group Meeting - EuroPVM/MPI. 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. BSP/CGM algorithms for maximum subsequence and maximum subarray. 2004, Anais.. Berlin: Springer, 2004. Disponível em: https://doi.org/10.1007/978-3-540-30218-6_24. Acesso em: 23 jun. 2024.
APA
Alves, C. E. R., Cáceres, E. N., & Song, S. W. (2004). BSP/CGM algorithms for maximum subsequence and maximum subarray. In Proceedings. Berlin: Springer. doi:10.1007/978-3-540-30218-6_24
NLM
Alves CER, Cáceres EN, Song SW. BSP/CGM algorithms for maximum subsequence and maximum subarray [Internet]. Proceedings. 2004 ;[citado 2024 jun. 23 ] Available from: https://doi.org/10.1007/978-3-540-30218-6_24
Vancouver
Alves CER, Cáceres EN, Song SW. BSP/CGM algorithms for maximum subsequence and maximum subarray [Internet]. Proceedings. 2004 ;[citado 2024 jun. 23 ] Available from: https://doi.org/10.1007/978-3-540-30218-6_24
Trabalho de evento
Efficient implementation of the BSP/CGM parallel vertex cover FPT algorithm (2004)
Hanashiro, Erik J; Mongelli, Henrique ; Song, Siang Wun
Source: Proceedings. Conference titles: International Workshop on Experimental and Efficient Algorithms - WEA. 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
HANASHIRO, Erik J e MONGELLI, Henrique e SONG, Siang Wun. Efficient implementation of the BSP/CGM parallel vertex cover FPT algorithm. 2004, Anais.. Berlin: Springer, 2004. Disponível em: https://doi.org/10.1007/978-3-540-24838-5_19. Acesso em: 23 jun. 2024.
APA
Hanashiro, E. J., Mongelli, H., & Song, S. W. (2004). Efficient implementation of the BSP/CGM parallel vertex cover FPT algorithm. In Proceedings. Berlin: Springer. doi:10.1007/978-3-540-24838-5_19
NLM
Hanashiro EJ, Mongelli H, Song SW. Efficient implementation of the BSP/CGM parallel vertex cover FPT algorithm [Internet]. Proceedings. 2004 ;[citado 2024 jun. 23 ] Available from: https://doi.org/10.1007/978-3-540-24838-5_19
Vancouver
Hanashiro EJ, Mongelli H, Song SW. Efficient implementation of the BSP/CGM parallel vertex cover FPT algorithm [Internet]. Proceedings. 2004 ;[citado 2024 jun. 23 ] Available from: https://doi.org/10.1007/978-3-540-24838-5_19
Trabalho de evento
A parallel wavefront algorithm for efficient biological sequence comparison (2003)
Alves, Carlos Eduardo Rodrigues; Cáceres, Edson Norberto ; Dehne, Frank; Song, Siang Wun
Source: Proceedings. Conference titles: International Conference on Computational Science and Its Applications - ICCSA. 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 et al. A parallel wavefront algorithm for efficient biological sequence comparison. 2003, Anais.. Berlin: Springer, 2003. Disponível em: https://doi.org/10.1007/3-540-44843-8_27. Acesso em: 23 jun. 2024.
APA
Alves, C. E. R., Cáceres, E. N., Dehne, F., & Song, S. W. (2003). A parallel wavefront algorithm for efficient biological sequence comparison. In Proceedings. Berlin: Springer. doi:10.1007/3-540-44843-8_27
NLM
Alves CER, Cáceres EN, Dehne F, Song SW. A parallel wavefront algorithm for efficient biological sequence comparison [Internet]. Proceedings. 2003 ;[citado 2024 jun. 23 ] Available from: https://doi.org/10.1007/3-540-44843-8_27
Vancouver
Alves CER, Cáceres EN, Dehne F, Song SW. A parallel wavefront algorithm for efficient biological sequence comparison [Internet]. Proceedings. 2003 ;[citado 2024 jun. 23 ] Available from: https://doi.org/10.1007/3-540-44843-8_27
Trabalho de evento
Efficient parallel implementation of transitive closure of digraphs (2003)
Alves, Carlos Eduardo Rodrigues; Cáceres, Edson Norberto ; Castro, Amaury; Song, Siang Wun; Szwarcfiter, Jayme Luiz
Source: Proceedings. Conference titles: European Parallel Virtual Machine / Message Passing Interface Users’ Group Meeting - EuroPVM/MPI. 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 et al. Efficient parallel implementation of transitive closure of digraphs. 2003, Anais.. Berlin: Springer, 2003. Disponível em: https://doi.org/10.1007%2F978-3-540-39924-7_21. Acesso em: 23 jun. 2024.
APA
Alves, C. E. R., Cáceres, E. N., Castro, A., Song, S. W., & Szwarcfiter, J. L. (2003). Efficient parallel implementation of transitive closure of digraphs. In Proceedings. Berlin: Springer. doi:10.1007%2F978-3-540-39924-7_21
NLM
Alves CER, Cáceres EN, Castro A, Song SW, Szwarcfiter JL. Efficient parallel implementation of transitive closure of digraphs [Internet]. Proceedings. 2003 ;[citado 2024 jun. 23 ] Available from: https://doi.org/10.1007%2F978-3-540-39924-7_21
Vancouver
Alves CER, Cáceres EN, Castro A, Song SW, Szwarcfiter JL. Efficient parallel implementation of transitive closure of digraphs [Internet]. Proceedings. 2003 ;[citado 2024 jun. 23 ] Available from: https://doi.org/10.1007%2F978-3-540-39924-7_21
Trabalho de evento
Efficient parallel graph algorithms for coarse grained multicomputers and BSP (1997)
Cáceres, Edson Norberto ; Dehne, Frank; Ferreira, A; Flocchini, P; Rieping, I; Roncato, A; Santoro, N; Song, Siang Wun
Source: Proceedings. Conference titles: International Colloquium on Automata, Languages, and Programming - ICALP. 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
CÁCERES, Edson Norberto et al. Efficient parallel graph algorithms for coarse grained multicomputers and BSP. 1997, Anais.. Berlin: Springer, 1997. Disponível em: https://doi.org/10.1007/3-540-63165-8_195. Acesso em: 23 jun. 2024.
APA
Cáceres, E. N., Dehne, F., Ferreira, A., Flocchini, P., Rieping, I., Roncato, A., et al. (1997). Efficient parallel graph algorithms for coarse grained multicomputers and BSP. In Proceedings. Berlin: Springer. doi:10.1007/3-540-63165-8_195
NLM
Cáceres EN, Dehne F, Ferreira A, Flocchini P, Rieping I, Roncato A, Santoro N, Song SW. Efficient parallel graph algorithms for coarse grained multicomputers and BSP [Internet]. Proceedings. 1997 ;[citado 2024 jun. 23 ] Available from: https://doi.org/10.1007/3-540-63165-8_195
Vancouver
Cáceres EN, Dehne F, Ferreira A, Flocchini P, Rieping I, Roncato A, Santoro N, Song SW. Efficient parallel graph algorithms for coarse grained multicomputers and BSP [Internet]. Proceedings. 1997 ;[citado 2024 jun. 23 ] Available from: https://doi.org/10.1007/3-540-63165-8_195

USP Schools

ReP

Filtros

Authors

Funding Agencies

Non normalized affiliation