ebook img

Theoretical Computer Science 1993: Vol 116 Index PDF

3 Pages·1993·0.45 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 1993: Vol 116 Index

Theoretical Computer Science 116 (1993) 431-432 Elsevier Author Index Volume 116 (1993) (The issue number is given in front of the page numbers) Abiteboul, S. and P. Kanellakis, Foreword to the Special Issue of Selected Papers of the International Conference on Database Theory (ICDT) Andrasiu, M., Gh. Paun, J. Dassow and A. Salomaa, Language-theoretic problems arising from Richelieu cryptosystems Beeri, C. and Y. Kornatzky, Algebraic optimization of object-oriented query languages Briiderlin, B., Using geometric rewrite rules for solving geometric problems symbolically Consens, M.P. and A.O. Mendelzon, Low-complexity aggregation in GraphLog and Datalog Culik II, K. and S. Dube, Affine automata and related techniques for generation of complex images Dassow, J., see M. Andrasiu Dube, S., see K. Culik II Ehrenfeucht, A. and G. Rozenberg, T-structures, T-functions, and texts (Fundamental Study) Fagin, R., Finite-model theory—a personal perspective Feuerstein, E. and A. Marchetti-Spaccamela, Dynamic algorithms for shortest paths in planar graphs Jarominek, S., see J.K arhumaki Kanellakis, P., see S. Abiteboul Karhumiaki, J., W. Rytter and S. Jarominek, Efficient constructions of test sets for regular and context-free languages 305-316 Kleine Biining, H., On generalized Horn formulas and k-resolution (Note) 405-413 Kornatzky, Y., see C. Beeri 59— 94 Koutsoupias, E., Improvements on Khrapchenko’s theorem (Note) 399-403 Kuper, G.M. and M.Y. Vardi, On the complexity of queries in the logical data model 33- 57 Lipton, R.J., J.F. Naughton, D.A. Schneider and S. Seshadri, Efficient sampling strategies for relational database operations 195-226 Marchetti-Spaccamela, A., see E. Feuerstein 359-371 Mendelzon, A.O., see M.P. Consens 95-116 Monien, B., W. Rytter and L. Schapers, Fast recognition of deterministic cfi’s with a smaller number of processors (Note) 421-429 Naughton, J.F., see R.J. Lipton 195-226 Paun, Gh., see M. Andrasiu 339-357 Pudlak, P. and P. Savicky, On shifting networks (Note) 4154419 Quinton, P., see Y. Saouter 317-337 Revesz, P.Z., A closed-form evaluation for Datalog queries with integer (gap)-order constraints 117-149 Rozenberg, G., see A. Ehrenfeucht 227-290 Rytter, W., see J.K arhumaki 305-316 Elsevier Science Publishers juthor Index Volume 116 Rytter, W., see B. Monien Salomaa, A., see M. Andrasiu Saouter, Y. and P. Quinton, Computability of recurrence equations Savicky, P., see P. Pudlak Schapers, L., see B. Monien Schneider, D.A., see R.J. Lipton Seshadri, S.. see R.J. Lipton Van der Meyden, R., Recursively indefinite databases Vardi, M.Y., see G.M. Kuper

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.