ReP USP - Resultado da busca

Artigo de periodico
Wavelet feature screening (2024)
Fonseca, Rodney ; Morettin, Pedro Alberto ; Pinheiro, Aluísio
Source: Journal of Computational and Graphical Statistics. Unidade: IME
Assunto: INFERÊNCIA PARAMÉTRICA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
FONSECA, Rodney e MORETTIN, Pedro Alberto e PINHEIRO, Aluísio. Wavelet feature screening. Journal of Computational and Graphical Statistics, 2024Tradução . . Disponível em: https://doi.org/10.1080/10618600.2024.2342984. Acesso em: 16 nov. 2024.
APA
Fonseca, R., Morettin, P. A., & Pinheiro, A. (2024). Wavelet feature screening. Journal of Computational and Graphical Statistics. doi:10.1080/10618600.2024.2342984
NLM
Fonseca R, Morettin PA, Pinheiro A. Wavelet feature screening [Internet]. Journal of Computational and Graphical Statistics. 2024 ;[citado 2024 nov. 16 ] Available from: https://doi.org/10.1080/10618600.2024.2342984
Vancouver
Fonseca R, Morettin PA, Pinheiro A. Wavelet feature screening [Internet]. Journal of Computational and Graphical Statistics. 2024 ;[citado 2024 nov. 16 ] Available from: https://doi.org/10.1080/10618600.2024.2342984
Artigo de periodico
Congruence of matrix spaces, matrix tuples, and multilinear maps (2021)
Belitskii, Genrich R.; Futorny, Vyacheslav ; Muzychuk, Mikhail ; Sergeichuk, Vladimir V.
Source: Linear Algebra and its Applications. Unidade: IME
Subjects: ÁLGEBRA LINEAR, FORMAS QUADRÁTICAS, ÁLGEBRA MULTILINEAR
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BELITSKII, Genrich R. et al. Congruence of matrix spaces, matrix tuples, and multilinear maps. Linear Algebra and its Applications, v. 609, p. 317-331, 2021Tradução . . Disponível em: https://doi.org/10.1016/j.laa.2020.09.018. Acesso em: 16 nov. 2024.
APA
Belitskii, G. R., Futorny, V., Muzychuk, M., & Sergeichuk, V. V. (2021). Congruence of matrix spaces, matrix tuples, and multilinear maps. Linear Algebra and its Applications, 609, 317-331. doi:10.1016/j.laa.2020.09.018
NLM
Belitskii GR, Futorny V, Muzychuk M, Sergeichuk VV. Congruence of matrix spaces, matrix tuples, and multilinear maps [Internet]. Linear Algebra and its Applications. 2021 ; 609 317-331.[citado 2024 nov. 16 ] Available from: https://doi.org/10.1016/j.laa.2020.09.018
Vancouver
Belitskii GR, Futorny V, Muzychuk M, Sergeichuk VV. Congruence of matrix spaces, matrix tuples, and multilinear maps [Internet]. Linear Algebra and its Applications. 2021 ; 609 317-331.[citado 2024 nov. 16 ] Available from: https://doi.org/10.1016/j.laa.2020.09.018
Artigo de periodico
On an epidemic model on finite graphs (2020)
Benjamini, Itai; Fontes, Luiz Renato Gonçalves ; Hermon, Jonathan ; Machado, Fábio Prates
Source: The Annals of Applied Probability. Unidade: IME
Subjects: PASSEIOS ALEATÓRIOS, MECÂNICA ESTATÍSTICA, PERCOLAÇÃO, PROCESSOS DE MARKOV, EPIDEMIOLOGIA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BENJAMINI, Itai et al. On an epidemic model on finite graphs. The Annals of Applied Probability, v. 30, n. 1, p. 208-258, 2020Tradução . . Disponível em: https://doi.org/10.1214/19-AAP1500. Acesso em: 16 nov. 2024.
APA
Benjamini, I., Fontes, L. R. G., Hermon, J., & Machado, F. P. (2020). On an epidemic model on finite graphs. The Annals of Applied Probability, 30( 1), 208-258. doi:10.1214/19-AAP1500
NLM
Benjamini I, Fontes LRG, Hermon J, Machado FP. On an epidemic model on finite graphs [Internet]. The Annals of Applied Probability. 2020 ; 30( 1): 208-258.[citado 2024 nov. 16 ] Available from: https://doi.org/10.1214/19-AAP1500
Vancouver
Benjamini I, Fontes LRG, Hermon J, Machado FP. On an epidemic model on finite graphs [Internet]. The Annals of Applied Probability. 2020 ; 30( 1): 208-258.[citado 2024 nov. 16 ] Available from: https://doi.org/10.1214/19-AAP1500
Artigo de periodico
Collectivity from interference (2017)
Blok, Boris; Jäkel, Christian Dieter ; Strikman, Mark; Wiedemann, Urs Achim
Source: Journal of High Energy Physics. Unidade: IME
Assunto: FÍSICA MATEMÁTICA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BLOK, Boris et al. Collectivity from interference. Journal of High Energy Physics, 2017Tradução . . Disponível em: https://doi.org/10.1007/jhep12(2017)074. Acesso em: 16 nov. 2024.
APA
Blok, B., Jäkel, C. D., Strikman, M., & Wiedemann, U. A. (2017). Collectivity from interference. Journal of High Energy Physics. doi:10.1007/jhep12(2017)074
NLM
Blok B, Jäkel CD, Strikman M, Wiedemann UA. Collectivity from interference [Internet]. Journal of High Energy Physics. 2017 ;[citado 2024 nov. 16 ] Available from: https://doi.org/10.1007/jhep12(2017)074
Vancouver
Blok B, Jäkel CD, Strikman M, Wiedemann UA. Collectivity from interference [Internet]. Journal of High Energy Physics. 2017 ;[citado 2024 nov. 16 ] Available from: https://doi.org/10.1007/jhep12(2017)074
Artigo de periodico
Counting contours on trees (2017)
Alon, Noga; Bissacot, Rodrigo ; Endo, Eric Ossami
Source: Letters in Mathematical Physics. Unidade: IME
Subjects: GRAFOS ALEATÓRIOS, COMBINATÓRIA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
ALON, Noga e BISSACOT, Rodrigo e ENDO, Eric Ossami. Counting contours on trees. Letters in Mathematical Physics, v. 107, n. 5, p. 887-899, 2017Tradução . . Disponível em: https://doi.org/10.1007/s11005-016-0927-6. Acesso em: 16 nov. 2024.
APA
Alon, N., Bissacot, R., & Endo, E. O. (2017). Counting contours on trees. Letters in Mathematical Physics, 107( 5), 887-899. doi:10.1007/s11005-016-0927-6
NLM
Alon N, Bissacot R, Endo EO. Counting contours on trees [Internet]. Letters in Mathematical Physics. 2017 ; 107( 5): 887-899.[citado 2024 nov. 16 ] Available from: https://doi.org/10.1007/s11005-016-0927-6
Vancouver
Alon N, Bissacot R, Endo EO. Counting contours on trees [Internet]. Letters in Mathematical Physics. 2017 ; 107( 5): 887-899.[citado 2024 nov. 16 ] Available from: https://doi.org/10.1007/s11005-016-0927-6
Artigo de periodico
On topological groups admitting a base at the identity indexed by ωω (2017)
Leiderman, Arkady G; Pestov, Vladimir G; Tomita, Artur Hideyuki
Source: Fundamenta Mathematicae. Unidade: IME
Assunto: GRUPOS TOPOLÓGICOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
LEIDERMAN, Arkady G e PESTOV, Vladimir G e TOMITA, Artur Hideyuki. On topological groups admitting a base at the identity indexed by ωω. Fundamenta Mathematicae, v. 238, p. 79-100, 2017Tradução . . Disponível em: https://doi.org/10.4064/fm188-9-2016. Acesso em: 16 nov. 2024.
APA
Leiderman, A. G., Pestov, V. G., & Tomita, A. H. (2017). On topological groups admitting a base at the identity indexed by ωω. Fundamenta Mathematicae, 238, 79-100. doi:10.4064/fm188-9-2016
NLM
Leiderman AG, Pestov VG, Tomita AH. On topological groups admitting a base at the identity indexed by ωω [Internet]. Fundamenta Mathematicae. 2017 ; 238 79-100.[citado 2024 nov. 16 ] Available from: https://doi.org/10.4064/fm188-9-2016
Vancouver
Leiderman AG, Pestov VG, Tomita AH. On topological groups admitting a base at the identity indexed by ωω [Internet]. Fundamenta Mathematicae. 2017 ; 238 79-100.[citado 2024 nov. 16 ] Available from: https://doi.org/10.4064/fm188-9-2016
Artigo de periodico
Infinite entropy is generic in Hölder and Sobolev spaces (2017)
Faria, Edson de ; Hazard, Peter; Tresser, Charles
Source: Comptes Rendus Mathematique. Unidade: IME
Assunto: TOPOLOGIA DINÂMICA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
FARIA, Edson de e HAZARD, Peter e TRESSER, Charles. Infinite entropy is generic in Hölder and Sobolev spaces. Comptes Rendus Mathematique, v. 355, n. 11, p. 1185-1189, 2017Tradução . . Disponível em: https://doi.org/10.1016/j.crma.2017.10.016. Acesso em: 16 nov. 2024.
APA
Faria, E. de, Hazard, P., & Tresser, C. (2017). Infinite entropy is generic in Hölder and Sobolev spaces. Comptes Rendus Mathematique, 355( 11), 1185-1189. doi:10.1016/j.crma.2017.10.016
NLM
Faria E de, Hazard P, Tresser C. Infinite entropy is generic in Hölder and Sobolev spaces [Internet]. Comptes Rendus Mathematique. 2017 ; 355( 11): 1185-1189.[citado 2024 nov. 16 ] Available from: https://doi.org/10.1016/j.crma.2017.10.016
Vancouver
Faria E de, Hazard P, Tresser C. Infinite entropy is generic in Hölder and Sobolev spaces [Internet]. Comptes Rendus Mathematique. 2017 ; 355( 11): 1185-1189.[citado 2024 nov. 16 ] Available from: https://doi.org/10.1016/j.crma.2017.10.016
Artigo de periodico
Densities in large permutations and parameter testing (2017)
Glebov, Roman; Hoppen, Carlos; Klimošová, Tereza; Kohayakawa, Yoshiharu ; Král, Daniel; Liu, Hong
Source: European Journal of Combinatorics. Unidade: IME
Subjects: DENSIDADE, PERMUTAÇÕES, TEOREMAS LIMITES
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
GLEBOV, Roman et al. Densities in large permutations and parameter testing. European Journal of Combinatorics, v. 60, n. 1, p. 89-99, 2017Tradução . . Disponível em: https://doi.org/10.1016/j.ejc.2016.09.006. Acesso em: 16 nov. 2024.
APA
Glebov, R., Hoppen, C., Klimošová, T., Kohayakawa, Y., Král, D., & Liu, H. (2017). Densities in large permutations and parameter testing. European Journal of Combinatorics, 60( 1), 89-99. doi:10.1016/j.ejc.2016.09.006
NLM
Glebov R, Hoppen C, Klimošová T, Kohayakawa Y, Král D, Liu H. Densities in large permutations and parameter testing [Internet]. European Journal of Combinatorics. 2017 ; 60( 1): 89-99.[citado 2024 nov. 16 ] Available from: https://doi.org/10.1016/j.ejc.2016.09.006
Vancouver
Glebov R, Hoppen C, Klimošová T, Kohayakawa Y, Král D, Liu H. Densities in large permutations and parameter testing [Internet]. European Journal of Combinatorics. 2017 ; 60( 1): 89-99.[citado 2024 nov. 16 ] Available from: https://doi.org/10.1016/j.ejc.2016.09.006
Artigo de periodico
The number of B3-sets of a given cardinality (2016)
Dellamonica Junior, Domingos; Kohayakawa, Yoshiharu ; Lee, Sang June; Rödl, Vojtěch; Samotij, Wojciech
Source: Journal of Combinatorial Theory, Series A. Unidade: IME
Subjects: ANÁLISE HARMÔNICA, SÉRIES, COMBINATÓRIA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
DELLAMONICA JUNIOR, Domingos et al. The number of B3-sets of a given cardinality. Journal of Combinatorial Theory, Series A, v. 142, p. 44-76, 2016Tradução . . Disponível em: https://doi.org/10.1016/j.jcta.2016.03.004. Acesso em: 16 nov. 2024.
APA
Dellamonica Junior, D., Kohayakawa, Y., Lee, S. J., Rödl, V., & Samotij, W. (2016). The number of B3-sets of a given cardinality. Journal of Combinatorial Theory, Series A, 142, 44-76. doi:10.1016/j.jcta.2016.03.004
NLM
Dellamonica Junior D, Kohayakawa Y, Lee SJ, Rödl V, Samotij W. The number of B3-sets of a given cardinality [Internet]. Journal of Combinatorial Theory, Series A. 2016 ; 142 44-76.[citado 2024 nov. 16 ] Available from: https://doi.org/10.1016/j.jcta.2016.03.004
Vancouver
Dellamonica Junior D, Kohayakawa Y, Lee SJ, Rödl V, Samotij W. The number of B3-sets of a given cardinality [Internet]. Journal of Combinatorial Theory, Series A. 2016 ; 142 44-76.[citado 2024 nov. 16 ] Available from: https://doi.org/10.1016/j.jcta.2016.03.004
Artigo de periodico
On the number of Bh-Sets (2016)
Dellamonica Junior, Domingos; Kohayakawa, Yoshiharu ; Lee, Sang June; Rodl, Vojtech; Samotij, Wojciech
Source: Combinatorics, Probability & Computing. Unidade: IME
Subjects: TEORIA DOS NÚMEROS, SEQUÊNCIAS, COMBINATÓRIA, MÉTODOS PROBABILÍSTICOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
DELLAMONICA JUNIOR, Domingos et al. On the number of Bh-Sets. Combinatorics, Probability & Computing, v. 25, n. Ja 2016, p. 108-129, 2016Tradução . . Disponível em: https://doi.org/10.1017/S0963548315000206. Acesso em: 16 nov. 2024.
APA
Dellamonica Junior, D., Kohayakawa, Y., Lee, S. J., Rodl, V., & Samotij, W. (2016). On the number of Bh-Sets. Combinatorics, Probability & Computing, 25( Ja 2016), 108-129. doi:10.1017/S0963548315000206
NLM
Dellamonica Junior D, Kohayakawa Y, Lee SJ, Rodl V, Samotij W. On the number of Bh-Sets [Internet]. Combinatorics, Probability & Computing. 2016 ; 25( Ja 2016): 108-129.[citado 2024 nov. 16 ] Available from: https://doi.org/10.1017/S0963548315000206
Vancouver
Dellamonica Junior D, Kohayakawa Y, Lee SJ, Rodl V, Samotij W. On the number of Bh-Sets [Internet]. Combinatorics, Probability & Computing. 2016 ; 25( Ja 2016): 108-129.[citado 2024 nov. 16 ] Available from: https://doi.org/10.1017/S0963548315000206
Relatorio tecnico
A conceptual framework for software startup ecosystems: the case of Israel (2015)
Kon, Fábio ; Cukier, Daniel; Melo, Claudia de Oliveira; Hazzan, Orit,; Yuklea, Harry
Unidade: IME
Subjects: CIÊNCIA DA COMPUTAÇÃO, EMPREENDEDORISMO, DESENVOLVIMENTO DE SOFTWARE
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
KON, Fábio et al. A conceptual framework for software startup ecosystems: the case of Israel. . São Paulo: IME-USP. Disponível em: https://repositorio.usp.br/directbitstream/3275191a-a51f-46be-837e-f671f4ee1d9f/2708467.pdf. Acesso em: 16 nov. 2024. , 2015
APA
Kon, F., Cukier, D., Melo, C. de O., Hazzan, O., & Yuklea, H. (2015). A conceptual framework for software startup ecosystems: the case of Israel. São Paulo: IME-USP. Recuperado de https://repositorio.usp.br/directbitstream/3275191a-a51f-46be-837e-f671f4ee1d9f/2708467.pdf
NLM
Kon F, Cukier D, Melo C de O, Hazzan O, Yuklea H. A conceptual framework for software startup ecosystems: the case of Israel [Internet]. 2015 ;[citado 2024 nov. 16 ] Available from: https://repositorio.usp.br/directbitstream/3275191a-a51f-46be-837e-f671f4ee1d9f/2708467.pdf
Vancouver
Kon F, Cukier D, Melo C de O, Hazzan O, Yuklea H. A conceptual framework for software startup ecosystems: the case of Israel [Internet]. 2015 ;[citado 2024 nov. 16 ] Available from: https://repositorio.usp.br/directbitstream/3275191a-a51f-46be-837e-f671f4ee1d9f/2708467.pdf
Artigo de periodico
Semantics and proof-theory of depth bounded Boolean logics (2013)
D'Agostino, Marcello; Finger, Marcelo ; Gabbay, Dov
Source: Theoretical Computer Science. Unidade: IME
Assunto: LÓGICA MATEMÁTICA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
D'AGOSTINO, Marcello e FINGER, Marcelo e GABBAY, Dov. Semantics and proof-theory of depth bounded Boolean logics. Theoretical Computer Science, v. 480, p. 43-68, 2013Tradução . . Disponível em: https://doi.org/10.1016/j.tcs.2013.02.014. Acesso em: 16 nov. 2024.
APA
D'Agostino, M., Finger, M., & Gabbay, D. (2013). Semantics and proof-theory of depth bounded Boolean logics. Theoretical Computer Science, 480, 43-68. doi:10.1016/j.tcs.2013.02.014
NLM
D'Agostino M, Finger M, Gabbay D. Semantics and proof-theory of depth bounded Boolean logics [Internet]. Theoretical Computer Science. 2013 ; 480 43-68.[citado 2024 nov. 16 ] Available from: https://doi.org/10.1016/j.tcs.2013.02.014
Vancouver
D'Agostino M, Finger M, Gabbay D. Semantics and proof-theory of depth bounded Boolean logics [Internet]. Theoretical Computer Science. 2013 ; 480 43-68.[citado 2024 nov. 16 ] Available from: https://doi.org/10.1016/j.tcs.2013.02.014
Artigo de periodico
Polynomial and Poisson dependence in free Poisson algebras and free Poisson fields (2012)
Makar-Limanov, Leonid; Shestakov, Ivan P
Source: Journal of Algebra. Unidade: IME
Assunto: ÁLGEBRA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
MAKAR-LIMANOV, Leonid e SHESTAKOV, Ivan P. Polynomial and Poisson dependence in free Poisson algebras and free Poisson fields. Journal of Algebra, v. 349, n. 1, p. 372-379, 2012Tradução . . Disponível em: https://doi.org/10.1016/j.jalgebra.2011.08.008. Acesso em: 16 nov. 2024.
APA
Makar-Limanov, L., & Shestakov, I. P. (2012). Polynomial and Poisson dependence in free Poisson algebras and free Poisson fields. Journal of Algebra, 349( 1), 372-379. doi:10.1016/j.jalgebra.2011.08.008
NLM
Makar-Limanov L, Shestakov IP. Polynomial and Poisson dependence in free Poisson algebras and free Poisson fields [Internet]. Journal of Algebra. 2012 ; 349( 1): 372-379.[citado 2024 nov. 16 ] Available from: https://doi.org/10.1016/j.jalgebra.2011.08.008
Vancouver
Makar-Limanov L, Shestakov IP. Polynomial and Poisson dependence in free Poisson algebras and free Poisson fields [Internet]. Journal of Algebra. 2012 ; 349( 1): 372-379.[citado 2024 nov. 16 ] Available from: https://doi.org/10.1016/j.jalgebra.2011.08.008
Artigo de periodico
Approximation algorithms and hardness results for the clique packing problem (2009)
Chataigner, Frederic; Manic, Gerhard; Wakabayashi, Yoshiko ; Yuster, R
Source: Discrete Applied Mathematics. Unidade: IME
Assunto: TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
CHATAIGNER, Frederic et al. Approximation algorithms and hardness results for the clique packing problem. Discrete Applied Mathematics, v. 157, n. 7, p. 1396-1406, 2009Tradução . . Disponível em: https://doi.org/10.1016/j.dam.2008.10.017. Acesso em: 16 nov. 2024.
APA
Chataigner, F., Manic, G., Wakabayashi, Y., & Yuster, R. (2009). Approximation algorithms and hardness results for the clique packing problem. Discrete Applied Mathematics, 157( 7), 1396-1406. doi:10.1016/j.dam.2008.10.017
NLM
Chataigner F, Manic G, Wakabayashi Y, Yuster R. Approximation algorithms and hardness results for the clique packing problem [Internet]. Discrete Applied Mathematics. 2009 ; 157( 7): 1396-1406.[citado 2024 nov. 16 ] Available from: https://doi.org/10.1016/j.dam.2008.10.017
Vancouver
Chataigner F, Manic G, Wakabayashi Y, Yuster R. Approximation algorithms and hardness results for the clique packing problem [Internet]. Discrete Applied Mathematics. 2009 ; 157( 7): 1396-1406.[citado 2024 nov. 16 ] Available from: https://doi.org/10.1016/j.dam.2008.10.017
Trabalho de evento-anais periodico
Approximation algorithms and hardness results for the clique packing problem (2007)
Chataigner, Frederic; Manic, Gordana; Wakabayashi, Yoshiko ; Yuster, Raphael
Source: Electronic Notes in Discrete Mathematics. Conference titles: European Conference on Combinatorics, Graph Theory and Applications - EUROCOMB. Unidade: IME
Subjects: TEORIA DOS GRAFOS, COMBINATÓRIA, ALGORITMOS DE APROXIMAÇÃO
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
CHATAIGNER, Frederic et al. Approximation algorithms and hardness results for the clique packing problem. 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/j.endm.2007.07.065. Acesso em: 16 nov. 2024. , 2007
APA
Chataigner, F., Manic, G., Wakabayashi, Y., & Yuster, R. (2007). Approximation algorithms and hardness results for the clique packing problem. Electronic Notes in Discrete Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. doi:10.1016/j.endm.2007.07.065
NLM
Chataigner F, Manic G, Wakabayashi Y, Yuster R. Approximation algorithms and hardness results for the clique packing problem [Internet]. Electronic Notes in Discrete Mathematics. 2007 ; 29 397-401.[citado 2024 nov. 16 ] Available from: https://doi.org/10.1016/j.endm.2007.07.065
Vancouver
Chataigner F, Manic G, Wakabayashi Y, Yuster R. Approximation algorithms and hardness results for the clique packing problem [Internet]. Electronic Notes in Discrete Mathematics. 2007 ; 29 397-401.[citado 2024 nov. 16 ] Available from: https://doi.org/10.1016/j.endm.2007.07.065
Artigo de periodico
Nonmonotone projected gradient methods based on barrier and Euclidean distances (2007)
Auslender, Alfred; Silva, Paulo J. S. ; Teboulle, Marc
Source: Computational Optimization and Applications. Unidade: IME
Subjects: OTIMIZAÇÃO RESTRITA, MÉTODOS NUMÉRICOS, OTIMIZAÇÃO CONVEXA, TEORIA ESPECTRAL
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
AUSLENDER, Alfred e SILVA, Paulo J. S. e TEBOULLE, Marc. Nonmonotone projected gradient methods based on barrier and Euclidean distances. Computational Optimization and Applications, v. 38, n. 3, p. 305-327, 2007Tradução . . Disponível em: https://doi.org/10.1007/s10589-007-9025-0. Acesso em: 16 nov. 2024.
APA
Auslender, A., Silva, P. J. S., & Teboulle, M. (2007). Nonmonotone projected gradient methods based on barrier and Euclidean distances. Computational Optimization and Applications, 38( 3), 305-327. doi:10.1007/s10589-007-9025-0
NLM
Auslender A, Silva PJS, Teboulle M. Nonmonotone projected gradient methods based on barrier and Euclidean distances [Internet]. Computational Optimization and Applications. 2007 ; 38( 3): 305-327.[citado 2024 nov. 16 ] Available from: https://doi.org/10.1007/s10589-007-9025-0
Vancouver
Auslender A, Silva PJS, Teboulle M. Nonmonotone projected gradient methods based on barrier and Euclidean distances [Internet]. Computational Optimization and Applications. 2007 ; 38( 3): 305-327.[citado 2024 nov. 16 ] Available from: https://doi.org/10.1007/s10589-007-9025-0
Artigo de periodico
Measures of pseudorandomness for finite sequences: typical values (2007)
Alon, Noga; Kohayakawa, Yoshiharu ; Mauduit, Christian; Moreira, Carlos Gustavo; Rodl, Vojtech
Source: Proceedings of the London Mathematical Society. Unidade: IME
Subjects: CIÊNCIA DA COMPUTAÇÃO, MATEMÁTICA DISCRETA, COMBINATÓRIA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
ALON, Noga et al. Measures of pseudorandomness for finite sequences: typical values. Proceedings of the London Mathematical Society, v. 95, n. 3, p. 778-812, 2007Tradução . . Disponível em: https://doi.org/10.1112/plms/pdm027. Acesso em: 16 nov. 2024.
APA
Alon, N., Kohayakawa, Y., Mauduit, C., Moreira, C. G., & Rodl, V. (2007). Measures of pseudorandomness for finite sequences: typical values. Proceedings of the London Mathematical Society, 95( 3), 778-812. doi:10.1112/plms/pdm027
NLM
Alon N, Kohayakawa Y, Mauduit C, Moreira CG, Rodl V. Measures of pseudorandomness for finite sequences: typical values [Internet]. Proceedings of the London Mathematical Society. 2007 ; 95( 3): 778-812.[citado 2024 nov. 16 ] Available from: https://doi.org/10.1112/plms/pdm027
Vancouver
Alon N, Kohayakawa Y, Mauduit C, Moreira CG, Rodl V. Measures of pseudorandomness for finite sequences: typical values [Internet]. Proceedings of the London Mathematical Society. 2007 ; 95( 3): 778-812.[citado 2024 nov. 16 ] Available from: https://doi.org/10.1112/plms/pdm027
Artigo de periodico
Measures of pseudorandomness for finite sequences: minimal values (2006)
Alon, Noga; Kohayakawa, Yoshiharu ; Mauduit, Caroline; Moreira, C. G; Rodl, M
Source: Combinatorics Probability & Computing. Unidade: IME
Assunto: COMBINATÓRIA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
ALON, Noga et al. Measures of pseudorandomness for finite sequences: minimal values. Combinatorics Probability & Computing, v. 15, n. 1-2, p. 1-29, 2006Tradução . . Disponível em: https://doi.org/10.1017/S0963548305007170. Acesso em: 16 nov. 2024.
APA
Alon, N., Kohayakawa, Y., Mauduit, C., Moreira, C. G., & Rodl, M. (2006). Measures of pseudorandomness for finite sequences: minimal values. Combinatorics Probability & Computing, 15( 1-2), 1-29. doi:10.1017/S0963548305007170
NLM
Alon N, Kohayakawa Y, Mauduit C, Moreira CG, Rodl M. Measures of pseudorandomness for finite sequences: minimal values [Internet]. Combinatorics Probability & Computing. 2006 ; 15( 1-2): 1-29.[citado 2024 nov. 16 ] Available from: https://doi.org/10.1017/S0963548305007170
Vancouver
Alon N, Kohayakawa Y, Mauduit C, Moreira CG, Rodl M. Measures of pseudorandomness for finite sequences: minimal values [Internet]. Combinatorics Probability & Computing. 2006 ; 15( 1-2): 1-29.[citado 2024 nov. 16 ] Available from: https://doi.org/10.1017/S0963548305007170
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: 16 nov. 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 nov. 16 ] 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 nov. 16 ] Available from: https://doi.org/10.1017/S0963548303005881
Trabalho de evento
Impasse bifurcations of constrained systems (2002)
Llibre, Jaume; Sotomayor, Jorge ; Zhitomirskii, Michail
Source: Differential equations and dynamical systems. Conference titles: Conference on Differential Equations and Dynamical Systems. Unidade: IME
Assunto: SISTEMAS DINÂMICOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
LLIBRE, Jaume e SOTOMAYOR, Jorge e ZHITOMIRSKII, Michail. Impasse bifurcations of constrained systems. 2002, Anais.. Providence: AMS, 2002. . Acesso em: 16 nov. 2024.
APA
Llibre, J., Sotomayor, J., & Zhitomirskii, M. (2002). Impasse bifurcations of constrained systems. In Differential equations and dynamical systems. Providence: AMS.
NLM
Llibre J, Sotomayor J, Zhitomirskii M. Impasse bifurcations of constrained systems. Differential equations and dynamical systems. 2002 ;[citado 2024 nov. 16 ]
Vancouver
Llibre J, Sotomayor J, Zhitomirskii M. Impasse bifurcations of constrained systems. Differential equations and dynamical systems. 2002 ;[citado 2024 nov. 16 ]

USP Schools

ReP

Filtros

Authors

USP affiliated authors

Date published

Subjects

Source title

Countries/Territories

Funding Agencies

Indexado em

Non normalized affiliation

Countries of institutions of collaboration