Table Of Content

Theoretical Computer Science 123 (1994) 429-430 Elsevier Author Index Volume 123 (1993) (The issue number is given in front of the page numbers) Allouche, J.-P., Note on the cyclic towers of Hanoi 2- 7 Aoki, K., J. Shinoda and T. Tsuda, On IT, theories of hp-T degrees of low sets 315-327 Assous, M.R., V. Bouchitté, C. Charretton and B. Rozoy, Finite labelling problem in event structures 9- 19 Bennett, G., Double dipping: the case of the missing binomial coefficient identities (Mathematical Games) 351-375 Bertrand, A., Sur une conjecture d’Yves Métivier 21- 30 Bertrand, C., A natural semantics of first-order type dependency 31- 53 Birget, J.-C., S.W. Margolis and J.C. Meakin, The word problem for inverse monoids presented by one idempotent relator (2) 273-289 Blanchard, F. and S. Fabre, Quelques procédés engendrant des suites infinies (1) 55- 60 Blanchet-Sadri, F., Equations and monoid varieties of dot-depth one and two (2) 239-258 Borel, J.-P., Symbolic representation of piecewise linear functions on the unit interval and application to discrepancy 61— 87 Bouchitte, V., see M.R. Assous 9- 19 Burckel, S., Functional equations associated with congruential functions (Note) 397-406 Charretton, C., see M.R. Assous 9- 19 Chaunier, C. and N. Lygerds, Le nombre de posets a isomorphie prés ayant 12 éléments 89- 94 Clerbout, M. and D. Gonzalez, Atomic semicommutations 259-272 Daude, H. and B. Vallée, An upper bound on the average number of iterations of the LLL algorithm 95-115 Duval, D. and P. Senéchaud, Sketches and parametrization 117-130 Fabre, S., see F. Blanchard 55-— 60 Faure, H., Méthodes quasi-Monte-Carlo multidimensionnelles 131-137 Flajolet, Ph., P. Grabner, P. Kirschenhofer, H. Prodinger and R. Tichy, Mellin transforms and asymptotics: digital sums 2) 291-314 Gonzalez, D., see M. Clerbout 2) 259-272 Grabner, P., see Ph. Flajolet (2) 291-314 Hemaspaandra, E. and L.A. Hemaspaandra, Quasi-injective reductions (Note) (2) 407-413 Hemaspaandra, L.A., see E. Hemaspaandra (2) 407-413 Huynh, D.T. and Lu Tian, Deciding bisimilarity of normed context-free processes is in £5 (2) 183-197 Iwata, S. and T. Kasai, The Othello game on an nxn board is PSPACE-complete (Mathematical Games) 329-340 Kasai, T., see S. Iwata 329-340 Kirschenhofer, P., see Ph. Flajolet 291-314 Klawe, M.M., Shallow grates (Note) 389-395 Kowalski, Z.S., Multiple returns under a bounded number of iterations 139-144 Kozen, D. and S. Zaks, Optimal bounds for the change-making problem (Note) 377-388 Lygeros, N., see C. Chaunier 89— 94 Margolis, S.W., see J.-C. Birget 273-289 Martin, B., A universal cellular automaton in quasi-linear time and its S-m-n form 2) 199-237 Elsevier Science B.V. 430 Author Index Volume 123 Mauduit, C. and J.-L. Nicolas, Preface to the Special Issue on Number Theory, Combina- torics and Applications to Computer Sciences (selected papers of the Tenth “Journées Mathématiques-Informatique”, Marseille, October 14-16, 1991) 1 Meakin, J.C., see J.-C. Birget 273-289 Mey, D., Finite games for a predicate logic without contractions (Mathematical Games) 341-349 Mignotte, M., Sur l’'equation de Catalan, II 145-149 Monien, B., W. Rytter and H. Schapers, Fast recognition of deterministic cfl’s with smaller number of processors (Corrigendum) 427 Nicolas, J.-L., see C. Mauduit 1 Nishimura, N., Restricted CRCW PRAMs (Note) 415-426 Prodinger, H. see Ph. Flajolet 291-314 Remila, E., A linear algorithm to tile the trapezes with h, and v, 151-165 Rozoy, B., see M.R. Assous 9- 19 Rytter, W., see B. Monien 427 Schapers, H., see B. Monien 427 Senéchaud, P., see D. Duval 117-130 Shinoda, J., see K. Aoki 315-327 Tian, Lu, see D.T. Huynh 183-197 Tichy, R., see Ph. Flajolet 291-314 Tsuda, T., see K. Aoki 315-327 Vallée, B., see H. Daudé 95-115 Ye, X.D., Coexistence of uniquely ergodic subsystems of interval mappings 167-181 Zaks, S., see D. Kozen (2) 377-388