Computer Science ELSEVIER Theoretical Computer Science 220 (1999) 517-523 www.elsevier.com/locate/tcs Master index volumes 211-220 (For the sake of simplicity and uniformity, all names beginning with articles or prepositions are listed as if written as single words) s ‘ . Aceto, L. and J.F. Groote, A complete equational axiomatization for MPA with string iteration 211 (1-2) (1999) 339-374 Aguilera, M.K., W. Chen and S. Toueg, Using the heartbeat failure detector for quiescent reliable communication and consensus in partitionable networks 220 (1) (1999) 3-30 Allouche, J.-P., Transcendence of formal power series with rational coefficients 218 (1) (1999) 143-160 Alur, R., L. Fix and T.A. Henzinger, Event-clock automata: a determinizable class of timed automata 211 (1-2) (1999) 253-273 Ambainis, A., S. Jain and A. Sharma, Ordinal mind change complexity of language identification 220 (2) (1999) 323-343 2 Andersson, A., P.B. Miltersen and M. Thorup, Fusion trees can be implemented with AC° instructions only (Note) 215 (1-2) (1999) 337-344 Andreae, T., F. Hartenstein and A. Wolter, A two-person game on graphs where each player tries to encircle his opponent’s men (Mathematical Games) 215 (1-2) (1999) 305-323 Andresen, B., see Y. Nourani 215 (1-2) (1999) 51-68 Apsitis, K., S. Arikawa, R. Freivalds, E. Hirowatari and C.H. Smith, On the inductive inference of recursive real-valued functions 219 (1-2) (1999) 3-17 Arikawa, S., see K. Apsitis 219 (1-2) (1999) 3-17 Autebert, J.-M., Some results about centralized PC grammar systems (Note) 215 (1-2) (1999) 383-398 Bandini, S. and G. Mauri, Foreword 217 (1) (1999) 1-2 Bandini, S. and G. Mauri, Multilayered cellular automata 217 (1) (1999) 91-113 Barcucci, E., A.D. Lungo and E. Pergola, Random generation of trees and other combinatorial objects 218 (2) (1999) 219-232 Bazzi, R.A., see G. Neiger 220 (1) (1999) 31-65 B-imel, A. and M. Franklin, Reliable communication over partially authenticated networks 220(1) (1999) 185-210 Benke, M., Some complexity bounds for subtype inequalities 212 (1-2) (1999) 3-27 Berarducci, A. and M. Dezani-Ciancaglini, Infinite A-calculus and types 212 (1-2) (1999) 29-75 Berline, C. and K. Grue, A x-denotational semantics for map theoory in ZFC + SI [Theoret. Comput. Sci 179 (1997) 137-202] (Addendum) 211 (1-2) (1999) 397-398 Berstel, J. and L. Boasson, Partial words and a theorem of Fine and Wilf 218 (1) (1999) 135-141 Best, E., see M. Koutny 211 (1-2) (1999) 1-83 Bignone, F.A., Coupled map lattices dynamics on a variable space for the study of development: A general discussion on Caenorhabditis elegans 217 (1) (1999) 157-172 Blanck, J., Effective domain representations of #(X), the space of compact subsets 219 (1-2) (1999) 19-48 Bloo, R. and H. Geuvers, Explicit substitution. On the edge of strong normalization 211 (1-2) (1999) 375-395 Boasson, L., see J. Berstel 218 (1) (1999) 135-141 Bohm, C. and I. Guessarian, Foreword 212 (1-2) (1999) 1-2 Boldi, P. and S. Vigna, Equality is a jump 219 (1-2) (1999) 49-64 Boley, H., Functional-logic integration via minimal reciprocal extensions 212 (1-2) (1999) 77-99 Elsevier Science B.V. 518 Master index volumes 211-220 / Theoretical Computer Science 220 (1999) 517-523 Bono, V. and M. Bugliesi, Matching for the lambda calculus of objects 212 (1-2) (1999) 101-140 Boufkhad, Y. and O. Dubois, Length of prime implicants and number of solutions of random CNF formulae (Fundamental Study) 215 (1-2) (1999) 1-30 Brattka, V. and K. Weihrauch, Computability on subsets of Euclidean space I: closed and compact subsets 219 (1-2) (1999) 65-93 Bridges, D.S., Constructive mathematics: a foundation for computable analysis 219 (1-2) (1999) 95-109 Bruyére, V. and D. Perrin, On maximal bifix codes 218 (1) (1999) 107-121 Bruyére, V. and C. Reutenauer, A proof of Choffrut’s theorem on subsequential functions (Note) 215 (1-2) (1999) 325-327 Buchholz, P., Exact performance equivalence: An equivalence relation for stochastic automata 215 (1-2) (1999) 263-287 Bugliesi, M., see V. Bono =2 12 (1-2) (1999) 101-140 Burmeister, P.. M. Monserrat, F. Rossello and G. Valiente, Algebraic transformation of unary partial algebras II: Single-pushout approach 216 (1-2) (1999) 311-362 Carpi, A., On abelian squares and substitutions 218 (1) (1999) 61-81 Cassaigne, J., Limit values of the recurrence quotient of Sturmian sequences 218 (1) (1999) 3-12 Castelli, M.G., F. Mignosi and A. Restivo, Fine and Wilf’s Theorem for three periods and a generalization of Sturmian words 218 (1) (1999) 83-94 Cattaneo, G., E. Formenti, L. Margara and G. Mauri, On the dynamical behavior of chaotic cellular automata 217 (1) (1999) 31-51 Cenzer, D. and J.B. Remmel, Index sets in computable analysis 219 (1-2) (1999) 111-150 Cerone, A. and A. Maggiolo-Schettini, Time-based expressivity of time Petri nets for system specification (Tutorial) 216 (1-2) (1999) 1-53 Chadzelek, T. and G. Hotz, Analytic machines 219 (1-2) (1999) 151-167 Champarnaud, J.-M., see D. Ziadi 215 (1-2) (1999) 69-87 Chaudhuri, S., M. Herlihy and M.R. Tuttle, wait-free implementations in message-passing systems 220(1) (1999) 211-245 Chen, W., see M.K. Aguilera 220 (1) (1999) 3-30 Chen, Z.-Z., see R. Uehara 215 (1-2) (1999) 89-98 Chopard, B. and P.O. Luthi, Lattice Boltzmann computations and applications to physics 217 (1) (1999) 115-130 Chwa, K.-Y., see O.-K. Kwon 215 (1-2) (1999) 209-223 Clerbout, M., Y. Roos and I. Ryl, Synchronization languages 215 (1-2) (1999) 99-121 Comini, M. and M.C. Meo, Compositionality properties of SLD-derivations 211 (1-2) (1999) 275-309 Crochemore, M., L. Gasieniec and W. Rytter, Constant-space string-matching in sublinear average time 218 (1) (1999) 197-203 Csuhaj-Varju, E. and C. Vaszil, On the computational completeness of context-free parallel communicating grammar systems (Note) 215 (1-2) (1999) 349-358 d’Andrea, G. and C. Fiorio, Maximal superpositions of horizontally convex polynominoes 218 (2) (1999) 273-283 Degano, P. and C. Priami, Non-interleaving semantics for mobile processes 216 (1-2) (1999) 237-270 de Luca, A.. On the combinatorics of finite words 218 (1) (1999) 13-39 Delorme, M., J. Mazoyer and L. Tougne, Discrete parabolas and circles on 2D cellular automata 218 (2) (1999) 347-417 Denise, A. and P. Zimmermann, Uniform random generation of decomposable structures using floating- point arithmetic 218 (2) (1999) 233-248 Dezani-Ciancaglini, M., see A. Berarducci 212 (1-2) (1999) 29-75 Di Gregorio, S., R. Serra and M. Villani, Applying cellular automata to complex environmental problems: The simulation of the bioremeidation of contaminated soils 217 (1) (1999) 131-156 Didier, G., Caractérisation des N-écritures et application a l'étude des suites de complexité ultimement n+c" 215 (1-2) (1999) 31-49 Dubois, O., see Y. Boufkhad 215 (1-2) (1999) 1-30 Duquenne, V., Latticial structures in data analysis 217 (2) (1999) 407-436 Durand, B. and A.-C. Fabret, On the complexity of deadlock detection in families of planar nets 215 (1-2) (1999) 225-237 Master index volumes 211-220 / Theoretical Computer Science 220 (1999) 517-523 519 Dyckhoff, R. and L. Pinto, Permutability of proofs in intuitionistic sequent calculi 212 (1-2) (1999) 141-155 Edalat, A. and P. Siinderhauf, Computable Banach spaces via domain theory 219 (1-2) (1999) 169-184 Emms, M. and H. Leib, Extending the type checker of Standard ML by polymorphic recursion 212 (1-2) (1999) 157-181 Engelfriet, J. and T. Gelsema, Multisets and structural congruence of the pi-calculus with replication 211 (1-2) (1999) 311-337 Fabret, A.-C., see B. Durand 215 (1-2) (1999) 225-237 Fadel, R., K.V. Jakobsen, J. Katajainen and J. Teuhola, Heaps and heapsort on secondary storage 220 (2) (1999) 345-362 Fekete, A., D. Gupta, V. Luchangco, N. Lynch and A. Shvartsman, Eventually-serializable data services 220 (1) (1999) 113-156 Ferenczi, S. and Z. Kasa, Complexity for finite factors of infinite sequences 218 (1) (1999) 177-195 Ferreira, W. and M. Hennessy, A behavioural theory of first-order CML (Fundamental Study) 216 (1-2) (1999) 55-107 Fiorio, C., see G. Andrea 218 (2) (1999) 273-283 Fischer, H. and H. Flanders, A minimal code list (Note) 215 (1-2) (1999) 345-348 Fishburn, P., Preference structures and their numerical representations 217 (2) (1999) 359-383 Fix, L.. see R. Alur 211 (1-2) (1999) 253-273 Flajolet, P., Singularity analysis and asymptotics of Bernoulli sums (Note) 215 (1-2) (1999) 371-381 Flanders, H., see H. Fischer 215 (1-2) (1999) 345-348 Formenti, E., see G. Cattaneo 217 (1) (1999) 31-51 Fraenkel, A.S. and J. Simpson, The exact number of squares in Fibonacci words 218 (1) (1999) 95-106 Franklin, M., see A. Beimel 220 (1) (1999) 185-210 Freivalds, R., see K. Apsitis 219 (1-2) (1999) 3-17 Ganter, B., Attribute exploration with background knowledge 217 (2) (1999) 215-233 Gehrke, J.E., C.G. Plaxton and R. Rajaraman, Rapid convergence of a local load balancing algorithm for asynchronous rings 220 (1) (1999) 247-265 Gelsema, T., see J. Engelfriet 211 (1-2) (1999) 311-337 Geuvers, H., see R. Bloo 211 (1-2) (1999) 375-395 Giacobazzi, R. and F. Ranzato, The reduced relative power operation on abstract domains (Fundamental Study) 216 (1-2) (1999) 159-211 Giammarresi, D. and R. Montalbano, Deterministic generalized automata 215 (1-2) (1999) 191-208 Goles, E. and |. Rapaport, Tiling allowing rotations only 218 (2) (1999) 285-295 Griitzer, G., Congruence lattices 101 217 (2) (1999) 279-289 Gratzer, G., E.T. Schmidt, Some combinatorial aspects of congruence lattice representations 217 (2) (1999) 291-300 Grigorchuk, R.I. and A. Machi, An example of an indexed language of intermediate growth (Note) 215 (1-2) (1999) 325-327 Grotte, J.F., see L. Aceto 211 (1-2) (1999) 339-374 Grue, K., see C. Berline 211 (1-2) (1999) 397-398 Guessarian, L., see C. Bohm = 212 (1-2) (1999) 1-2 Gumm, H.P., Generating algebraic laws from imperative programs 217 (2) (1999) 385-405 Gupta, D., see A. Fekete 220 (1) (1999) 113-156 Gasieniec, L., see M. Crochemore 218 (1) (1999) 197-203 Hagauer, J.. W. Imrich and S. Klavzar, Recognizing median graphs in subquadratic time 215 (1-2)(1999) 123-136 Harland, J., Foreword 220 (2) (1999) 321-322 Hartenstein, F., see T. Andreae 215 (1-2) (1999) 305-323 He, X., see R. Uehara 215 (1-2) (1999) 89-98 Hemmerling, A.. On approximate and algebraic computability over the real numbers 219 (1-2) (1999) 185-223 Hennessy, M., see W. Ferreira 216 (1-2) (1999) 55-107 Henzinger, T.A., see R. Alur 211 (1-2) (1999) 253-273 Herlihy, M., see S. Chaudhuri 220 (1) (1999) 211-245 520 Master index volumes 211-220 | Theoretical Computer Science 220 (1999) 517-523 Hertling, P., An effective Riemann Mapping Theorem 219 (1-2) (1999) 225-265 Hirowatari, E., see K. Apsitis 219 (1-2) (1999) 3-17 Honsell, F. and M. Lenisa, Semantical analysis of perpetual strategies in /-calculus 212 (1-2) (1999) 183-209 Hotz, G., see T. Chadzelek 219 (1-2) (1999) 151-167 Houle, M.E., E. Tempero and G. Turner, Optimal dimension-exchange token distribution on complete binary trees 220 (2) (1999) 363-376 lliopoulos, C. and L. Mouchard, Quasiperiodicity and string covering 218 (1) (1999) 205-216 Imrich, W., see J. Hagauer 215 (1-2) (1999) 123-136 Intrigila, B. and M. Venturini Zilli, Orders, reduction graphs and spectra 212 (1-2) (1999) 211-231 Jain, S., see A. Ambainis 220 (2) (1999) 323-343 Jakobsen, K.V., see R. Fadel 220 (2) (1999) 345-362 Jia, X., see L. Wang 215 (1-2) (1999) 359-370 Kasa, Z., see S. Ferenczi 218 (1) (1999) 177-195 Karhumiaki, J., W. Plandowski and W. Rytter, Generalized factorizations of words and their algorithmic properties 218 (1) (1999) 123-133 Katajainen, J.. see R. Fadel 220 (2) (1999) 345-362 Klavzar, S., see J. Hagauer 215 (1-2) (1999) 123-136 Ko, K.-L., see A. Nerode 219 (1-2) (1999) 1-2 Koiran, P., Elimination of parameters in the polynomial hierarchy 215 (1-2) (1999) 289-304 Kolpakov, R., G. Kucherov and Y. Tarannikov, On repetition-free binary words of minimal density 218 (1) (1999) 161-175 Koutny, M. and E. Best, Operational and denotational semantics for the box algebra (Fundamental Study) 211 (1-2) (1999) 1-83 Kucherov, G., see R. Kolpakov 218 (1) (1999) 161-175 Kushner, B.A., Markov’s constructive analysis; a participant’s view 219 (1-2) (1999) 267-285 Kutrib, M., Pushdown cellular automata 215 (1-2) (1999) 239-261 Kutten, S. and B. Patt-Shamir, Stabilizing time-adaptive protocols 220 (1) (1999) 93-111 Kwon, O.-H and K.-Y. Chwa, Scheduling parallel tasks with individual deadlines 215 (1-2) (1999) 209-223 Leib, H., see M. Emms_ 212 (1-2) (1999) 157-181 Leino, K.R.M. and R. Manohar, Joining specification statements 216 (1-2) (1999) 375-394 Lenisa, M., see F. Honsell 212 (1-2) (1999) 183-209 Levi, F.. A compositional y-calculus proof system for statecharts processes 216 (1-2) (1999) 271-310 Levitt, K.N., see C. Zhang 216 (1-2) (1999) 213-235 Liu, C. and M.A. Orgun, Verification of reactive systems using temporal logic with clocks 220 (2) (1999) 377-408 Louchard, G., Asymptotic properties of some underdiagonal walks generation algorithms 218 (2) (1999) 249-262 Lowe, W., see M. Middendorf 215 (1-2) (1999) 137-168 Luchangco, V., see A. Fekete 220 (1) (1999) 113-156 Lui, K.-S. and S. Zaks, Scheduling in synchronous networks and the greedy algorithm 220 (1) (1999) 157-183 Lungo, A.D., see E. Barcucci 218 (2) (1999) 219-232 Luthi, P.O., see B. Chopard =2 17 (1) (1999) 115-130 Lynch, N., see A. Fekete 220 (1) (1999) 113-156 Lynch, N., N. Shavit, A. Shvartsman and D. Touitou, Timing conditions for linearizability in uniform counting networks 220 (1) (1999) 67-91 Machi, A., see R.I. Grigorchuk 215 (1-2) (1999) 325-327 Maggiolo-Schettini, A., see A. Cerone 216 (1-2) (1999) 1-53 Manohar, R., see K.R.M. Leino 216 (1-2) (1999) 375-394 Margara, L., see G. Cattaneo 217 (1) (1999) 31-51 Mason, I.A. and C.L. Talcott, Actor languages. Their syntax, semantics, translation, and equivalence 220 (2) (1999) 409-467 Mauri, G., see S. Bandini 217 (1) (1999) 1-2 Master index volumes 211-220 | Theoretical Computer Science 220 (1999) 517-523 Mauri, G., see S. Bandini 217 (1) (1999) 91-113 Mauri, G., see G. Cattaneo 217 (1) (1999) 31-51 Mavronicolas, M., Foreword 220 (1) (1999) 1 Mavronicolas, M. and D. Roth, Linearizable read/write objects 220 (1) (1999) 267-319 Mazoyer, J. and V. Terrier, Signals in one-dimensional cellular automata 217 (1) (1999) 53-80 Mazoyer, J.. see M. Delorme 218 (2) (1999) 347-417 Mazoyer, J., Pinzani, R. and J.-G. Penaud, Avant Propos 218 (2) (1999) 217-218 Melangon, G., Large Lyndon words and singular factors of Sturmian words 218 (1) (1999) 41-59 Meo, M.C., see M. Comini 211 (1-2) (1999) 275-309 Middendorf, M., W. Lowe and W. Zimmermann, Scheduling inverse trees under the communication model of the LogP-machine 215 (1-2) (1999) 137-168 Mignosi, F., see M.G. Castelli 218 (1) (1999) 83-94 Mihalache, V., Decidability problems in grammar systems 215 (1-2) (1999) 169-189 Miltersen, P.B.. see A. Andersson 215 (1-2) (1999) 337-344 Monserrat, M., see P. Burmeister 216 (1-2) (1999) 311-362 Montalbano, R., see D. Giammarresi 215 (1-2) (1999) 191-208 Mori, T., see M. Yasugi 219 (1-2) (1999) 467-486 Mosbah, M. and N. Saheb, Non-uniform random spanning trees on weighted graphs 218 (2) (1999) 263-271 Mouchard, L., see C. Iliopoulos 218 (1) (1999) 205-216 Miller, N.Th., Computability on random variables 219 (1-2) (1999) 287-299 Neiger, G. and R.A. Bazzi, Using knowledge to optimally achieve coordination in distributed systems 220 (1) (1999) 31-65 Neraud, J., Preface 218 (1) (1999) 1 Nerode, A., K.-I. Ko and K. Weihrauch, Foreword 219 (1-2) (1999) 1-2 Nourani, Y. and B. Andresen, Exploration of NP-hard enumeration problems by simulated annealing - the spectrum values of permanents 215 (1-2) (1999) 51-68 Novak, E. and H. Wozniakowski, On the cost of uniform and nonuniform algorithms 219 (1-2) (1999) 301-318 Olsson, R.A., see C. Zhang 216 (1-2) (1999) 213-235 Orgun, M.A., see C. Liu 220 (2) (1999) 377-408 Patt-Shamir, B., see S. Kutten 220 (1) (1999) 93-111 Penaud, J.-G., see J. Mazoyer 218 (2) (1999) 217-218 Pergola, E., see E. Barcucci 218 (2) (1999) 219-232 Pinto, L., see R. Dyckhoff 212 (1-2) (1999) 141-155 Pinzani, R., see J. Mazoyer 218 (2) (1999) 217-218 Piperno, A., An algebraic view of the BGhm-out technique 212 (1-2) (1999) 233-246 Plandowski, W., see J. Karhumaki 218 (1) (1999) 123-133 Plaxton, C.G., see J.E. Gehrke 220 (1) (1999) 247-265 Pour-El, M.B., From axiomatics to intrinsic characterization: some open problems in computable analysis 219 (1-2) (1999) 319-329 Priami, C., see P. Degano 216 (1-2) (1999) 237-270 Rajaraman, R., see J.E. Gehrke 220 (1) (1999) 247-265 Ranzato, F., see R. Giacobazzi 216 (1-2) (1999) 159-211 Rapaport, L., see E. Goles 218 (2) (1999) 285-295 Reed, G.M. and A.W. Roscoe, The times failures — Stability model for CSP (Fundamental Study) 211 (1-2) (1999) 85-127 Remmel, J.B., see D. Cenzer 219 (1-2) (1999) 111-150 Restivo, A., see M.G. Castelli 218 (1) (1999) 83-94 Reutenauer, C., see V. Bruyére 215 (1-2) (1999) 325-327 Rival, I. and N. Zaguia, Editorial 217 (2) (1999) 173 Roberts, A. and A. Symvonis, On-line matching routing on trees 220 (2) (1999) 469-488 Roos, Y., see M. Clerbout 215 (1-2) (1999) 99-121 Roscoe, A.W., see G.M. Reed 211 (1-2) (1999) 85-127 Rossello, F.. see P. Burmeister 216 (1-2) (1999) 311-362 Master index volumes 211-220 ;T heoretical Computer Science 220 (1999) 517-523 Roth, D., see M. Mavronicolas 220 (1) (1999) 267-319 Ryl, L, see M. Clerbout 215 (1-2) (1999) 99-121 Rytter, W., see J. Karhumaki =2 18 (1) (1999) 123-133 Rytter, W., see M. Crochemore 218 (1) (1999) 197-203 Saheb, N., see M. Mosbah 218 (2) (1999) 263-271 Sander, G., Graph layout for applications in compiler construction 217 (2) (1999) 175-214 Schmid, J., Boolean layer cakes 217 (2) (1999) 255-278 Schmidt, E.T., see G. Gratzer 217 (2) (1999) 291-300 Schmidt-SchauB, M., Decidability of behavioural equivalence in unary PCF 216 (1-2) (1999) 363-373 Schréder, B.S.W., Algorithms for the fixed point property 217 (2) (1999) 301-358 Schréder, M., Online computations of differentiable functions 219 (1-2) (1999) 331-345 Schwichtenberg, H., Termination of permutative conversions in intuitionistic Gentzen calculi 212 (1-2) (1999) 247-260 Serra, R., see 8. Di Gregorio 217 (1) (1999) 131-156 Sharma, A., see A. Ambainis 220 (2) (1999) 323-343 Shavit, N., see N. Lynch 220 (1) (1999) 67-91 Shvartsman, A., see A. Fekete 220 (1) (1999) 113-156 Shvartsman, A., see N. Lynch 220 (1) (1999) 67-91 Simplot, D., A characterization of recognizable picture languages by tilings by finite sets 218 (2) (1999) 297-323 Simpson, J., see A.S. Fraenkel 218 (1) (1999) 95-106 Sipper, M. and M. Tomassini, Computation in artificially evolved, non-uniform cellular automata 217 (1) (1999) 81-98 Smith, C.H., see K. Apsitis 219 (1-2) (1999) 3-17 Spreen, D., On functions preserving levels of approximation: A refined model construction for various lambda calculi 212 (1-2) (1999) 261-303 Stoltenberg-Hansen, V. and J.V. Tucker, Concrete models of computation for topological algebras 219 (1-2) (1999) 347-378 Stone, M., Representing scope in intuitionistic deductions (Fundamental Study) 211 (1-2) (1999) 129-188 Siinderhauf, P., see A. Edalat 219 (1-2) (1999) 169-184 Sun, Y., An algebraic generalization of Frege structures - binding algebras 211 (1-2) (1999) 189-232 Symvonis, A., see A. Roberts 220 (2) (1999) 469-488 Talcott, C.L., see LA. Mason 220 (2) (1999) 409-467 Tamassia, R., Advances in the theory and practice of graph drawing 217 (2) (1999) 235-254 Tarannikov, Y., see R. Kolpakov 218 (1) (1999) 161-175 Tempero, E., see M.E. Houle 220 (2) (1999) 363-376 Terrier, V., see J. Mazoyer 217 (1) (1999) 53-80 Teirier, V.. Two-dimensional cellular automata recognizer 218 (2) (1999) 325-346 Teuhola, J., see R. Fadel 220 (2) (1999) 345-362 Thorup, M., see A. Andersson 215 (1-2) (1999) 337-344 Tomassini, M., see M. Sipper 217 (1) (1999) 81-98 Toueg, S., see M.K. Aguilera 220 (1) (1999) 3-30 Tougne, L., see M. Delorme 218 (2) (1999) 347-417 Touitou, D., see N. Lynch 220 (1) (1999) 67-91 Troelstra, A.S., From constructivism to computer science 211 (1-2) (1999) 233-252 Tsujii, Y., see M. Yasugi 219 (1-2) (1999) 467-486 Tucker, J.V. and J.1. Zucker, Computation by ‘While’ programs on topological partial algebras 219 (1-2) (1999) 379-420 Tucker, J.V., see V. Stoltenberg-Hansen 219 (1-2) (1999) 347-378 Turner, G., see M.E. Houle 220 (2) (1999) 363-376 Tuttle, M.R., see S. Chaudhuri 220 (1) (1999) 211-245 Uehara, R., Z.-Z. Chen and X. He, Fast RNC and NC algorithms for maximal path sets 215 (1-2) (1999) 89-98 Valiente, G., see P. Burmeister 216 (1-2) (1999) 311-362 Vaszil, G., see E. Csuhaj-Varju 215 (1-2) (1999) 349-358 Master index volumes 211-220 / Theoretical Computer Science 220 (1999) 517-523 Venturini Zilli, M., see B. Intrigila 212 (1-2) (1999) 211-231 Vigna, S., see P. Boldi 219 (1-2) (1999) 49-64 Villani, M., see S. Di Gregorio 217 (1) (1999) 131-156 Wang, L. and X. Jia, Fixed topology Steiner trees and spanning forests (Note) 215 (1-2) (1999) 359-370 Weihrauch, K. and X. Zheng, Effectiveness of the global modulus of continuity on metric spaces 219(1-2) (1999) 439-450 Weihrauch, K., see A. Nerode 219 (1-2) (1999) 1-2 Weihrauch, K., see V. Brattka 219 (1-2) (1999) 65-93 Weihrauch, K., Computability on the probability measures on the Borel sets of the unit interval 219(1-2) (1999) 421-437 Wolter, A., see T. Andreae 215 (1-2) (1999) 305-323 Worsch, T., Parallel turing machines with one-head control units and cellular automata 217 (1) (1999) 3-30 Wozniakowski, H., Why does information-based complexity use the real number model? 219 (1-2) (1999) 451-465 Wozniakowski, H., see E. Novak 219 (1-2) (1999) 301-318 Yasugi, M., T. Mori and Y. Tsujii, Effective properties of sets and functions in metric spaces with computability structure 219 (1-2) (1999) 467-486 Ying, M., A shorter proof to uniqueness of solutions of equations (Note) 216 (1-2) (1999) 395-397 Zaguia, N., see 1. Rival 217 (2) (1999) 173 Zaks, S., see K.-S. Lui 220 (1) (1999) 157-183 Zhang, C., R.A. Olsson and K.N. Levitt, Formal verification of a programming logic for a distributed programming language 216 (1-2) (1999) 213-235 Zhang, Y., Specifying causality in action theories: a default logic approach 220 (2) (1999) 489-513 Zheng, X., see K. Weihrauch 219 (1-2) (1999) 439-450 Zhong, N., Computability structure of the Sobolev spaces and its applications 219 (1-2) (1999) 487-510 Ziadi, D. and J.-M. Champarnaud, An optimal parallel algorithm to convert a regular expression into its Glushkov automaton 215 (1-2) (1999) 69-87 Zimmermann, P., see A. Denise 218 (2) (1999) 233-248 Zimmermann, W., see M. Middendorf 215 (1-2) (1999) 137-168 Zucca, E., From static to dynamic abstract data-types: an institution transformation (Fundamental Study) 216 (1-2) (1999) 109-157 Zucker, J.1., see JV. Tucker 219 (1-2) (1999) 379-420