Theoretical Computer Science 1998: Vol 200 Index

2 Pages·1998·0.2 MB·English

Theoretical
Computer Science
ELSEVIER Theoretical Computer Science 200 (1998) 367
Author index volume 200 (1998)
(The issue number is given in front of the page numbers)
Barthelmann, K., Nondeterministic operations on finite relational structures (Funda-
j-5 i-m
mental Study)
Blundo, C., L.A.F. Mattos and D.R. Stinson, Generalized Beimel—Chor schemes for
(1-2) 313-334
broadcast encryption and interactive key distribution
(1-2) 261-287
Delahaye, J.-P., see E. Rivals
(1-2) 101-134
Fujii, R.H., see L.M. Schmitt
(1-2) 205-224
Harju, T. and L. Ilie, On quasi orders of words and the confluence property
(1-2) 225-260
Hennessy, M. and J. Rathke, Bisimulations for a calculus of broadcasting systems
(1-2) 205-224
Illie, L., see T. Harju
(1-2) 185-204
Jeavons, P., On the algebraic structure of combinatorial problems
(1-2) 313-334
Mattos, L.A.F., see C. Blundo
Mundici, D. and N. Olivetti, Resolution and model building in the infinite-valued
calculus of Lukasiewicz (1-2) 335-366
Nehaniv, C.L. see L.M. Schmitt (1-2) 101-134
Nivat, M., Foreword (1-2) xl
Olivetti, N., see D. Mundici (1-2) 335-366
Rathke, J., see M. Hennessy (1-2) 225-260
Rivals, E. and J.-P. Delahaye, Optimal representation in average using Kolmogorov
(1-2) 261-287
complexity
Schmitt, L.M., C.L. Nehaniv and R.H. Fujii, Linear analysis of genetic algorithms
(1-2) 101-134
(Fundamental Study)
(1-2) 45-100
Schmitt, V., Stable trace automata vs. full trace automata (Fundamental Study)
(1-2) 313-334
Stinson, D.R., see C. Blundo
(1-2) 289-312
van de Pol, J., Operational semantics of rewriting with priorities
Zielonka, W., Infinite games on finitely coloured graphs with applications to automata on
(1-2) 135-183
infinite trees (Fundamental Study)
Elsevier Science B.V.