ebook img

Theoretical Computer Science 1997: Vol 174 Index PDF

3 Pages·1997·0.74 MB·English
by  
Save to my drive
Quick download
Download
Most books are stored in the elastic cloud where traffic is expensive. For this reason, we have a limit on daily download.

Preview Theoretical Computer Science 1997: Vol 174 Index

Theoretical 4 Computer Science ELSEVIER Theoretical Computer Science 174 (1997) 281 Author index volume 174 (1997) (The issue number is given in front of the page numbers) Arora, S. and R. Fagin, On winning strategies in Ehrenfeucht—Fraissé games (1-2) 97-121 Berman, P. and A. Lingas, A nearly optimal parallel algorithm for the Voronoi diagram of a convex polygon (1-2) 193-202 Bracho, F., M. Droste, M. and D. Kuske, Representation of computations in concurrent automata by dependence orders (1-2) 67- 96 Canfield, E.R., see G.-Q. Zhang (1-2) 275-279 Droste, M., see F. Bracho (1-2) 67- 96 Fagin, R., see S. Arora (1-2) 97-121 Favati, P., G. Lotti and L. Margara, Additive one-dimensional cellular automata are chaotic according to Devaney’s definition of chaos (1-2) 157-170 Finkel, A. and P. McKenzie, Verifying identical communicating processes is undecidable (1-2) 217-230 Hunt III, H.B., see M.V. Marathe (1-2) 23- 65 Kobayashi, S. and T. Yokomori, Learning approximately regular languages with revers- ible languages (Note) (1-2) 251-257 Krause, M. and P. Pudlak, On the computational power of depth-2 circuits with threshold and modulo gates (1-2) 137-156 Kurka, P., On topological dynamics of Turing machines (1-2) 203-216 Kuske, D., see F. Bracho (1-2) 67- 96 Lingas, A., see P. Berman (1-2) 193-202 Litovsky, I. and L. Staiger, Finite acceptance of infinite words (1-2) 1-21 Lotti, G., see P. Favati (1-2) 157-170 Marathe, M.V.. V. Radhakrishnan, H.B. Hunt III and S.S. Ravi, Hierarchically specified unit disk graphs (1-2) 23— 65 Margara, L., see P. Favati (1-2) 157-170 McKenzie, P., see A. Finkel (1-2) 217-230 Mullins, J., On an effective hierarchy of communicating processes: separation principle and testing (1-2) 231-246 (1-2) 123-136 Orponen, P., Computing with truly asynchronous threshold logic networks (1-2) 137-156 Pudlak, P., see M. Krause (1-2) 23- 65 Radhakrishnan, V., see M.V. Marathe (1-2) 23- 65 Ravi, S.S., see M.V. Marathe (1-2) 171-191 Santini-Bouchard, M.-L., Echanges de trois intervalles et suites minimales a-9 1-H Staiger, L., see I. Litovsky Takahashi, N., Various hierarchies of w-regular sets (Note) (1-2) 259-268 Turakainen, P., The undecidability of some equivalence problems concerning ngsm’s and (1-2) 269-274 finite substitutions (Note) (1-2) 247-249 Yamasaki, Y., The arithmetic of reversed positional games (Mathematical Games) (1-2) 251-257 Yokomori, T., see S. Kobayashi (1-2) 275-279 Zhang, G.-Q. and E.R. Canfield, The end of pumping? (Note) Elsevier Science B.V.

See more

The list of books you might like

Most books are stored in the elastic cloud where traffic is expensive. For this reason, we have a limit on daily download.