Discrete Mathematics & Theoretical Computer Science

Volume 3:2 (1999), regular papers

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
033-042	The Number of Sides of a Parallelogram Elisha Falbel and Pierre-Vincent Koseleff
043-064	Quicksort algorithm again revisited C. Knessl and W. Szpankowski
065-070	Optimal Lower Bound for Generators of Invariant Rings without Finite SAGBI Bases with Respect to Any Admissible Order Manfred Göbel