ReP USP - Resultado da busca

Trabalho de evento-anais periodico
An efficient algorithm for representing piecewise linear functions into logic (2020)
Preto, Sandro ; Finger, Marcelo
Source: Electronic Notes in Theoretical Computer Science. Conference titles: International Workshop on Logical and Semantic Frameworks, with Applications - LSFA 2020. Unidade: IME
Subjects: LÓGICA FORMAL, SEMÂNTICA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
PRETO, Sandro e FINGER, Marcelo. An efficient algorithm for representing piecewise linear functions into logic. Electronic Notes in Theoretical Computer Science. Amsterdam: Elsevier. Disponível em: https://doi.org/10.1016/j.entcs.2020.08.009. Acesso em: 08 out. 2025. , 2020
APA
Preto, S., & Finger, M. (2020). An efficient algorithm for representing piecewise linear functions into logic. Electronic Notes in Theoretical Computer Science. Amsterdam: Elsevier. doi:10.1016/j.entcs.2020.08.009
NLM
Preto S, Finger M. An efficient algorithm for representing piecewise linear functions into logic [Internet]. Electronic Notes in Theoretical Computer Science. 2020 ; 351 167-186.[citado 2025 out. 08 ] Available from: https://doi.org/10.1016/j.entcs.2020.08.009
Vancouver
Preto S, Finger M. An efficient algorithm for representing piecewise linear functions into logic [Internet]. Electronic Notes in Theoretical Computer Science. 2020 ; 351 167-186.[citado 2025 out. 08 ] Available from: https://doi.org/10.1016/j.entcs.2020.08.009
Trabalho de evento-anais periodico
Algebras, graphs and thetas (2019)
Silva, Marcel Kenji de Carli ; Coutinho, Gabriel ; Godsil, Chris ; Roberson, David E
Source: Electronic Notes in Theoretical Computer Science. Conference titles: Latin and American Algorithms, Graphs and Optimization Symposium - LAGOS. Unidade: IME
Assunto: PROGRAMAÇÃO MATEMÁTICA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
SILVA, Marcel Kenji de Carli et al. Algebras, graphs and thetas. Electronic Notes in Theoretical Computer Science. Amsterdam: Elsevier. Disponível em: https://doi.org/10.1016/j.entcs.2019.08.025. Acesso em: 08 out. 2025. , 2019
APA
Silva, M. K. de C., Coutinho, G., Godsil, C., & Roberson, D. E. (2019). Algebras, graphs and thetas. Electronic Notes in Theoretical Computer Science. Amsterdam: Elsevier. doi:10.1016/j.entcs.2019.08.025
NLM
Silva MK de C, Coutinho G, Godsil C, Roberson DE. Algebras, graphs and thetas [Internet]. Electronic Notes in Theoretical Computer Science. 2019 ; 346 275-283.[citado 2025 out. 08 ] Available from: https://doi.org/10.1016/j.entcs.2019.08.025
Vancouver
Silva MK de C, Coutinho G, Godsil C, Roberson DE. Algebras, graphs and thetas [Internet]. Electronic Notes in Theoretical Computer Science. 2019 ; 346 275-283.[citado 2025 out. 08 ] Available from: https://doi.org/10.1016/j.entcs.2019.08.025
Trabalho de evento-anais periodico
On edge-magic labelings of forests (2019)
Cerioli, Márcia R ; Fernandes, Cristina Gomes ; Lee, Orlando ; Lintzmayer, Carla Negri ; Mota, Guilherme Oliveira ; Silva, Cândida Nunes da
Source: Electronic Notes in Theoretical 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
CERIOLI, Márcia R et al. On edge-magic labelings of forests. Electronic Notes in Theoretical Computer Science. Amsterdam: Elsevier. Disponível em: https://doi.org/10.1016/j.entcs.2019.08.027. Acesso em: 08 out. 2025. , 2019
APA
Cerioli, M. R., Fernandes, C. G., Lee, O., Lintzmayer, C. N., Mota, G. O., & Silva, C. N. da. (2019). On edge-magic labelings of forests. Electronic Notes in Theoretical Computer Science. Amsterdam: Elsevier. doi:10.1016/j.entcs.2019.08.027
NLM
Cerioli MR, Fernandes CG, Lee O, Lintzmayer CN, Mota GO, Silva CN da. On edge-magic labelings of forests [Internet]. Electronic Notes in Theoretical Computer Science. 2019 ; 346 299-307.[citado 2025 out. 08 ] Available from: https://doi.org/10.1016/j.entcs.2019.08.027
Vancouver
Cerioli MR, Fernandes CG, Lee O, Lintzmayer CN, Mota GO, Silva CN da. On edge-magic labelings of forests [Internet]. Electronic Notes in Theoretical Computer Science. 2019 ; 346 299-307.[citado 2025 out. 08 ] Available from: https://doi.org/10.1016/j.entcs.2019.08.027
Artigo de periodico-apres/intr
We are happy to organize this issue of the Electronic Notes in Theoretical Computer Science. [Prefácio] (2019)
Coutinho, Gabriel (Prefácio) ; Kohayakawa, Yoshiharu (Prefácio) ; Santos, Vinicius dos (Prefácio); Urrutia, Sebastián (Prefácio)
Source: Electronic Notes in Theoretical 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
We are happy to organize this issue of the Electronic Notes in Theoretical Computer Science. [Prefácio]. Electronic Notes in Theoretical Computer Science. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. Disponível em: https://doi.org/10.1016/j.entcs.2019.08.001. Acesso em: 08 out. 2025. , 2019
APA
We are happy to organize this issue of the Electronic Notes in Theoretical Computer Science. [Prefácio]. (2019). We are happy to organize this issue of the Electronic Notes in Theoretical Computer Science. [Prefácio]. Electronic Notes in Theoretical Computer Science. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. doi:10.1016/j.entcs.2019.08.001
NLM
We are happy to organize this issue of the Electronic Notes in Theoretical Computer Science. [Prefácio] [Internet]. Electronic Notes in Theoretical Computer Science. 2019 ; 346 1-2.[citado 2025 out. 08 ] Available from: https://doi.org/10.1016/j.entcs.2019.08.001
Vancouver
We are happy to organize this issue of the Electronic Notes in Theoretical Computer Science. [Prefácio] [Internet]. Electronic Notes in Theoretical Computer Science. 2019 ; 346 1-2.[citado 2025 out. 08 ] Available from: https://doi.org/10.1016/j.entcs.2019.08.001
Trabalho de evento-anais periodico
On Tuza's conjecture for triangulations and graphs with small treewidth (2019)
Botler, Fábio Happ ; Fernandes, Cristina Gomes ; Gutierrez, Juan
Source: Electronic Notes in Theoretical 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 FERNANDES, Cristina Gomes e GUTIERREZ, Juan. On Tuza's conjecture for triangulations and graphs with small treewidth. Electronic Notes in Theoretical Computer Science. Amsterdam: Elsevier. Disponível em: https://doi.org/10.1016/j.entcs.2019.08.016. Acesso em: 08 out. 2025. , 2019
APA
Botler, F. H., Fernandes, C. G., & Gutierrez, J. (2019). On Tuza's conjecture for triangulations and graphs with small treewidth. Electronic Notes in Theoretical Computer Science. Amsterdam: Elsevier. doi:10.1016/j.entcs.2019.08.016
NLM
Botler FH, Fernandes CG, Gutierrez J. On Tuza's conjecture for triangulations and graphs with small treewidth [Internet]. Electronic Notes in Theoretical Computer Science. 2019 ; 346 171-183.[citado 2025 out. 08 ] Available from: https://doi.org/10.1016/j.entcs.2019.08.016
Vancouver
Botler FH, Fernandes CG, Gutierrez J. On Tuza's conjecture for triangulations and graphs with small treewidth [Internet]. Electronic Notes in Theoretical Computer Science. 2019 ; 346 171-183.[citado 2025 out. 08 ] Available from: https://doi.org/10.1016/j.entcs.2019.08.016
Artigo de periodico-apres/intr
Logical and semantic frameworks are formal languages used to represent logics, languages and systems. [Prefácio] (2014)
Fernández, Maribel; Finger, Marcelo (Editor)
Source: Electronic Notes in Theoretical Computer Science. Unidade: IME
Assunto: CIÊNCIA DA COMPUTAÇÃO
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
FERNÁNDEZ, Maribel. Logical and semantic frameworks are formal languages used to represent logics, languages and systems. [Prefácio]. Electronic Notes in Theoretical Computer Science. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. Disponível em: https://doi.org/10.1016/j.entcs.2014.06.001. Acesso em: 08 out. 2025. , 2014
APA
Fernández, M. (2014). Logical and semantic frameworks are formal languages used to represent logics, languages and systems. [Prefácio]. Electronic Notes in Theoretical Computer Science. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. doi:10.1016/j.entcs.2014.06.001
NLM
Fernández M. Logical and semantic frameworks are formal languages used to represent logics, languages and systems. [Prefácio] [Internet]. Electronic Notes in Theoretical Computer Science. 2014 ; 305 1-3.[citado 2025 out. 08 ] Available from: https://doi.org/10.1016/j.entcs.2014.06.001
Vancouver
Fernández M. Logical and semantic frameworks are formal languages used to represent logics, languages and systems. [Prefácio] [Internet]. Electronic Notes in Theoretical Computer Science. 2014 ; 305 1-3.[citado 2025 out. 08 ] Available from: https://doi.org/10.1016/j.entcs.2014.06.001
Trabalho de evento-anais periodico
A framework to generate synthetic multi-label datasets (2014)
Tomás, Jimena Torres; Spolaôr, Newton; Cherman, Everton Alvares; Monard, Maria Carolina
Source: Electronic Notes in Theoretical Computer Science. Conference titles: Latin American Computing Conference - CLEI. Unidade: ICMC
Assunto: INTELIGÊNCIA ARTIFICIAL
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
TOMÁS, Jimena Torres et al. A framework to generate synthetic multi-label datasets. Electronic Notes in Theoretical Computer Science. Amsterdam: Elsevier. Disponível em: https://doi.org/10.1016/j.entcs.2014.01.025. Acesso em: 08 out. 2025. , 2014
APA
Tomás, J. T., Spolaôr, N., Cherman, E. A., & Monard, M. C. (2014). A framework to generate synthetic multi-label datasets. Electronic Notes in Theoretical Computer Science. Amsterdam: Elsevier. doi:10.1016/j.entcs.2014.01.025
NLM
Tomás JT, Spolaôr N, Cherman EA, Monard MC. A framework to generate synthetic multi-label datasets [Internet]. Electronic Notes in Theoretical Computer Science. 2014 ; fe 2014 155-176.[citado 2025 out. 08 ] Available from: https://doi.org/10.1016/j.entcs.2014.01.025
Vancouver
Tomás JT, Spolaôr N, Cherman EA, Monard MC. A framework to generate synthetic multi-label datasets [Internet]. Electronic Notes in Theoretical Computer Science. 2014 ; fe 2014 155-176.[citado 2025 out. 08 ] Available from: https://doi.org/10.1016/j.entcs.2014.01.025
Trabalho de evento-anais periodico
A comparison of multi-label feature selection methods using the problem transformation approach (2013)
Spolaôr, Newton; Cherman, Everton Alvares; Monard, Maria Carolina ; Lee, Huei Diana
Source: Electronic Notes in Theoretical Computer Science. Conference titles: Latin American Conference in Informatics - CLEI. Unidade: ICMC
Assunto: INTELIGÊNCIA ARTIFICIAL
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
SPOLAÔR, Newton et al. A comparison of multi-label feature selection methods using the problem transformation approach. Electronic Notes in Theoretical Computer Science. Amsterdam: Elsevier. Disponível em: https://doi.org/10.1016/j.entcs.2013.02.010. Acesso em: 08 out. 2025. , 2013
APA
Spolaôr, N., Cherman, E. A., Monard, M. C., & Lee, H. D. (2013). A comparison of multi-label feature selection methods using the problem transformation approach. Electronic Notes in Theoretical Computer Science. Amsterdam: Elsevier. doi:10.1016/j.entcs.2013.02.010
NLM
Spolaôr N, Cherman EA, Monard MC, Lee HD. A comparison of multi-label feature selection methods using the problem transformation approach [Internet]. Electronic Notes in Theoretical Computer Science. 2013 ; 292( 5): 135-151.[citado 2025 out. 08 ] Available from: https://doi.org/10.1016/j.entcs.2013.02.010
Vancouver
Spolaôr N, Cherman EA, Monard MC, Lee HD. A comparison of multi-label feature selection methods using the problem transformation approach [Internet]. Electronic Notes in Theoretical Computer Science. 2013 ; 292( 5): 135-151.[citado 2025 out. 08 ] Available from: https://doi.org/10.1016/j.entcs.2013.02.010
Trabalho de evento-anais periodico
Towards an efficient prover for the C1 paraconsistent logic (2009)
Neto, Adolfo ; Kaestner, Celso A. A.; Finger, Marcelo
Source: Electronic Notes in Theoretical Computer Science. Conference titles: Workshop on Logical and Semantic Frameworks, with Applications - LSFA. Unidade: IME
Subjects: LÓGICA FORMAL, WEB SEMÂNTICA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
NETO, Adolfo e KAESTNER, Celso A. A. e FINGER, Marcelo. Towards an efficient prover for the C1 paraconsistent logic. Electronic Notes in Theoretical Computer Science. Amsterdam: Elsevier. Disponível em: https://doi.org/10.1016/j.entcs.2009.11.007. Acesso em: 08 out. 2025. , 2009
APA
Neto, A., Kaestner, C. A. A., & Finger, M. (2009). Towards an efficient prover for the C1 paraconsistent logic. Electronic Notes in Theoretical Computer Science. Amsterdam: Elsevier. doi:10.1016/j.entcs.2009.11.007
NLM
Neto A, Kaestner CAA, Finger M. Towards an efficient prover for the C1 paraconsistent logic [Internet]. Electronic Notes in Theoretical Computer Science. 2009 ; 256 87-102.[citado 2025 out. 08 ] Available from: https://doi.org/10.1016/j.entcs.2009.11.007
Vancouver
Neto A, Kaestner CAA, Finger M. Towards an efficient prover for the C1 paraconsistent logic [Internet]. Electronic Notes in Theoretical Computer Science. 2009 ; 256 87-102.[citado 2025 out. 08 ] Available from: https://doi.org/10.1016/j.entcs.2009.11.007
Trabalho de evento-anais periodico
Model checking merged program traces (2009)
Silva, Paulo Salem da; Melo, Ana Cristina Vieira de
Source: Electronic Notes in Theoretical Computer Science. Conference titles: Brazilian Symposium on Formal Methods - SBMF. Unidade: IME
Subjects: JAVA, MODELOS DE PROCESSO DE SOFTWARE
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
SILVA, Paulo Salem da e MELO, Ana Cristina Vieira de. Model checking merged program traces. Electronic Notes in Theoretical Computer Science. Amsterdam: Elsevier. Disponível em: https://doi.org/10.1016/j.entcs.2009.05.047. Acesso em: 08 out. 2025. , 2009
APA
Silva, P. S. da, & Melo, A. C. V. de. (2009). Model checking merged program traces. Electronic Notes in Theoretical Computer Science. Amsterdam: Elsevier. doi:10.1016/j.entcs.2009.05.047
NLM
Silva PS da, Melo ACV de. Model checking merged program traces [Internet]. Electronic Notes in Theoretical Computer Science. 2009 ; 240 97-112.[citado 2025 out. 08 ] Available from: https://doi.org/10.1016/j.entcs.2009.05.047
Vancouver
Silva PS da, Melo ACV de. Model checking merged program traces [Internet]. Electronic Notes in Theoretical Computer Science. 2009 ; 240 97-112.[citado 2025 out. 08 ] Available from: https://doi.org/10.1016/j.entcs.2009.05.047
Trabalho de evento-anais periodico
Using abduction to compute efficient proofs (2009)
Finger, Marcelo
Source: Electronic Notes in Theoretical Computer Science. Conference titles: Workshop on Logical and Semantic Frameworks, with Applications - LSFA. Unidade: IME
Assunto: LÓGICA FORMAL
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
FINGER, Marcelo. Using abduction to compute efficient proofs. Electronic Notes in Theoretical Computer Science. Amsterdam: Elsevier. Disponível em: https://doi.org/10.1016/j.entcs.2009.07.047. Acesso em: 08 out. 2025. , 2009
APA
Finger, M. (2009). Using abduction to compute efficient proofs. Electronic Notes in Theoretical Computer Science. Amsterdam: Elsevier. doi:10.1016/j.entcs.2009.07.047
NLM
Finger M. Using abduction to compute efficient proofs [Internet]. Electronic Notes in Theoretical Computer Science. 2009 ; 247 39-49.[citado 2025 out. 08 ] Available from: https://doi.org/10.1016/j.entcs.2009.07.047
Vancouver
Finger M. Using abduction to compute efficient proofs [Internet]. Electronic Notes in Theoretical Computer Science. 2009 ; 247 39-49.[citado 2025 out. 08 ] Available from: https://doi.org/10.1016/j.entcs.2009.07.047
Trabalho de evento-anais periodico
Approximations of Modal Logic K (2006)
Rabello, Guilherme de Souza; Finger, Marcelo
Source: Electronic Notes in Theoretical Computer Science. Conference titles: Workshop on Logic, Language, Information and Computation - WoLLIC. Unidades: IME, IF
Assunto: LÓGICA MODAL
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
RABELLO, Guilherme de Souza e FINGER, Marcelo. Approximations of Modal Logic K. Electronic Notes in Theoretical Computer Science. Amsterdam: Elsevier. Disponível em: https://doi.org/10.1016/j.entcs.2005.04.040. Acesso em: 08 out. 2025. , 2006
APA
Rabello, G. de S., & Finger, M. (2006). Approximations of Modal Logic K. Electronic Notes in Theoretical Computer Science. Amsterdam: Elsevier. doi:10.1016/j.entcs.2005.04.040
NLM
Rabello G de S, Finger M. Approximations of Modal Logic K [Internet]. Electronic Notes in Theoretical Computer Science. 2006 ; 14 171-184.[citado 2025 out. 08 ] Available from: https://doi.org/10.1016/j.entcs.2005.04.040
Vancouver
Rabello G de S, Finger M. Approximations of Modal Logic K [Internet]. Electronic Notes in Theoretical Computer Science. 2006 ; 14 171-184.[citado 2025 out. 08 ] Available from: https://doi.org/10.1016/j.entcs.2005.04.040
Trabalho de evento-anais periodico
From active names to π-calculus rewriting rules (2005)
Melo, Ana Cristina Vieira de
Source: Electronic Notes in Theoretical Computer Science. Conference titles: Brazilian Symposium on Formal Methods - SBMF. Unidade: IME
Subjects: TEORIA DOS AUTÔMATOS, MODELOS MATEMÁTICOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
MELO, Ana Cristina Vieira de. From active names to π-calculus rewriting rules. Electronic Notes in Theoretical Computer Science. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. Disponível em: https://doi.org/10.1016/j.entcs.2005.03.010. Acesso em: 08 out. 2025. , 2005
APA
Melo, A. C. V. de. (2005). From active names to π-calculus rewriting rules. Electronic Notes in Theoretical Computer Science. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. doi:10.1016/j.entcs.2005.03.010
NLM
Melo ACV de. From active names to π-calculus rewriting rules [Internet]. Electronic Notes in Theoretical Computer Science. 2005 ; 130 169-185.[citado 2025 out. 08 ] Available from: https://doi.org/10.1016/j.entcs.2005.03.010
Vancouver
Melo ACV de. From active names to π-calculus rewriting rules [Internet]. Electronic Notes in Theoretical Computer Science. 2005 ; 130 169-185.[citado 2025 out. 08 ] Available from: https://doi.org/10.1016/j.entcs.2005.03.010
Trabalho de evento-anais periodico
A study on the potential active names of π-agents (2004)
Melo, Ana Cristina Vieira de
Source: Electronic Notes in Theoretical Computer Science. Conference titles: Brazilian Workshop on Formal Methods - WMF. Unidade: IME
Subjects: COMPUTABILIDADE E COMPLEXIDADE, PROGRAMAÇÃO MATEMÁTICA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
MELO, Ana Cristina Vieira de. A study on the potential active names of π-agents. Electronic Notes in Theoretical Computer Science. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. Disponível em: https://doi.org/10.1016/S1571-0661(04)05025-X. Acesso em: 08 out. 2025. , 2004
APA
Melo, A. C. V. de. (2004). A study on the potential active names of π-agents. Electronic Notes in Theoretical Computer Science. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. doi:10.1016/S1571-0661(04)05025-X
NLM
Melo ACV de. A study on the potential active names of π-agents [Internet]. Electronic Notes in Theoretical Computer Science. 2004 ; 95 269-286.[citado 2025 out. 08 ] Available from: https://doi.org/10.1016/S1571-0661(04)05025-X
Vancouver
Melo ACV de. A study on the potential active names of π-agents [Internet]. Electronic Notes in Theoretical Computer Science. 2004 ; 95 269-286.[citado 2025 out. 08 ] Available from: https://doi.org/10.1016/S1571-0661(04)05025-X
Trabalho de evento-anais periodico
Definability in o-minimal expansions of the real numbers (2002)
Bianconi, Ricardo
Source: Electronic Notes in Theoretical Computer Science. Conference titles: Workhop on Logic, Language, Information and Computation - WoLLIC. Unidade: IME
Subjects: TEORIA DOS CONJUNTOS, VARIEDADES COMPLEXAS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BIANCONI, Ricardo. Definability in o-minimal expansions of the real numbers. Electronic Notes in Theoretical Computer Science. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. Disponível em: https://doi.org/10.1016/S1571-0661(04)80536-X. Acesso em: 08 out. 2025. , 2002
APA
Bianconi, R. (2002). Definability in o-minimal expansions of the real numbers. Electronic Notes in Theoretical Computer Science. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. doi:10.1016/S1571-0661(04)80536-X
NLM
Bianconi R. Definability in o-minimal expansions of the real numbers [Internet]. Electronic Notes in Theoretical Computer Science. 2002 ; 67 1-6.[citado 2025 out. 08 ] Available from: https://doi.org/10.1016/S1571-0661(04)80536-X
Vancouver
Bianconi R. Definability in o-minimal expansions of the real numbers [Internet]. Electronic Notes in Theoretical Computer Science. 2002 ; 67 1-6.[citado 2025 out. 08 ] Available from: https://doi.org/10.1016/S1571-0661(04)80536-X

USP Schools

ReP

Filtros

Authors

USP affiliated authors

Date published

Subjects

Conference titles

Funding Agencies

Non normalized affiliation