ReP USP - Resultado da busca

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: 22 jan. 2026. , 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 2026 jan. 22 ] 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 2026 jan. 22 ] Available from: https://doi.org/10.1016/j.procs.2015.05.421
Trabalho de evento
Efficient representations of row-sorted 1-variant matrices for parallel string applications (2007)
Alves, Carlos Eduardo Rodrigues; Cáceres, Edson Norberto ; Song, Siang Wun
Source: Proceedings. Conference titles: International Conference on Algorithms and Architectures for Parallel Processing - ICA3PP. Unidade: IME
Assunto: PROGRAMAÇÃO PARALELA
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: 22 jan. 2026.
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 2026 jan. 22 ] 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 2026 jan. 22 ] Available from: https://doi.org/10.1007/978-3-540-72905-1_6
Trabalho de evento
A parallel algorithm for enumerating combinations (2003)
Torres, Martha; Goldman, Alfredo ; Barrera, Júnior
Source: Proceedings. Conference titles: International Conference on Parallel Processing. Unidade: IME
Subjects: CIÊNCIA DA COMPUTAÇÃO, PROGRAMAÇÃO DINÂMICA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
TORRES, Martha e GOLDMAN, Alfredo e BARRERA, Júnior. A parallel algorithm for enumerating combinations. 2003, Anais.. Los Alamitos: IEEE, 2003. Disponível em: https://doi.org/10.1109/ICPP.2003.1240626. Acesso em: 22 jan. 2026.
APA
Torres, M., Goldman, A., & Barrera, J. (2003). A parallel algorithm for enumerating combinations. In Proceedings. Los Alamitos: IEEE. doi:10.1109/ICPP.2003.1240626
NLM
Torres M, Goldman A, Barrera J. A parallel algorithm for enumerating combinations [Internet]. Proceedings. 2003 ;[citado 2026 jan. 22 ] Available from: https://doi.org/10.1109/ICPP.2003.1240626
Vancouver
Torres M, Goldman A, Barrera J. A parallel algorithm for enumerating combinations [Internet]. Proceedings. 2003 ;[citado 2026 jan. 22 ] Available from: https://doi.org/10.1109/ICPP.2003.1240626
Parte de monografia/livro
Parallel graph algorithms for coarse-grained multicomputers (2002)
Song, Siang Wun
Source: Models for parallel and distributed computation : theory, algorithmic techniques and applications. Unidade: IME
Assunto: ALGORITMOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
SONG, Siang Wun. Parallel graph algorithms for coarse-grained multicomputers. Models for parallel and distributed computation : theory, algorithmic techniques and applications. Tradução . Boston: Springer, 2002. . Disponível em: https://doi.org/10.1007/978-1-4757-3609-0_6. Acesso em: 22 jan. 2026.
APA
Song, S. W. (2002). Parallel graph algorithms for coarse-grained multicomputers. In Models for parallel and distributed computation : theory, algorithmic techniques and applications. Boston: Springer. doi:10.1007/978-1-4757-3609-0_6
NLM
Song SW. Parallel graph algorithms for coarse-grained multicomputers [Internet]. In: Models for parallel and distributed computation : theory, algorithmic techniques and applications. Boston: Springer; 2002. [citado 2026 jan. 22 ] Available from: https://doi.org/10.1007/978-1-4757-3609-0_6
Vancouver
Song SW. Parallel graph algorithms for coarse-grained multicomputers [Internet]. In: Models for parallel and distributed computation : theory, algorithmic techniques and applications. Boston: Springer; 2002. [citado 2026 jan. 22 ] Available from: https://doi.org/10.1007/978-1-4757-3609-0_6
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: 22 jan. 2026.
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 2026 jan. 22 ] 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 2026 jan. 22 ] Available from: https://doi.org/10.1142/S0129054199000277
Artigo de periodico
Convergence of some partially parallel gibbs samplers with annealing (1993)
Ferrari, Pablo Augusto ; Frigessi, Arnoldo; Schonmann, Roberto Henrique
Source: Annals of Applied Probability. Unidade: IME
Assunto: PROCESSOS DE MARKOV
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
FERRARI, Pablo Augusto e FRIGESSI, Arnoldo e SCHONMANN, Roberto Henrique. Convergence of some partially parallel gibbs samplers with annealing. Annals of Applied Probability, v. 3 , n. 1 , p. 137-53, 1993Tradução . . Disponível em: https://doi.org/10.1214/aoap/1177005511. Acesso em: 22 jan. 2026.
APA
Ferrari, P. A., Frigessi, A., & Schonmann, R. H. (1993). Convergence of some partially parallel gibbs samplers with annealing. Annals of Applied Probability, 3 ( 1 ), 137-53. doi:10.1214/aoap/1177005511
NLM
Ferrari PA, Frigessi A, Schonmann RH. Convergence of some partially parallel gibbs samplers with annealing [Internet]. Annals of Applied Probability. 1993 ;3 ( 1 ): 137-53.[citado 2026 jan. 22 ] Available from: https://doi.org/10.1214/aoap/1177005511
Vancouver
Ferrari PA, Frigessi A, Schonmann RH. Convergence of some partially parallel gibbs samplers with annealing [Internet]. Annals of Applied Probability. 1993 ;3 ( 1 ): 137-53.[citado 2026 jan. 22 ] Available from: https://doi.org/10.1214/aoap/1177005511

USP Schools

ReP

Filtros

Authors

Date published

Subjects

Funding Agencies

Non normalized affiliation