Discrete Mathematics & Theoretical Computer Science

Volume 2 (1998)

If you select a title you will receive more information about the paper and the option to download the paper in PostScript or in Acrobat PDF form:

Contents
001-025	SOUR graphs for efficient completion Christopher Lynch and Polina Strogova
027-033	Right-cancellability of a family of operations on binary trees Philippe Duchon
035-047	Lower bounds for sparse matrix vector multiplication on hypercubic networks Giovanni Manzini
047-061	Object grammars and random generation I. Dutour, J.M. Fedou