Theoretical Computer Science 1991: Vol 85 Index

1 Pages·1991·0.13 MB·English

Theoretical Computer Science 85 (1991) 359
Elsevier
Author Index Volume 85 (1991)
(The issue number is given in front of the page numbers)
Bethke, I., Coherence spaces are untopological (Note) (2) 353-357
Cherubini, A., C. Citrini, S. Crespi Reghizzi and D. Mandrioli, QRT FIFO automata,
breadth-first grammars and their relations (1) 171-203
Cialdea, M., Resolution for some first-order modal systems (2) 213-229
Citrini, C., see A. Cherubini (1) 171-203
Crespi Reghizzi, S., see A. Cherubini (1) 171-203
Devolder, J. and I. Litovsky, Finitely generated biw-languages (1) 33- 52
Doggaz, N. and C. Kirchner, Completion for unification (2) 231-251
Goto, S., Proof normalization with nonstandard objects (2) 333-351
Ibarra, O.H., T. Jiang and H. Wang, Parallel parsing on a one-way linear array of
finite-state machines (1) 53— 74
Jiang, T., see O.H. Ibarra (1) 53— 74
Kamper, J., Nonuniform proof systems: a new framework to describe nonuniform and
probabilistic complexity classes (2) 305-331
Kirchner, C., see N. Doggaz (2) 231--251
Kutytowski, M., Multihead one-way finite automata (1) 135-153
Lindell, S., An analysis of fixed-point queries on binary trees (1) 75- 95
Litovsky, L., see J. Devolder (1) 33- 52
Mandrioli, D., see A. Cherubini (1) 171-203
Michel, P., An NP-complete language accepted in linear time by a one-tape Turing
machine (Note) (1) 205-212
Rodenburg, P.H., Algebraic specifiability of data types with minimal computable para-
meters (1) 97-116
Sopena, E., Hypermap rewriting: a combinatorial approach (2) 253-281
Szpankowski, W., A characterization of digital search trees from the successful search
viewpoint (1) 117-134
Tennent, R.D. and J.K. Tobin, Continuations in possible-world semantics (2) 283-303
Tobin, J.K., see R.D. Tennent (2) 283-303
Wang, H., see O.H. Ibarra (1) 53- 74
Wang, J., On p-creative sets and p-completely creative sets (Fundamental Study) (1) 1- 31
Wegener, I., The complexity of the parity function in unbounded fan-in, unbounded depth
circuits (1) 155-170
Elsevier Science Publishers B.V.