Table Of Content

Theoretical Computer Science 125 (1994) 385-386 Elsevier Author Index Volume 125 (1994) (The issue number is given in front of the page numbers) Akyildiz, LF. and H. von Brand, Exact solutions for networks of queues with blocking- after-service (1) 111-130 Baccelli, F.. W.A. Massey and P.E. Wright, Determining the exit time distribution for a closed cyclic network (1) 149-165 Bafna, V., B. Kalyanasundaram and K. Pruhs, Not all insertion methods yield constant approximate tours in the Euclidean plane (Note) (2) 345-353 Boxma, O.J., see M.B. Combé (1) 17- 43 Chakka, R. and I. Mitrani, Heterogeneous multiprocessor systems with breakdowns: performance and optimal repair strategies (1) 91-109 Chen, P., The communication complexity of computing differentiable functions in a multicomputer network (Note) (2) 373-383 Coffman Jr., E.G., L. Flatto, B. Poonen and P.E. Wright, The processor minimization problem with independent waiting-time constraints (1) 3- 16 Combé, M.B. and O.J. Boxma, Optimization of static traffic allocation policies (1) 17- 43 Ehrenfeucht, A., P. ten Pas and G. Rozenberg, Properties of grammatical codes of trees (2) 259-293 Flatto, L., see E.G. Coffman Jr. (1) 3- 16 Gastin, P., A. Petit and W. Zielonka, An extension of Kleene’s and Ochmanski’s theorems to infinite traces (Fundamental Study) (2) 167-204 Gelenbe, E., see I. Mitrani (1) 1 Gelenbe, E. and M. Hernandez, Virus tests to maximize availability of software systems (1) 131-147 Goles, E., Lyapunov operators to study the convergence of extremal automata (Note) (2) 329-337 Hernandez, M., see E. Gelenbe (1) 131-147 Hofri, M. and Y. Kogan, Asymptotic analysis of product-form distributions related to large interconnection networks (1) 61- 90 Ibarra, O.H., see T. Jiang (2) 243-257 Jiang, T., O.H. Ibarra and H. Wang, Some results concerning 2-D on-line tessellation acceptors and 2-D alternating finite automata (2) 243-257 Kalyanasundaram, B., see V. Bafna (2) 345-353 Kelly, F., see G. Louth (1) 45- 59 Kogan, Y., see M. Hofri (1) 61- 90 Lempel, M. and A. Paz, An algorithm for finding a shortest vector in a two-dimensional modular lattice (2) 229-241 Litow, B., A context-free language decision problem (Note) (2) 339-343 Louth, G., M. Mitzenmacher and F. Kelly, Computational complexity of loss networks (1) 45- 59 Massey, W.A., see F. Baccelli (1) 149-165 Mateescu, A., Scattered deletion and commutativity (Note) (2) 361-371 Matthews, R.E., An inherently iterative algorithm for the Grzegorczyk hierarchy (Note) (2) 355-360 Middendorf, M., More on the complexity of common superstring and supersequence problems (2) 205-228 Mitrani, I. and E. Gelenbe, Preface to the Special Issue on Probabilistic Modelling (1) 1 Mitrani, I., see R. Chakka (1) 91-109 Mitzenmacher, M., see G. Louth (1) 45- 59 Elsevier Science B.V. 386 Author Index Volume 125 Paz, A., see M. Lempel Petit, A., see P. Gastin Poonen, B., see E.G. Coffman Jr. Pruhs, K., see V. Bafna (2) 345-353 Rozenberg, G., see A. Ehrenfeucht (2) 259-293 Salomaa, K., see S. Yu (2) 315-328 ten Pas, P., see A. Ehrenfeucht (2) 259-293 von Brand, H., see I.F. Akyildiz (1) 111-130 Wang, H., see T. Jiang (2) 243-257 Wolf, M.J., Nondeterministic circuits, space complexity and quasigroups (2) 295-313 Wright, P.E., see E.G. Coffman Jr. (1) 3- 16 Wright, P.E., see F. Baccelli (1) 149-165 Yu, S., Q. Zhuang and K. Salomaa, The state complexities of some basic operations on regular languages (2) 315-328 Zhuang, Q., see S. Yu (2) 315-328 Zielonka, W., see P. Gastin (2) 167-204