Catalogo Articoli (Spogli Riviste)

HELP
ATTENZIONE: attualmente gli articoli Current Contents (fonte ISI) a partire dall'anno 2002 sono consultabili sulla Risorsa On-Line

Le informazioni sugli articoli di fonte ISI sono coperte da copyright

La ricerca find articoli where authors phrase all words ' Narendran, P' sort by level,fasc_key/DESCEND, pagina_ini_num/ASCEND ha restituito 13 riferimenti
Selezionare un intervallo

Per ulteriori informazioni selezionare i riferimenti di interesse.

    1. Baader, F; Narendran, P
      Unification of concept terms in description logics

      JOURNAL OF SYMBOLIC COMPUTATION
    2. Guo, Q; Narendran, P; Wolfram, DA
      Complexity of nilpotent unification and matching problems

      INFORMATION AND COMPUTATION
    3. Degtyarev, A; Gurevich, Y; Narendran, P; Veanes, M; Voronkov, A
      Decidability and complexity of simultaneous rigid E-unification with one variable and related results

      THEORETICAL COMPUTER SCIENCE
    4. Peakman, M; Stevens, EJ; Lohmann, T; Narendran, P; Dromey, J; Alexander, A; Tomlinson, AJ; Trucco, M; Gorga, JC; Chicz, RM
      Naturally processed and presented epitopes of the islet cell autoantigen IA-2 eluted from HLA-DR4

      JOURNAL OF CLINICAL INVESTIGATION
    5. Narendran, P; Gale, EAM; Dayan, CM
      Immunotherapy and prevention of autoimmune endocrinopathies

      AUTOIMMUNE ENDOCRINOPATHIES
    6. OTTO F; NARENDRAN P; DOUGHERTY DJ
      EQUATIONAL UNIFICATION, WORD UNIFICATION, AND 2ND-ORDER EQUATIONAL UNIFICATION

      Theoretical computer science
    7. P.Narendran; F.Otto
      Single Versus Simultaneous Equational Unification and Equational unification for Variable-Permuting Theories

      Journal of automated reasoning
    8. NARENDRAN P; PFENNING F; STATMAN R
      ON THE UNIFICATION PROBLEM FOR CARTESIAN CLOSED CATEGORIES

      The Journal of symbolic logic
    9. P.Narendran; M.Rusinowitch
      Any Ground Associative-Commutative Theory has a Finite Canonical System

      Journal of automated reasoning
    10. OTTO F; NARENDRAN P
      CODES MODULO FINITE MONADIC STRING-REWRITING SYSTEMS

      Theoretical computer science
    11. OTTO F; NARENDRAN P
      CODES MODULO FINITE MONADIC STRING-REWRITING SYSTEMS

      Theoretical computer science
    12. MADLENER K; NARENDRAN P; OTTO F; ZHANG L
      ON WEAKLY CONFLUENT MONADIC STRING-REWRITING SYSTEMS

      Theoretical computer science
    13. D.Kapur; P.Narendran
      Complexity of Unification Problems with Associative-Communicative Operators

      Journal of automated reasoning


ASDD Area Sistemi Dipartimentali e Documentali, Università di Bologna, Catalogo delle riviste ed altri periodici
Documento generato il 25/01/21 alle ore 03:17:56