ReP USP - Resultado da busca

Artigo de periodico
Solving the maximum subsequence sum and related problems using BSP/CGM model and multi-GPU CUDA (2016)
Lima, Anderson C.; Branco, Rodrigo G.; Ferraz, Samuel; Cáceres, Edson N.; Gaioso, Roussian A.; Martins, Wellington S.; Song, Siang Wun
Source: Journal of the Brazilian Computer Society. 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
LIMA, Anderson C. et al. Solving the maximum subsequence sum and related problems using BSP/CGM model and multi-GPU CUDA. Journal of the Brazilian Computer Society, v. 22, n. 7, p. 1-13, 2016Tradução . . Disponível em: https://doi.org/10.1186/s13173-016-0045-4. Acesso em: 09 ago. 2024.
APA
Lima, A. C., Branco, R. G., Ferraz, S., Cáceres, E. N., Gaioso, R. A., Martins, W. S., & Song, S. W. (2016). Solving the maximum subsequence sum and related problems using BSP/CGM model and multi-GPU CUDA. Journal of the Brazilian Computer Society, 22( 7), 1-13. doi:10.1186/s13173-016-0045-4
NLM
Lima AC, Branco RG, Ferraz S, Cáceres EN, Gaioso RA, Martins WS, Song SW. Solving the maximum subsequence sum and related problems using BSP/CGM model and multi-GPU CUDA [Internet]. Journal of the Brazilian Computer Society. 2016 ; 22( 7): 1-13.[citado 2024 ago. 09 ] Available from: https://doi.org/10.1186/s13173-016-0045-4
Vancouver
Lima AC, Branco RG, Ferraz S, Cáceres EN, Gaioso RA, Martins WS, Song SW. Solving the maximum subsequence sum and related problems using BSP/CGM model and multi-GPU CUDA [Internet]. Journal of the Brazilian Computer Society. 2016 ; 22( 7): 1-13.[citado 2024 ago. 09 ] Available from: https://doi.org/10.1186/s13173-016-0045-4
Trabalho de evento
A multi-GPU hitting set algorithm for GRNs inference (2015)
Carastan Santos, Danilo; Camargo, Raphael Y. de; Martins Júnior, David Correa; Song, Siang Wun; Rozante, Luiz Carlos da Silva; Borelli, Fabrizio F
Source: Proceedings. Conference titles: IEEE/ACM International Symposium on Cluster, Cloud, and Grid Computing - CCGRID. 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
CARASTAN SANTOS, Danilo et al. A multi-GPU hitting set algorithm for GRNs inference. 2015, Anais.. Los Alamitos: IEEE, 2015. Disponível em: https://doi.org/10.1109/CCGrid.2015.29. Acesso em: 09 ago. 2024.
APA
Carastan Santos, D., Camargo, R. Y. de, Martins Júnior, D. C., Song, S. W., Rozante, L. C. da S., & Borelli, F. F. (2015). A multi-GPU hitting set algorithm for GRNs inference. In Proceedings. Los Alamitos: IEEE. doi:10.1109/CCGrid.2015.29
NLM
Carastan Santos D, Camargo RY de, Martins Júnior DC, Song SW, Rozante LC da S, Borelli FF. A multi-GPU hitting set algorithm for GRNs inference [Internet]. Proceedings. 2015 ;[citado 2024 ago. 09 ] Available from: https://doi.org/10.1109/CCGrid.2015.29
Vancouver
Carastan Santos D, Camargo RY de, Martins Júnior DC, Song SW, Rozante LC da S, Borelli FF. A multi-GPU hitting set algorithm for GRNs inference [Internet]. Proceedings. 2015 ;[citado 2024 ago. 09 ] Available from: https://doi.org/10.1109/CCGrid.2015.29
Trabalho de evento-anais periodico
Efficient BSP/CGM algorithms for the maximum subsequence sum and related problems (2015)
Lima, Anderson C; Branco, Rodrigo G; Cáceres, Edson Norberto; Gaioso, Roussian R. A; Ferraz, Samuel; Song, Siang Wun; Martins, Wellington S
Source: Procedia Computer Science. Conference titles: International Conference On Computational Science - ICCS. 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
LIMA, Anderson C et al. Efficient BSP/CGM algorithms for the maximum subsequence sum and related problems. Procedia Computer Science. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. Disponível em: https://doi.org/10.1016/j.procs.2015.05.421. Acesso em: 09 ago. 2024. , 2015
APA
Lima, A. C., Branco, R. G., Cáceres, E. N., Gaioso, R. R. A., Ferraz, S., Song, S. W., & Martins, W. S. (2015). Efficient BSP/CGM algorithms for the maximum subsequence sum and related problems. Procedia Computer Science. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. doi:10.1016/j.procs.2015.05.421
NLM
Lima AC, Branco RG, Cáceres EN, Gaioso RRA, Ferraz S, Song SW, Martins WS. Efficient BSP/CGM algorithms for the maximum subsequence sum and related problems [Internet]. Procedia Computer Science. 2015 ; 51 2754–2758.[citado 2024 ago. 09 ] Available from: https://doi.org/10.1016/j.procs.2015.05.421
Vancouver
Lima AC, Branco RG, Cáceres EN, Gaioso RRA, Ferraz S, Song SW, Martins WS. Efficient BSP/CGM algorithms for the maximum subsequence sum and related problems [Internet]. Procedia Computer Science. 2015 ; 51 2754–2758.[citado 2024 ago. 09 ] Available from: https://doi.org/10.1016/j.procs.2015.05.421
Artigo de periodico
Finding All Maximal Contiguous Subsequences of a Sequence of Numbers in O(1) Communication Rounds (2013)
Alves, Carlos Eduardo Rodrigues; Cáceres, Edson Norberto; Song, Siang Wun
Source: IEEE Transactions on Parallel and Distributed Systems. 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. Finding All Maximal Contiguous Subsequences of a Sequence of Numbers in O(1) Communication Rounds. IEEE Transactions on Parallel and Distributed Systems, v. 24, n. 4, p. 724-733, 2013Tradução . . Disponível em: https://doi.org/10.1109/TPDS.2012.149. Acesso em: 09 ago. 2024.
APA
Alves, C. E. R., Cáceres, E. N., & Song, S. W. (2013). Finding All Maximal Contiguous Subsequences of a Sequence of Numbers in O(1) Communication Rounds. IEEE Transactions on Parallel and Distributed Systems, 24( 4), 724-733. doi:10.1109/TPDS.2012.149
NLM
Alves CER, Cáceres EN, Song SW. Finding All Maximal Contiguous Subsequences of a Sequence of Numbers in O(1) Communication Rounds [Internet]. IEEE Transactions on Parallel and Distributed Systems. 2013 ; 24( 4): 724-733.[citado 2024 ago. 09 ] Available from: https://doi.org/10.1109/TPDS.2012.149
Vancouver
Alves CER, Cáceres EN, Song SW. Finding All Maximal Contiguous Subsequences of a Sequence of Numbers in O(1) Communication Rounds [Internet]. IEEE Transactions on Parallel and Distributed Systems. 2013 ; 24( 4): 724-733.[citado 2024 ago. 09 ] Available from: https://doi.org/10.1109/TPDS.2012.149
Artigo de periodico
Parallel transitive closure algorithm (2013)
Alves, Carlos Eduardo Rodrigues; Cáceres, Edson Norberto ; Castro Junior, Amaury Antônio de; Song, Siang Wun; Szwarcfiter, Jayme Luiz
Source: Journal of the Brazilian Computer Society. 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. Parallel transitive closure algorithm. Journal of the Brazilian Computer Society, v. 19, p. 161-166, 2013Tradução . . Disponível em: https://doi.org/10.1007/s13173-012-0089-z. Acesso em: 09 ago. 2024.
APA
Alves, C. E. R., Cáceres, E. N., Castro Junior, A. A. de, Song, S. W., & Szwarcfiter, J. L. (2013). Parallel transitive closure algorithm. Journal of the Brazilian Computer Society, 19, 161-166. doi:10.1007/s13173-012-0089-z
NLM
Alves CER, Cáceres EN, Castro Junior AA de, Song SW, Szwarcfiter JL. Parallel transitive closure algorithm [Internet]. Journal of the Brazilian Computer Society. 2013 ; 19 161-166.[citado 2024 ago. 09 ] Available from: https://doi.org/10.1007/s13173-012-0089-z
Vancouver
Alves CER, Cáceres EN, Castro Junior AA de, Song SW, Szwarcfiter JL. Parallel transitive closure algorithm [Internet]. Journal of the Brazilian Computer Society. 2013 ; 19 161-166.[citado 2024 ago. 09 ] Available from: https://doi.org/10.1007/s13173-012-0089-z
Relatorio tecnico
A BSP/CGM algorithm for finding all maximal contiguos subsequences of a sequence of numbers (2005)
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. A BSP/CGM algorithm for finding all maximal contiguos subsequences of a sequence of numbers. . São Paulo: IME-USP. Disponível em: https://repositorio.usp.br/directbitstream/ef5e9997-cd98-4742-b72d-f10d5a9a7847/1419659.pdf. Acesso em: 09 ago. 2024. , 2005
APA
Alves, C. E. R., Cáceres, E. N., & Song, S. W. (2005). A BSP/CGM algorithm for finding all maximal contiguos subsequences of a sequence of numbers. São Paulo: IME-USP. Recuperado de https://repositorio.usp.br/directbitstream/ef5e9997-cd98-4742-b72d-f10d5a9a7847/1419659.pdf
NLM
Alves CER, Cáceres EN, Song SW. A BSP/CGM algorithm for finding all maximal contiguos subsequences of a sequence of numbers [Internet]. 2005 ;[citado 2024 ago. 09 ] Available from: https://repositorio.usp.br/directbitstream/ef5e9997-cd98-4742-b72d-f10d5a9a7847/1419659.pdf
Vancouver
Alves CER, Cáceres EN, Song SW. A BSP/CGM algorithm for finding all maximal contiguos subsequences of a sequence of numbers [Internet]. 2005 ;[citado 2024 ago. 09 ] Available from: https://repositorio.usp.br/directbitstream/ef5e9997-cd98-4742-b72d-f10d5a9a7847/1419659.pdf
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: 09 ago. 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 ago. 09 ] 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 ago. 09 ] 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: 09 ago. 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 ago. 09 ] 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 ago. 09 ] 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: 09 ago. 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 ago. 09 ] 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 ago. 09 ] 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: 09 ago. 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 ago. 09 ] 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 ago. 09 ] Available from: https://doi.org/10.1007/3-540-44843-8_27
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: 09 ago. 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 ago. 09 ] 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 ago. 09 ] Available from: https://repositorio.usp.br/directbitstream/4ba5e2d8-e2a9-42ec-9d5a-e69267f5f987/1315979.pdf
Trabalho de evento
A BSP/CGM algorithm for the all-substrings longest common subsequence problem (2003)
Alves, Carlos Eduardo Rodrigues; Cáceres, Edson Norberto; Song, Siang Wun
Source: Proceedings. Conference titles: International Parallel and Distributed 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
ALVES, Carlos Eduardo Rodrigues e CÁCERES, Edson Norberto e SONG, Siang Wun. A BSP/CGM algorithm for the all-substrings longest common subsequence problem. 2003, Anais.. Los Alamitos: IEEE Computer Society, 2003. . Acesso em: 09 ago. 2024.
APA
Alves, C. E. R., Cáceres, E. N., & Song, S. W. (2003). A BSP/CGM algorithm for the all-substrings longest common subsequence problem. In Proceedings. Los Alamitos: IEEE Computer Society.
NLM
Alves CER, Cáceres EN, Song SW. A BSP/CGM algorithm for the all-substrings longest common subsequence problem. Proceedings. 2003 ;[citado 2024 ago. 09 ]
Vancouver
Alves CER, Cáceres EN, Song SW. A BSP/CGM algorithm for the all-substrings longest common subsequence problem. Proceedings. 2003 ;[citado 2024 ago. 09 ]
Trabalho de evento
Comparison of genomes using high-performance parallel computing (2003)
Almeida Junior, Nalvo F; Cáceres, Edson Norberto ; Alves, Carlos Eduardo Rodrigues; Song, Siang Wun
Source: Proceedings. Conference titles: Symposium on Computer Architecture and High Performance Computing. 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
ALMEIDA JUNIOR, Nalvo F et al. Comparison of genomes using high-performance parallel computing. 2003, Anais.. Piscataway: IEEE, 2003. Disponível em: https://doi.org/10.1109/CAHPC.2003.1250332. Acesso em: 09 ago. 2024.
APA
Almeida Junior, N. F., Cáceres, E. N., Alves, C. E. R., & Song, S. W. (2003). Comparison of genomes using high-performance parallel computing. In Proceedings. Piscataway: IEEE. doi:10.1109/CAHPC.2003.1250332
NLM
Almeida Junior NF, Cáceres EN, Alves CER, Song SW. Comparison of genomes using high-performance parallel computing [Internet]. Proceedings. 2003 ;[citado 2024 ago. 09 ] Available from: https://doi.org/10.1109/CAHPC.2003.1250332
Vancouver
Almeida Junior NF, Cáceres EN, Alves CER, Song SW. Comparison of genomes using high-performance parallel computing [Internet]. Proceedings. 2003 ;[citado 2024 ago. 09 ] Available from: https://doi.org/10.1109/CAHPC.2003.1250332
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: 09 ago. 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 ago. 09 ] 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 ago. 09 ] Available from: https://doi.org/10.1007%2F978-3-540-39924-7_21
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: 09 ago. 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 ago. 09 ] 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 ago. 09 ] Available from: https://doi.org/10.1007/BFb0097993
Trabalho de evento
Parallel graph algorithms (1999)
Song, Siang Wun
Conference titles: International School on Advanced Algorithmic Techniques for Parallel Computation with Applications. 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
SONG, Siang Wun. Parallel graph algorithms. 1999, Anais.. Natal: Instituto de Matemática e Estatística, Universidade de São Paulo, 1999. . Acesso em: 09 ago. 2024.
APA
Song, S. W. (1999). Parallel graph algorithms. In . Natal: Instituto de Matemática e Estatística, Universidade de São Paulo.
NLM
Song SW. Parallel graph algorithms. 1999 ;[citado 2024 ago. 09 ]
Vancouver
Song SW. Parallel graph algorithms. 1999 ;[citado 2024 ago. 09 ]
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: 09 ago. 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 ago. 09 ] 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 ago. 09 ] Available from: https://doi.org/10.1142/S0129054199000277
Artigo de periodico
A note on parallel selection on coarse-grained multicomputers (1999)
Saukas, Einar Luciano Gattoni; Song, Siang Wun
Source: Algorithmica. 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
SAUKAS, Einar Luciano Gattoni e SONG, Siang Wun. A note on parallel selection on coarse-grained multicomputers. Algorithmica, v. 24, n. 3/4, p. 371-380, 1999Tradução . . Disponível em: https://doi.org/10.1007/PL00008268. Acesso em: 09 ago. 2024.
APA
Saukas, E. L. G., & Song, S. W. (1999). A note on parallel selection on coarse-grained multicomputers. Algorithmica, 24( 3/4), 371-380. doi:10.1007/PL00008268
NLM
Saukas ELG, Song SW. A note on parallel selection on coarse-grained multicomputers [Internet]. Algorithmica. 1999 ; 24( 3/4): 371-380.[citado 2024 ago. 09 ] Available from: https://doi.org/10.1007/PL00008268
Vancouver
Saukas ELG, Song SW. A note on parallel selection on coarse-grained multicomputers [Internet]. Algorithmica. 1999 ; 24( 3/4): 371-380.[citado 2024 ago. 09 ] Available from: https://doi.org/10.1007/PL00008268
Trabalho de evento
Efficient selection algorithms on distributed memory computers (1998)
Saukas, Einar Luciano Gattoni; Song, Siang Wun
Source: Proceedings. Conference titles: Supercomputing 98 : High Performance Networking and Computing Conference. 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
SAUKAS, Einar Luciano Gattoni e SONG, Siang Wun. Efficient selection algorithms on distributed memory computers. 1998, Anais.. New York: IEEE, 1998. Disponível em: https://doi.org/10.1109/SC.1998.10054. Acesso em: 09 ago. 2024.
APA
Saukas, E. L. G., & Song, S. W. (1998). Efficient selection algorithms on distributed memory computers. In Proceedings. New York: IEEE. doi:10.1109/SC.1998.10054
NLM
Saukas ELG, Song SW. Efficient selection algorithms on distributed memory computers [Internet]. Proceedings. 1998 ;[citado 2024 ago. 09 ] Available from: https://doi.org/10.1109/SC.1998.10054
Vancouver
Saukas ELG, Song SW. Efficient selection algorithms on distributed memory computers [Internet]. Proceedings. 1998 ;[citado 2024 ago. 09 ] Available from: https://doi.org/10.1109/SC.1998.10054
Trabalho de evento
Aplicação de um método de imersão para problemas matriciais no hipercubo (1998)
Takemoto, Carla Yayoi; Song, Siang Wun
Source: Anais. Conference titles: Simposio Brasileiro de Arquitetura de Computadores. 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
TAKEMOTO, Carla Yayoi e SONG, Siang Wun. Aplicação de um método de imersão para problemas matriciais no hipercubo. 1998, Anais.. Rio de Janeiro: SBC, 1998. . Acesso em: 09 ago. 2024.
APA
Takemoto, C. Y., & Song, S. W. (1998). Aplicação de um método de imersão para problemas matriciais no hipercubo. In Anais. Rio de Janeiro: SBC.
NLM
Takemoto CY, Song SW. Aplicação de um método de imersão para problemas matriciais no hipercubo. Anais. 1998 ;[citado 2024 ago. 09 ]
Vancouver
Takemoto CY, Song SW. Aplicação de um método de imersão para problemas matriciais no hipercubo. Anais. 1998 ;[citado 2024 ago. 09 ]

USP Schools

ReP

Filtros

Authors

Date published

Source title

Publisher

Conference titles

Countries/Territories

Funding Agencies

Non normalized affiliation

Countries of institutions of collaboration