Pascal and Francis Bibliographic Databases

Help

Search results

Your search

au.\*:("VENTURINI ZILLI M")

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 8 of 8

  • Page / 1
Export

Selection :

  • and

ON DIFFERENT LEINDS OF INDEFINITE. = DIFFERENTS TYPES D'INDEFINIVENTURINI ZILLI M.1974; CALCOLO; ITAL.; DA. 1974; VOL. 11; NO 1; PP. 67-77; BIBL. 8 REF.Article

COMPLEXITY OF THE UNIFICATION ALGORITHM FOR FIRST-ORDER EXPRESSIONS.VENTURINI ZILLI M.1975; CALCOLO; ITAL.; DA. 1975; VOL. 12; NO 4; PP. 361-371; BIBL. 4 REF.Article

COMPLEXITY OF THEOREM-PROVING PROCEDURES: SOME GENERAL PROPERTIES.LONGO G; VENTURINI ZILLI M.1974; REV. FR. AUTOMAT. INFORMAT. RECH. OPERAT., R; FR.; DA. 1974; VOL. 8; NO 3; PP. 5-18; BIBL. 11 REF.Article

While-programs with nondeterministic assignments and the logic ALNAMASCARI, G; VENTURINI ZILLI, M.Theoretical computer science. 1985, Vol 40, Num 2-3, pp 211-235, issn 0304-3975Article

Generalizations of unificationBERARDUCCI, A; VENTURINI ZILLI, M.Journal of symbolic computation. 1993, Vol 16, Num 5, pp 479-491, issn 0747-7171Article

Reduction graphs in the lambda calculusVENTURINI ZILLI, M; DE BAKKER, J.Theoretical computer science. 1984, Vol 29, Num 3, pp 251-275, issn 0304-3975Article

Proceedings/Advanced school on mathematical models for the semantics of parallelism, Rome, Italy, September 24 October 1, 1986VENTURINI ZILLI, M.Lecture notes in computer science. 1987, Vol 280, issn 0302-9743, V-231 pConference Proceedings

Orders, reduction graphs and spectraINTRIGILA, B; VENTURINI ZILLI, M.Theoretical computer science. 1999, Vol 212, Num 1-2, pp 211-231, issn 0304-3975Article

  • Page / 1