- Email: [email protected]
Author index volume 255 (2001)
Theoretical Computer Science 255 (2001) 699}700
Author index volume 255 (2001) (The issue number is given in front of the page numbers) Almeida, J. and P.V. Silva, SC-hyperdecidability of R Apolloni, B. and D. Malchiodi, Gaining degrees of freedom in subsymbolic learning Arikati, S.R., A. Dessmark, A. Lingas and M.V. Marathe, Approximation algorithms for maximum two-dimensional pattern matching Arvind, V. and J. KoK bler, On pseudorandomness and resource-bounded measure Asano, T., see S.C. Nandy Barcucci, E. and S. Rinaldi, Some linear recurrences and their combinatorial interpretation by means of regular languages (Note) Blondel, V.D., O. Bournez, P. Koiran, C.H. Papadimitriou and J.N. Tsitsiklis, Deciding stability and mortality of piecewise a$ne dynamical systems (Note) Bournez, O., see V.D. Blondel Calamoneri, T. and A. Massini, Optimal three-dimensional layout of interconnection networks Calude, C.S., P.H. Hertling, B. Khoussainov and Y. Wang, Recursively enumerable reals and Chaitin numbers Chen, C. and K. Wu, Disproving a conjecture on planar visibility graphs (Note) Chen, F., see G. Jin Chen, Y.-W. and K.-L. Chung, Improved fault-tolerant sorting algorithm in hypercubes (Note) Chung, K.-L., see Y.-W. Chen Csuhaj-VarjuH , E. and G. Vaszil, On context-free parallel communicating grammar systems: synchronization, communication, and normal forms Cucker, F., On weak and weighted computations over the real closure of 0 (Note) Dessmark, A., see S.R. Arikati de Wolf, R., see V. Halava Droubay, X., J. Justin and G. Pirillo, Episturmian words and some constructions of de Luca and Rauzy DuK ntsch, I., H. Wang and S. McCloskey, A relation } algebraic approach to the region connection calculus Erlebach, T. and K. Jansen, The complexity of path coloring and call scheduling Feder, T., Fanout limitations on constraint systems Finkel, O., Locally "nite languages Fischer, P.F., F.P. Preparata and J.E. Savage, Generalized scans and tridiagonal systems Fournier, H., Sparse NP-complete problems over the reals with addition (Note) Halava, V., M. Hirvensalo and R. de Wolf, Marked PCP is decidable Harayama, T., see S.C. Nandy Hertling, P.H., see C.S. Calude Hirvensalo, M., see V. Halava Honkala, J., On Parikh slender context-free languages (Note) Incitti, R., The growth function of context-free languages (Note) Jain, S., Branch and bound on the network model Jansen, K., see T. Erlebach Jin, G., Z. Li and F. Chen, A theoretical foundation for program transformations to reduce cache thrashing due to true data sharing Elsevier Science B.V.
(1}2) 569}591 (1}2) 295}321 (1}2) 51} 62 (1}2) 205}221 (1}2) 627}639 (1}2) 679}686 (1}2) 687}696 (1}2) 687}696 (1}2) 263}279 (1}2) 125}149 (1}2) 659}665 (1}2) 449}481 (1}2) 649}658 (1}2) 649}658 (1}2) (1}2) (1}2) (1}2)
511}538 593}600 51} 62 193}204
(1}2) 539}553 (1}2) (1}2) (1}2) (1}2) (1}2) (1}2) (1}2) (1}2) (1}2) (1}2) (1}2) (1}2) (1}2) (1}2)
63} 83 33} 50 281}293 223}261 423}436 607}610 193}204 627}639 125}149 193}204 667}677 601}605 107}123 33} 50
(1}2) 449}481
700
Author index volume 255 / Theoretical Computer Science 255 (2001) 699}700
Justin, J. and G. Pirillo, Fractional powers in Sturmian words Justin, J., see X. Droubay Khoussainov, B., see C.S. Calude KoK bler, J., see V. Arvind Koiran, P., see V.D. Blondel Koskinen, J.A., Non-injective knapsack public-key cryptosystems Li, Z., see G. Jin Lingas, A., see S.R. Arikati Lopez, L.-M. and P. Narbel, Substitutions and interval exchange transformations of rotation class Malchiodi, D., see B. Apolloni Mantaci, S. and A. Restivo, Codes and equations on trees Marathe, M.V., see S.R. Arikati Massini, A., see T. Calamoneri McCloskey, S., see I. DuK ntsch Nandy, S.C., T. Harayama and T. Asano, Dynamically maintaining the widest k-dense corridor (Note) Narbel, P., see L.-M. Lopez NeH raud, J. and C. Selmi, On codes with a "nite deciphering delay: constructing uncompletable words Nikolskaia, L., see M. Nikolskaia Nikolskaia, M. and L. Nikolskaia, Size of OBDD representation of 2-level redundancies functions (Note) Papadimitriou, C.H., see V.D. Blondel Penaud, J.-G., E. Pergola, R. Pinzani and O. Roques, Chemins de SchroK der et hieH rarchies aleH atoires Pergola, E., see J.-G. Penaud Picouleau, C., Reconstruction of domino tiling from its two orthogonal projections Pinzani, R., see J.-G. Penaud Pirillo, G., see J. Justin Pirillo, G., see X. Droubay Preparata, F.P., see P. F. Fischer Rahonis, G., Alphabetic and synchronized tree transducers Ravi Kumar, S. and D. Sivakumar, On the unique shortest lattice vector problem (Note) Restivo, A., see S. Mantaci Rinaldi, S., see E. Barcucci Roques, O., see J.-G. Penaud Savage, J.E., see P. F. Fischer Selmi, C., see J. NeH raud Silva, P.V., see J. Almeida Sivakumar, D., see S. Ravi Kumar Sokratova, O., The Mal'cev Lemma and rewriting on semirings (Note) Stirling, C., Decidability of DPDA equivalence (Fundamental Study) Trahtman, A.N., Erratum to `Optimal estimation on the order of local testability of "nite automataa [Theoret. Comput. Sci. 231 (2000) 59}74] (Erratum) Tsitsiklis, J.N., see V.D. Blondel Vaszil, G., see E. Csuhaj-VarjuH Wang, H., see I. DuK ntsch Wang, Y., see C.S. Calude WaK tjen, D., Parallel communicating limited and uniformly limited 0L systems Wu, K., see C. Chen Xue, G., A cost optimal parallel algorithm for computing force "eld in N-body simulations on a CREW PRAM Yu, S.S, Post-plus languages
(1}2) (1}2) (1}2) (1}2) (1}2) (1}2) (1}2) (1}2)
363}376 539}553 125}149 205}221 687}696 401}422 449}481 51} 62
(1}2) (1}2) (1}2) (1}2) (1}2) (1}2)
323}344 295}321 483}509 51} 62 263}279 63} 83
(1}2) 627}639 (1}2) 323}344 (1}2) 151}162 (1}2) 615}625 (1}2) 615}625 (1}2) 687}696 (1}2) (1}2) (1}2) (1}2) (1}2) (1}2) (1}2) (1}2) (1}2) (1}2) (1}2) (1}2) (1}2) (1}2) (1}2) (1}2) (1}2) (1}2)
345}361 345}361 437}447 345}361 363}376 539}553 423}436 377}399 641}648 483}509 679}686 345}361 423}436 151}162 569}591 641}648 611}614 1} 31
(1}2) (1}2) (1}2) (1}2) (1}2) (1}2) (1}2)
697 687}696 511}538 63} 83 125}149 163}191 659}665
(1}2) 555}568 (1}2) 85}105
Author index volume 255 (2001) (The issue number is given in front of the page numbers) Almeida, J. and P.V. Silva, SC-hyperdecidability of R Apolloni, B. and D. Malchiodi, Gaining degrees of freedom in subsymbolic learning Arikati, S.R., A. Dessmark, A. Lingas and M.V. Marathe, Approximation algorithms for maximum two-dimensional pattern matching Arvind, V. and J. KoK bler, On pseudorandomness and resource-bounded measure Asano, T., see S.C. Nandy Barcucci, E. and S. Rinaldi, Some linear recurrences and their combinatorial interpretation by means of regular languages (Note) Blondel, V.D., O. Bournez, P. Koiran, C.H. Papadimitriou and J.N. Tsitsiklis, Deciding stability and mortality of piecewise a$ne dynamical systems (Note) Bournez, O., see V.D. Blondel Calamoneri, T. and A. Massini, Optimal three-dimensional layout of interconnection networks Calude, C.S., P.H. Hertling, B. Khoussainov and Y. Wang, Recursively enumerable reals and Chaitin numbers Chen, C. and K. Wu, Disproving a conjecture on planar visibility graphs (Note) Chen, F., see G. Jin Chen, Y.-W. and K.-L. Chung, Improved fault-tolerant sorting algorithm in hypercubes (Note) Chung, K.-L., see Y.-W. Chen Csuhaj-VarjuH , E. and G. Vaszil, On context-free parallel communicating grammar systems: synchronization, communication, and normal forms Cucker, F., On weak and weighted computations over the real closure of 0 (Note) Dessmark, A., see S.R. Arikati de Wolf, R., see V. Halava Droubay, X., J. Justin and G. Pirillo, Episturmian words and some constructions of de Luca and Rauzy DuK ntsch, I., H. Wang and S. McCloskey, A relation } algebraic approach to the region connection calculus Erlebach, T. and K. Jansen, The complexity of path coloring and call scheduling Feder, T., Fanout limitations on constraint systems Finkel, O., Locally "nite languages Fischer, P.F., F.P. Preparata and J.E. Savage, Generalized scans and tridiagonal systems Fournier, H., Sparse NP-complete problems over the reals with addition (Note) Halava, V., M. Hirvensalo and R. de Wolf, Marked PCP is decidable Harayama, T., see S.C. Nandy Hertling, P.H., see C.S. Calude Hirvensalo, M., see V. Halava Honkala, J., On Parikh slender context-free languages (Note) Incitti, R., The growth function of context-free languages (Note) Jain, S., Branch and bound on the network model Jansen, K., see T. Erlebach Jin, G., Z. Li and F. Chen, A theoretical foundation for program transformations to reduce cache thrashing due to true data sharing Elsevier Science B.V.
(1}2) 569}591 (1}2) 295}321 (1}2) 51} 62 (1}2) 205}221 (1}2) 627}639 (1}2) 679}686 (1}2) 687}696 (1}2) 687}696 (1}2) 263}279 (1}2) 125}149 (1}2) 659}665 (1}2) 449}481 (1}2) 649}658 (1}2) 649}658 (1}2) (1}2) (1}2) (1}2)
511}538 593}600 51} 62 193}204
(1}2) 539}553 (1}2) (1}2) (1}2) (1}2) (1}2) (1}2) (1}2) (1}2) (1}2) (1}2) (1}2) (1}2) (1}2) (1}2)
63} 83 33} 50 281}293 223}261 423}436 607}610 193}204 627}639 125}149 193}204 667}677 601}605 107}123 33} 50
(1}2) 449}481
700
Author index volume 255 / Theoretical Computer Science 255 (2001) 699}700
Justin, J. and G. Pirillo, Fractional powers in Sturmian words Justin, J., see X. Droubay Khoussainov, B., see C.S. Calude KoK bler, J., see V. Arvind Koiran, P., see V.D. Blondel Koskinen, J.A., Non-injective knapsack public-key cryptosystems Li, Z., see G. Jin Lingas, A., see S.R. Arikati Lopez, L.-M. and P. Narbel, Substitutions and interval exchange transformations of rotation class Malchiodi, D., see B. Apolloni Mantaci, S. and A. Restivo, Codes and equations on trees Marathe, M.V., see S.R. Arikati Massini, A., see T. Calamoneri McCloskey, S., see I. DuK ntsch Nandy, S.C., T. Harayama and T. Asano, Dynamically maintaining the widest k-dense corridor (Note) Narbel, P., see L.-M. Lopez NeH raud, J. and C. Selmi, On codes with a "nite deciphering delay: constructing uncompletable words Nikolskaia, L., see M. Nikolskaia Nikolskaia, M. and L. Nikolskaia, Size of OBDD representation of 2-level redundancies functions (Note) Papadimitriou, C.H., see V.D. Blondel Penaud, J.-G., E. Pergola, R. Pinzani and O. Roques, Chemins de SchroK der et hieH rarchies aleH atoires Pergola, E., see J.-G. Penaud Picouleau, C., Reconstruction of domino tiling from its two orthogonal projections Pinzani, R., see J.-G. Penaud Pirillo, G., see J. Justin Pirillo, G., see X. Droubay Preparata, F.P., see P. F. Fischer Rahonis, G., Alphabetic and synchronized tree transducers Ravi Kumar, S. and D. Sivakumar, On the unique shortest lattice vector problem (Note) Restivo, A., see S. Mantaci Rinaldi, S., see E. Barcucci Roques, O., see J.-G. Penaud Savage, J.E., see P. F. Fischer Selmi, C., see J. NeH raud Silva, P.V., see J. Almeida Sivakumar, D., see S. Ravi Kumar Sokratova, O., The Mal'cev Lemma and rewriting on semirings (Note) Stirling, C., Decidability of DPDA equivalence (Fundamental Study) Trahtman, A.N., Erratum to `Optimal estimation on the order of local testability of "nite automataa [Theoret. Comput. Sci. 231 (2000) 59}74] (Erratum) Tsitsiklis, J.N., see V.D. Blondel Vaszil, G., see E. Csuhaj-VarjuH Wang, H., see I. DuK ntsch Wang, Y., see C.S. Calude WaK tjen, D., Parallel communicating limited and uniformly limited 0L systems Wu, K., see C. Chen Xue, G., A cost optimal parallel algorithm for computing force "eld in N-body simulations on a CREW PRAM Yu, S.S, Post-plus languages
(1}2) (1}2) (1}2) (1}2) (1}2) (1}2) (1}2) (1}2)
363}376 539}553 125}149 205}221 687}696 401}422 449}481 51} 62
(1}2) (1}2) (1}2) (1}2) (1}2) (1}2)
323}344 295}321 483}509 51} 62 263}279 63} 83
(1}2) 627}639 (1}2) 323}344 (1}2) 151}162 (1}2) 615}625 (1}2) 615}625 (1}2) 687}696 (1}2) (1}2) (1}2) (1}2) (1}2) (1}2) (1}2) (1}2) (1}2) (1}2) (1}2) (1}2) (1}2) (1}2) (1}2) (1}2) (1}2) (1}2)
345}361 345}361 437}447 345}361 363}376 539}553 423}436 377}399 641}648 483}509 679}686 345}361 423}436 151}162 569}591 641}648 611}614 1} 31
(1}2) (1}2) (1}2) (1}2) (1}2) (1}2) (1}2)
697 687}696 511}538 63} 83 125}149 163}191 659}665
(1}2) 555}568 (1}2) 85}105