ReP USP - Resultado da busca

Artigo de periodico
A nonstiff, adaptive mesh refinement-based method for the Cahn-Hilliard equation (2007)
Ceniceros Angulo, Héctor Daniel; Roma, Alexandre Megiorin
Source: Journal of Computational Physics. Unidade: IME
Assunto: MECÂNICA CLÁSSICA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
CENICEROS ANGULO, Héctor Daniel e ROMA, Alexandre Megiorin. A nonstiff, adaptive mesh refinement-based method for the Cahn-Hilliard equation. Journal of Computational Physics, v. 225, p. 1849-1862, 2007Tradução . . Disponível em: https://doi.org/10.1016/j.jcp.2007.02.019. Acesso em: 13 jun. 2024.
APA
Ceniceros Angulo, H. D., & Roma, A. M. (2007). A nonstiff, adaptive mesh refinement-based method for the Cahn-Hilliard equation. Journal of Computational Physics, 225, 1849-1862. doi:10.1016/j.jcp.2007.02.019
NLM
Ceniceros Angulo HD, Roma AM. A nonstiff, adaptive mesh refinement-based method for the Cahn-Hilliard equation [Internet]. Journal of Computational Physics. 2007 ; 225 1849-1862.[citado 2024 jun. 13 ] Available from: https://doi.org/10.1016/j.jcp.2007.02.019
Vancouver
Ceniceros Angulo HD, Roma AM. A nonstiff, adaptive mesh refinement-based method for the Cahn-Hilliard equation [Internet]. Journal of Computational Physics. 2007 ; 225 1849-1862.[citado 2024 jun. 13 ] Available from: https://doi.org/10.1016/j.jcp.2007.02.019
Artigo de periodico
Small subsets inherit sparse ε-regularity (2007)
Gerke, Stephanie; Kohayakawa, Yoshiharu ; Rodl, Vojtech; Steger, Angelika
Source: Journal of Combinatorial Theory. Series B. Unidade: IME
Assunto: TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
GERKE, Stephanie et al. Small subsets inherit sparse ε-regularity. Journal of Combinatorial Theory. Series B, v. 97, n. 1, p. 34-56, 2007Tradução . . Disponível em: https://doi.org/10.1016/j.jctb.2006.03.004. Acesso em: 13 jun. 2024.
APA
Gerke, S., Kohayakawa, Y., Rodl, V., & Steger, A. (2007). Small subsets inherit sparse ε-regularity. Journal of Combinatorial Theory. Series B, 97( 1), 34-56. doi:10.1016/j.jctb.2006.03.004
NLM
Gerke S, Kohayakawa Y, Rodl V, Steger A. Small subsets inherit sparse ε-regularity [Internet]. Journal of Combinatorial Theory. Series B. 2007 ; 97( 1): 34-56.[citado 2024 jun. 13 ] Available from: https://doi.org/10.1016/j.jctb.2006.03.004
Vancouver
Gerke S, Kohayakawa Y, Rodl V, Steger A. Small subsets inherit sparse ε-regularity [Internet]. Journal of Combinatorial Theory. Series B. 2007 ; 97( 1): 34-56.[citado 2024 jun. 13 ] Available from: https://doi.org/10.1016/j.jctb.2006.03.004
Artigo de periodico
Turan's theorem for pseudo-random graphs (2007)
Kohayakawa, Yoshiharu ; Rodl, Vojtech; Schacht, Mathias; Sissokho, Papa; Skokan, Jozef
Source: Journal of Combinatorial Theory, Serie 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. Turan's theorem for pseudo-random graphs. Journal of Combinatorial Theory, Serie A, v. 114, n. 4, p. 631-657, 2007Tradução . . Disponível em: https://doi.org/10.1016/j.jcta.2006.08.004. Acesso em: 13 jun. 2024.
APA
Kohayakawa, Y., Rodl, V., Schacht, M., Sissokho, P., & Skokan, J. (2007). Turan's theorem for pseudo-random graphs. Journal of Combinatorial Theory, Serie A, 114( 4), 631-657. doi:10.1016/j.jcta.2006.08.004
NLM
Kohayakawa Y, Rodl V, Schacht M, Sissokho P, Skokan J. Turan's theorem for pseudo-random graphs [Internet]. Journal of Combinatorial Theory, Serie A. 2007 ; 114( 4): 631-657.[citado 2024 jun. 13 ] Available from: https://doi.org/10.1016/j.jcta.2006.08.004
Vancouver
Kohayakawa Y, Rodl V, Schacht M, Sissokho P, Skokan J. Turan's theorem for pseudo-random graphs [Internet]. Journal of Combinatorial Theory, Serie A. 2007 ; 114( 4): 631-657.[citado 2024 jun. 13 ] Available from: https://doi.org/10.1016/j.jcta.2006.08.004
Artigo de periodico
Two-dimensional scaling limits via marked nonsimple loops (2006)
Camia, Federico; Fontes, Luiz Renato ; Newman, Charles M.
Source: Bulletin of the Brazilian Mathematical Society. Unidade: IME
Assunto: PERCOLAÇÃO
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
CAMIA, Federico e FONTES, Luiz Renato e NEWMAN, Charles M. Two-dimensional scaling limits via marked nonsimple loops. Bulletin of the Brazilian Mathematical Society, v. 37, n. 4, p. 537-559, 2006Tradução . . Disponível em: https://doi-org.ez67.periodicos.capes.gov.br/10.1007/s00574-006-0026-x. Acesso em: 13 jun. 2024.
APA
Camia, F., Fontes, L. R., & Newman, C. M. (2006). Two-dimensional scaling limits via marked nonsimple loops. Bulletin of the Brazilian Mathematical Society, 37( 4), 537-559. doi:10.1007/s00574-006-0026-x
NLM
Camia F, Fontes LR, Newman CM. Two-dimensional scaling limits via marked nonsimple loops [Internet]. Bulletin of the Brazilian Mathematical Society. 2006 ; 37( 4): 537-559.[citado 2024 jun. 13 ] Available from: https://doi-org.ez67.periodicos.capes.gov.br/10.1007/s00574-006-0026-x
Vancouver
Camia F, Fontes LR, Newman CM. Two-dimensional scaling limits via marked nonsimple loops [Internet]. Bulletin of the Brazilian Mathematical Society. 2006 ; 37( 4): 537-559.[citado 2024 jun. 13 ] Available from: https://doi-org.ez67.periodicos.capes.gov.br/10.1007/s00574-006-0026-x
Artigo de periodico
Adaptive mesh refinement for micromagnetics simulations (2006)
García-Cervera, Carlos J.; Roma, Alexandre Megiorin
Source: IEEE Transactions on Magnetics. Unidade: IME
Assunto: ENGENHARIA ELETRÔNICA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
GARCÍA-CERVERA, Carlos J. e ROMA, Alexandre Megiorin. Adaptive mesh refinement for micromagnetics simulations. IEEE Transactions on Magnetics, v. 42, n. 6, p. 1648-1654, 2006Tradução . . Disponível em: https://doi.org/10.1109/TMAG.2006.872199. Acesso em: 13 jun. 2024.
APA
García-Cervera, C. J., & Roma, A. M. (2006). Adaptive mesh refinement for micromagnetics simulations. IEEE Transactions on Magnetics, 42( 6), 1648-1654. doi:10.1109/TMAG.2006.872199
NLM
García-Cervera CJ, Roma AM. Adaptive mesh refinement for micromagnetics simulations [Internet]. IEEE Transactions on Magnetics. 2006 ; 42( 6): 1648-1654.[citado 2024 jun. 13 ] Available from: https://doi.org/10.1109/TMAG.2006.872199
Vancouver
García-Cervera CJ, Roma AM. Adaptive mesh refinement for micromagnetics simulations [Internet]. IEEE Transactions on Magnetics. 2006 ; 42( 6): 1648-1654.[citado 2024 jun. 13 ] Available from: https://doi.org/10.1109/TMAG.2006.872199
Artigo de periodico
A multi-phase flow method with a fast, geometry-based fluid indicator (2005)
Ceniceros Angulo, Héctor Daniel; Roma, Alexandre Megiorin
Source: Journal of Computational Physics. Unidade: IME
Assunto: MÉTODOS NUMÉRICOS EM DINÂMICA DE FLUIDOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
CENICEROS ANGULO, Héctor Daniel e ROMA, Alexandre Megiorin. A multi-phase flow method with a fast, geometry-based fluid indicator. Journal of Computational Physics, v. 205, n. 2, p. 391-400, 2005Tradução . . Disponível em: https://doi.org/10.1016/j.jcp.2004.11.013. Acesso em: 13 jun. 2024.
APA
Ceniceros Angulo, H. D., & Roma, A. M. (2005). A multi-phase flow method with a fast, geometry-based fluid indicator. Journal of Computational Physics, 205( 2), 391-400. doi:10.1016/j.jcp.2004.11.013
NLM
Ceniceros Angulo HD, Roma AM. A multi-phase flow method with a fast, geometry-based fluid indicator [Internet]. Journal of Computational Physics. 2005 ; 205( 2): 391-400.[citado 2024 jun. 13 ] Available from: https://doi.org/10.1016/j.jcp.2004.11.013
Vancouver
Ceniceros Angulo HD, Roma AM. A multi-phase flow method with a fast, geometry-based fluid indicator [Internet]. Journal of Computational Physics. 2005 ; 205( 2): 391-400.[citado 2024 jun. 13 ] Available from: https://doi.org/10.1016/j.jcp.2004.11.013
Artigo de periodico
The Turan theorem for random graphs (2004)
Kohayakawa, Yoshiharu ; Rodl, Vojtech; Schacht, Mathias
Source: Combinatorics Probability & Computing. 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 SCHACHT, Mathias. The Turan theorem for random graphs. Combinatorics Probability & Computing, v. 13, n. 1, p. 61-91, 2004Tradução . . Disponível em: https://doi.org/10.1017/S0963548303005856. Acesso em: 13 jun. 2024.
APA
Kohayakawa, Y., Rodl, V., & Schacht, M. (2004). The Turan theorem for random graphs. Combinatorics Probability & Computing, 13( 1), 61-91. doi:10.1017/S0963548303005856
NLM
Kohayakawa Y, Rodl V, Schacht M. The Turan theorem for random graphs [Internet]. Combinatorics Probability & Computing. 2004 ; 13( 1): 61-91.[citado 2024 jun. 13 ] Available from: https://doi.org/10.1017/S0963548303005856
Vancouver
Kohayakawa Y, Rodl V, Schacht M. The Turan theorem for random graphs [Internet]. Combinatorics Probability & Computing. 2004 ; 13( 1): 61-91.[citado 2024 jun. 13 ] Available from: https://doi.org/10.1017/S0963548303005856
Artigo de periodico
Study of the long-time dynamics of a viscous vortex sheet with a fully adaptive nonstiff method (2004)
Ceniceros Angulo, Héctor Daniel; Roma, Alexandre Megiorin
Source: Physics of Fluids. Unidade: IME
Assunto: MECÂNICA DOS FLUÍDOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
CENICEROS ANGULO, Héctor Daniel e ROMA, Alexandre Megiorin. Study of the long-time dynamics of a viscous vortex sheet with a fully adaptive nonstiff method. Physics of Fluids, v. 16, n. 12, p. 4285-4318, 2004Tradução . . Disponível em: https://doi.org/10.1063/1.1788351. Acesso em: 13 jun. 2024.
APA
Ceniceros Angulo, H. D., & Roma, A. M. (2004). Study of the long-time dynamics of a viscous vortex sheet with a fully adaptive nonstiff method. Physics of Fluids, 16( 12), 4285-4318. doi:10.1063/1.1788351
NLM
Ceniceros Angulo HD, Roma AM. Study of the long-time dynamics of a viscous vortex sheet with a fully adaptive nonstiff method [Internet]. Physics of Fluids. 2004 ; 16( 12): 4285-4318.[citado 2024 jun. 13 ] Available from: https://doi.org/10.1063/1.1788351
Vancouver
Ceniceros Angulo HD, Roma AM. Study of the long-time dynamics of a viscous vortex sheet with a fully adaptive nonstiff method [Internet]. Physics of Fluids. 2004 ; 16( 12): 4285-4318.[citado 2024 jun. 13 ] Available from: https://doi.org/10.1063/1.1788351
Artigo de periodico
An optimal algorithm for checking regularity (2003)
Kohayakawa, Yoshiharu ; Rodl, Vojtech; Thoma, Lubo
Source: Siam Journal on Computing,. 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 THOMA, Lubo. An optimal algorithm for checking regularity. Siam Journal on Computing, v. 32, n. 5, p. 1210-1235, 2003Tradução . . Disponível em: https://doi.org/10.1137/S0097539702408223. Acesso em: 13 jun. 2024.
APA
Kohayakawa, Y., Rodl, V., & Thoma, L. (2003). An optimal algorithm for checking regularity. Siam Journal on Computing,, 32( 5), 1210-1235. doi:10.1137/S0097539702408223
NLM
Kohayakawa Y, Rodl V, Thoma L. An optimal algorithm for checking regularity [Internet]. Siam Journal on Computing,. 2003 ; 32( 5): 1210-1235.[citado 2024 jun. 13 ] Available from: https://doi.org/10.1137/S0097539702408223
Vancouver
Kohayakawa Y, Rodl V, Thoma L. An optimal algorithm for checking regularity [Internet]. Siam Journal on Computing,. 2003 ; 32( 5): 1210-1235.[citado 2024 jun. 13 ] Available from: https://doi.org/10.1137/S0097539702408223
Artigo de periodico
Ramsey games against a one-armed bandit (2003)
Friedgut, Ehud; Kohayakawa, Yoshiharu ; Rodl, Vojtech; Rucinski, Andrzej; Tetali, Prasad
Source: Combinatorics, Probability & Computing. Unidade: IME
Assunto: TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
FRIEDGUT, Ehud et al. Ramsey games against a one-armed bandit. Combinatorics, Probability & Computing, v. 12, n. 5-6, p. 515-545, 2003Tradução . . Disponível em: https://doi.org/10.1017/S0963548303005881. Acesso em: 13 jun. 2024.
APA
Friedgut, E., Kohayakawa, Y., Rodl, V., Rucinski, A., & Tetali, P. (2003). Ramsey games against a one-armed bandit. Combinatorics, Probability & Computing, 12( 5-6), 515-545. doi:10.1017/S0963548303005881
NLM
Friedgut E, Kohayakawa Y, Rodl V, Rucinski A, Tetali P. Ramsey games against a one-armed bandit [Internet]. Combinatorics, Probability & Computing. 2003 ; 12( 5-6): 515-545.[citado 2024 jun. 13 ] Available from: https://doi.org/10.1017/S0963548303005881
Vancouver
Friedgut E, Kohayakawa Y, Rodl V, Rucinski A, Tetali P. Ramsey games against a one-armed bandit [Internet]. Combinatorics, Probability & Computing. 2003 ; 12( 5-6): 515-545.[citado 2024 jun. 13 ] Available from: https://doi.org/10.1017/S0963548303005881
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: 13 jun. 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 jun. 13 ] 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 jun. 13 ] Available from: https://doi.org/10.1002/rsa.10081
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: 13 jun. 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 jun. 13 ] 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 jun. 13 ] Available from: https://doi.org/10.1006/jcta.2001.3217
Artigo de periodico
Some wavelet-based analyses of Markov chain data (2000)
Brillinger, David R.; Morettin, Pedro Alberto ; Irizarry, R A; Chiann, Chang
Source: Signal Processing. Unidade: IME
Assunto: MODELOS EM SÉRIES TEMPORAIS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BRILLINGER, David R. et al. Some wavelet-based analyses of Markov chain data. Signal Processing, v. 80, n. 8, p. 1607-1627, 2000Tradução . . Disponível em: https://doi.org/10.1016/S0165-1684(00)00097-9. Acesso em: 13 jun. 2024.
APA
Brillinger, D. R., Morettin, P. A., Irizarry, R. A., & Chiann, C. (2000). Some wavelet-based analyses of Markov chain data. Signal Processing, 80( 8), 1607-1627. doi:10.1016/S0165-1684(00)00097-9
NLM
Brillinger DR, Morettin PA, Irizarry RA, Chiann C. Some wavelet-based analyses of Markov chain data [Internet]. Signal Processing. 2000 ; 80( 8): 1607-1627.[citado 2024 jun. 13 ] Available from: https://doi.org/10.1016/S0165-1684(00)00097-9
Vancouver
Brillinger DR, Morettin PA, Irizarry RA, Chiann C. Some wavelet-based analyses of Markov chain data [Internet]. Signal Processing. 2000 ; 80( 8): 1607-1627.[citado 2024 jun. 13 ] Available from: https://doi.org/10.1016/S0165-1684(00)00097-9
Artigo de periodico
An adaptive version of the immersed boundary method (1999)
Roma, Alexandre Megiorin ; Peskin, Charles S; Berger, Marsha J
Source: Journal of Computational Physics. Unidade: IME
Assunto: ANÁLISE NUMÉRICA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
ROMA, Alexandre Megiorin e PESKIN, Charles S e BERGER, Marsha J. An adaptive version of the immersed boundary method. Journal of Computational Physics, v. 153, p. 509-534, 1999Tradução . . Disponível em: https://doi.org/10.1006/jcph.1999.6293. Acesso em: 13 jun. 2024.
APA
Roma, A. M., Peskin, C. S., & Berger, M. J. (1999). An adaptive version of the immersed boundary method. Journal of Computational Physics, 153, 509-534. doi:10.1006/jcph.1999.6293
NLM
Roma AM, Peskin CS, Berger MJ. An adaptive version of the immersed boundary method [Internet]. Journal of Computational Physics. 1999 ; 153 509-534.[citado 2024 jun. 13 ] Available from: https://doi.org/10.1006/jcph.1999.6293
Vancouver
Roma AM, Peskin CS, Berger MJ. An adaptive version of the immersed boundary method [Internet]. Journal of Computational Physics. 1999 ; 153 509-534.[citado 2024 jun. 13 ] Available from: https://doi.org/10.1006/jcph.1999.6293

USP Schools

ReP

Filtros

Authors

Date published

Subjects

Source title

Funding Agencies

Non normalized affiliation

Countries of institutions of collaboration