ReP USP - Resultado da busca

Artigo de periodico
A semi-parametric statistical test to compare complex networks (2020)
Fujita, André ; Lira, Eduardo Silva ; Santos, Suzana de Siqueira ; Bando, Sílvia Yumi ; Soares, Gabriela Eleuterio ; Takahashi, Daniel Yasumasa
Source: Journal of Complex Networks. Unidades: IME, FM, EEFERP
Subjects: INFERÊNCIA PARAMÉTRICA, BIOINFORMÁTICA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
FUJITA, André et al. A semi-parametric statistical test to compare complex networks. Journal of Complex Networks, v. 8, n. 2, 2020Tradução . . Disponível em: https://doi.org/10.1093/comnet/cnz028. Acesso em: 21 jan. 2026.
APA
Fujita, A., Lira, E. S., Santos, S. de S., Bando, S. Y., Soares, G. E., & Takahashi, D. Y. (2020). A semi-parametric statistical test to compare complex networks. Journal of Complex Networks, 8( 2). doi:10.1093/comnet/cnz028
NLM
Fujita A, Lira ES, Santos S de S, Bando SY, Soares GE, Takahashi DY. A semi-parametric statistical test to compare complex networks [Internet]. Journal of Complex Networks. 2020 ; 8( 2):[citado 2026 jan. 21 ] Available from: https://doi.org/10.1093/comnet/cnz028
Vancouver
Fujita A, Lira ES, Santos S de S, Bando SY, Soares GE, Takahashi DY. A semi-parametric statistical test to compare complex networks [Internet]. Journal of Complex Networks. 2020 ; 8( 2):[citado 2026 jan. 21 ] Available from: https://doi.org/10.1093/comnet/cnz028
Artigo de periodico
A statistical method to distinguish functional brain networks (2017)
Fujita, André ; Vidal, Maciel Calebe ; Takahashi, Daniel Yasumasa
Source: Frontiers in Neuroscience. Unidade: IME
Subjects: ANÁLISE DE VARIÂNCIA, GRAFOS ALEATÓRIOS, SIMULAÇÃO, ESTATÍSTICA APLICADA, CIÊNCIA DA COMPUTAÇÃO
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
FUJITA, André e VIDAL, Maciel Calebe e TAKAHASHI, Daniel Yasumasa. A statistical method to distinguish functional brain networks. Frontiers in Neuroscience, v. 11, p. 1-10, 2017Tradução . . Disponível em: https://doi.org/10.3389/fnins.2017.00066. Acesso em: 21 jan. 2026.
APA
Fujita, A., Vidal, M. C., & Takahashi, D. Y. (2017). A statistical method to distinguish functional brain networks. Frontiers in Neuroscience, 11, 1-10. doi:10.3389/fnins.2017.00066
NLM
Fujita A, Vidal MC, Takahashi DY. A statistical method to distinguish functional brain networks [Internet]. Frontiers in Neuroscience. 2017 ; 11 1-10.[citado 2026 jan. 21 ] Available from: https://doi.org/10.3389/fnins.2017.00066
Vancouver
Fujita A, Vidal MC, Takahashi DY. A statistical method to distinguish functional brain networks [Internet]. Frontiers in Neuroscience. 2017 ; 11 1-10.[citado 2026 jan. 21 ] Available from: https://doi.org/10.3389/fnins.2017.00066
Trabalho de evento
Powers of Hamilton cycles in pseudorandom graphs (2014)
Allen, Peter; Bottcher, Julia; Hàn, Hiêp; Kohayakawa, Yoshiharu ; Person, Yury
Source: LATIN 2014: theoretical informatics: Proceedings. Conference titles: Latin American on Theoretical Informatics Symposium - LATIN 2014. Unidade: IME
Subjects: ANÁLISE DE ALGORITMOS, COMPUTABILIDADE E COMPLEXIDADE, MATEMÁTICA DISCRETA, ESTRUTURAS DE DADOS, TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
ALLEN, Peter et al. Powers of Hamilton cycles in pseudorandom graphs. 2014, Anais.. Heidelberg: Springer, 2014. Disponível em: https://doi.org/10.1007/978-3-642-54423-1_31. Acesso em: 21 jan. 2026.
APA
Allen, P., Bottcher, J., Hàn, H., Kohayakawa, Y., & Person, Y. (2014). Powers of Hamilton cycles in pseudorandom graphs. In LATIN 2014: theoretical informatics: Proceedings. Heidelberg: Springer. doi:10.1007/978-3-642-54423-1_31
NLM
Allen P, Bottcher J, Hàn H, Kohayakawa Y, Person Y. Powers of Hamilton cycles in pseudorandom graphs [Internet]. LATIN 2014: theoretical informatics: Proceedings. 2014 ;[citado 2026 jan. 21 ] Available from: https://doi.org/10.1007/978-3-642-54423-1_31
Vancouver
Allen P, Bottcher J, Hàn H, Kohayakawa Y, Person Y. Powers of Hamilton cycles in pseudorandom graphs [Internet]. LATIN 2014: theoretical informatics: Proceedings. 2014 ;[citado 2026 jan. 21 ] Available from: https://doi.org/10.1007/978-3-642-54423-1_31
Parte de monografia/livro
On the triangle removal lemma for subgraphs of sparse pseudorandom graphs (2010)
Kohayakawa, Yoshiharu ; RÖdlt, VojtĚch; Schacht, Mathias; Skokan, Jozef
Source: An irregular mind. Unidade: IME
Subjects: MÉTODOS PROBABILÍSTICOS, 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 the triangle removal lemma for subgraphs of sparse pseudorandom graphs. An irregular mind. Tradução . Berlin: Springer, 2010. . Disponível em: https://doi.org/10.1007/978-3-642-14444-8_10. Acesso em: 21 jan. 2026.
APA
Kohayakawa, Y., RÖdlt, V. Ě., Schacht, M., & Skokan, J. (2010). On the triangle removal lemma for subgraphs of sparse pseudorandom graphs. In An irregular mind. Berlin: Springer. doi:10.1007/978-3-642-14444-8_10
NLM
Kohayakawa Y, RÖdlt VĚ, Schacht M, Skokan J. On the triangle removal lemma for subgraphs of sparse pseudorandom graphs [Internet]. In: An irregular mind. Berlin: Springer; 2010. [citado 2026 jan. 21 ] Available from: https://doi.org/10.1007/978-3-642-14444-8_10
Vancouver
Kohayakawa Y, RÖdlt VĚ, Schacht M, Skokan J. On the triangle removal lemma for subgraphs of sparse pseudorandom graphs [Internet]. In: An irregular mind. Berlin: Springer; 2010. [citado 2026 jan. 21 ] Available from: https://doi.org/10.1007/978-3-642-14444-8_10
Parte de monografia/livro
Szemerédi's regularity lemma and quasi-randominess (2003)
Kohayakawa, Yoshiharu ; RÖdlt, VojtĚch
Source: Recent advances in algorithms and combinatorics. 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 e RÖDLT, VojtĚch. Szemerédi's regularity lemma and quasi-randominess. Recent advances in algorithms and combinatorics. Tradução . New York: Springer, 2003. . Disponível em: https://doi-org.ez67.periodicos.capes.gov.br/10.1007/0-387-22444-0_9. Acesso em: 21 jan. 2026.
APA
Kohayakawa, Y., & RÖdlt, V. Ě. (2003). Szemerédi's regularity lemma and quasi-randominess. In Recent advances in algorithms and combinatorics. New York: Springer. doi:10.1007/0-387-22444-0_9
NLM
Kohayakawa Y, RÖdlt VĚ. Szemerédi's regularity lemma and quasi-randominess [Internet]. In: Recent advances in algorithms and combinatorics. New York: Springer; 2003. [citado 2026 jan. 21 ] Available from: https://doi-org.ez67.periodicos.capes.gov.br/10.1007/0-387-22444-0_9
Vancouver
Kohayakawa Y, RÖdlt VĚ. Szemerédi's regularity lemma and quasi-randominess [Internet]. In: Recent advances in algorithms and combinatorics. New York: Springer; 2003. [citado 2026 jan. 21 ] Available from: https://doi-org.ez67.periodicos.capes.gov.br/10.1007/0-387-22444-0_9

USP Schools

ReP

Filtros

Authors

USP affiliated authors

Subjects

Funding Agencies

Non normalized affiliation