ReP USP - Resultado da busca

Artigo de periodico
Probabilistic prediction and context tree identification in the goalkeeper game (2024)
Hernández, Noslen ; Galves, Antonio ; García, Jesús E.; Gubitoso, Marco Dimas ; Vargas, Claudia D.
Source: Scientific Reports. Unidade: IME
Subjects: PROCESSOS DE MARKOV, JOGOS DE COMPUTADOR
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
HERNÁNDEZ, Noslen et al. Probabilistic prediction and context tree identification in the goalkeeper game. Scientific Reports, v. 14, n. artigo 15467, p. 1-18, 2024Tradução . . Disponível em: https://doi.org/10.1038/s41598-024-66009-w. Acesso em: 05 ago. 2024.
APA
Hernández, N., Galves, A., García, J. E., Gubitoso, M. D., & Vargas, C. D. (2024). Probabilistic prediction and context tree identification in the goalkeeper game. Scientific Reports, 14( artigo 15467), 1-18. doi:10.1038/s41598-024-66009-w
NLM
Hernández N, Galves A, García JE, Gubitoso MD, Vargas CD. Probabilistic prediction and context tree identification in the goalkeeper game [Internet]. Scientific Reports. 2024 ; 14( artigo 15467): 1-18.[citado 2024 ago. 05 ] Available from: https://doi.org/10.1038/s41598-024-66009-w
Vancouver
Hernández N, Galves A, García JE, Gubitoso MD, Vargas CD. Probabilistic prediction and context tree identification in the goalkeeper game [Internet]. Scientific Reports. 2024 ; 14( artigo 15467): 1-18.[citado 2024 ago. 05 ] Available from: https://doi.org/10.1038/s41598-024-66009-w
Artigo de periodico
Independent dominating sets in planar triangulations (2024)
Botler, Fábio Happ ; Fernandes, Cristina Gomes ; Gutiérrez, Juan
Source: The Electronic Journal of Combinatorics. Unidade: IME
Assunto: TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BOTLER, Fábio Happ e FERNANDES, Cristina Gomes e GUTIÉRREZ, Juan. Independent dominating sets in planar triangulations. The Electronic Journal of Combinatorics, v. 31, n. 2, p. 1-10, 2024Tradução . . Disponível em: https://doi.org/10.37236/12548. Acesso em: 05 ago. 2024.
APA
Botler, F. H., Fernandes, C. G., & Gutiérrez, J. (2024). Independent dominating sets in planar triangulations. The Electronic Journal of Combinatorics, 31( 2), 1-10. doi:10.37236/12548
NLM
Botler FH, Fernandes CG, Gutiérrez J. Independent dominating sets in planar triangulations [Internet]. The Electronic Journal of Combinatorics. 2024 ; 31( 2): 1-10.[citado 2024 ago. 05 ] Available from: https://doi.org/10.37236/12548
Vancouver
Botler FH, Fernandes CG, Gutiérrez J. Independent dominating sets in planar triangulations [Internet]. The Electronic Journal of Combinatorics. 2024 ; 31( 2): 1-10.[citado 2024 ago. 05 ] Available from: https://doi.org/10.37236/12548
Artigo de periodico
The mod k chromatic index of graphs is O(k) (2023)
Botler, Fábio Happ ; Colucci, Lucas ; Kohayakawa, Yoshiharu
Source: Journal of Graph Theory. Unidade: IME
Subjects: COMBINATÓRIA, TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BOTLER, Fábio Happ e COLUCCI, Lucas e KOHAYAKAWA, Yoshiharu. The mod k chromatic index of graphs is O(k). Journal of Graph Theory, v. 102, n. 1, p. 197-200, 2023Tradução . . Disponível em: https://doi.org/10.1002/jgt.22866. Acesso em: 05 ago. 2024.
APA
Botler, F. H., Colucci, L., & Kohayakawa, Y. (2023). The mod k chromatic index of graphs is O(k). Journal of Graph Theory, 102( 1), 197-200. doi:10.1002/jgt.22866
NLM
Botler FH, Colucci L, Kohayakawa Y. The mod k chromatic index of graphs is O(k) [Internet]. Journal of Graph Theory. 2023 ; 102( 1): 197-200.[citado 2024 ago. 05 ] Available from: https://doi.org/10.1002/jgt.22866
Vancouver
Botler FH, Colucci L, Kohayakawa Y. The mod k chromatic index of graphs is O(k) [Internet]. Journal of Graph Theory. 2023 ; 102( 1): 197-200.[citado 2024 ago. 05 ] Available from: https://doi.org/10.1002/jgt.22866
Trabalho de evento
Independent dominating sets in planar triangulations (2023)
Botler, Fábio Happ ; Fernandes, Cristina Gomes ; Gutiérrez, Juan
Source: Proceedings. Conference titles: European Conference on Combinatorics, Graph Theory and Applications - EUROCOMB. Unidade: IME
Assunto: TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BOTLER, Fábio Happ e FERNANDES, Cristina Gomes e GUTIÉRREZ, Juan. Independent dominating sets in planar triangulations. 2023, Anais.. Prague: Charles University, 2023. Disponível em: https://doi.org/10.5817/CZ.MUNI.EUROCOMB23-023. Acesso em: 05 ago. 2024.
APA
Botler, F. H., Fernandes, C. G., & Gutiérrez, J. (2023). Independent dominating sets in planar triangulations. In Proceedings. Prague: Charles University. doi:10.5817/CZ.MUNI.EUROCOMB23-023
NLM
Botler FH, Fernandes CG, Gutiérrez J. Independent dominating sets in planar triangulations [Internet]. Proceedings. 2023 ;[citado 2024 ago. 05 ] Available from: https://doi.org/10.5817/CZ.MUNI.EUROCOMB23-023
Vancouver
Botler FH, Fernandes CG, Gutiérrez J. Independent dominating sets in planar triangulations [Internet]. Proceedings. 2023 ;[citado 2024 ago. 05 ] Available from: https://doi.org/10.5817/CZ.MUNI.EUROCOMB23-023
Artigo de periodico
The mod k chromatic index of random graphs (2023)
Botler, Fábio Happ ; Colucci, Lucas ; Kohayakawa, Yoshiharu
Source: Journal of Graph Theory. Unidade: IME
Assunto: TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BOTLER, Fábio Happ e COLUCCI, Lucas e KOHAYAKAWA, Yoshiharu. The mod k chromatic index of random graphs. Journal of Graph Theory, v. 103, n. 4, p. 767-779, 2023Tradução . . Disponível em: https://doi.org/10.1002/jgt.22946. Acesso em: 05 ago. 2024.
APA
Botler, F. H., Colucci, L., & Kohayakawa, Y. (2023). The mod k chromatic index of random graphs. Journal of Graph Theory, 103( 4), 767-779. doi:10.1002/jgt.22946
NLM
Botler FH, Colucci L, Kohayakawa Y. The mod k chromatic index of random graphs [Internet]. Journal of Graph Theory. 2023 ; 103( 4): 767-779.[citado 2024 ago. 05 ] Available from: https://doi.org/10.1002/jgt.22946
Vancouver
Botler FH, Colucci L, Kohayakawa Y. The mod k chromatic index of random graphs [Internet]. Journal of Graph Theory. 2023 ; 103( 4): 767-779.[citado 2024 ago. 05 ] Available from: https://doi.org/10.1002/jgt.22946
Trabalho de evento
Proper edge colorings of complete graphs without repeated triangles (2022)
Botler, Fábio Happ ; Colucci, Lucas ; Matias, Paulo ; Mota, Guilherme Oliveira ; Parente, Roberto Freitas ; Secco, Matheus
Source: Anais. Conference titles: Congresso da Sociedade Brasileira de Computação - CSBC. Unidade: IME
Assunto: TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BOTLER, Fábio Happ et al. Proper edge colorings of complete graphs without repeated triangles. 2022, Anais.. Porto Alegre: SBC, 2022. Disponível em: https://doi.org/10.5753/etc.2022.222917. Acesso em: 05 ago. 2024.
APA
Botler, F. H., Colucci, L., Matias, P., Mota, G. O., Parente, R. F., & Secco, M. (2022). Proper edge colorings of complete graphs without repeated triangles. In Anais. Porto Alegre: SBC. doi:10.5753/etc.2022.222917
NLM
Botler FH, Colucci L, Matias P, Mota GO, Parente RF, Secco M. Proper edge colorings of complete graphs without repeated triangles [Internet]. Anais. 2022 ;[citado 2024 ago. 05 ] Available from: https://doi.org/10.5753/etc.2022.222917
Vancouver
Botler FH, Colucci L, Matias P, Mota GO, Parente RF, Secco M. Proper edge colorings of complete graphs without repeated triangles [Internet]. Anais. 2022 ;[citado 2024 ago. 05 ] Available from: https://doi.org/10.5753/etc.2022.222917
Artigo de periodico
Counting orientations of graphs with no strongly connected tournaments (2022)
Botler, Fábio Happ ; Hoppen, Carlos ; Mota, Guilherme Oliveira
Source: Discrete Mathematics. Unidade: IME
Assunto: TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BOTLER, Fábio Happ e HOPPEN, Carlos e MOTA, Guilherme Oliveira. Counting orientations of graphs with no strongly connected tournaments. Discrete Mathematics, v. 345, n. 12, 2022Tradução . . Disponível em: https://doi.org/10.1016/j.disc.2022.113024. Acesso em: 05 ago. 2024.
APA
Botler, F. H., Hoppen, C., & Mota, G. O. (2022). Counting orientations of graphs with no strongly connected tournaments. Discrete Mathematics, 345( 12). doi:10.1016/j.disc.2022.113024
NLM
Botler FH, Hoppen C, Mota GO. Counting orientations of graphs with no strongly connected tournaments [Internet]. Discrete Mathematics. 2022 ; 345( 12):[citado 2024 ago. 05 ] Available from: https://doi.org/10.1016/j.disc.2022.113024
Vancouver
Botler FH, Hoppen C, Mota GO. Counting orientations of graphs with no strongly connected tournaments [Internet]. Discrete Mathematics. 2022 ; 345( 12):[citado 2024 ago. 05 ] Available from: https://doi.org/10.1016/j.disc.2022.113024
Trabalho de evento-anais periodico
Counting orientations of graphs with no strongly connected tournaments (2021)
Botler, Fábio Happ ; Hoppen, Carlos ; Mota, Guilherme Oliveira
Source: Procedia Computer Science. Conference titles: Latin and American Algorithms, Graphs and Optimization Symposium - LAGOS. Unidade: IME
Assunto: TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BOTLER, Fábio Happ e HOPPEN, Carlos e MOTA, Guilherme Oliveira. Counting orientations of graphs with no strongly connected tournaments. 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.2021.11.047. Acesso em: 05 ago. 2024. , 2021
APA
Botler, F. H., Hoppen, C., & Mota, G. O. (2021). Counting orientations of graphs with no strongly connected tournaments. Procedia Computer Science. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. doi:10.1016/j.procs.2021.11.047
NLM
Botler FH, Hoppen C, Mota GO. Counting orientations of graphs with no strongly connected tournaments [Internet]. Procedia Computer Science. 2021 ; 195 385-393.[citado 2024 ago. 05 ] Available from: https://doi.org/10.1016/j.procs.2021.11.047
Vancouver
Botler FH, Hoppen C, Mota GO. Counting orientations of graphs with no strongly connected tournaments [Internet]. Procedia Computer Science. 2021 ; 195 385-393.[citado 2024 ago. 05 ] Available from: https://doi.org/10.1016/j.procs.2021.11.047
Trabalho de evento-anais periodico
The 2-Decomposition Conjecture for a new class of graphs (2021)
Botler, Fábio Happ ; Jiménez, Andrea; Sambinelli, Maycon ; Wakabayashi, Yoshiko
Source: Procedia Computer Science. Conference titles: Latin and American Algorithms, Graphs and Optimization Symposium - LAGOS. Unidade: IME
Assunto: TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BOTLER, Fábio Happ et al. The 2-Decomposition Conjecture for a new class of graphs. 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.2021.11.044. Acesso em: 05 ago. 2024. , 2021
APA
Botler, F. H., Jiménez, A., Sambinelli, M., & Wakabayashi, Y. (2021). The 2-Decomposition Conjecture for a new class of graphs. Procedia Computer Science. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. doi:10.1016/j.procs.2021.11.044
NLM
Botler FH, Jiménez A, Sambinelli M, Wakabayashi Y. The 2-Decomposition Conjecture for a new class of graphs [Internet]. Procedia Computer Science. 2021 ; 195 359-367.[citado 2024 ago. 05 ] Available from: https://doi.org/10.1016/j.procs.2021.11.044
Vancouver
Botler FH, Jiménez A, Sambinelli M, Wakabayashi Y. The 2-Decomposition Conjecture for a new class of graphs [Internet]. Procedia Computer Science. 2021 ; 195 359-367.[citado 2024 ago. 05 ] Available from: https://doi.org/10.1016/j.procs.2021.11.044
Artigo de periodico
On strong Sidon sets of integers (2021)
Kohayakawa, Yoshiharu ; Lee, Sang June ; Moreira, Carlos Gustavo; Rodl, Vojtech
Source: Journal of Combinatorial Theory, Series A. Unidade: IME
Assunto: TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
KOHAYAKAWA, Yoshiharu et al. On strong Sidon sets of integers. Journal of Combinatorial Theory, Series A, v. 183, 2021Tradução . . Disponível em: https://doi.org/10.1016/j.jcta.2021.105490. Acesso em: 05 ago. 2024.
APA
Kohayakawa, Y., Lee, S. J., Moreira, C. G., & Rodl, V. (2021). On strong Sidon sets of integers. Journal of Combinatorial Theory, Series A, 183. doi:10.1016/j.jcta.2021.105490
NLM
Kohayakawa Y, Lee SJ, Moreira CG, Rodl V. On strong Sidon sets of integers [Internet]. Journal of Combinatorial Theory, Series A. 2021 ; 183[citado 2024 ago. 05 ] Available from: https://doi.org/10.1016/j.jcta.2021.105490
Vancouver
Kohayakawa Y, Lee SJ, Moreira CG, Rodl V. On strong Sidon sets of integers [Internet]. Journal of Combinatorial Theory, Series A. 2021 ; 183[citado 2024 ago. 05 ] Available from: https://doi.org/10.1016/j.jcta.2021.105490
Artigo de periodico
On the discovery of stars, quasars, and galaxies in the Southern Hemisphere with S-PLUS DR2 (2021)
Nakazono, Lilianne Mariko Izuti ; Oliveira, C. Mendes de ; Hirata, Nina Sumiko Tomita ; Jeram, Sarik ; Queiroz, C. ; Eikenberry, Stephen ; Gonzalez, Anthony H. ; Abramo, Luis Raul Weber ; Overzier, Roderik ; Espadoto, Mateus ; Martinazzo, Ana Carolina Rodrigues Cavalcante; Sampedro, Laura ; Herpich, Fábio Rafael ; Fernandes, Felipe de Almeida ; Werle, Ariel ; Barbosa, Carlos Eduardo ; Sodre Junior, Laerte ; Lima, E V; Buzzo, Maria Luisa Gomes ; Cortesi, Arianna ; Menendez-Delmestre, Karin ; Akras, Stavros ; Alvarez-Candal, Alvaro ; Lopes, A R; Telles, Eduardo ; Schoenell, William ; Kanaan, Antonio ; Ribeiro, T
Source: Monthly Notices of the Royal Astronomical Society. Unidades: IAG, IME, IF
Subjects: AGLOMERADOS DE GALÁXIAS, QUASARES, APRENDIZADO COMPUTACIONAL
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
NAKAZONO, Lilianne Mariko Izuti et al. On the discovery of stars, quasars, and galaxies in the Southern Hemisphere with S-PLUS DR2. Monthly Notices of the Royal Astronomical Society, v. 507, n. 4, p. 5847-5868, 2021Tradução . . Disponível em: https://doi.org/10.1093/mnras/stab1835. Acesso em: 05 ago. 2024.
APA
Nakazono, L. M. I., Oliveira, C. M. de, Hirata, N. S. T., Jeram, S., Queiroz, C., Eikenberry, S., et al. (2021). On the discovery of stars, quasars, and galaxies in the Southern Hemisphere with S-PLUS DR2. Monthly Notices of the Royal Astronomical Society, 507( 4), 5847-5868. doi:10.1093/mnras/stab1835
NLM
Nakazono LMI, Oliveira CM de, Hirata NST, Jeram S, Queiroz C, Eikenberry S, Gonzalez AH, Abramo LRW, Overzier R, Espadoto M, Martinazzo ACRC, Sampedro L, Herpich FR, Fernandes F de A, Werle A, Barbosa CE, Sodre Junior L, Lima EV, Buzzo MLG, Cortesi A, Menendez-Delmestre K, Akras S, Alvarez-Candal A, Lopes AR, Telles E, Schoenell W, Kanaan A, Ribeiro T. On the discovery of stars, quasars, and galaxies in the Southern Hemisphere with S-PLUS DR2 [Internet]. Monthly Notices of the Royal Astronomical Society. 2021 ; 507( 4): 5847-5868.[citado 2024 ago. 05 ] Available from: https://doi.org/10.1093/mnras/stab1835
Vancouver
Nakazono LMI, Oliveira CM de, Hirata NST, Jeram S, Queiroz C, Eikenberry S, Gonzalez AH, Abramo LRW, Overzier R, Espadoto M, Martinazzo ACRC, Sampedro L, Herpich FR, Fernandes F de A, Werle A, Barbosa CE, Sodre Junior L, Lima EV, Buzzo MLG, Cortesi A, Menendez-Delmestre K, Akras S, Alvarez-Candal A, Lopes AR, Telles E, Schoenell W, Kanaan A, Ribeiro T. On the discovery of stars, quasars, and galaxies in the Southern Hemisphere with S-PLUS DR2 [Internet]. Monthly Notices of the Royal Astronomical Society. 2021 ; 507( 4): 5847-5868.[citado 2024 ago. 05 ] Available from: https://doi.org/10.1093/mnras/stab1835
Trabalho de evento
An approach for developing component-based groupware product lines using Groupware Workbench (2010)
Gadelha, Bruno; Cirilo, Elder; Fux, Hugo; Lucena, Carlos José Pereira de; Castro Junior, Alberto; Gerosa, Marco Aurélio
Source: Proceedings. Conference titles: Brazilian Symposium on Collaborative Systems - SBSC. Unidade: IME
Subjects: SOFTWARES, DESENVOLVIMENTO DE SOFTWARE
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
GADELHA, Bruno et al. An approach for developing component-based groupware product lines using Groupware Workbench. 2010, Anais.. Piscataway: IEEE, 2010. Disponível em: https://doi.org/10.1109/SBSC.2010.13. Acesso em: 05 ago. 2024.
APA
Gadelha, B., Cirilo, E., Fux, H., Lucena, C. J. P. de, Castro Junior, A., & Gerosa, M. A. (2010). An approach for developing component-based groupware product lines using Groupware Workbench. In Proceedings. Piscataway: IEEE. doi:10.1109/SBSC.2010.13
NLM
Gadelha B, Cirilo E, Fux H, Lucena CJP de, Castro Junior A, Gerosa MA. An approach for developing component-based groupware product lines using Groupware Workbench [Internet]. Proceedings. 2010 ;[citado 2024 ago. 05 ] Available from: https://doi.org/10.1109/SBSC.2010.13
Vancouver
Gadelha B, Cirilo E, Fux H, Lucena CJP de, Castro Junior A, Gerosa MA. An approach for developing component-based groupware product lines using Groupware Workbench [Internet]. Proceedings. 2010 ;[citado 2024 ago. 05 ] Available from: https://doi.org/10.1109/SBSC.2010.13
Artigo de periodico
Is the unfolding of the group discussion off-pattern? Improving coordination support in educational forums using mobile devices (2010)
Gerosa, Marco Aurélio ; Filippo, Denise; Pimentel, Mariano Gomes; Fuks, Hugo; Lucena, Carlos José Pereira de
Source: Computers and Education. Unidade: IME
Assunto: SISTEMAS COLABORATIVOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
GEROSA, Marco Aurélio et al. Is the unfolding of the group discussion off-pattern? Improving coordination support in educational forums using mobile devices. Computers and Education, v. 54, n. 2, p. 528-544, 2010Tradução . . Disponível em: https://doi.org/10.1016/j.compedu.2009.09.004. Acesso em: 05 ago. 2024.
APA
Gerosa, M. A., Filippo, D., Pimentel, M. G., Fuks, H., & Lucena, C. J. P. de. (2010). Is the unfolding of the group discussion off-pattern? Improving coordination support in educational forums using mobile devices. Computers and Education, 54( 2), 528-544. doi:10.1016/j.compedu.2009.09.004
NLM
Gerosa MA, Filippo D, Pimentel MG, Fuks H, Lucena CJP de. Is the unfolding of the group discussion off-pattern? Improving coordination support in educational forums using mobile devices [Internet]. Computers and Education. 2010 ; 54( 2): 528-544.[citado 2024 ago. 05 ] Available from: https://doi.org/10.1016/j.compedu.2009.09.004
Vancouver
Gerosa MA, Filippo D, Pimentel MG, Fuks H, Lucena CJP de. Is the unfolding of the group discussion off-pattern? Improving coordination support in educational forums using mobile devices [Internet]. Computers and Education. 2010 ; 54( 2): 528-544.[citado 2024 ago. 05 ] Available from: https://doi.org/10.1016/j.compedu.2009.09.004
Trabalho de evento
An approach for developing component-based groupware product lines using the Groupware Workbench (2010)
Gadelha, Bruno; Cirilo, Elder; Gerosa, Marco Aurélio ; Castro Junior, Alberto; Lucena, Carlos José Pereira de
Source: Proceedings. Conference titles: International Conference on Software Product Lines - SPLC. Unidade: IME
Subjects: SOFTWARES, DESENVOLVIMENTO DE SOFTWARE
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
GADELHA, Bruno et al. An approach for developing component-based groupware product lines using the Groupware Workbench. 2010, Anais.. Berlin: Springer, 2010. Disponível em: https://doi.org/10.1007/978-3-642-15579-6_34. Acesso em: 05 ago. 2024.
APA
Gadelha, B., Cirilo, E., Gerosa, M. A., Castro Junior, A., & Lucena, C. J. P. de. (2010). An approach for developing component-based groupware product lines using the Groupware Workbench. In Proceedings. Berlin: Springer. doi:10.1007/978-3-642-15579-6_34
NLM
Gadelha B, Cirilo E, Gerosa MA, Castro Junior A, Lucena CJP de. An approach for developing component-based groupware product lines using the Groupware Workbench [Internet]. Proceedings. 2010 ;[citado 2024 ago. 05 ] Available from: https://doi.org/10.1007/978-3-642-15579-6_34
Vancouver
Gadelha B, Cirilo E, Gerosa MA, Castro Junior A, Lucena CJP de. An approach for developing component-based groupware product lines using the Groupware Workbench [Internet]. Proceedings. 2010 ;[citado 2024 ago. 05 ] Available from: https://doi.org/10.1007/978-3-642-15579-6_34
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: 05 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. 05 ] 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. 05 ] Available from: https://doi.org/10.1007%2F978-3-540-39924-7_21
Trabalho de evento
A parallel unrestricted depth search algorithm (2001)
Cáceres, Edson Norberto ; Song, Siang Wun; Szwarcfiter, Jayme Luiz
Source: Proceedings. Conference titles: International Conference on Parallel and Distributed Processing Techniques and Applications - PDPTA. Unidade: IME
Assunto: ARQUITETURA E ORGANIZAÇÃO DE COMPUTADORES
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. A parallel unrestricted depth search algorithm. 2001, Anais.. Las Vegas: Instituto de Matemática e Estatística, Universidade de São Paulo, 2001. . Acesso em: 05 ago. 2024.
APA
Cáceres, E. N., Song, S. W., & Szwarcfiter, J. L. (2001). A parallel unrestricted depth search algorithm. In Proceedings. Las Vegas: Instituto de Matemática e Estatística, Universidade de São Paulo.
NLM
Cáceres EN, Song SW, Szwarcfiter JL. A parallel unrestricted depth search algorithm. Proceedings. 2001 ;[citado 2024 ago. 05 ]
Vancouver
Cáceres EN, Song SW, Szwarcfiter JL. A parallel unrestricted depth search algorithm. Proceedings. 2001 ;[citado 2024 ago. 05 ]
Trabalho de evento-anais periodico
Bounds for optimal coverings (2001)
Moreira, Carlos Gustavo Tamm de Araujo; Kohayakawa, Yoshiharu
Source: Electronic Notes in Discrete Mathematics. Conference titles: Brazilian Symposium on Graphs, Algorithms and Combinatorics. Unidade: IME
Subjects: OTIMIZAÇÃO COMBINATÓRIA, TEORIA DOS CONJUNTOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
MOREIRA, Carlos Gustavo Tamm de Araujo e KOHAYAKAWA, Yoshiharu. Bounds for optimal coverings. Electronic Notes in Discrete Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. Disponível em: https://doi.org/10.1016/S1571-0653(04)00225-2. Acesso em: 05 ago. 2024. , 2001
APA
Moreira, C. G. T. de A., & Kohayakawa, Y. (2001). Bounds for optimal coverings. Electronic Notes in Discrete Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. doi:10.1016/S1571-0653(04)00225-2
NLM
Moreira CGT de A, Kohayakawa Y. Bounds for optimal coverings [Internet]. Electronic Notes in Discrete Mathematics. 2001 ; 7 62-65.[citado 2024 ago. 05 ] Available from: https://doi.org/10.1016/S1571-0653(04)00225-2
Vancouver
Moreira CGT de A, Kohayakawa Y. Bounds for optimal coverings [Internet]. Electronic Notes in Discrete Mathematics. 2001 ; 7 62-65.[citado 2024 ago. 05 ] Available from: https://doi.org/10.1016/S1571-0653(04)00225-2
Trabalho de evento
A coarse-grained parallel algorithm for maximal cliques in circle graphs (2001)
Cáceres, Edson Norberto ; Song, Siang Wun; Szwarcfiter, Jayme Luiz
Source: Proceedings. Conference titles: International Conference on Computational Science - ICCS. Unidade: IME
Assunto: ARQUITETURA E ORGANIZAÇÃO DE COMPUTADORES
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. A coarse-grained parallel algorithm for maximal cliques in circle graphs. 2001, Anais.. Berlin: Springer, 2001. Disponível em: https://doi.org/10.1007/3-540-45718-6_69. Acesso em: 05 ago. 2024.
APA
Cáceres, E. N., Song, S. W., & Szwarcfiter, J. L. (2001). A coarse-grained parallel algorithm for maximal cliques in circle graphs. In Proceedings. Berlin: Springer. doi:10.1007/3-540-45718-6_69
NLM
Cáceres EN, Song SW, Szwarcfiter JL. A coarse-grained parallel algorithm for maximal cliques in circle graphs [Internet]. Proceedings. 2001 ;[citado 2024 ago. 05 ] Available from: https://doi.org/10.1007/3-540-45718-6_69
Vancouver
Cáceres EN, Song SW, Szwarcfiter JL. A coarse-grained parallel algorithm for maximal cliques in circle graphs [Internet]. Proceedings. 2001 ;[citado 2024 ago. 05 ] Available from: https://doi.org/10.1007/3-540-45718-6_69
Trabalho de evento
Finding skew partitions efficiently (2000)
Figueiredo, Celina Miraglia Herrera de; Klein, Sulamita; Kohayakawa, Yoshiharu ; Reed, Bruce A
Source: Proceedings. Conference titles: Latin American Symposium on Theoretical Informatics - LATIN. 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
FIGUEIREDO, Celina Miraglia Herrera de et al. Finding skew partitions efficiently. 2000, Anais.. Berlin: Springer, 2000. Disponível em: https://doi.org/10.1007/10719839_18. Acesso em: 05 ago. 2024.
APA
Figueiredo, C. M. H. de, Klein, S., Kohayakawa, Y., & Reed, B. A. (2000). Finding skew partitions efficiently. In Proceedings. Berlin: Springer. doi:10.1007/10719839_18
NLM
Figueiredo CMH de, Klein S, Kohayakawa Y, Reed BA. Finding skew partitions efficiently [Internet]. Proceedings. 2000 ;[citado 2024 ago. 05 ] Available from: https://doi.org/10.1007/10719839_18
Vancouver
Figueiredo CMH de, Klein S, Kohayakawa Y, Reed BA. Finding skew partitions efficiently [Internet]. Proceedings. 2000 ;[citado 2024 ago. 05 ] Available from: https://doi.org/10.1007/10719839_18

USP Schools

ReP

Filtros

Authors

USP affiliated authors

Date published

Subjects

Source title

Publisher

Conference titles

Countries/Territories

Funding Agencies

Normalized affiliation

Non normalized affiliation

Countries of institutions of collaboration