- Email: [email protected]
Author index volume 120 (1993)
Theoretical Elsevier
Computer
Science
120 (1993) 317
317
Author Index Volume 120 (1993) (The issue number
is given in front of the page numbers)
Baratella, S., A class of programs for which SLDNF resolution and NAF rule are complete Briiggemann-Klein, A., Regular expressions into finite automata Chen, G.H., B.F. Wang and H. Li, Deriving algorithms on reconfigurable networks based on function decomposition Cousot, P. and R. Cousot, “A la Burstall” intermittent assertions induction principles for proving inevitability properties of programs Cousot, R., see P. Cousot Cox, P.T., see E. Knill Ferreira, A., On space-efficient algorithms for certain NP-complete problems (Note) Fu, B. and H.-z. Li, On symmetric differences of NP-hard sets with weakly P-selective sets (Note) Gastin, P. and B. Rozoy, The poset of infinitary traces Grabowski, M., On the status of proving program properties is effective interpretations Honkala, J., On DOL systems with immigration Iyengar, S.S., see R. Subbiah Kashyap, R.L., see R. Subbiah Kim, C. and D.H. Lee, Separating k-separated eNCE graph languages Knill, E., P.T. Cox and T. Pietrzykowski, Equality and abductive residua for Horn clauses (Fundamental Study) Lee, D.H., see C. Kim Li, H., see G.H. Chen Li, H.-z., see B. Fu Marcoux, Y., Composition is almost (but not quite) as good as s-l-l (Fundamental Study) Nota, G., S. Orefice, G. Pacini, F. Ruggiero and G. Tortora, Legality concepts for three-valued logic programs Orefice, S., see G. Nota Pacini, G., see G. Nota P&m, Gh. and A. Salomaa, Closure properties of slender languages (Note) Pietrzykowski, T., see E. Knill Radhakrishnan, S., see R. Subbiah Rozoy, B., see P. Gastin Ruggiero, F., see G. Nota Salomaa, A., see Gh. Paun Sikkel, K., Parallel on-line parsing in constant time per word (Note) Subbiah, R., S.S. Iyengar, S. Radhakrishnan and R.L. Kashyap, An optimal distributed algorithm for recognizing mesh-connected networks Tortora, G., see G. Nota Wang, B.F., see G.H. Chen Zhang, W., Cut-formulas in propositional logic (Note)
Elsevier Science Publishers
B.V
(1) 83- 99 (2) 197-213 (2) 215-227 (1) 123-155 (1) 123-155 (1) l- 44 (2) 311-315 (2) (1) (1) (2) (2) (2) (2)
279-291 101-121 69- 81 229-245 261-278 261-278 247-259
(1) (2) (2) (2) (2)
l- 44 247-259 215-227 279-291 169-195
(1) (1) (1) (2) (1) (2) (1) (1) (2) (2)
45- 68 45- 68 45- 68 293-301 l- 44 261-278 101-121 45- 68 293-301 303-310
(2) 261-278 (1) 45- 68 (2) 215-227 (1) 157-168
Computer
Science
120 (1993) 317
317
Author Index Volume 120 (1993) (The issue number
is given in front of the page numbers)
Baratella, S., A class of programs for which SLDNF resolution and NAF rule are complete Briiggemann-Klein, A., Regular expressions into finite automata Chen, G.H., B.F. Wang and H. Li, Deriving algorithms on reconfigurable networks based on function decomposition Cousot, P. and R. Cousot, “A la Burstall” intermittent assertions induction principles for proving inevitability properties of programs Cousot, R., see P. Cousot Cox, P.T., see E. Knill Ferreira, A., On space-efficient algorithms for certain NP-complete problems (Note) Fu, B. and H.-z. Li, On symmetric differences of NP-hard sets with weakly P-selective sets (Note) Gastin, P. and B. Rozoy, The poset of infinitary traces Grabowski, M., On the status of proving program properties is effective interpretations Honkala, J., On DOL systems with immigration Iyengar, S.S., see R. Subbiah Kashyap, R.L., see R. Subbiah Kim, C. and D.H. Lee, Separating k-separated eNCE graph languages Knill, E., P.T. Cox and T. Pietrzykowski, Equality and abductive residua for Horn clauses (Fundamental Study) Lee, D.H., see C. Kim Li, H., see G.H. Chen Li, H.-z., see B. Fu Marcoux, Y., Composition is almost (but not quite) as good as s-l-l (Fundamental Study) Nota, G., S. Orefice, G. Pacini, F. Ruggiero and G. Tortora, Legality concepts for three-valued logic programs Orefice, S., see G. Nota Pacini, G., see G. Nota P&m, Gh. and A. Salomaa, Closure properties of slender languages (Note) Pietrzykowski, T., see E. Knill Radhakrishnan, S., see R. Subbiah Rozoy, B., see P. Gastin Ruggiero, F., see G. Nota Salomaa, A., see Gh. Paun Sikkel, K., Parallel on-line parsing in constant time per word (Note) Subbiah, R., S.S. Iyengar, S. Radhakrishnan and R.L. Kashyap, An optimal distributed algorithm for recognizing mesh-connected networks Tortora, G., see G. Nota Wang, B.F., see G.H. Chen Zhang, W., Cut-formulas in propositional logic (Note)
Elsevier Science Publishers
B.V
(1) 83- 99 (2) 197-213 (2) 215-227 (1) 123-155 (1) 123-155 (1) l- 44 (2) 311-315 (2) (1) (1) (2) (2) (2) (2)
279-291 101-121 69- 81 229-245 261-278 261-278 247-259
(1) (2) (2) (2) (2)
l- 44 247-259 215-227 279-291 169-195
(1) (1) (1) (2) (1) (2) (1) (1) (2) (2)
45- 68 45- 68 45- 68 293-301 l- 44 261-278 101-121 45- 68 293-301 303-310
(2) 261-278 (1) 45- 68 (2) 215-227 (1) 157-168