Filtros : "IME" "Cáceres, Edson Norberto" Limpar

Filtros



Refine with date range


  • Unidade: IME

    Assunto: ALGORITMOS E ESTRUTURAS DE DADOS

    Versão PublicadaHow to cite
    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: 29 mar. 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 mar. 29 ] 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 mar. 29 ] Available from: https://repositorio.usp.br/directbitstream/4ba5e2d8-e2a9-42ec-9d5a-e69267f5f987/1315979.pdf
  • 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 e MONGELLI, Henrique. Performance results of running parallel applications on the InteGrade. Concurrecy and Computation: Practice and Experience, v. 22, n. 3, p. 375-393, 2010Tradução . . Disponível em: https://doi.org/10.1002/cpe.1524. Acesso em: 29 mar. 2024.
    • 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.[citado 2024 mar. 29 ] Available from: https://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.[citado 2024 mar. 29 ] Available from: https://doi.org/10.1002/cpe.1524
  • Source: Journal of the Brazilian Computer Society. Unidade: IME

    Assunto: ALGORITMOS E ESTRUTURAS DE DADOS

    Versão PublicadaAcesso à fonteDOIHow to cite
    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: 29 mar. 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 mar. 29 ] 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 mar. 29 ] Available from: https://doi.org/10.1007/s13173-012-0089-z
  • Source: Proceedings. Conference titles: ACM Symposium on Parallelism in Algorithms and Architectures - SPAA. Unidade: IME

    Subjects: ALGORITMOS, PROGRAMAÇÃO DINÂMICA

    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 et al. Parallel dynamic programing for solving the string editing problem on a CGM/BSP. 2002, Anais.. New York: ACM, 2002. Disponível em: https://doi.org/10.1145/564870.564916. Acesso em: 29 mar. 2024.
    • APA

      Alves, C. E. R., Cáceres, E. N., Dehne, F., & Song, S. W. (2002). Parallel dynamic programing for solving the string editing problem on a CGM/BSP. In Proceedings. New York: ACM. doi:10.1145/564870.564916
    • NLM

      Alves CER, Cáceres EN, Dehne F, Song SW. Parallel dynamic programing for solving the string editing problem on a CGM/BSP [Internet]. Proceedings. 2002 ;[citado 2024 mar. 29 ] Available from: https://doi.org/10.1145/564870.564916
    • Vancouver

      Alves CER, Cáceres EN, Dehne F, Song SW. Parallel dynamic programing for solving the string editing problem on a CGM/BSP [Internet]. Proceedings. 2002 ;[citado 2024 mar. 29 ] Available from: https://doi.org/10.1145/564870.564916
  • Source: RAIRO: Theoretical Informatics and Applications. Unidade: IME

    Assunto: ALGORITMOS

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

      CÁCERES, Edson Norberto e SONG, Siang Wun e SZWARCFITER, Jayme Luiz. Parallel algorithms for maximal cliques in circle graphs and unrestricted depth search. RAIRO: Theoretical Informatics and Applications, v. 44, n. 3, p. 293-312, 2010Tradução . . Disponível em: https://doi.org/10.1051/ita/2010016. Acesso em: 29 mar. 2024.
    • 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.[citado 2024 mar. 29 ] Available from: https://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.[citado 2024 mar. 29 ] Available from: https://doi.org/10.1051/ita/2010016
  • Unidade: IME

    Assunto: ARQUITETURA E ORGANIZAÇÃO DE COMPUTADORES

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

      CÁCERES, Edson Norberto e SONG, Siang Wun e SZWARCFITER, Jayme Luiz. Parallel algorithms for maximal cliques in circle graphs and unrestricted depth search. . São Paulo: IME-USP. Disponível em: https://repositorio.usp.br/directbitstream/6a120906-1345-4f66-ab5c-3a3fb044192a/1332991.pdf. Acesso em: 29 mar. 2024. , 2003
    • APA

      Cáceres, E. N., Song, S. W., & Szwarcfiter, J. L. (2003). Parallel algorithms for maximal cliques in circle graphs and unrestricted depth search. São Paulo: IME-USP. Recuperado de https://repositorio.usp.br/directbitstream/6a120906-1345-4f66-ab5c-3a3fb044192a/1332991.pdf
    • NLM

      Cáceres EN, Song SW, Szwarcfiter JL. Parallel algorithms for maximal cliques in circle graphs and unrestricted depth search [Internet]. 2003 ;[citado 2024 mar. 29 ] Available from: https://repositorio.usp.br/directbitstream/6a120906-1345-4f66-ab5c-3a3fb044192a/1332991.pdf
    • Vancouver

      Cáceres EN, Song SW, Szwarcfiter JL. Parallel algorithms for maximal cliques in circle graphs and unrestricted depth search [Internet]. 2003 ;[citado 2024 mar. 29 ] Available from: https://repositorio.usp.br/directbitstream/6a120906-1345-4f66-ab5c-3a3fb044192a/1332991.pdf
  • 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 et al. New BSP/CGM algorithms for spanning trees. The International Journal of High Performance Computing Applications, v. 33, n. 3, p. 444-461, 2019Tradução . . Disponível em: https://doi.org/10.1177/1094342018803672. Acesso em: 29 mar. 2024.
    • APA

      Vasconcellos, J. F. de A., Cáceres, E. N., Mongelli, H., Song, S. W., Dehne, F., & Szwarcfiter, J. L. (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, Cáceres EN, Mongelli H, Song SW, Dehne F, Szwarcfiter JL. New BSP/CGM algorithms for spanning trees [Internet]. The International Journal of High Performance Computing Applications. 2019 ; 33( 3): 444-461.[citado 2024 mar. 29 ] Available from: https://doi.org/10.1177/1094342018803672
    • Vancouver

      Vasconcellos JF de A, Cáceres EN, Mongelli H, Song SW, Dehne F, Szwarcfiter JL. New BSP/CGM algorithms for spanning trees [Internet]. The International Journal of High Performance Computing Applications. 2019 ; 33( 3): 444-461.[citado 2024 mar. 29 ] Available from: https://doi.org/10.1177/1094342018803672
  • 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 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: 29 mar. 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 mar. 29 ] 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 mar. 29 ] Available from: https://doi.org/10.1109/TPDS.2012.149
  • 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 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: 29 mar. 2024.
    • 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 2024 mar. 29 ] 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 2024 mar. 29 ] Available from: https://doi.org/10.1109/HPCS.2010.5547062
  • Source: Proceedings. Conference titles: International Conference on Algorithms and Architectures for Parallel Processing - ICA3PP. Unidade: IME

    Assunto: PROGRAMAÇÃO PARALELA

    PrivadoAcesso à fonteDOIHow to cite
    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. Efficient representations of row-sorted 1-variant matrices for parallel string applications. 2007, Anais.. Berlin: Springer, 2007. Disponível em: https://doi.org/10.1007/978-3-540-72905-1_6. Acesso em: 29 mar. 2024.
    • APA

      Alves, C. E. R., Cáceres, E. N., & Song, S. W. (2007). Efficient representations of row-sorted 1-variant matrices for parallel string applications. In Proceedings. Berlin: Springer. doi:10.1007/978-3-540-72905-1_6
    • NLM

      Alves CER, Cáceres EN, Song SW. Efficient representations of row-sorted 1-variant matrices for parallel string applications [Internet]. Proceedings. 2007 ;[citado 2024 mar. 29 ] Available from: https://doi.org/10.1007/978-3-540-72905-1_6
    • Vancouver

      Alves CER, Cáceres EN, Song SW. Efficient representations of row-sorted 1-variant matrices for parallel string applications [Internet]. Proceedings. 2007 ;[citado 2024 mar. 29 ] Available from: https://doi.org/10.1007/978-3-540-72905-1_6
  • Source: Proceedings. Conference titles: European Parallel Virtual Machine / Message Passing Interface Users’ Group Meeting - EuroPVM/MPI. 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 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: 29 mar. 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 mar. 29 ] 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 mar. 29 ] Available from: https://doi.org/10.1007%2F978-3-540-39924-7_21
  • Source: Algorithmica. 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

      DEHNE, Frank et al. Efficient parallel graph algoritms for coarse-grained multicomputers and BSP. Algorithmica, v. 33, n. 2, p. 183-200, 2002Tradução . . Disponível em: https://doi.org/10.1007/s00453-001-0109-4. Acesso em: 29 mar. 2024.
    • APA

      Dehne, F., Ferreira, A. G., Cáceres, E. N., Song, S. W., & Roncato, A. (2002). Efficient parallel graph algoritms for coarse-grained multicomputers and BSP. Algorithmica, 33( 2), 183-200. doi:10.1007/s00453-001-0109-4
    • NLM

      Dehne F, Ferreira AG, Cáceres EN, Song SW, Roncato A. Efficient parallel graph algoritms for coarse-grained multicomputers and BSP [Internet]. Algorithmica. 2002 ; 33( 2): 183-200.[citado 2024 mar. 29 ] Available from: https://doi.org/10.1007/s00453-001-0109-4
    • Vancouver

      Dehne F, Ferreira AG, Cáceres EN, Song SW, Roncato A. Efficient parallel graph algoritms for coarse-grained multicomputers and BSP [Internet]. Algorithmica. 2002 ; 33( 2): 183-200.[citado 2024 mar. 29 ] Available from: https://doi.org/10.1007/s00453-001-0109-4
  • Source: Proceedings. Conference titles: International Colloquium on Automata, Languages, and Programming - ICALP. Unidade: IME

    Assunto: ALGORITMOS E ESTRUTURAS DE DADOS

    PrivadoAcesso à fonteDOIHow to cite
    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: 29 mar. 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 mar. 29 ] 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 mar. 29 ] Available from: https://doi.org/10.1007/3-540-63165-8_195
  • Source: Procedia Computer Science. Conference titles: International Conference On Computational Science - ICCS. Unidade: IME

    Assunto: ALGORITMOS E ESTRUTURAS DE DADOS

    Versão PublicadaAcesso à fonteDOIHow to cite
    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: 29 mar. 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 mar. 29 ] 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 mar. 29 ] Available from: https://doi.org/10.1016/j.procs.2015.05.421
  • Source: Proceedings. Conference titles: Symposium on Computer Architecture and High Performance Computing. 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

      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: 29 mar. 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 mar. 29 ] 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 mar. 29 ] Available from: https://doi.org/10.1109/CAHPC.2003.1250332
  • 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 et al. Communication issues in scalable parallel computing. The handbook of research on scalable computing technologies. Tradução . Hershey, PA: Information Science Reference, 2010. . Disponível em: https://doi.org/10.4018/978-1-60566-661-7.ch017. Acesso em: 29 mar. 2024.
    • 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. [citado 2024 mar. 29 ] 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. [citado 2024 mar. 29 ] Available from: https://doi.org/10.4018/978-1-60566-661-7.ch017
  • Source: Proceedings. Conference titles: European Parallel Virtual Machine / Message Passing Interface Users’ Group Meeting - EuroPVM/MPI. 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 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: 29 mar. 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 mar. 29 ] 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 mar. 29 ] Available from: https://doi.org/10.1007/978-3-540-30218-6_24
  • Source: Discrete Applied Mathematics. Conference titles: Brazilian Symposium on Graphs, Algorithms and Combinatorics - GRACO. Unidade: IME

    Assunto: ANÁLISE DE ALGORITMOS

    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. e CÁCERES, Edson Norberto e SONG, Siang Wun. An all-substrings common subsequence algorithm. Discrete Applied Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. Disponível em: https://doi.org/10.1016/j.dam.2007.05.056. Acesso em: 29 mar. 2024. , 2008
    • APA

      Alves, C. E. R., Cáceres, E. N., & Song, S. W. (2008). An all-substrings common subsequence algorithm. Discrete Applied Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. doi:10.1016/j.dam.2007.05.056
    • NLM

      Alves CER, Cáceres EN, Song SW. An all-substrings common subsequence algorithm [Internet]. Discrete Applied Mathematics. 2008 ; 156( 7): 1025-1035.[citado 2024 mar. 29 ] Available from: https://doi.org/10.1016/j.dam.2007.05.056
    • Vancouver

      Alves CER, Cáceres EN, Song SW. An all-substrings common subsequence algorithm [Internet]. Discrete Applied Mathematics. 2008 ; 156( 7): 1025-1035.[citado 2024 mar. 29 ] Available from: https://doi.org/10.1016/j.dam.2007.05.056
  • Source: Electronic Notes in Discrete Mathematics. Conference titles: Brazilian Symposium on Graphs, Algorithms and Combinatorics - GRACO. Unidade: IME

    Assunto: ANÁLISE DE ALGORITMOS

    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 e CÁCERES, Edson Norberto e SONG, Siang Wun. An all-substrings common subsequence algorithm. Electronic Notes in Discrete Mathematics. Amsterdam: Elsevier. Disponível em: https://doi.org/10.1016/j.endm.2005.05.019. Acesso em: 29 mar. 2024. , 2005
    • APA

      Alves, C. E. R., Cáceres, E. N., & Song, S. W. (2005). An all-substrings common subsequence algorithm. Electronic Notes in Discrete Mathematics. Amsterdam: Elsevier. doi:10.1016/j.endm.2005.05.019
    • NLM

      Alves CER, Cáceres EN, Song SW. An all-substrings common subsequence algorithm [Internet]. Electronic Notes in Discrete Mathematics. 2005 ; 19 133-139.[citado 2024 mar. 29 ] Available from: https://doi.org/10.1016/j.endm.2005.05.019
    • Vancouver

      Alves CER, Cáceres EN, Song SW. An all-substrings common subsequence algorithm [Internet]. Electronic Notes in Discrete Mathematics. 2005 ; 19 133-139.[citado 2024 mar. 29 ] Available from: https://doi.org/10.1016/j.endm.2005.05.019
  • Conference titles: Jornada de Atualização em Informática. Unidade: IME

    Assunto: ARQUITETURA E ORGANIZAÇÃO DE COMPUTADORES

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

      CÁCERES, Edson Norberto e MONGELLI, Henrique e SONG, Siang Wun. Algoritmos paralelos usando CGM/PVM/MPI: uma introdução. 2001, Anais.. Fortaleza: SBC, 2001. . Acesso em: 29 mar. 2024.
    • APA

      Cáceres, E. N., Mongelli, H., & Song, S. W. (2001). Algoritmos paralelos usando CGM/PVM/MPI: uma introdução. In . Fortaleza: SBC.
    • NLM

      Cáceres EN, Mongelli H, Song SW. Algoritmos paralelos usando CGM/PVM/MPI: uma introdução. 2001 ;[citado 2024 mar. 29 ]
    • Vancouver

      Cáceres EN, Mongelli H, Song SW. Algoritmos paralelos usando CGM/PVM/MPI: uma introdução. 2001 ;[citado 2024 mar. 29 ]

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