Le informazioni sugli articoli di fonte ISI sono coperte da copyright

Per ulteriori informazioni selezionare i riferimenti di interesse.

1. Levy, J; Veanes, M
   On the undecidability of second-order unification
   INFORMATION AND COMPUTATION
   
   J. Levy e M. Veanes, "On the undecidability of second-order unification", INF COMPUT, 159(1-2), 2000, pp. 125-150
2. 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
   
   A. Degtyarev et al., "Decidability and complexity of simultaneous rigid E-unification with one variable and related results", THEOR COMP, 243(1-2), 2000, pp. 167-184
3. Veanes, M
   Farmer's Theorem revisited
   INFORMATION PROCESSING LETTERS
   
   M. Veanes, "Farmer's Theorem revisited", INF PROCESS, 74(1-2), 2000, pp. 47-53
4. Gurevich, Y; Veanes, M
   Logic with equality: Partisan corroboration and shifted pairing
   INFORMATION AND COMPUTATION
   
   Y. Gurevich e M. Veanes, "Logic with equality: Partisan corroboration and shifted pairing", INF COMPUT, 152(2), 1999, pp. 205-235
5. VEANES M; BARKLUND J
   NATURAL CYCLETREES - FLEXIBLE INTERCONNECTION GRAPHS
   Journal of parallel and distributed computing
   
   M. Veanes e J. Barklund, "NATURAL CYCLETREES - FLEXIBLE INTERCONNECTION GRAPHS", Journal of parallel and distributed computing, 33(1), 1996, pp. 44-54
6. VEANES M; BARKLUND J
   CONSTRUCTION OF NATURAL CYCLETREES
   Information processing letters
   
   M. Veanes e J. Barklund, "CONSTRUCTION OF NATURAL CYCLETREES", Information processing letters, 60(6), 1996, pp. 313-318
7. VEANES M; BARKLUND J
   ON THE NUMBER OF EDGES IN CYCLETREES
   Information processing letters
   
   M. Veanes e J. Barklund, "ON THE NUMBER OF EDGES IN CYCLETREES", Information processing letters, 57(4), 1996, pp. 225-229