ReP USP - Resultado da busca

Trabalho de evento
A new efficient parallel algorithm for minimum spanning tree (2019)
Vasconcellos, Jucele França de Alencar ; Cáceres, Edson Norberto ; Mongelli, Henrique ; Song, Siang Wun
Source: Proceedings. Conference titles: International Symposium on Computer Architecture and High Performance Computing - SBAC-PAD. Unidade: IME
Subjects: GEOMETRIA E MODELAGEM COMPUTACIONAL, COMPUTAÇÃO GRÁFICA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
VASCONCELLOS, Jucele França de Alencar et al. A new efficient parallel algorithm for minimum spanning tree. 2019, Anais.. Piscataway: IEEE, 2019. Disponível em: https://doi.org/10.1109/CAHPC.2018.8645917. Acesso em: 16 fev. 2026.
APA
Vasconcellos, J. F. de A., Cáceres, E. N., Mongelli, H., & Song, S. W. (2019). A new efficient parallel algorithm for minimum spanning tree. In Proceedings. Piscataway: IEEE. doi:10.1109/CAHPC.2018.8645917
NLM
Vasconcellos JF de A, Cáceres EN, Mongelli H, Song SW. A new efficient parallel algorithm for minimum spanning tree [Internet]. Proceedings. 2019 ;[citado 2026 fev. 16 ] Available from: https://doi.org/10.1109/CAHPC.2018.8645917
Vancouver
Vasconcellos JF de A, Cáceres EN, Mongelli H, Song SW. A new efficient parallel algorithm for minimum spanning tree [Internet]. Proceedings. 2019 ;[citado 2026 fev. 16 ] Available from: https://doi.org/10.1109/CAHPC.2018.8645917
Trabalho de evento
A parallel algorithm for minimum spanning tree on GPU (2017)
Vasconcellos, Jucele Franca de Alencar; Caceres, Edson Norberto; Mongelli, Henrique; Song, Siang Wun
Source: Proceedings. Conference titles: International Symposium on Computer Architecture and High Performance Computing Workshops. Unidade: IME
Subjects: TEORIA DA COMPUTAÇÃO, ALGORITMOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
VASCONCELLOS, Jucele Franca de Alencar et al. A parallel algorithm for minimum spanning tree on GPU. 2017, Anais.. Los Alamitos: IEEE, 2017. Disponível em: https://doi.org/10.1109/SBAC-PADW.2017.20. Acesso em: 16 fev. 2026.
APA
Vasconcellos, J. F. de A., Caceres, E. N., Mongelli, H., & Song, S. W. (2017). A parallel algorithm for minimum spanning tree on GPU. In Proceedings. Los Alamitos: IEEE. doi:10.1109/SBAC-PADW.2017.20
NLM
Vasconcellos JF de A, Caceres EN, Mongelli H, Song SW. A parallel algorithm for minimum spanning tree on GPU [Internet]. Proceedings. 2017 ;[citado 2026 fev. 16 ] Available from: https://doi.org/10.1109/SBAC-PADW.2017.20
Vancouver
Vasconcellos JF de A, Caceres EN, Mongelli H, Song SW. A parallel algorithm for minimum spanning tree on GPU [Internet]. Proceedings. 2017 ;[citado 2026 fev. 16 ] Available from: https://doi.org/10.1109/SBAC-PADW.2017.20
Trabalho de evento
Experimental results of a coarse-grained parallel algorithm for spanning tree and connected components (2010)
Cáceres, Edson Norberto; Mongelli, Henrique; Nishibe, Christiane; Song, Siang Wun
Source: Proceedings. Conference titles: International conference on High Peformance Computing and Simulation - HPCS. Unidade: IME
Subjects: ALGORITMOS, ALGORITMOS PARA PROCESSAMENTO, TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
CÁCERES, Edson Norberto et al. Experimental results of a coarse-grained parallel algorithm for spanning tree and connected components. 2010, Anais.. Piscataway: IEEE, 2010. Disponível em: https://doi.org/10.1109/HPCS.2010.5547062. Acesso em: 16 fev. 2026.
APA
Cáceres, E. N., Mongelli, H., Nishibe, C., & Song, S. W. (2010). Experimental results of a coarse-grained parallel algorithm for spanning tree and connected components. In Proceedings. Piscataway: IEEE. doi:10.1109/HPCS.2010.5547062
NLM
Cáceres EN, Mongelli H, Nishibe C, Song SW. Experimental results of a coarse-grained parallel algorithm for spanning tree and connected components [Internet]. Proceedings. 2010 ;[citado 2026 fev. 16 ] Available from: https://doi.org/10.1109/HPCS.2010.5547062
Vancouver
Cáceres EN, Mongelli H, Nishibe C, Song SW. Experimental results of a coarse-grained parallel algorithm for spanning tree and connected components [Internet]. Proceedings. 2010 ;[citado 2026 fev. 16 ] Available from: https://doi.org/10.1109/HPCS.2010.5547062
Trabalho de evento
Generating parallel algorithms for cluster and grid computing (2005)
Hayashida, Ulisses Kendi; Okuda, Kunio; Song, Siang Wun; Panetta, Jairo
Source: Proceedings. Conference titles: International Conference on Computational Science - ICCS. Unidade: IME
Assunto: PROGRAMAÇÃO PARALELA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
HAYASHIDA, Ulisses Kendi et al. Generating parallel algorithms for cluster and grid computing. 2005, Anais.. Berlin: Springer, 2005. Disponível em: https://doi.org/10.1007/11428831_6. Acesso em: 16 fev. 2026.
APA
Hayashida, U. K., Okuda, K., Song, S. W., & Panetta, J. (2005). Generating parallel algorithms for cluster and grid computing. In Proceedings. Berlin: Springer. doi:10.1007/11428831_6
NLM
Hayashida UK, Okuda K, Song SW, Panetta J. Generating parallel algorithms for cluster and grid computing [Internet]. Proceedings. 2005 ;[citado 2026 fev. 16 ] Available from: https://doi.org/10.1007/11428831_6
Vancouver
Hayashida UK, Okuda K, Song SW, Panetta J. Generating parallel algorithms for cluster and grid computing [Internet]. Proceedings. 2005 ;[citado 2026 fev. 16 ] Available from: https://doi.org/10.1007/11428831_6

USP Schools

ReP

Filtros

Authors

Subjects

Funding Agencies