ReP USP - Resultado da busca

Artigo de periodico
High CD90 (THY-1) expression positively correlates with cell transformation and worse prognosis in basal-like breast cancer tumors (2018)
Lobba, Aline Ramos Maia ; Carreira, Ana Claudia Oliveira ; Cerqueira, Otto Luiz Dutra; Fujita, André ; DeOcesano-Pereira, Carlos ; Osorio, Cynthia Aparecida Bueno ; Soares, Fernando Augusto ; Rameshwar, Pranela ; Sogayar, Mari Cleide
Source: PLOS ONE. Unidades: IME, FO, IQ, FM
Subjects: BIOINFORMÁTICA, NEOPLASIAS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
LOBBA, Aline Ramos Maia et al. High CD90 (THY-1) expression positively correlates with cell transformation and worse prognosis in basal-like breast cancer tumors. PLOS ONE, v. 13, n. 6, p. 1-21, 2018Tradução . . Disponível em: https://doi.org/10.1371/journal.pone.0199254. Acesso em: 23 ago. 2024.
APA
Lobba, A. R. M., Carreira, A. C. O., Cerqueira, O. L. D., Fujita, A., DeOcesano-Pereira, C., Osorio, C. A. B., et al. (2018). High CD90 (THY-1) expression positively correlates with cell transformation and worse prognosis in basal-like breast cancer tumors. PLOS ONE, 13( 6), 1-21. doi:10.1371/journal.pone.0199254
NLM
Lobba ARM, Carreira ACO, Cerqueira OLD, Fujita A, DeOcesano-Pereira C, Osorio CAB, Soares FA, Rameshwar P, Sogayar MC. High CD90 (THY-1) expression positively correlates with cell transformation and worse prognosis in basal-like breast cancer tumors [Internet]. PLOS ONE. 2018 ; 13( 6): 1-21.[citado 2024 ago. 23 ] Available from: https://doi.org/10.1371/journal.pone.0199254
Vancouver
Lobba ARM, Carreira ACO, Cerqueira OLD, Fujita A, DeOcesano-Pereira C, Osorio CAB, Soares FA, Rameshwar P, Sogayar MC. High CD90 (THY-1) expression positively correlates with cell transformation and worse prognosis in basal-like breast cancer tumors [Internet]. PLOS ONE. 2018 ; 13( 6): 1-21.[citado 2024 ago. 23 ] Available from: https://doi.org/10.1371/journal.pone.0199254
Artigo de periodico
Association between short-term systolic blood pressure variability and carotid intima-media thickness in ELSA-Brasil Baseline (2017)
Ribeiro, Adèle Helena ; Lotufo, Paulo Andrade ; Fujita, André ; Goulart, Alessandra Carvalho; Chor, Dora ; Mill, José Geraldo ; Benseñor, Isabela Judith Martins ; Santos, Itamar de Souza
Source: American Journal of Hypertension. Unidades: FM, IME, HU
Subjects: ARTERIOSCLEROSE, PRESSÃO SANGUÍNEA, HIPERTENSÃO, MODELAGEM DE EQUAÇÕES ESTRUTURAIS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
RIBEIRO, Adèle Helena et al. Association between short-term systolic blood pressure variability and carotid intima-media thickness in ELSA-Brasil Baseline. American Journal of Hypertension, v. 30, n. 10, p. 954-960, 2017Tradução . . Disponível em: https://doi.org/10.1093/ajh/hpx076. Acesso em: 23 ago. 2024.
APA
Ribeiro, A. H., Lotufo, P. A., Fujita, A., Goulart, A. C., Chor, D., Mill, J. G., et al. (2017). Association between short-term systolic blood pressure variability and carotid intima-media thickness in ELSA-Brasil Baseline. American Journal of Hypertension, 30( 10), 954-960. doi:10.1093/ajh/hpx076
NLM
Ribeiro AH, Lotufo PA, Fujita A, Goulart AC, Chor D, Mill JG, Benseñor IJM, Santos I de S. Association between short-term systolic blood pressure variability and carotid intima-media thickness in ELSA-Brasil Baseline [Internet]. American Journal of Hypertension. 2017 ; 30( 10): 954-960.[citado 2024 ago. 23 ] Available from: https://doi.org/10.1093/ajh/hpx076
Vancouver
Ribeiro AH, Lotufo PA, Fujita A, Goulart AC, Chor D, Mill JG, Benseñor IJM, Santos I de S. Association between short-term systolic blood pressure variability and carotid intima-media thickness in ELSA-Brasil Baseline [Internet]. American Journal of Hypertension. 2017 ; 30( 10): 954-960.[citado 2024 ago. 23 ] Available from: https://doi.org/10.1093/ajh/hpx076
Artigo de periodico
A quantitative and humane tail bleeding assay for efficacy evaluation of antihaemophilic factors in haemophilia A mice (2014)
Molina, Erika de Simone ; Fujita, André ; Sogayar, Mari Cleide ; Demasi, Marcos Angelo Almeida
Source: Haemophilia. Unidades: IME, IQ, BIOTECNOLOGIA
Subjects: BIOINFORMÁTICA, HEMOFILIA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
MOLINA, Erika de Simone et al. A quantitative and humane tail bleeding assay for efficacy evaluation of antihaemophilic factors in haemophilia A mice. Haemophilia, v. 20, p. e392-e398, 2014Tradução . . Disponível em: https://doi.org/10.1111/hae.12484. Acesso em: 23 ago. 2024.
APA
Molina, E. de S., Fujita, A., Sogayar, M. C., & Demasi, M. A. A. (2014). A quantitative and humane tail bleeding assay for efficacy evaluation of antihaemophilic factors in haemophilia A mice. Haemophilia, 20, e392-e398. doi:10.1111/hae.12484
NLM
Molina E de S, Fujita A, Sogayar MC, Demasi MAA. A quantitative and humane tail bleeding assay for efficacy evaluation of antihaemophilic factors in haemophilia A mice [Internet]. Haemophilia. 2014 ; 20 e392-e398.[citado 2024 ago. 23 ] Available from: https://doi.org/10.1111/hae.12484
Vancouver
Molina E de S, Fujita A, Sogayar MC, Demasi MAA. A quantitative and humane tail bleeding assay for efficacy evaluation of antihaemophilic factors in haemophilia A mice [Internet]. Haemophilia. 2014 ; 20 e392-e398.[citado 2024 ago. 23 ] Available from: https://doi.org/10.1111/hae.12484
Artigo de periodico
Embedding graphs with bounded degree in sparse pseudorandom graphs (2004)
Kohayakawa, Yoshiharu ; Rodl, Vojtech; Sissokho, Papa
Source: Israel Journal of Mathematics. 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 RODL, Vojtech e SISSOKHO, Papa. Embedding graphs with bounded degree in sparse pseudorandom graphs. Israel Journal of Mathematics, v. 139, p. 93-137, 2004Tradução . . Disponível em: https://doi-org.ez67.periodicos.capes.gov.br/10.1007/BF02787543. Acesso em: 23 ago. 2024.
APA
Kohayakawa, Y., Rodl, V., & Sissokho, P. (2004). Embedding graphs with bounded degree in sparse pseudorandom graphs. Israel Journal of Mathematics, 139, 93-137. doi:10.1007/bf02787543
NLM
Kohayakawa Y, Rodl V, Sissokho P. Embedding graphs with bounded degree in sparse pseudorandom graphs [Internet]. Israel Journal of Mathematics. 2004 ; 139 93-137.[citado 2024 ago. 23 ] Available from: https://doi-org.ez67.periodicos.capes.gov.br/10.1007/BF02787543
Vancouver
Kohayakawa Y, Rodl V, Sissokho P. Embedding graphs with bounded degree in sparse pseudorandom graphs [Internet]. Israel Journal of Mathematics. 2004 ; 139 93-137.[citado 2024 ago. 23 ] Available from: https://doi-org.ez67.periodicos.capes.gov.br/10.1007/BF02787543
Trabalho de evento-anais periodico
Bounds for optimal coverings (2004)
Moreira, Carlos Gustavo Tamm de Araujo; Kohayakawa, Yoshiharu
Source: Discrete Applied Mathematics. Conference titles: Brazilian Symposium on Graphs, Algorithms and Combinatorics - GRACO. Unidade: IME
Assunto: COMBINATÓRIA
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. Discrete Applied Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. Disponível em: https://doi.org/10.1016/S0166-218X(03)00372-X. Acesso em: 23 ago. 2024. , 2004
APA
Moreira, C. G. T. de A., & Kohayakawa, Y. (2004). Bounds for optimal coverings. Discrete Applied Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. doi:10.1016/S0166-218X(03)00372-X
NLM
Moreira CGT de A, Kohayakawa Y. Bounds for optimal coverings [Internet]. Discrete Applied Mathematics. 2004 ; 141( 1-3): 263-276.[citado 2024 ago. 23 ] Available from: https://doi.org/10.1016/S0166-218X(03)00372-X
Vancouver
Moreira CGT de A, Kohayakawa Y. Bounds for optimal coverings [Internet]. Discrete Applied Mathematics. 2004 ; 141( 1-3): 263-276.[citado 2024 ago. 23 ] Available from: https://doi.org/10.1016/S0166-218X(03)00372-X
Artigo de periodico
Regular pairs in sparse random graphs I (2003)
Kohayakawa, Yoshiharu ; Rodl, Vojtech
Source: Random Structures and Algorithms. Unidade: IME
Subjects: ALGORITMOS E ESTRUTURAS DE DADOS, GRAFOS ALEATÓRIOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
KOHAYAKAWA, Yoshiharu e RODL, Vojtech. Regular pairs in sparse random graphs I. Random Structures and Algorithms, v. 22, n. 4, p. 359-434, 2003Tradução . . Disponível em: https://doi.org/10.1002/rsa.10081. Acesso em: 23 ago. 2024.
APA
Kohayakawa, Y., & Rodl, V. (2003). Regular pairs in sparse random graphs I. Random Structures and Algorithms, 22( 4), 359-434. doi:10.1002/rsa.10081
NLM
Kohayakawa Y, Rodl V. Regular pairs in sparse random graphs I [Internet]. Random Structures and Algorithms. 2003 ; 22( 4): 359-434.[citado 2024 ago. 23 ] Available from: https://doi.org/10.1002/rsa.10081
Vancouver
Kohayakawa Y, Rodl V. Regular pairs in sparse random graphs I [Internet]. Random Structures and Algorithms. 2003 ; 22( 4): 359-434.[citado 2024 ago. 23 ] Available from: https://doi.org/10.1002/rsa.10081
Artigo de periodico
The width of random subsets of boolean lattices (2002)
Kohayakawa, Yoshiharu ; Kreuter, Bernd
Source: Journal of Combinatorial Theory, Ser. A. Unidade: IME
Assunto: ESTRUTURAS ALGÉBRICAS ORDENADAS (COMBINATÓRIA)
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
KOHAYAKAWA, Yoshiharu e KREUTER, Bernd. The width of random subsets of boolean lattices. Journal of Combinatorial Theory, Ser. A, v. 100, n. 2, p. 376-386, 2002Tradução . . Disponível em: https://doi.org/10.1006/jcta.2002.3293. Acesso em: 23 ago. 2024.
APA
Kohayakawa, Y., & Kreuter, B. (2002). The width of random subsets of boolean lattices. Journal of Combinatorial Theory, Ser. A, 100( 2), 376-386. doi:10.1006/jcta.2002.3293
NLM
Kohayakawa Y, Kreuter B. The width of random subsets of boolean lattices [Internet]. Journal of Combinatorial Theory, Ser. A. 2002 ; 100( 2): 376-386.[citado 2024 ago. 23 ] Available from: https://doi.org/10.1006/jcta.2002.3293
Vancouver
Kohayakawa Y, Kreuter B. The width of random subsets of boolean lattices [Internet]. Journal of Combinatorial Theory, Ser. A. 2002 ; 100( 2): 376-386.[citado 2024 ago. 23 ] Available from: https://doi.org/10.1006/jcta.2002.3293
Artigo de periodico
A density result for random sparse oriented graphs and its relation to a conjecture of woodall (2002)
Donadelli Junior, Jair; Kohayakawa, Yoshiharu
Source: 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
DONADELLI JUNIOR, Jair e KOHAYAKAWA, Yoshiharu. A density result for random sparse oriented graphs and its relation to a conjecture of woodall. Electronic Journal of Combinatorics, v. 9, n. 1, p. 1-10, 2002Tradução . . Disponível em: https://doi.org/10.37236/1661. Acesso em: 23 ago. 2024.
APA
Donadelli Junior, J., & Kohayakawa, Y. (2002). A density result for random sparse oriented graphs and its relation to a conjecture of woodall. Electronic Journal of Combinatorics, 9( 1), 1-10. doi:10.37236/1661
NLM
Donadelli Junior J, Kohayakawa Y. A density result for random sparse oriented graphs and its relation to a conjecture of woodall [Internet]. Electronic Journal of Combinatorics. 2002 ; 9( 1): 1-10.[citado 2024 ago. 23 ] Available from: https://doi.org/10.37236/1661
Vancouver
Donadelli Junior J, Kohayakawa Y. A density result for random sparse oriented graphs and its relation to a conjecture of woodall [Internet]. Electronic Journal of Combinatorics. 2002 ; 9( 1): 1-10.[citado 2024 ago. 23 ] Available from: https://doi.org/10.37236/1661
Artigo de periodico
Hypergraphs, quasi-randomness, and conditions for regularity (2002)
Kohayakawa, Yoshiharu ; Rodl, Vojtech; Skokan, Jozef
Source: Journal of Combinatorial Theory. Ser. 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 e RODL, Vojtech e SKOKAN, Jozef. Hypergraphs, quasi-randomness, and conditions for regularity. Journal of Combinatorial Theory. Ser. A, v. 97, n. 2, p. 307-352, 2002Tradução . . Disponível em: https://doi.org/10.1006/jcta.2001.3217. Acesso em: 23 ago. 2024.
APA
Kohayakawa, Y., Rodl, V., & Skokan, J. (2002). Hypergraphs, quasi-randomness, and conditions for regularity. Journal of Combinatorial Theory. Ser. A, 97( 2), 307-352. doi:10.1006/jcta.2001.3217
NLM
Kohayakawa Y, Rodl V, Skokan J. Hypergraphs, quasi-randomness, and conditions for regularity [Internet]. Journal of Combinatorial Theory. Ser. A. 2002 ; 97( 2): 307-352.[citado 2024 ago. 23 ] Available from: https://doi.org/10.1006/jcta.2001.3217
Vancouver
Kohayakawa Y, Rodl V, Skokan J. Hypergraphs, quasi-randomness, and conditions for regularity [Internet]. Journal of Combinatorial Theory. Ser. A. 2002 ; 97( 2): 307-352.[citado 2024 ago. 23 ] Available from: https://doi.org/10.1006/jcta.2001.3217
Artigo de periodico
Essentially infinite colourings of graphs (2000)
Bollobás, Béla ; Kohayakawa, Yoshiharu ; Schelp, Richard H.
Source: Journal of the London Mathematical Society. Second Series. Unidade: IME
Assunto: TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BOLLOBÁS, Béla e KOHAYAKAWA, Yoshiharu e SCHELP, Richard H. Essentially infinite colourings of graphs. Journal of the London Mathematical Society. Second Series, v. 61, n. 3, p. 658-670, 2000Tradução . . Disponível em: https://doi-org.ez67.periodicos.capes.gov.br/10.1112/S0024610700008796. Acesso em: 23 ago. 2024.
APA
Bollobás, B., Kohayakawa, Y., & Schelp, R. H. (2000). Essentially infinite colourings of graphs. Journal of the London Mathematical Society. Second Series, 61( 3), 658-670. doi:10.1112/S0024610700008796
NLM
Bollobás B, Kohayakawa Y, Schelp RH. Essentially infinite colourings of graphs [Internet]. Journal of the London Mathematical Society. Second Series. 2000 ; 61( 3): 658-670.[citado 2024 ago. 23 ] Available from: https://doi-org.ez67.periodicos.capes.gov.br/10.1112/S0024610700008796
Vancouver
Bollobás B, Kohayakawa Y, Schelp RH. Essentially infinite colourings of graphs [Internet]. Journal of the London Mathematical Society. Second Series. 2000 ; 61( 3): 658-670.[citado 2024 ago. 23 ] Available from: https://doi-org.ez67.periodicos.capes.gov.br/10.1112/S0024610700008796
Trabalho de evento
Universality and tolerance (2000)
Alon, Noga; Capalbo, Michael; Kohayakawa, Yoshiharu ; Rodl, Vojtech; Ruciânski, Andrzej; Szemerédi, Endre
Conference titles: Annual Symposium on Foundations of Computer Science. Unidade: IME
Assunto: COMPUTAÇÃO GRÁFICA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
ALON, Noga et al. Universality and tolerance. 2000, Anais.. Los alamitos: IEEE Computer Society, 2000. Disponível em: https://doi.org/10.1109/SFCS.2000.892007. Acesso em: 23 ago. 2024.
APA
Alon, N., Capalbo, M., Kohayakawa, Y., Rodl, V., Ruciânski, A., & Szemerédi, E. (2000). Universality and tolerance. In . Los alamitos: IEEE Computer Society. doi:10.1109/SFCS.2000.892007
NLM
Alon N, Capalbo M, Kohayakawa Y, Rodl V, Ruciânski A, Szemerédi E. Universality and tolerance [Internet]. 2000 ;[citado 2024 ago. 23 ] Available from: https://doi.org/10.1109/SFCS.2000.892007
Vancouver
Alon N, Capalbo M, Kohayakawa Y, Rodl V, Ruciânski A, Szemerédi E. Universality and tolerance [Internet]. 2000 ;[citado 2024 ago. 23 ] Available from: https://doi.org/10.1109/SFCS.2000.892007
Artigo de periodico
Finding skew partitions efficiently (2000)
Figueiredo, Celina Miraglia Herrera de; Klein, Sulamita; Kohayakawa, Yoshiharu ; Reed, Bruce A.
Source: Journal of Algorithms. Unidade: IME
Subjects: ALGORITMOS E ESTRUTURAS DE DADOS, ALGORITMOS
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. Journal of Algorithms, v. 37, n. 2, p. 505-521, 2000Tradução . . Disponível em: https://doi.org/10.1006/jagm.1999.1122. Acesso em: 23 ago. 2024.
APA
Figueiredo, C. M. H. de, Klein, S., Kohayakawa, Y., & Reed, B. A. (2000). Finding skew partitions efficiently. Journal of Algorithms, 37( 2), 505-521. doi:10.1006/jagm.1999.1122
NLM
Figueiredo CMH de, Klein S, Kohayakawa Y, Reed BA. Finding skew partitions efficiently [Internet]. Journal of Algorithms. 2000 ; 37( 2): 505-521.[citado 2024 ago. 23 ] Available from: https://doi.org/10.1006/jagm.1999.1122
Vancouver
Figueiredo CMH de, Klein S, Kohayakawa Y, Reed BA. Finding skew partitions efficiently [Internet]. Journal of Algorithms. 2000 ; 37( 2): 505-521.[citado 2024 ago. 23 ] Available from: https://doi.org/10.1006/jagm.1999.1122
Artigo de periodico
The length of random subsets of Boolean lattices (2000)
Kohayakawa, Yoshiharu ; Kreuter, Bernd; Osthus, Deryk
Source: Random Structures & Algorithms. Unidade: IME
Subjects: TEORIA DOS GRAFOS, COMBINATÓRIA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
KOHAYAKAWA, Yoshiharu e KREUTER, Bernd e OSTHUS, Deryk. The length of random subsets of Boolean lattices. Random Structures & Algorithms, v. 16, n. 2, p. 177-194, 2000Tradução . . Disponível em: https://doi.org/10.1002/(SICI)1098-2418(200003)16:2<177::AID-RSA4>3.0.CO;2-9. Acesso em: 23 ago. 2024.
APA
Kohayakawa, Y., Kreuter, B., & Osthus, D. (2000). The length of random subsets of Boolean lattices. Random Structures & Algorithms, 16( 2), 177-194. doi:10.1002/(SICI)1098-2418(200003)16:2<177::AID-RSA4>3.0.CO;2-9
NLM
Kohayakawa Y, Kreuter B, Osthus D. The length of random subsets of Boolean lattices [Internet]. Random Structures & Algorithms. 2000 ; 16( 2): 177-194.[citado 2024 ago. 23 ] Available from: https://doi.org/10.1002/(SICI)1098-2418(200003)16:2<177::AID-RSA4>3.0.CO;2-9
Vancouver
Kohayakawa Y, Kreuter B, Osthus D. The length of random subsets of Boolean lattices [Internet]. Random Structures & Algorithms. 2000 ; 16( 2): 177-194.[citado 2024 ago. 23 ] Available from: https://doi.org/10.1002/(SICI)1098-2418(200003)16:2<177::AID-RSA4>3.0.CO;2-9
Artigo de periodico
Induced Ramsey Numbers (1998)
Kohayakawa, Yoshiharu ; Prömel, Hans Jürgen; Rodl, Vojtech
Source: Combinatorica volume. 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
KOHAYAKAWA, Yoshiharu e PRÖMEL, Hans Jürgen e RODL, Vojtech. Induced Ramsey Numbers. Combinatorica volume, v. 18, n. 3, p. 373-404, 1998Tradução . . Disponível em: https://doi.org/10.1007/pl00009828. Acesso em: 23 ago. 2024.
APA
Kohayakawa, Y., Prömel, H. J., & Rodl, V. (1998). Induced Ramsey Numbers. Combinatorica volume, 18( 3), 373-404. doi:10.1007/pl00009828
NLM
Kohayakawa Y, Prömel HJ, Rodl V. Induced Ramsey Numbers [Internet]. Combinatorica volume. 1998 ; 18( 3): 373-404.[citado 2024 ago. 23 ] Available from: https://doi.org/10.1007/pl00009828
Vancouver
Kohayakawa Y, Prömel HJ, Rodl V. Induced Ramsey Numbers [Internet]. Combinatorica volume. 1998 ; 18( 3): 373-404.[citado 2024 ago. 23 ] Available from: https://doi.org/10.1007/pl00009828

USP Schools

ReP

Filtros

USP Schools

Authors

USP affiliated authors

Date published

Subjects

Source title

Funding Agencies

Indexado em

Non normalized affiliation

Countries of institutions of collaboration