Filtros : "SONG, SIANG WUN" Limpar

Filtros



Refine with date range


  • Unidade: IME

    Assunto: COMBINATÓRIA

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

      SZWARCFITER, Jayme Luiz; SONG, Siang Wun. Electronic Notes in Discrete Mathematics. [S.l: s.n.], 2021.Disponível em: .
    • APA

      Szwarcfiter, J. L., & Song, S. W. (2021). Electronic Notes in Discrete Mathematics. Amsterdam. Recuperado de https://www.sciencedirect.com/journal/electronic-notes-in-discrete-mathematics/vol/7/suppl/C
    • NLM

      Szwarcfiter JL, Song SW. Electronic Notes in Discrete Mathematics [Internet]. 2021 ; 7 1-205.Available from: https://www.sciencedirect.com/journal/electronic-notes-in-discrete-mathematics/vol/7/suppl/C
    • Vancouver

      Szwarcfiter JL, Song SW. Electronic Notes in Discrete Mathematics [Internet]. 2021 ; 7 1-205.Available from: https://www.sciencedirect.com/journal/electronic-notes-in-discrete-mathematics/vol/7/suppl/C
  • Source: The International Journal of High Performance Computing Applications. Unidade: IME

    Assunto: REDES DE COMPUTADORES

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

      VASCONCELLOS, Jucele França de Alencar; MONGELLI, Henrique; SONG, Siang Wun; et al. New BSP/CGM algorithms for spanning trees. The International Journal of High Performance Computing Applications, Thousand Oaks, v. 33, n. 3, p. 444-461, 2019. Disponível em: < http://dx.doi.org/10.1177/1094342018803672 > DOI: 10.1177/1094342018803672.
    • APA

      Vasconcellos, J. F. de A., Mongelli, H., Song, S. W., Dehne, F., Szwarcfiter, J. L., & Cáceres, E. N. (2019). New BSP/CGM algorithms for spanning trees. The International Journal of High Performance Computing Applications, 33( 3), 444-461. doi:10.1177/1094342018803672
    • NLM

      Vasconcellos JF de A, Mongelli H, Song SW, Dehne F, Szwarcfiter JL, Cáceres EN. New BSP/CGM algorithms for spanning trees [Internet]. The International Journal of High Performance Computing Applications. 2019 ; 33( 3): 444-461.Available from: http://dx.doi.org/10.1177/1094342018803672
    • Vancouver

      Vasconcellos JF de A, Mongelli H, Song SW, Dehne F, Szwarcfiter JL, Cáceres EN. New BSP/CGM algorithms for spanning trees [Internet]. The International Journal of High Performance Computing Applications. 2019 ; 33( 3): 444-461.Available from: http://dx.doi.org/10.1177/1094342018803672
  • Source: Concurrency and Computation: Practice and Experience. Unidade: IME

    Assunto: ALGORITMOS PARA PROCESSAMENTO

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

      SANTOS, Danilo Carastan; MARTINS-JR, David; SONG, Siang Wun; ROZANTE, Luiz Carlos da Silva; CAMARGO, Raphael Y. de. A hybrid CPU‐GPU‐MIC algorithm for minimal hitting set enumeration. Concurrency and Computation: Practice and Experience, Chichester, v. 31, n. 18, p. 1-12, 2019. Disponível em: < https://doi.org/10.1002/cpe.5087 > DOI: 10.1002/cpe.5087.
    • APA

      Santos, D. C., Martins-Jr, D., Song, S. W., Rozante, L. C. da S., & Camargo, R. Y. de. (2019). A hybrid CPU‐GPU‐MIC algorithm for minimal hitting set enumeration. Concurrency and Computation: Practice and Experience, 31( 18), 1-12. doi:10.1002/cpe.5087
    • NLM

      Santos DC, Martins-Jr D, Song SW, Rozante LC da S, Camargo RY de. A hybrid CPU‐GPU‐MIC algorithm for minimal hitting set enumeration [Internet]. Concurrency and Computation: Practice and Experience. 2019 ; 31( 18): 1-12.Available from: https://doi.org/10.1002/cpe.5087
    • Vancouver

      Santos DC, Martins-Jr D, Song SW, Rozante LC da S, Camargo RY de. A hybrid CPU‐GPU‐MIC algorithm for minimal hitting set enumeration [Internet]. Concurrency and Computation: Practice and Experience. 2019 ; 31( 18): 1-12.Available from: https://doi.org/10.1002/cpe.5087
  • 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

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

      VASCONCELLOS, Jucele França de Alencar; CÁCERES, Edson Norberto; MONGELLI, Henrique; SONG, Siang Wun. A new efficient parallel algorithm for minimum spanning tree. Anais.. Piscataway: IEEE, 2019.Disponível em: DOI: 10.1109/CAHPC.2018.8645917.
    • 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 ;Available from: http://dx.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 ;Available from: http://dx.doi.org/10.1109/CAHPC.2018.8645917
  • Source: Proceedings. Conference titles: International Symposium on Computer Architecture and High Performance Computing Workshops. Unidade: IME

    Subjects: TEORIA DA COMPUTAÇÃO, ALGORITMOS

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

      VASCONCELLOS, Jucele Franca de Alencar; CACERES, Edson Norberto; MONGELLI, Henrique; SONG, Siang Wun. A parallel algorithm for minimum spanning tree on GPU. Anais.. Los Alamitos: IEEE, 2017.Disponível em: DOI: 10.1109/SBAC-PADW.2017.20.
    • 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 ;Available from: https://dx.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 ;Available from: https://dx.doi.org/10.1109/SBAC-PADW.2017.20
  • Source: Anais do Simpósio de Sistemas Computacionais de Alto Desempenho (WSCAD-WIC). Conference titles: Simpósio de Sistemas Computacionais de Alto Desempenho (WSCAD). Unidade: IME

    Assunto: METODOLOGIA E TÉCNICAS DE COMPUTAÇÃO

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

      CARASTAN-SANTOS, Danilo; MARTINS-JR, David C; ROZANTE, Luiz Carlos da Silva; SONG, Siang Wun; CAMARGO, Raphael Y. de. A hybrid CPU-GPU-MIC algorithm for the hitting set problem. Anais.. Campinas: Sociedade Brasileira de Computação (SBC), 2017.Disponível em: .
    • APA

      Carastan-Santos, D., Martins-Jr, D. C., Rozante, L. C. da S., Song, S. W., & Camargo, R. Y. de. (2017). A hybrid CPU-GPU-MIC algorithm for the hitting set problem. In Anais do Simpósio de Sistemas Computacionais de Alto Desempenho (WSCAD-WIC). Campinas: Sociedade Brasileira de Computação (SBC). Recuperado de https://portaldeconteudo.sbc.org.br/index.php/wscad/article/view/250
    • NLM

      Carastan-Santos D, Martins-Jr DC, Rozante LC da S, Song SW, Camargo RY de. A hybrid CPU-GPU-MIC algorithm for the hitting set problem [Internet]. Anais do Simpósio de Sistemas Computacionais de Alto Desempenho (WSCAD-WIC). 2017 ;Available from: https://portaldeconteudo.sbc.org.br/index.php/wscad/article/view/250
    • Vancouver

      Carastan-Santos D, Martins-Jr DC, Rozante LC da S, Song SW, Camargo RY de. A hybrid CPU-GPU-MIC algorithm for the hitting set problem [Internet]. Anais do Simpósio de Sistemas Computacionais de Alto Desempenho (WSCAD-WIC). 2017 ;Available from: https://portaldeconteudo.sbc.org.br/index.php/wscad/article/view/250
  • Source: Anais do Simpósio de Sistemas Computacionais de Alto Desempenho (WSCAD-WIC). Conference titles: Simpósio de Sistemas Computacionais de Alto Desempenho (WSCAD). Unidade: IME

    Subjects: METODOLOGIA E TÉCNICAS DE COMPUTAÇÃO, ALGORITMOS, TEORIA DOS GRAFOS

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

      VASCONCELLOS, Jucele Franca de Alencar; CACERES, Edson Norberto; MONGELLI, Henrique; SONG, Siang Wun. Algoritmo paralelo para árvore geradora usando GPU. Anais.. Campinas: Sociedade Brasileira de Computação (SBC), 2017.Disponível em: .
    • APA

      Vasconcellos, J. F. de A., Caceres, E. N., Mongelli, H., & Song, S. W. (2017). Algoritmo paralelo para árvore geradora usando GPU. In Anais do Simpósio de Sistemas Computacionais de Alto Desempenho (WSCAD-WIC). Campinas: Sociedade Brasileira de Computação (SBC). Recuperado de http://www.lbd.dcc.ufmg.br/colecoes/wscad/2017/025.pdf
    • NLM

      Vasconcellos JF de A, Caceres EN, Mongelli H, Song SW. Algoritmo paralelo para árvore geradora usando GPU [Internet]. Anais do Simpósio de Sistemas Computacionais de Alto Desempenho (WSCAD-WIC). 2017 ;Available from: http://www.lbd.dcc.ufmg.br/colecoes/wscad/2017/025.pdf
    • Vancouver

      Vasconcellos JF de A, Caceres EN, Mongelli H, Song SW. Algoritmo paralelo para árvore geradora usando GPU [Internet]. Anais do Simpósio de Sistemas Computacionais de Alto Desempenho (WSCAD-WIC). 2017 ;Available from: http://www.lbd.dcc.ufmg.br/colecoes/wscad/2017/025.pdf
  • Source: Future Generation Computer Systems. Unidade: IME

    Assunto: COMPUTAÇÃO GRÁFICA

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

      CARASTAN SANTOS, Danilo; CAMARGO, Raphael Y; MARTINS JUNIOR, David C; SONG, Siang Wun; ROZANTE, Luiz Carlos da Silva. Finding exact hitting set solutions for systems biology applications using heterogeneous GPU clusters. Future Generation Computer Systems, Amsterdam, v. 67, p. 418-429, 2017. Disponível em: < http://dx.doi.org/10.1016/j.future.2016.02.009 > DOI: 10.1016/j.future.2016.02.009.
    • APA

      Carastan Santos, D., Camargo, R. Y., Martins Junior, D. C., Song, S. W., & Rozante, L. C. da S. (2017). Finding exact hitting set solutions for systems biology applications using heterogeneous GPU clusters. Future Generation Computer Systems, 67, 418-429. doi:10.1016/j.future.2016.02.009
    • NLM

      Carastan Santos D, Camargo RY, Martins Junior DC, Song SW, Rozante LC da S. Finding exact hitting set solutions for systems biology applications using heterogeneous GPU clusters [Internet]. Future Generation Computer Systems. 2017 ; 67 418-429.Available from: http://dx.doi.org/10.1016/j.future.2016.02.009
    • Vancouver

      Carastan Santos D, Camargo RY, Martins Junior DC, Song SW, Rozante LC da S. Finding exact hitting set solutions for systems biology applications using heterogeneous GPU clusters [Internet]. Future Generation Computer Systems. 2017 ; 67 418-429.Available from: http://dx.doi.org/10.1016/j.future.2016.02.009
  • Source: Journal of the Brazilian Computer Society. Unidade: IME

    Assunto: ALGORITMOS E ESTRUTURAS DE DADOS

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

      LIMA, Anderson C.; BRANCO, Rodrigo G.; FERRAZ, Samuel; et al. Solving the maximum subsequence sum and related problems using BSP/CGM model and multi-GPU CUDA. Journal of the Brazilian Computer Society, Heidelberg, v. 22, n. 7, p. 1-13, 2016. Disponível em: < http://dx.doi.org/10.1186/s13173-016-0045-4 > DOI: 10.1186/s13173-016-0045-4.
    • 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.Available from: http://dx.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.Available from: http://dx.doi.org/10.1186/s13173-016-0045-4
  • Source: Proceedings. Conference titles: IEEE/ACM International Symposium on Cluster, Cloud, and Grid Computing - CCGRID. Unidade: IME

    Assunto: ALGORITMOS E ESTRUTURAS DE DADOS

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

      CARASTAN SANTOS, Danilo; CAMARGO, Raphael Y. de; MARTINS JÚNIOR, David Correa; et al. A multi-GPU hitting set algorithm for GRNs inference. Anais.. Los Alamitos: IEEE, 2015.Disponível em: DOI: 10.1109/CCGrid.2015.29.
    • 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 ;Available from: http://dx.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 ;Available from: http://dx.doi.org/10.1109/CCGrid.2015.29
  • Source: Procedia Computer Science. Conference titles: International Conference On Computational Science - ICCS. Unidade: IME

    Assunto: ALGORITMOS E ESTRUTURAS DE DADOS

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

      LIMA, Anderson C; BRANCO, Rodrigo G; CÁCERES, Edson Norberto; et al. Efficient BSP/CGM algorithms for the maximum subsequence sum and related problems. Procedia Computer Science[S.l: s.n.], 2015.Disponível em: DOI: 10.1016/j.procs.2015.05.421.
    • 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. 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.Available from: http://dx.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.Available from: http://dx.doi.org/10.1016/j.procs.2015.05.421
  • Source: Proceedings. Conference titles: International Symposium on Computer Architecture and High Performance Computing Workshops - SBAC-PADW. Unidade: IME

    Subjects: ARQUITETURA E ORGANIZAÇÃO DE COMPUTADORES, ALGORITMOS, COMPUTAÇÃO GRÁFICA

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

      FERREIRA, Cleber S; CAMARGO, Raphael Yokoingawa de; SONG, Siang Wun. A parallel maximum subarray algorithm on GPUs. Anais.. Los Alamitos: IEEE, 2014.Disponível em: DOI: 10.1109/SBAC-PADW.2014.15.
    • APA

      Ferreira, C. S., Camargo, R. Y. de, & Song, S. W. (2014). A parallel maximum subarray algorithm on GPUs. In Proceedings. Los Alamitos: IEEE. doi:10.1109/SBAC-PADW.2014.15
    • NLM

      Ferreira CS, Camargo RY de, Song SW. A parallel maximum subarray algorithm on GPUs [Internet]. Proceedings. 2014 ;Available from: http://dx.doi.org/10.1109/SBAC-PADW.2014.15
    • Vancouver

      Ferreira CS, Camargo RY de, Song SW. A parallel maximum subarray algorithm on GPUs [Internet]. Proceedings. 2014 ;Available from: http://dx.doi.org/10.1109/SBAC-PADW.2014.15
  • Source: Procedia Computer Science. Conference titles: International Conference on Computational Science - ICCS 2014. Unidade: IME

    Subjects: OTIMIZAÇÃO COMBINATÓRIA, PROGRAMAÇÃO PARALELA, COMPUTAÇÃO BIOINSPIRADA

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

      FINGLER, Henrique; CÁCERES, Edson Norberto; MONGELLI, Henrique; SONG, Siang Wun. A CUDA based solution to the multidimensional knapsack problem using the ant colony optimization. Procedia Computer Science[S.l: s.n.], 2014.Disponível em: DOI: 10.1016/j.procs.2014.05.008.
    • APA

      Fingler, H., Cáceres, E. N., Mongelli, H., & Song, S. W. (2014). A CUDA based solution to the multidimensional knapsack problem using the ant colony optimization. Procedia Computer Science. Amsterdam. doi:10.1016/j.procs.2014.05.008
    • NLM

      Fingler H, Cáceres EN, Mongelli H, Song SW. A CUDA based solution to the multidimensional knapsack problem using the ant colony optimization [Internet]. Procedia Computer Science. 2014 ; 29 84-94.Available from: http://dx.doi.org/10.1016/j.procs.2014.05.008
    • Vancouver

      Fingler H, Cáceres EN, Mongelli H, Song SW. A CUDA based solution to the multidimensional knapsack problem using the ant colony optimization [Internet]. Procedia Computer Science. 2014 ; 29 84-94.Available from: http://dx.doi.org/10.1016/j.procs.2014.05.008
  • Source: Journal of the Brazilian Computer Society. Unidade: IME

    Assunto: TEORIA DOS GRAFOS

    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; CÁCERES, Edson Norberto; CASTRO JUNIOR, Amaury Antônio de; SONG, Siang Wun; SZWARCFITER, Jayme Luiz. Parallel transitive closure algorithm. Journal of the Brazilian Computer Society, Guildford, v. 19, p. 161-166, 2013. Disponível em: < https://doi.org/10.1007/s13173-012-0089-z > DOI: 10.1007/s13173-012-0089-z.
    • 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.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.Available from: https://doi.org/10.1007/s13173-012-0089-z
  • Source: IEEE Transactions on Parallel and Distributed Systems. Unidade: IME

    Assunto: ALGORITMOS E ESTRUTURAS DE DADOS

    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; CÁCERES, Edson Norberto; 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, Los Alamitos, v. 24, n. 4, p. 724-733, 2013. Disponível em: < http://dx.doi.org/10.1109/TPDS.2012.149 > DOI: 10.1109/TPDS.2012.149.
    • 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.Available from: http://dx.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.Available from: http://dx.doi.org/10.1109/TPDS.2012.149
  • Source: Journal of the Brazilian Computer Society. Unidade: IME

    Assunto: ALGORITMOS E ESTRUTURAS DE DADOS

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

      ALVES, C. E. R; CÁCERES, Edson Norberto; CASTRO JUNIOR, A. A. de; SONG, Siang Wun; SZWARCFITER, Jayme Luiz. Parallel transitive closure algorithm. Journal of the Brazilian Computer Society, Heidelberg, v. 19, p. 161-166, 2013. Disponível em: < http://dx.doi.org/10.1007/s13173-012-0089-z > DOI: 10.1007/s13173-012-0089-z.
    • 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.Available from: http://dx.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.Available from: http://dx.doi.org/10.1007/s13173-012-0089-z
  • Source: Proceedings. Conference titles: International conference on High Peformance Computing and Simulation - HPCS. Unidade: IME

    Subjects: ALGORITMOS, ALGORITMOS PARA PROCESSAMENTO, TEORIA DOS GRAFOS

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

      CÁCERES, Edson Norberto; MONGELLI, Henrique; NISHIBE, Christiane; SONG, Siang Wun. Experimental results of a coarse-grained parallel algorithm for spanning tree and connected components. Anais.. Piscataway: IEEE, 2010.Disponível em: DOI: 10.1109/HPCS.2010.5547062.
    • 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 ;Available from: http://dx.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 ;Available from: http://dx.doi.org/10.1109/HPCS.2010.5547062
  • Source: The handbook of research on scalable computing technologies. Unidade: IME

    Assunto: PROGRAMAÇÃO PARALELA

    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; CÁCERES, Edson Norberto; DEHNE, Frank; SONG, Siang Wun. Communication issues in scalable parallel computing. In: The handbook of research on scalable computing technologies[S.l: s.n.], 2010.Disponível em: DOI: 10.4018/978-1-60566-661-7.ch017.
    • APA

      Alves, C. E. R., Cáceres, E. N., Dehne, F., & Song, S. W. (2010). Communication issues in scalable parallel computing. In The handbook of research on scalable computing technologies. Hershey, PA: Information Science Reference. doi:10.4018/978-1-60566-661-7.ch017
    • NLM

      Alves CER, Cáceres EN, Dehne F, Song SW. Communication issues in scalable parallel computing [Internet]. In: The handbook of research on scalable computing technologies. Hershey, PA: Information Science Reference; 2010. Available from: https://doi.org/10.4018/978-1-60566-661-7.ch017
    • Vancouver

      Alves CER, Cáceres EN, Dehne F, Song SW. Communication issues in scalable parallel computing [Internet]. In: The handbook of research on scalable computing technologies. Hershey, PA: Information Science Reference; 2010. Available from: https://doi.org/10.4018/978-1-60566-661-7.ch017
  • Source: RAIRO: Theoretical Informatics and Applications. 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

      CÁCERES, Edson Norberto; SONG, Siang Wun; SZWARCFITER, Jayme Luiz. Parallel algorithms for maximal cliques in circle graphs and unrestricted depth search. RAIRO: Theoretical Informatics and Applications, Paris, v. 44, n. 3, p. 293-312, 2010. Disponível em: < http://dx.doi.org/10.1051/ita/2010016 > DOI: 10.1051/ita/2010016.
    • APA

      Cáceres, E. N., Song, S. W., & Szwarcfiter, J. L. (2010). Parallel algorithms for maximal cliques in circle graphs and unrestricted depth search. RAIRO: Theoretical Informatics and Applications, 44( 3), 293-312. doi:10.1051/ita/2010016
    • NLM

      Cáceres EN, Song SW, Szwarcfiter JL. Parallel algorithms for maximal cliques in circle graphs and unrestricted depth search [Internet]. RAIRO: Theoretical Informatics and Applications. 2010 ; 44( 3): 293-312.Available from: http://dx.doi.org/10.1051/ita/2010016
    • Vancouver

      Cáceres EN, Song SW, Szwarcfiter JL. Parallel algorithms for maximal cliques in circle graphs and unrestricted depth search [Internet]. RAIRO: Theoretical Informatics and Applications. 2010 ; 44( 3): 293-312.Available from: http://dx.doi.org/10.1051/ita/2010016
  • Source: Concurrecy and Computation: Practice and Experience. Unidade: IME

    Subjects: PROGRAMAÇÃO PARALELA, MIDDLEWARE

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

      CÁCERES, Edson Norberto; MONGELLI, Henrique. Performance results of running parallel applications on the InteGrade. Concurrecy and Computation: Practice and Experience, New Jersey, v. 22, n. 3, p. 375-393, 2010. Disponível em: < http://dx.doi.org/10.1002/cpe.1524 > DOI: 10.1002/cpe.1524.
    • APA

      Cáceres, E. N., & Mongelli, H. (2010). Performance results of running parallel applications on the InteGrade. Concurrecy and Computation: Practice and Experience, 22( 3), 375-393. doi:10.1002/cpe.1524
    • NLM

      Cáceres EN, Mongelli H. Performance results of running parallel applications on the InteGrade [Internet]. Concurrecy and Computation: Practice and Experience. 2010 ; 22( 3): 375-393.Available from: http://dx.doi.org/10.1002/cpe.1524
    • Vancouver

      Cáceres EN, Mongelli H. Performance results of running parallel applications on the InteGrade [Internet]. Concurrecy and Computation: Practice and Experience. 2010 ; 22( 3): 375-393.Available from: http://dx.doi.org/10.1002/cpe.1524

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