Theoretical Computer Science 133 (1994) 443 Elsevier Author Index Volume 133 (1994) (The issue number is given in front of the page numbers) Alagar, V.S., Foreword to the Special Issue on Formal Methods in Databases and Software Engineering (2) 203-204 (2) 205-265 Bonner, A.J. and M. Kifer, An overview of transaction logic Cucker, F., Foreword to the Special Issue of Selected Papers of the Workshop on Continuous Algorithms and Complexity, Barcelona, Spain, October 1993 (1) | Cucker, F., M. Shub and S. Smale, Separation of complexity classes in Koiran’s weak model (1) 3- 14 Dong, F. and L.V.S. Lakshmanan, Intuitionistic interpretation of deductive databases with incomplete information (2) 267-306 Emerson, T., Relativizations of the P = ? NP question over the reals (and other ordered rings) (1) 15- 22 Godin, R. and R. Missaoui, An incremental concept formation approach for learning from databases (2) 387-419 Grigoriev, D.Yu., Deviation theorems for solutions of differential equations and applica- tions to lower bounds on parallel complexity of sigmoids (1) 23- 33 (1) 165-185 Haegemans, A., see J. Verschelde (2) 361-385 Han, J., Towards efficient induction mechanisms in database systems (2) 307-340 Kapur, D., X. Nie and D.R. Musser, An overview of the Tecton proof system (2) 205-265 Kifer, M., see A.J. Bonner (1) 35-47 Koiran, P., Computing over the reals with addition and order (1) 49- 64 Kurka, P., Regular unimodal systems and factors of finite automata Lakshmanan, L.V.S., see F. Dong (2) 267-306 Malajovich, G., On generalized Newton algorithms: quadratic convergence, path-follow- ing and error analysis (1) 65— 84 Meer, K., On the complexity of quadratic programming in real number models of (1) 85-94 computation (1) 95-104 Michaux, C., P#NP over the nonstandard reals implies P# NP over R (2) 187-200 Milner, R., David Michael Ritchie Park (1935-1990) in memoriam (Obituary) (2) 387-419 Missaoui, R., see R. Godin (2) 307-340 Musser, D.R., see D. Kapur (2) 307-340 Nie, X., see D. Kapur Ramanathan, G., Refinement of events in the development of real-time distributed systems (2) 341-359 Rojas, J.M., A convex geometric approach to counting the roots of a polynomial system (1) 105-140 Sadri, F., Aggregate operations in the information source tracking method (2) 421-442 Shub, M., see F. Cucker (1) 3- 14 Shub, M. and S. Smale, Complexity of Bezout’s theorem V: Polynomial time (1) 141-164 Smale, S., see F. Cucker (1) 3- 14 Smale, S., see M. Shub (1) 141-164 Verschelde, J. and A. Haegemans, Homotopies for solving polynomial systems within a bounded domain (1) 165-185 Elsevier Science B.V.