Tome 30 (1996) no. 4

Sommaire

A Markovian concurrency measure
p. 295-304
Average case analysis of fully dynamic reachability for directed graphs
p. 305-318
Algorithme de Bareiss, algorithme des sous-résultants
p. 319-347
On free inverse monoid languages
p. 349-378