- Email: [email protected]
Author index volume 147
Theoretical Computer Science EISEVIER
Theoretical Computer Science 147 (1995) 299
Author Index Volume 147 (1995) (The issue number is given in front of the page numbers)
Aigrain, P. and D. Beauquier, Polyomino tilings, cellular automata and codicity Amaldi, E. and V. Kann, The complexity and approximability of finding maximum feasible subsystems of linear relations Arqub, D. and 0. Grange, A fast scan-line alogrithm for topological filling of well-nested objects in 2.5D digital pictures Bampis, E., J.-C. Kiinig and D. Trystram, Optimal parallel execution of complete binary trees and grids into most popular interconnection networks Beauquier, D., see P. Aigrain Blot, J., W. Fernandez de la Vega, V. Th. Paschos and R. Saad, Average case analysis of greedy algorithms for optimisation problems on set systems Bodlaender, H.L., R.G. Downey, M.R. Fellows and H.T. Wareham, The parameterized complexity of sequence alignment and consensus Chen, G.-H., see C.-W. Yu Cheng, A., J. Esparza and J. Palsberg, Complexity results for l-safe nets Downey, R.G., see H.L. Bodlaender Esparxa, J., see A. Cheng Fellows, M.R., see H.L. Bodlaender Femandez de la Vega, W., see J. Blot Ggieniec, L., W. Plandowski and W. Rytter, The zooming method: a recursive approach to time-space efficient string-matching Grange, O., see D. Araques Jansen, K. and H. Miiller, The minimum broadcast time problem for several processor networks Kann, V., see E. Amaldi K&rig, J.-C., see E. Bampis Miiller, H., see K. Jansen Nishida, T.Y., Quasi-deterministic OL systems and their representation Palsberg, J., see A. Cheng Paschos, V.Th., see J. Blot Plandowski, W., see L. Ggsieniec Rytter, W., see L. Gasieniec Saad, R., see J. Blot Schurz, G., Most general first order theorems are not recursively enumerable Sureson, C., NP # Co-NP and models of arithmetic Trystram, D., see E. Bampis Wareham, H.T., see H.L. Bodlaender Yu, C.-W. and G.-H. Chen, Efficient parallel algorithms for double convex-bipartite graphs Zimand, M., On the topological size of p-m-complete degrees
Elsevier Science B.V.
(l-2)
165-180
(l-2)
181-210
(l-2) 211-248 (l-2) (l-2)
l- 18 165-180
(i-2) 267-298 (l-2) 31- 54 (l-2) 249-265 (l-2) 117-136 (l-2) 31- 54 (l-2) 117-136 (l-2) 31- 54 (l-2) 267-298 (l-2) 19- 30 (l-2) 211-248 (l-2) 69- 85 (l-2) 181-210 (l-2) l- 18 (l-2) 69- 85 (l-2) 87-116 (l-2) 117-136 (l-2) 267-298 (l-2) 19- 30 (l-2) 19- 30 (l-2) 267-298 (l-2) 149-163 (l-2) 55- 67 (l-2) l- 18 (l-2) 31- 54 (l-2) 249-265 (l-2) 137-147
Theoretical Computer Science 147 (1995) 299
Author Index Volume 147 (1995) (The issue number is given in front of the page numbers)
Aigrain, P. and D. Beauquier, Polyomino tilings, cellular automata and codicity Amaldi, E. and V. Kann, The complexity and approximability of finding maximum feasible subsystems of linear relations Arqub, D. and 0. Grange, A fast scan-line alogrithm for topological filling of well-nested objects in 2.5D digital pictures Bampis, E., J.-C. Kiinig and D. Trystram, Optimal parallel execution of complete binary trees and grids into most popular interconnection networks Beauquier, D., see P. Aigrain Blot, J., W. Fernandez de la Vega, V. Th. Paschos and R. Saad, Average case analysis of greedy algorithms for optimisation problems on set systems Bodlaender, H.L., R.G. Downey, M.R. Fellows and H.T. Wareham, The parameterized complexity of sequence alignment and consensus Chen, G.-H., see C.-W. Yu Cheng, A., J. Esparza and J. Palsberg, Complexity results for l-safe nets Downey, R.G., see H.L. Bodlaender Esparxa, J., see A. Cheng Fellows, M.R., see H.L. Bodlaender Femandez de la Vega, W., see J. Blot Ggieniec, L., W. Plandowski and W. Rytter, The zooming method: a recursive approach to time-space efficient string-matching Grange, O., see D. Araques Jansen, K. and H. Miiller, The minimum broadcast time problem for several processor networks Kann, V., see E. Amaldi K&rig, J.-C., see E. Bampis Miiller, H., see K. Jansen Nishida, T.Y., Quasi-deterministic OL systems and their representation Palsberg, J., see A. Cheng Paschos, V.Th., see J. Blot Plandowski, W., see L. Ggsieniec Rytter, W., see L. Gasieniec Saad, R., see J. Blot Schurz, G., Most general first order theorems are not recursively enumerable Sureson, C., NP # Co-NP and models of arithmetic Trystram, D., see E. Bampis Wareham, H.T., see H.L. Bodlaender Yu, C.-W. and G.-H. Chen, Efficient parallel algorithms for double convex-bipartite graphs Zimand, M., On the topological size of p-m-complete degrees
Elsevier Science B.V.
(l-2)
165-180
(l-2)
181-210
(l-2) 211-248 (l-2) (l-2)
l- 18 165-180
(i-2) 267-298 (l-2) 31- 54 (l-2) 249-265 (l-2) 117-136 (l-2) 31- 54 (l-2) 117-136 (l-2) 31- 54 (l-2) 267-298 (l-2) 19- 30 (l-2) 211-248 (l-2) 69- 85 (l-2) 181-210 (l-2) l- 18 (l-2) 69- 85 (l-2) 87-116 (l-2) 117-136 (l-2) 267-298 (l-2) 19- 30 (l-2) 19- 30 (l-2) 267-298 (l-2) 149-163 (l-2) 55- 67 (l-2) l- 18 (l-2) 31- 54 (l-2) 249-265 (l-2) 137-147