Filtros : "Electronic Notes in Theoretical Computer Science" Removido: "Elsevier" Limpar

Filtros



Refine with date range


  • Source: Electronic Notes in Theoretical Computer Science. Conference titles: Latin and American Algorithms, Graphs and Optimization Symposium - LAGOS. Unidade: IME

    Assunto: TEORIA DOS GRAFOS

    PrivadoAcesso à fonteDOIHow to cite
    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: 06 nov. 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 nov. 06 ] 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 nov. 06 ] Available from: https://doi.org/10.1016/j.entcs.2019.08.001
  • Source: Electronic Notes in Theoretical Computer Science. Unidade: IME

    Assunto: CIÊNCIA DA COMPUTAÇÃO

    Acesso à fonteDOIHow to cite
    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: 06 nov. 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 nov. 06 ] 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 nov. 06 ] Available from: https://doi.org/10.1016/j.entcs.2014.06.001
  • 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

    Acesso à fonteDOIHow to cite
    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: 06 nov. 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 nov. 06 ] 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 nov. 06 ] Available from: https://doi.org/10.1016/j.entcs.2005.03.010
  • 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

    Acesso à fonteDOIHow to cite
    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: 06 nov. 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 nov. 06 ] 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 nov. 06 ] Available from: https://doi.org/10.1016/S1571-0661(04)05025-X
  • Source: Electronic Notes in Theoretical Computer Science. Conference titles: Workshop on Logic, Language, Information and Computation - WoLLIC. Unidade: IME

    Subjects: INTELIGÊNCIA ARTIFICIAL, REPRESENTAÇÃO DE CONHECIMENTO

    Acesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      FINGER, Marcelo e WASSERMANN, Renata. The universe of approximations. 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)80847-8. Acesso em: 06 nov. 2025. , 2003
    • APA

      Finger, M., & Wassermann, R. (2003). The universe of approximations. 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)80847-8
    • NLM

      Finger M, Wassermann R. The universe of approximations [Internet]. Electronic Notes in Theoretical Computer Science. 2003 ; 84 91-104.[citado 2025 nov. 06 ] Available from: https://doi.org/10.1016/S1571-0661(04)80847-8
    • Vancouver

      Finger M, Wassermann R. The universe of approximations [Internet]. Electronic Notes in Theoretical Computer Science. 2003 ; 84 91-104.[citado 2025 nov. 06 ] Available from: https://doi.org/10.1016/S1571-0661(04)80847-8
  • 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

    Versão PublicadaAcesso à fonteDOIHow to cite
    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: 06 nov. 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 nov. 06 ] 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 nov. 06 ] Available from: https://doi.org/10.1016/S1571-0661(04)80536-X

Digital Library of Intellectual Production of Universidade de São Paulo     2012 - 2025