Discrete Mathematics & Theoretical Computer Science

Volume 3:3 (1999), Special Issue: STACS'98

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
071-072	Editors foreword in postscript form, in pdf form Daniel Krob, Christophe Meinel and Michel Morvan
073-094	On the Structure of Valiant's Complexity Classes Peter Bürgisser
095-107	Partially persistent search trees with transcript operations Kim S. Larsen
109-124	Local Normal Forms for First-Order Logic with Applications to Games and Automata Thomas Schwentick and Klaus Barthelmann
125-140	Applying a uniform marked morphism to a word Anna Frid