Author index volume 225 (1999)

Theoretical Computer Science ELSEVIER

Theoretical

Computer

Science 225 (1999) 199 www.elsevier.com/locate/tcs

Author

index volume 225 (1999)

(The issue number

is given in front of the page numbers)

Basart, J.M. and P. Guitart, A solution for the coloured cubes problem (Note) Chuan, W.-F., Sturmian morphisms and cc-words Clementi, A.E.F. and L. Trevisan, Improved non-approximability results for minimum vertex cover with density constraints Crescenzi, P. and L. Trevisan, Max NP-completeness made easy (Fundamental Srudy) Gobel, M., The “smallest” ring of polynomial invariants of a permutation group which has no finite SAGBI bases w.r.t. any admissible order (Note) Guitart, P., see J.M. Basart Hakala, I. and J. Kortelainen, On the system of word equations Y,,u~,.~,u~I~u~x~ = y,,v~yL&y2u~y3 (i = 0, I, 2, . ..) in a free monoid Kortelainen, J., see I. Hakala Lutz, J.H. and D.L. Schweizer, Feasible reductions to Kolmogorov-Loveland stochastic sequences (Note) Pelletier, M. and J. Sakarovitch, On the representation of finite deterministic 2-tape automata (Fundamental Study) Roka, Z., Simulations between cellular automata on Cayley graphs Sakarovitch. J., see M. Pelletier Schweizer, D.L., see J.H. Lutz Trevisan, L., see P. Crescenzi Trevisan, L., see A.E.F. Clementi Wong, P.-K., Optimal path cover problem on block graphs (Note)

Elsevier Science B.V

(l-2) (l-2)

171-176 129-148

(l-2) (l-2)

113-12s 65- 79

(l-2) (l-2)

177-184 171-176

(l-2) (l-2)

149-161 149-161

(l-2)

185-194

(l-2) (l-2) (l-2) (l-2) (l-2) (l-2) (l-2)

I- 63 81-111 I- 63 185-194 65- 79 113-12X 163-169