Theoretical Computer Science Theoretical Computer Science 193 (1998) 249 Author index volume 193 (1998) (The issue number is given in front of the page numbers) Alessi, F. and P. Baldan, A characterization of distance between 1-bounded compact ultrametric spaces through a universal space (1 2) 113-127 Aoyagi, S., see Y. Manabe (1 2) 97-112 Baldan, P., see F. Alessi (1 ~2) 113-127 Baldoni, R., see Y. Manabe (1 -2) 97-112 Bonsangue, M.M., F. van Breugel and J.J.M.M. Rutten, Generalized metric spaces: Completion, topology, and powerdomains via the Yoneda embedding (Fundamental i} 5 Study) (1-2) 215-244 Cadoli, M. and L. Palopoli, Circumscribing DATALOG: expressive power and complexity Drakengren, T., A decidable canonical representation of the compact elements in Scott’s (1-2) 181-195 reflexive domain in Pw ‘i-> 33-73 Edalat, A. and R. Heckmann, A computational model for metric spaces (1-2) 129-148 Esbelin, H.-A. and M. More, Rudimentary relations and primitive recursion: A toolbox (1-2) 75- 96 Ghelli, G. and B. Pierce, Bounded existentials and minimal typing (i-2). $3- 73 Heckmann, R., see A. Edalat Manabe, Y., R. Baldoni, M. Raynal and S. Aoyagi, k-Arbiter: A safe and general scheme (1-2) 97-112 for h-out of-k mutual exclusion (1-2) 129-148 More, M. see H.-A. Esbelin (1-2) 215-244 Palopoli, L., see M. Cadoli (1-2) 75- 96 Pierce, B., see G. Ghelli Rabinovich, A., On translations of temporal logic of actions into monadic second-order logic (1-2) 197-214 Raynal, M., see Y. Manabe (1-2) 97-112 Ross, K.A., D. Srivastava, P.J. Stuckey and S. Sudarshan, Foundations of aggregation (1-2) 149-179 constraints = Rutten, J.J.M.M., see M.M. Bonsangue (1-2) 149-179 Srivastava, D., see K.A. Ross (1-2) 149-179 Stuckey, P.J., see K.A. Ross (1-2) 149-179 Sudarshan, S., see K.A. Ross is is van Breugel, F., see M.M. Bonsangue Elsevier Science B.V.