ReP USP - Resultado da busca

Trabalho de evento-anais periodico
Structural matching of 2D electrophoresis gels using deformed graphs (2011)
Noma, Alexandre ; Pardo, Alvaro; César Júnior, Roberto Marcondes
Source: Pattern Recognition Letters. Conference titles: Conference on Graphics, Patterns and Images - SIBGRAPI. Unidade: IME
Subjects: RECONHECIMENTO DE PADRÕES, TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
NOMA, Alexandre e PARDO, Alvaro e CÉSAR JÚNIOR, Roberto Marcondes. Structural matching of 2D electrophoresis gels using deformed graphs. Pattern Recognition Letters. Amsterdam: Elsevier. Disponível em: https://doi.org/10.1016/j.patrec.2010.02.016. Acesso em: 25 abr. 2024. , 2011
APA
Noma, A., Pardo, A., & César Júnior, R. M. (2011). Structural matching of 2D electrophoresis gels using deformed graphs. Pattern Recognition Letters. Amsterdam: Elsevier. doi:10.1016/j.patrec.2010.02.016
NLM
Noma A, Pardo A, César Júnior RM. Structural matching of 2D electrophoresis gels using deformed graphs [Internet]. Pattern Recognition Letters. 2011 ; 32( 1): 3-11.[citado 2024 abr. 25 ] Available from: https://doi.org/10.1016/j.patrec.2010.02.016
Vancouver
Noma A, Pardo A, César Júnior RM. Structural matching of 2D electrophoresis gels using deformed graphs [Internet]. Pattern Recognition Letters. 2011 ; 32( 1): 3-11.[citado 2024 abr. 25 ] Available from: https://doi.org/10.1016/j.patrec.2010.02.016
Parte de monografia/livro
Large-sample statistical methods (2010)
Singer, Júlio da Motta ; Andrade, Dalton Francisco de
Source: International encyclopedia of education. Unidade: IME
Subjects: DISTRIBUIÇÕES (PROBABILIDADE), MÉTODOS ASSINTÓTICOS, TEOREMAS LIMITES
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
SINGER, Júlio da Motta e ANDRADE, Dalton Francisco de. Large-sample statistical methods. International encyclopedia of education. Tradução . Oxford: Elsevier, 2010. . Disponível em: https://doi.org/10.1016/B978-0-08-044894-7.01339-7. Acesso em: 25 abr. 2024.
APA
Singer, J. da M., & Andrade, D. F. de. (2010). Large-sample statistical methods. In International encyclopedia of education. Oxford: Elsevier. doi:10.1016/B978-0-08-044894-7.01339-7
NLM
Singer J da M, Andrade DF de. Large-sample statistical methods [Internet]. In: International encyclopedia of education. Oxford: Elsevier; 2010. [citado 2024 abr. 25 ] Available from: https://doi.org/10.1016/B978-0-08-044894-7.01339-7
Vancouver
Singer J da M, Andrade DF de. Large-sample statistical methods [Internet]. In: International encyclopedia of education. Oxford: Elsevier; 2010. [citado 2024 abr. 25 ] Available from: https://doi.org/10.1016/B978-0-08-044894-7.01339-7
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: 25 abr. 2024. , 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 2024 abr. 25 ] 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 2024 abr. 25 ] 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: 25 abr. 2024. , 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 2024 abr. 25 ] 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 2024 abr. 25 ] 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: 25 abr. 2024. , 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 2024 abr. 25 ] 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 2024 abr. 25 ] Available from: https://doi.org/10.1016/j.entcs.2009.07.047
Monografia/livro-ed/org
Information flow and knowledge sharing (2008)
Silva, Flávio Soares Corrêa da (Editor) ; Agustí-Cullell, Jaume (Editor)
Unidade: IME
Subjects: INTELIGÊNCIA ARTIFICIAL, REPRESENTAÇÃO DE CONHECIMENTO
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
Information flow and knowledge sharing. . Amsterdam: Elsevier. . Acesso em: 25 abr. 2024. , 2008
APA
Information flow and knowledge sharing. (2008). Information flow and knowledge sharing. Amsterdam: Elsevier.
NLM
Information flow and knowledge sharing. 2008 ;[citado 2024 abr. 25 ]
Vancouver
Information flow and knowledge sharing. 2008 ;[citado 2024 abr. 25 ]
Editor de periodico
GRACO 2005: 2nd Brazilian Symposium on Graphs, Algorithms and Combinatorics (2008)
Feofiloff, Paulo (Editor) ; Figueiredo, Celina Miraglia Herrera de (Editor); Wakabayashi, Yoshiko (Editor)
Source: Discrete Applied Mathematics. Conference titles: Brazilian Symposium on Graphs, Algorithms and Combinatorics - GRACO. 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
GRACO 2005: 2nd Brazilian Symposium on Graphs, Algorithms and Combinatorics. Discrete Applied Mathematics. Amsterdam: Elsevier. Disponível em: https://www.sciencedirect.com/journal/discrete-applied-mathematics/vol/156/issue/7. Acesso em: 25 abr. 2024. , 2008
APA
GRACO 2005: 2nd Brazilian Symposium on Graphs, Algorithms and Combinatorics. (2008). GRACO 2005: 2nd Brazilian Symposium on Graphs, Algorithms and Combinatorics. Discrete Applied Mathematics. Amsterdam: Elsevier. Recuperado de https://www.sciencedirect.com/journal/discrete-applied-mathematics/vol/156/issue/7
NLM
GRACO 2005: 2nd Brazilian Symposium on Graphs, Algorithms and Combinatorics [Internet]. Discrete Applied Mathematics. 2008 ; 156( 7): 985-1180.[citado 2024 abr. 25 ] Available from: https://www.sciencedirect.com/journal/discrete-applied-mathematics/vol/156/issue/7
Vancouver
GRACO 2005: 2nd Brazilian Symposium on Graphs, Algorithms and Combinatorics [Internet]. Discrete Applied Mathematics. 2008 ; 156( 7): 985-1180.[citado 2024 abr. 25 ] Available from: https://www.sciencedirect.com/journal/discrete-applied-mathematics/vol/156/issue/7
Parte de monografia/livro
The interplay between compact spaces and the Banach spaces of their continuous functions (2007)
Koszmider, Piotr Boleslaw
Source: Open problems in topology II. Unidade: IME
Subjects: ESPAÇOS DE BANACH, GENERALIZAÇÕES DE COMPACIDADE
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
KOSZMIDER, Piotr Boleslaw. The interplay between compact spaces and the Banach spaces of their continuous functions. Open problems in topology II. Tradução . Amsterdam: Elsevier, 2007. . Disponível em: https://doi.org/10.1016/B978-044452208-5/50052-1. Acesso em: 25 abr. 2024.
APA
Koszmider, P. B. (2007). The interplay between compact spaces and the Banach spaces of their continuous functions. In Open problems in topology II. Amsterdam: Elsevier. doi:10.1016/B978-044452208-5/50052-1
NLM
Koszmider PB. The interplay between compact spaces and the Banach spaces of their continuous functions [Internet]. In: Open problems in topology II. Amsterdam: Elsevier; 2007. [citado 2024 abr. 25 ] Available from: https://doi.org/10.1016/B978-044452208-5/50052-1
Vancouver
Koszmider PB. The interplay between compact spaces and the Banach spaces of their continuous functions [Internet]. In: Open problems in topology II. Amsterdam: Elsevier; 2007. [citado 2024 abr. 25 ] Available from: https://doi.org/10.1016/B978-044452208-5/50052-1
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: 25 abr. 2024. , 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 2024 abr. 25 ] 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 2024 abr. 25 ] Available from: https://doi.org/10.1016/j.entcs.2005.04.040
Trabalho de evento-anais periodico
The 3-colored Ramsey number of odd cycles (2005)
Kohayakawa, Yoshiharu ; Simonovits, Maklós; Skokan, Jozef
Source: Electronic Notes in Discrete 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
KOHAYAKAWA, Yoshiharu e SIMONOVITS, Maklós e SKOKAN, Jozef. The 3-colored Ramsey number of odd cycles. Electronic Notes in Discrete Mathematics. Amsterdam: Elsevier. Disponível em: https://doi.org/10.1016/j.endm.2005.05.053. Acesso em: 25 abr. 2024. , 2005
APA
Kohayakawa, Y., Simonovits, M., & Skokan, J. (2005). The 3-colored Ramsey number of odd cycles. Electronic Notes in Discrete Mathematics. Amsterdam: Elsevier. doi:10.1016/j.endm.2005.05.053
NLM
Kohayakawa Y, Simonovits M, Skokan J. The 3-colored Ramsey number of odd cycles [Internet]. Electronic Notes in Discrete Mathematics. 2005 ; 19 397-402.[citado 2024 abr. 25 ] Available from: https://doi.org/10.1016/j.endm.2005.05.053
Vancouver
Kohayakawa Y, Simonovits M, Skokan J. The 3-colored Ramsey number of odd cycles [Internet]. Electronic Notes in Discrete Mathematics. 2005 ; 19 397-402.[citado 2024 abr. 25 ] Available from: https://doi.org/10.1016/j.endm.2005.05.053
Trabalho de evento-anais periodico
An all-substrings common subsequence algorithm (2005)
Alves, Carlos Eduardo Rodrigues; Cáceres, Edson Norberto; Song, Siang Wun
Source: Electronic Notes in Discrete Mathematics. Conference titles: Brazilian Symposium on Graphs, Algorithms and Combinatorics - GRACO. Unidade: IME
Assunto: ANÁLISE DE ALGORITMOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
ALVES, Carlos Eduardo Rodrigues e CÁCERES, Edson Norberto e SONG, Siang Wun. An all-substrings common subsequence algorithm. Electronic Notes in Discrete Mathematics. Amsterdam: Elsevier. Disponível em: https://doi.org/10.1016/j.endm.2005.05.019. Acesso em: 25 abr. 2024. , 2005
APA
Alves, C. E. R., Cáceres, E. N., & Song, S. W. (2005). An all-substrings common subsequence algorithm. Electronic Notes in Discrete Mathematics. Amsterdam: Elsevier. doi:10.1016/j.endm.2005.05.019
NLM
Alves CER, Cáceres EN, Song SW. An all-substrings common subsequence algorithm [Internet]. Electronic Notes in Discrete Mathematics. 2005 ; 19 133-139.[citado 2024 abr. 25 ] Available from: https://doi.org/10.1016/j.endm.2005.05.019
Vancouver
Alves CER, Cáceres EN, Song SW. An all-substrings common subsequence algorithm [Internet]. Electronic Notes in Discrete Mathematics. 2005 ; 19 133-139.[citado 2024 abr. 25 ] Available from: https://doi.org/10.1016/j.endm.2005.05.019
Editor de periodico
Proceedings of GRACO 2005: the 2nd Brazilian Symposium on Graphs, Algorithms, and Combinatorics (2005)
Feofiloff, Paulo (Editor) ; Figueiredo, Celina Miraglia Herrera de (Editor); Wakabayashi, Yoshiko (Editor)
Source: Electronic Notes in Discrete Mathematics. Conference titles: Brazilian Symposium on Graphs, Algorithms and Combinatorics - GRACO. 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
Proceedings of GRACO 2005: the 2nd Brazilian Symposium on Graphs, Algorithms, and Combinatorics. Electronic Notes in Discrete Mathematics. Amsterdam: Elsevier. Disponível em: https://www.sciencedirect.com/journal/electronic-notes-in-discrete-mathematics/vol/19/suppl/C. Acesso em: 25 abr. 2024. , 2005
APA
Proceedings of GRACO 2005: the 2nd Brazilian Symposium on Graphs, Algorithms, and Combinatorics. (2005). Proceedings of GRACO 2005: the 2nd Brazilian Symposium on Graphs, Algorithms, and Combinatorics. Electronic Notes in Discrete Mathematics. Amsterdam: Elsevier. Recuperado de https://www.sciencedirect.com/journal/electronic-notes-in-discrete-mathematics/vol/19/suppl/C
NLM
Proceedings of GRACO 2005: the 2nd Brazilian Symposium on Graphs, Algorithms, and Combinatorics [Internet]. Electronic Notes in Discrete Mathematics. 2005 ; 19 1-416.[citado 2024 abr. 25 ] Available from: https://www.sciencedirect.com/journal/electronic-notes-in-discrete-mathematics/vol/19/suppl/C
Vancouver
Proceedings of GRACO 2005: the 2nd Brazilian Symposium on Graphs, Algorithms, and Combinatorics [Internet]. Electronic Notes in Discrete Mathematics. 2005 ; 19 1-416.[citado 2024 abr. 25 ] Available from: https://www.sciencedirect.com/journal/electronic-notes-in-discrete-mathematics/vol/19/suppl/C
Trabalho de evento-anais periodico
Scheduling with duplication on m processors with small communication delays (2001)
Goldman, Alfredo ; Rapine, Christophe
Source: Electronic Notes in Discrete Mathematics. Conference titles: Brazilian Symposium on Graphs, Algorithms and Combinatorics. Unidade: IME
Assunto: SCHEDULING
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
GOLDMAN, Alfredo e RAPINE, Christophe. Scheduling with duplication on m processors with small communication delays. Electronic Notes in Discrete Mathematics. Amsterdam: Elsevier. Disponível em: https://doi.org/10.1016/S1571-0653(04)00255-0. Acesso em: 25 abr. 2024. , 2001
APA
Goldman, A., & Rapine, C. (2001). Scheduling with duplication on m processors with small communication delays. Electronic Notes in Discrete Mathematics. Amsterdam: Elsevier. doi:10.1016/S1571-0653(04)00255-0
NLM
Goldman A, Rapine C. Scheduling with duplication on m processors with small communication delays [Internet]. Electronic Notes in Discrete Mathematics. 2001 ; 7 182-185.[citado 2024 abr. 25 ] Available from: https://doi.org/10.1016/S1571-0653(04)00255-0
Vancouver
Goldman A, Rapine C. Scheduling with duplication on m processors with small communication delays [Internet]. Electronic Notes in Discrete Mathematics. 2001 ; 7 182-185.[citado 2024 abr. 25 ] Available from: https://doi.org/10.1016/S1571-0653(04)00255-0
Monografia/livro
Alternative loop rings (1996)
Goodaire, Edgar G; Jespers, Eric; Polcino Milies, Francisco César
Unidade: IME
Subjects: ANÉIS E ÁLGEBRAS NÃO ASSOCIATIVOS, LAÇOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
GOODAIRE, Edgar G e JESPERS, Eric e POLCINO MILIES, Francisco César. Alternative loop rings. . Amsterdam: Elsevier. . Acesso em: 25 abr. 2024. , 1996
APA
Goodaire, E. G., Jespers, E., & Polcino Milies, F. C. (1996). Alternative loop rings. Amsterdam: Elsevier.
NLM
Goodaire EG, Jespers E, Polcino Milies FC. Alternative loop rings. 1996 ;[citado 2024 abr. 25 ]
Vancouver
Goodaire EG, Jespers E, Polcino Milies FC. Alternative loop rings. 1996 ;[citado 2024 abr. 25 ]
Parte de monografia/livro
Preventive maintenance policies (1986)
Borges, Wagner de Souza ; Block, H W; Savits, T H
Source: Reliability and Quality Control. Unidade: IME
Subjects: TEORIA DA CONFIABILIDADE, TESTES DE VIDA (PESQUISA OPERACIONAL), MANUTENÇÃO (PESQUISA OPERACIONAL)
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BORGES, Wagner de Souza e BLOCK, H W e SAVITS, T H. Preventive maintenance policies. Reliability and Quality Control. Tradução . Amsterdam: Elsevier, 1986. . . Acesso em: 25 abr. 2024.
APA
Borges, W. de S., Block, H. W., & Savits, T. H. (1986). Preventive maintenance policies. In Reliability and Quality Control. Amsterdam: Elsevier.
NLM
Borges W de S, Block HW, Savits TH. Preventive maintenance policies. In: Reliability and Quality Control. Amsterdam: Elsevier; 1986. [citado 2024 abr. 25 ]
Vancouver
Borges W de S, Block HW, Savits TH. Preventive maintenance policies. In: Reliability and Quality Control. Amsterdam: Elsevier; 1986. [citado 2024 abr. 25 ]
Parte de monografia/livro
Torsion units in group rings and a conjecture of H.J. Zassenhaus (1986)
Polcino Milies, Francisco César
Source: Group and semigroup rings. Unidade: IME
Assunto: ANÉIS DE GRUPOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
POLCINO MILIES, Francisco César. Torsion units in group rings and a conjecture of H.J. Zassenhaus. Group and semigroup rings. Tradução . Amsterdam: Elsevier, 1986. . Disponível em: https://doi.org/10.1016/S0304-0208(08)71521-4. Acesso em: 25 abr. 2024.
APA
Polcino Milies, F. C. (1986). Torsion units in group rings and a conjecture of H.J. Zassenhaus. In Group and semigroup rings. Amsterdam: Elsevier. doi:10.1016/S0304-0208(08)71521-4
NLM
Polcino Milies FC. Torsion units in group rings and a conjecture of H.J. Zassenhaus [Internet]. In: Group and semigroup rings. Amsterdam: Elsevier; 1986. [citado 2024 abr. 25 ] Available from: https://doi.org/10.1016/S0304-0208(08)71521-4
Vancouver
Polcino Milies FC. Torsion units in group rings and a conjecture of H.J. Zassenhaus [Internet]. In: Group and semigroup rings. Amsterdam: Elsevier; 1986. [citado 2024 abr. 25 ] Available from: https://doi.org/10.1016/S0304-0208(08)71521-4

USP Schools

ReP

Filtros

Document Types

USP Schools

Departament

Authors

USP affiliated authors

Date published

Subjects

Source title

Conference titles

Countries/Territories

Funding Agencies

Normalized affiliation

Non normalized affiliation

Countries of institutions of collaboration