Table Of Content

Theoretical Computer Science 84 (1991) 313 Elsevier Author Index Volume 84 (1991) (The issue number is given in front of the page numbers) Ausiello, G., M. Dezani-Ciancaglini and S. Ronchi della Rocca, Preface to the Special Issue on 16th International Colloquium on Automata, Languages and Programming, Stresa, Italy, July 11-15, 1989 (Algorithms, automata, complexity and games) (1) 1 Baldwin, W.A. and G.O. Strawn, Multidimensional trees ( Note) (2) 293-311 Beauquier, D. and J.-E. Pin, Languages and scanners (1) 3- 21 Becker, B. and U. Sparmann, Computations over finite monoids and their test complexity (2) 225-250 Beigel, R., Bounded queries to SAT and the Boolean hierarchy (2) 199-223 Brassard, G., C. Crépeau and M. Yung, Constant-round perfect zero-knowledge compu- tationally convincing protocols (1) 23- 52 Bruyére, V., Maximal codes with bounded deciphering delay (1) 53- 76 Chazelle, B., H. Edelsbrunner, L.J. Guibas and M. Sharir, A singly exponential stratification scheme for real semi-algebraic varieties and its applications (1) 77-105 Clausen, M., A. Dress, J. Grabmeier and M. Karpinski, On zero-testing and interpolation of k-sparse multivariate polynomials over finite fields (2) 151-164 Crépeau, C., see G. Brassard (1) 23- 52 Dassow, J. and H. Jiirgensen, Deterministic soliton automata with a single exterior note ( Note) (2) 281-292 Dezani-Ciancaglini, M., see G. Ausiello (1) 1 Dress, A., see M. Clausen (2) 151-164 Edelsbrunner, H., see B. Chazelle (1) 77-105 Gambosi, G., E. Nardelli and M. Talamo, A pointer-free data structure for merging heaps and min-max heaps (1) 107-126 Grabmeier, J., see M. Clausen (2) 151-164 Guibas, L.J., see B. Chazelle (1) 77-105 JurgensenH,. , see J.D assow (2) 281-292 Karpinski, M., see M. Clausen (2) 151-164 Maurer, H.A., A. Salomaa and D. Wood, Bounded delay L codes (N ote) (2) 265-279 Moran, S. and Y. Wolfstahl, Optimal covering of cacti by vertex-disjoint paths (2) 179-197 Nardelli, E., see G. Gambosi (1) 107-126 Papadimitriou, C.H. and M. Yannakakis, Shortest paths without a map (1) 127-150 Pin, J.-E., see D. Beauquier (1) 3- 21 Ronchi della Rocca, see G. Ausiello (1) 1 Rupert, C.P., Which Kleene semigroups are finite? ( Note) (2) 251-264 Salomaa, A., see H.A. Maurer (2) 265-279 Saoudi, A., Generalized automata on infinite trees and Muller-McNaughton’s Theorem (2) 165-177 Sharir, M., see B. Chazelle (2) 77-105 Sparmann, U., see B. Becker (2) 225-250 Strawn, G.O., see W.A. Baldwin (2) 293-311 Talamo, M., see G. Gambosi (1) 107-126 Wolfstahl, Y., see S. Moran (2) 179-197 Wood, D., see H.A. Maurer (2) 265-279 Yannakakis, M., see C.H. Papadimitriou (1) 127-150 Yung, M., see G. Brassard (1) 23- 52