Theoretical Computer Science tell ELSEVIER Theoretical Computer Science 172 (1997) 323 Author index volume 172 (1997) (The issue number is given in front of the page numbers) Ambos-Spies, K., S.A. Terwijn and X. Zheng, Resource bounded randomness and weakly complete problems (1-2) 195-207 Apolloni, B. and S. Chiaravalli, PAC learning of concept classes through the boundaries of their items (1-2) 91-120 Brandstadt, A., F.F. Dragan and F. Nicolai, Homogeneously orderable graphs (1-2) 209-232 Chiaravalli, S., see B. Apolloni (1-2) 91-120 Dendris, N.D., L.M. Kirousis and D.M. Thilikos, Fugitive-search games on graphs and related parameters (1-2) 233-254 Dragan, F.F., see A. Brandstadt (1-2) 209-232 Edmonds, J., Removing Ramsey theory: Lower bounds with smaller domain size (Funda- mental Study) (1-2) 1- 41 Fagnot, I., Sur les facteurs des mots automatiques (1-2) 67- 89 Fischer, P., K.-U. Hoffgen and H. Lefmann, PAC-learning from general examples (1-2) 43-— 65 Goles, E. and M. Margenstern, Universality of the chip-firing game (1-2) 121-134 Handley, W.G., Deterministic summation modulo &,,, the semigroup of binary relations on {0, 1,...,1—1} (1-2) 135-174 He, X., see G. Kant (1-2) 175-193 Hoffgen, K.-U., see P. Fischer (1-2) 43- 65 Hohl, J-C., Massively parallel factorizations of polynomials with many non-commuting variables (Note) (1-2) 255-263 Hoogeboom, H.J. and A. Muscholl, The code problem for traces — improving the boundaries (Note) (1-2) 309-321 Iliopoulos, C.S., D. Moore and W.F. Smyth, A characterization of the squares in a Fibonacci string (Note) (1-2) 281-291 Kant, G. and X. He, Regular edge labeling of 4-connected plane graphs and its applica- (1-2) 175-193 tions in graph drawing problems Kirousis, L.M., see N.D. Dendris (1-2) 233-254 (1-2) 43- 65 Lefmann, H., see P. Fischer (1-2) 121-134 Margenstern, M., see E. Goles (1-2) 281-291 Moore, D., see C.S. Iliopoulos (1-2) 309-321 Muscholl, A., see H.J. Hoogeboom Nicolai, F., see A. Brandstadt (1-2) 209-232 Rote, G., Finding a shortest vector in a two-dimensional lattice modulo m (Note) (1-2) 303-308 (1-2) 273-279 Rystsov, I., Reset words for commutative and solvable automata (Note) Savicky, P. and S. Zak, A lower bound on branching programs reading some bits twice (1-2) 293-301 (Note) (1-2) 265-271 Shimozono, S., Finding optimal subgraphs by local search (Note) (1-2) 281-291 Smyth, W.F., see C.S. Iliopoulos (1-2) 195-207 Terwijn, S.A., see K. Ambos-Spies (1-2) 233-254 Thilikos, D.M., see N.D. Dendris (1-2) 293-301 Zak, S., see P. Savicky (1-2) 195-207 Zheng, X., see K. Ambos-Spies Elsevier Science B.V.