Master index volumes 101–110

Theoretical Elsevier

Computer

Science

I IO (1993) 435 441

435

Master Index Volumes 101-l 10 (For the sake of simplicity and uniformity, listed as if vvritten as single words)

all names

beginning

with articles

or prepositions

are

Almetda. J.. Locally commutative power semigroups and counting factors of words 108 (I) (1993) 3-16 Alvarez, C. and B. Jenner. A v’ery hard log-space counting class 107 (I) (1993) 3-30 Andersson. A.. Comments on: “On the balance property of Patrtcia tries: External path length viewpoint” (Letter 10 t/n, E&or) 106 (2) (1992) 391-393 Apostohco. A., Efficient CRCW-PRAM algorithms for universal substring searching (Note) 108 (2) (1993) 331-344 Arnold. A.. Preface to the Special Issue of Selected Papers of the 15th Colloquium on Trees in Algebra and Programming (CAAP ‘90). Copenhagen, May 15~18 1990 106 (I) (1992) 1-I AugusteiJn. L.. .sec R. Leermakers 104 (2) (1992) 313-323 Bar Yehuda. R.. T. Etzion and S. Moran, Rotating-table games and derivatives of words (Mathemrrticul Gtr,nr.s) IOR (2) (1993) 31 I 329 Bauderon. M.. Infinite hypergraphs II. Systems of recursive equations (~unr/umrnru/ Study) 103 (2) (1992) I655190 Bedard. F.. F. Lemieux and P. McKenric. Extensions to Barrington’s M-program model 107 (I) (1993) 31-61 Beigcl, R. and J. Gill. Counting classes: thresholds. parity, mods. and fewness 103 (I) (1992) 3-23 Bellia. M. and M.E. Occhiuto. C-expressions: a vartable-free calculus for equational logic programming (Flodtrrw~l/tr/Sfd~) 107 (2) (1993) 2099252 Bern. M.W.. H.J. Karloff. P. Raghavan and B. Schieber, Fast geometric approximation techniques and geometric embedding problems 106 (2) (1992) 265-281 Best. E.. J. Desel and J. Esparza. Traps characterize home states in free choice systems 101 (2) (1992) 161-176 Black. D.L.. SVP M.G. Main 107 (2) (1993) 3055332 Blizard. W.D.. Dedekind multisets and function shells I IO (I) (1993) 79998 Bloom. B. and A.R. Meyer. Experimenting with process equivalence 101 (2) (1992) 2233237 Bodlaender, H.L.. Complexity of path-forming games (Mathmaficu/ Game.s) I IO (1) (1993) 2155245 Bodlaender. H.L. and D. Kratsch, The complexity of coloring games on perfect graphs (Mathemarical (;d/ne\) 106 (2) (1992) 3099326 Bol. R.N.. Generalizing completeness results for loop checks in logic programming 104 (1) (1992) 3328 Boudol. G. and K.G. Larsen. Graphical versus logical specifications 106 (1) (1992) 3320 Bovet. D.P.. P. Crescenzi and R. Silvestri. A uniform approach to define complexity classes 104 (2) (1992) 263 -283 Brookes, S. and S. Geva. Towards a theory of parallel algorithms on concrete data structures 101 (2) (1992) 1777221 Bruschi. D.. Strong separations of the polynomial hierarchy with oracles: constructive separations by Immune and stmple sets (Fundtrrnmttrl Srudy) 102 (2) (1992) 215-252 Cai. J., A. Condon and R.J. Lipton, On games of incomplete information 103 (1) (1992) 25538 Cai. J.. R. Paige and R. Tarjan. More efficient bottom-up multi-pattern matching in trees 106 (I) (1992) 2 I-60 Caucal. D.. On the regular structure of prefix rewriting 106 (1) (1992) 61-86 Charron-Bost. B.. Coupling coefficients of a distributed execution (~undnmenral Srudy) 110 (2) (1993) 341-376 Elsevier Sctence Publishers

B.V.

(‘ho. J.W.. see B.M. Kim Choffrut.

103 (2) (I’)‘)?)

C. and T. Lcngaucr.

Symposium

Editorial

on Theoretical

183-309

to the Special Issue of Selected Papers from the Seventh Annual

Aspects of Computer

C‘lerbout. M. and Y. Roes. SemicommLitation\ Condon,

A.. w

Corradim.

J. Cal

103 (1) (1992)

A. and U. Montnnari,

tions to logic programs Corradlni,

103 (I) (1992)

109 (I -2)

(I)

(1992)

3Y 49

semantics for structured

51

transition

systems and its applica-

IOh

replacement jungle rewriting

for tern-reuriting

systems and logic

(lYY31 7-48

Cortesl. A. and G. Fib?, Graph Courcelle.

I

103 (I) (1992) 103

25 38

An algebruc

A. and F. Rossi, Hypcrcdge

programming

Science (STAC’S ‘90)

and algebraic languages

B.. The monadic

propertics

for normal

second-order

logic programs

logic of graphs VII:

Graphs

I07 (2) (1993)

277-303

as rclatlonal

structures

101 (I)

(19Y2) 3-m33 Courcelle.

B. and G. Rorcnbcrg.

Workshop

Preface to the Special Volume

by Graph

Tr;lnsform~~tion.

C‘ourcellc. (l-1)

B. and M. Moshah.

(1993)

Crcscenri,

Monadic

Dagum.

evaluations

(NCIIC)

P. and M.

108 (2) (1993) Luby.

263

_7lb23.

1991

109 (I

2)

on tree-decomposable

graphs

109

2X3

On Klecnc algebras

F.. A. Mnrchctti-Spnccamelo

ad\ersaq

second-order

104 (2) (1992)

S. and R.S. Madnrhsz,

d’Amore,

and U. Nanni.

371

10X (I) (1993) The \\eiehtcd

17-24

list update problem

and the lazy

3X3

Approximating

the permanent

of graphs with laryc factors

102 (2) (1992)

30s

Damm. C. and Ch. Mcmcl. Separatmg complexity claw

relntcd to C.?-decison trees (,vorc,)

106 (2) (1997)

360

Dna. G. and D. Joseph. Mimmum Dnuchet. Dehart,

M.. Simulation F., P. Enjalhert

loge

I05 (II

dc Boer,

bertcx hulla for polyhedral

of Turing I41

Kok.

De\lllerh. Dlekert.

IO1 (2) (1997)

. B.

(I) (I’)921 Dobck.

(,Yote,)

of pattern

F.. Recognising !,-conncctcd Transf~)rmation”:

;I sur\ey

Fhrip, H. and M. Lti~le. Parallel I?-Taha.

763

143%158

165-183

uf matrix

108

(I J (lYY3)

tranhposltion

75 43

on one-lope

off-line Turing

271-290

Stability for the rigrag aubmonwds

IOX (2) (1993)

237

144,

linear logic (~Vorv)

IO7

matching

In calculi &here primitive

recursive functions

are

hypcrgraphs

in cubic time

Basic Rcsearch Worhing 109 (I

I09 (l-2)

Group

(1993)

X3-11’

COMPUGRAPH

“Computing

by

1) (19Y3) 3-6

and distrihutcd

deri\ationb

in the singbpushout

approach

109 (lb2)

123sl43 M. and S. Stidham

I06 (2) (1991)

Jr. Determinlstlc

Engclfrlet.

J. and H.J. Hoogehoom, P.. .\w F. Dchnrt J. and M. Sll\n.

102 (I) (199’)

analysis of qucueing

systems with heterogeneous

sr\ers

243 ~263

EnJalbtw. Esparza.

239

I07 (2) (1Y93) 34Y%356

Ehrig. H. and M. Liine. The ESPRIT

(1993)

IO success: comparing

101 (IJ (1992)

linear predicate loplc i\ ;I frapmcnt of intultionistic

G.. The undccldahilit)

Graph

failure

IO1 (2) (1992)

207~~214

reprcwilablc Dreucs.

409-420

and order-sorted

‘89~335

I07 (I) (IYY2)

The complexity

Lc Sacc and I. L~tovskj. clnsical

From

semi-commutntivns

I08 (2) (1993)

machmea \bith output tape K.. Nonmodal

107-135

using equational

of inductive dclinitions

preserving bislmulntion

M. and W. Muss.

Do Long Van.

(1992)

I03 (2) (1992)

161~~176

V.. MObiLIs functlonh and conllucnt

Dictrfclhingcr.

D&n.

dimension

101 (2) (19Y2)

R.. Maximality

Rutten.

semantics for Horn cla~~sr logic

M.. The functional

E. Best

I I)

103

I66

de Rocver. W.P.. .w J.J.M. Hooman Descl. J.. w

lop~c programming

C. Palaru~des~l and J.J.M.M.

and a declarative

de Rougcmont,

domains

machines by a regular rcwrlte rule (,Vorc,)

and M. Lcwot. Multimodal

(1991)

F.S.. J.N

a denotational

Esparu.

March

49-82

P.. .tw D.P. Borcf

Crvcnko\i&

351

of Selected Papers of the International

Bordeaux.

I

(19931

283

on C‘omputing

IO5 (I)

S-automata (1907)

A pol~nomul-time

on (-,-words (~lo~~/~l,~rr,,lftrlS~url~~) I IO (1) (I9931 algorithm

1x5 ‘OS

J.. .wc E. Best

I-51

l4lblhh

I01 (2) (1992) 161~~176

to decide li\eneab of hounded

free chow

nets

&ion.

T.. w

IOX (2) (1993)

R. Bar Yehuda

Fclleisen. M. and R. Hi&

31 l-329 103

The revised report on the ayntactlc theories of sequential control and state

(2) (19Y2) 235-271 Flli, G.. see A. Corteai

107 (2) (1993) 277- 303

Forster. T.. A semantic characterization Fraenkcl. Fretvalda.

R.. E.B. Kinber

110 (I) (1993)

(;urnr.s)

On the pouer

1 IO (2) (19931 405-418

I IO (I) (1993)

of mductivc

197-214

inference from good examples

131~~144

Ch.. Conlluent

Frougny.

Ch. and J. Sakarovitch.

(1993)

(.Malhrrwtictr/

and R. Wiehagen.

Frougny.

lmear numeration

systema (F~r,rd~/,,rr,r~rtrlStutly)

Synchronized

rational

IO6 (2) (1992)

1X3-2lY 108

relations of finite and infinite words

(I)

45-82

Fiiltip. Z.. F. Herrmann. Srudr)

S. Vligv(ilgyi and H. Vogler. Tree transducers with external functions (~u~~dww~tu/

IOX (2) (19931

Gabbriclll.

M.

grams Gallxr.

of the well-typed formulae of i-calculus

A.S. and S. Simonson. Geography

105 (II

Levi.

(1092)

J.. Constructi\c

(1993)

IX5 236

and G.

Unfolding

and

tixpoint

semantics

of concurrent

constraint

logic pro-

Xi- 12X logics Part I: A tutorial on proof systems and typed i-calculi

(Tutoric~l) I IO (2)

249-339

Garron.

108 (I) (1993)

M.. Caylcy automata

Cieva. S.. see S. Brookes G111. J.. ,sec R. Bcigel Gogucn,

101 (2) (lY92)

103 (I) (1992)

J.A. and J. Mesegucr.

overloading.

X3- 102

177-221

3-23

Order-sorted

algebra

evceptlona and partial operations

Golrs. E.. A. Maaas and S. Martinez.

I: equational

deductmn

(~lr/~r/~~wnrrrl St~rtly)

for multiple

105 (2) (1902)

inheritance.

217-273

On the limit set of some universal cellular automata

I IO (I)

(1993)

53 7X Griidcl,

E.. Capturing

Grandjean.

complexity

E.. Editorial

classes by fragment\

of second-order

101

(I)

to Computer

(1992)

35 57 101 (I

Science

I

(1992)

Grossi, R.. On finding common subtreea (Norcl

10X (2) (1993)

Grue. K.. Map theory (F~r,rd[~,,ler~rl,lSr~rtll,)

(I)

Gunawardcna. Gunter,

logic

to the Special Ishue on Logic and Applications

J.. Causal automata

101 (2) (1992)

C.A.. The mixed power domain

Hxbel. A.. H.-J. Krcowski properties Halpenn>,

I45

102 (2)

(1992)

K.. H. Hiraishi

103 (7) (1992) Helman.

311-334

A comparison

of compatible.

and S. Y:i.jmia. z-Regular

R., A scm-algorithm

Herrmann.

F.. .we Z. Fiiliip

Hicb. R.. sw M. Fellciscn

grammar

(1993)

2 x 2 shitching networks (Murhw~trt-

temporal

logic and its model checking problem

106 (2) (1992)

On read-once

for algebraic implementation

103 (2) (1992)

formulae

and their randomized

proofs

104 (I

)

(1992)

53-87

185~236

23.5-271

103 (2) (lY92)

191 -204

t!pcs of BCK-lambda-terms

D., Termination

783-30X

threshold

63-76

10X (2) (1993)

K. Hamaguchi

S.. Prinapal

Hoopcboom.

(I I

I07

HennIcker.

(1992)

linitc. and inductive graph

32Y -35-I

and A. Wigdcrson.

decision II-~ complexit!

105 (II

265 -2X8

16X

in left-assoclatl\c

R.. I. Newman

H.. w

3%

191 204

Hausscr. R.. Complcxlty

Hofbauer,

345

I-1 33

L. and C. Smyth. A classilication of minimal standard-path

Hnmaguchi.

Hirokawa.

(1992)

103 (2) (lY92)

and C. Lautcmann,

I IO (I) (lYY3)

ic,tr/ (;twws)

Hiraishi.

102

107 (2) (1993)

253-776

proofs by multisct path orderings imply primitive rccursi\e

derivation

lengths

12Y%l30

H.J.. ,wt’J. Engelfrict

I IO (I)

(1993)

Hooman. J.J.M.. S. Ramcsh and W.P. de Rower. (1997) 2X9-335

I-51

A compositional

aniomatization

Hromko\i?. J. and K. Inoue. A note on realtime one-way synchronized (?V0fUl IOX (‘7) (1993) 3Y3 400

alternating

Huang. S.-H.%, H. LIU. and V. Viswanathnn. A sublinear parallel algorithm ming problems (R’wc) 106 (2) (1997) 361 371 Inoue. K.. we J. Hromko\i?

IOX (2) (1993)

393 400

of Statecharts one-counter

101 (2) automata

for some dynamic program-

)

Ito. M.. Forword

to the Special Issue on Selcctcd Papers of the Intcrnation~l

Languages and Combinatorics. Iyengar.

S.S.. .wc’ L. Prasnd

Jacobs, B., Comprehension

( 1993)

Kyoto.

102 (2) (lYY2)

10X (I

I

Colloquium

on Words.

I

(1993)

365

categories and the semantic\ of type dependency (f~r,~rltrrl~r,nftr/Srlrdj,)

K.. Processor optiml/.atlon

Jansacns. D.. Equivalence Joseph. D., \wG. Jouannaud.

Da!,

Karhumiiki.

I07 (2)

(1993)

103

(19Y’7) 107-135 Tel-mlnation

and completion

module

associativity.

commutatiwty

and

normal

logic program\

to constraint

logic programs

over

(inite set\ of \\ords

and equivalence

problems

m automata

theoq

IIX

H.J.. .wc M.W.

Bern

Katz. S. and D. Pclcd. Dclinlng B.M. and J.W. 00.

I 1992)

I06 (2)

M. and G. Twnnha. Group\

265-281

of linlte elcmentnry

conditional

codes

indcpcndcncc

A nc~ wb\umptiOn

method

108 (I) (1993)

using collapses

I IO-149

IO1 (2) (1992)

1n the connection

337-359

graph proof proccdurc

I03

2X3-309

Kim. C. and I.H. Sudhorough.

On rc\crsal-hounded

I IO

E.B.. .sw R. F~rclvalds

Kirchner.

H., To Prof. Dr. Wolfgang

Kirchner.

H. and W. Wcchlcr.

Confcrcncc (199’)

14s180

i-30

29~~51

J.. Equations

(2) (199’)

2X5-298

IO9 II -2) (lY93)

77 56

108 (I) (1993)

Kin&r.

104 (2) (1992)

in actor gl-ammars

K. and P.J. Stuckcq. Transforming

IO5 (I) (1991)

Karloff,

103 (I)

104 (I) (1992)

Kanchanasut.

Katsura.

I07 (I)

J.-P. and C. March&

idcntit>

for 110~ graphs

of computations

Jcnner. B., .wc C. Al\arel

on

Algcbralc

(II

(1993)

Wcchlcr (Ohirwr~~)

Editorial and

picture languages

I04 (1) (1992)

1X5-206

131-143

I I)

I05

(1997)

5

IO the Special Issue of Sclcctcd Papcra of the 2nd International

Logic

Programming.

Nanq.

France.

October

l-3.

1990

I05 (I)

l-3

Kirschenhofer.

P.. H. Prodinger and W. SrpankoMskl.

a reply to Profcswr

Andawon’s

Kok, J.N.. .wc F.S. dc Boer Kounalis, (1992)

E.. Testing x7

Kratsch.

IO1 (2) (lYY2)

for

the ground

modeling of data structures on words:

I06 (2) (1992)

395-400

23Y 263

(co-lrcducibillt~

property

in term-rcwrltlng

systems

106 (I)

II7 IO6 (2) (IYY2)

D.. .xv H.L. Bodlacndcr

I IO (I)

H.-J.. .wv A. Habcl

Kruseman

Arctz. F.E.J.. .wv R. Lccrmakers

Kunze.

Probabilistic

lcttcr (L~/rcr 10 //I(, Eflirw)

Krcowski.

151

355

1990

169-207

Janxn,

Kim,

Japan. August 2X-31,

M.. Standard

automata

(I9Y3)

?OY-3’6

I45

IhX

I04 (2) (IY91)

and amldirect

product\

313-313

of transformation

semigroups

I08 (I)

(lYY3)

I71

Kurihara.

M. and A. Ohuchi.

constructors Kwiatkowska,

M.Z..

Workshop Lambert.

Modularity

I03 (21 (lYY7) Editorial

(u,+ v,) in

of clrcult\

K.G., .wc G. Roudol

I06

C.. .w~’ A. Hahel

Le Sa?c. B.. w

of term rwrlting

systems with shared

to the Special Issue of Selected Papers from the International

J.-L.. Sorting the sum:,

Lautemann.

of simple tcrminatlon

2X2

on Semantics for Concurrency

Lange. K.-J.. L’namblgulty Lawn.

273

I07

(I)

IO1 (7) (1997) O(n’)

I I)

(1992)

(19Y2)

137-141

145-16X

IOX (2) (lYY3)

xccnt

I03 (I)

77 94

3 70

I IO (I) (1993)

Do Long Van

comparix~ns

(1993)

BCS-FACS

I SY

237-249

Leermakers.

R.. Rccursi\c

parsing. from EarIcy to Marcus (iVo/rl

Lecrmakera.

R.. L. Auguhteijn and F.F.J. Kruscman

Arctr. A functional

IO3 (2) (1992)

299

312

LR-parw

(h’ofe)

I04 12) (lYY2)

arc qautomatic

(h’orr,)

IOX (2) (1993)

313-323 Lehr, S.. Sums and ratlonnl

multiplc~ of q-automatic

3X5-3’) I Lemieux. Lengauer.

F.. wc F. Bedard T., ,sw C. Cholfrut

Lcscot. M.. w Lc\i.

F. Debart

G, .rer M. Gabhriclli

I07 (I)

(1993)

31 -61

I03 (I) (lY92j IO5 (II I05 (I)

(IYY?) (1991)

I

I41

I66

x5

12x

scqucnccs

Llmongclli.

C. and M. Temperini.

ical computation Lipton.

R.J.. w

Litovsky. Liu.

Abstract specilication of atructurcs and methods in symbolic mathemat-

104 (I) (1992) X0-107

J. Cai

103 (I) (1992) 75-38

1.. .sw Do Long Van

H.. .w’ S.-H.S.

Huang

IOX (21 (1993) 237-249

IO6 (2) (lY92)

361-371

Ltiwe.

M.. Algebraic approach to single-pushout

Lliwe.

M.. see H. Ehrig

I09 (I

L&e.

M.. .,YC H. Ehrig

I09 (l-2)

Luby.

M.. .we P. Dagum

Lutz,

sire relative to pseudorandom

I IO (I) (lYY3)

Maass. W., we M. Dietzfelbinger

oracles

107 (I) (1993) 95-120

S3 7X

IOX (2) (1993) 271-2Y0

Madarlisz.

R.S.. ,we S. CrvcnkoLii’

Madonia.

M.. S. Salemi and T.

108 (I) (lY93) Sportelli.

17-24

A gcncralization

of Sardinas

and Patterson’s

algorithm

to

I08 (2) (1993) 251&270

Magglolo-Schettini,

A. and J. Winkowski.

Towards

an algebra for timed behaviours

103 (2) (1992)

363

Mahcr. II0

(1993) 1X1-224

(1993) 123-143

J.H. and W.J. Schmidt. Circuit

33s

I09 (l-2)

102 (2) (1992) 2X3- 30.5

Maass. A., \w E. Golcs

:-codes

graph transformation

7) (1993) 3-6

M.J..

A transformation

(2) (lYY3)

Main. M.G. and D.L. Mairson.

system for dcductl\c database modules with

Black. Semantic models for total

correctness and fairness

H.G.. A simple proof of a theorem of Statman

Mansour.

perfect model semantics

377 303

Y.. N. Nlsan

and P. Tluarl.

The

(R’otc,)

computational

107 (2) (1993) 305-332

103 (2) (lOY2) 3X7-394

complexity

of universal

hashing

107 (I)

(1993) 121-133 Marche. C., .sw J.-P. Jouannaud Marchetti-Spaccamoln.

104 (I

) (1997)

A.. .xv F. d’Amore

Marek. W. and V.S. Subrnhmanian.

The relationship

semantics for gcncral logic program, Martincr.

S.. .sw E. Cole,

II0

Mason. 1. and C.L. Talcott, .sru
371-384

between stable. supported. default and autoepistemic

103 (2) (1092) 365 386

(I) (1993) 53 78

Inferring

10s (2) (19’)‘)

2Y 5 I

IOX (2) (lYY3)

the equivalence of functional programs that mutate data (Fundcrmuntal

167-215

Mathew.

L.. .xv K.G. Subramanian

Mazuycr.

J. and N. Reimen. A linear speed-up theorem for cellular automata

McKenzie.

P.. SCP F. BCdard

Meinel. Ch., ,xv C. Damm

106 (2) (IYYZ)

I06 (2) (19Y2) 351 360

Meyer. A.R.. .sw B. Bloom

105 (2) (1992) 217-273

101 (2) (1YY2) 223 237

Michel. P.. A survey of bpace complexit)

101 (I) (1992) 9’) 132

Michel. P.. Complevlty

of logical theorich Involving

Mlddendorf.

shortest

(l9Y3)

The

common

coprimalitl

nonsubsequencc

106 (2) (1992) 721-241

problem

is

NP-complete

(iVoru)

I08 (2)

365- 36Y

Milner.

R. and F. Mollcr.

Miola.

IO1 (I) (1992) 59-98

107 (I) (1993) 31-61

Mcscgucr. J.. wc J.A. Gogucn

M..

373 383

A., Foreword

Symbolic Computation Mirwald.

Unique decomposition

of procexxa (Norc,)

to the Selected Papers on Theoretical

R. and C.P.

Systems S-h L norr.

104 (I) (1992) The

multiplicative

107 (7) (1993) 357-363

Issues of Design

and Implementation

of

I complexity

of quadratic

boolean forms

102 (2)

(1992) 307 37x Moller.

F.. .xv R. Milner

107 (2) (1993) 357 363

Montanarl. U. and F. Rossi. Graph rewriting programming I09 (I -2) (1993) 225-256 Montanarl. Moran. Mosbah, Nanni.

U.. .sw A. Corradlm

S.. .wt’ R. Bar Yehuda M.. .stv B. Courcelle

[I.. xv F. d’Amorc

Newman. I., w

R. Heiman

N., .wc’Y. Mansour

ordering semantics of concurrent constraint

103 (I) (1992) 51~106 108 (2) (1993) 31 I-339 IOY

(I -2)

(1993) 4Y X2

IOX (2) (1Y93) 371-384 I07 (I)

Niaan. N.. On read-once vs. multiple Nwn.

for a partial

I 1993)

63-76

access to randomness In logapace

107 (I) (1993)

I21

I33

I07 (I) (1993) 135-144

Occhiuto. Ohuchi.

M.E..

we M. Bcllia

107 (2) (lY93l

A.. w’ M. Kurihara

Paipc. R.. ,we J. Cai PalamidesG. Palopoli.

106 II)

101 (2) ( 1992) 239

I IO

Paterson. M.S.. .we Ll. Zvick P&&xu.

Peled. D.. .YC’C S. KatL Phnn

Minh

IO5 (I) (1992)

On

I IO

w’

RaghaLan.

P.. ,w~ M.W.

L. Zhang

Ramcsh. S.. \L’<’J.J.M.

Bern

quality

Rohson. J.M..

of logic programs

ol’ necklaces in a shuffle-exchange

(19931

2x’)-335

145~ I63

I09

\L’c’ F.S. de Bou

M. Madonia Bern

I:.. The a!eragc

11993) 2Yl

(I

IO1 (‘I

Lut/

(lYY2)

Selman. A.L.. F-ortxurd

251 -270 unfold fold tr;lnaformatlon

systems

IO5 (I) (1992)

57-84

ol’ ;I antrolled

ALOHA

collialon

rcwlutlon

algorithm

IOX 12)

I07 (II

(IYY?) Y5-I’0 integxting

structural

transform~~tions and operations

on

I02 (2) (1992)

307

of recurai\ely

32x

dclincd t>pcs

I06 (I) I 1992) I IY- I34 is dcc~dablc in polynominl time I06 (I ) (19971 13%1X1 to the Special Issue on Structure 1n Complexity Theory 107 (I ) (1993) I

SilLa. M.. wc J. Ehparfa

of tree tranxiuccl-\

I02 (I) (1991)

R.. wv D.P. Bovct

I IO (I

R.. wc’ K.G. Subramanlxn M.. thnar!

IX5

I04 (2) (1992)

Simonson, S.. we A.S. Fracnkel

I

205 263

2X3

119Y3) I97

106 (‘I

214

(I’)‘)?)

pcl-iodic \!nchronwnp

K.. Plcturc lords

373 3x3

xqucnce\

I02 (2) (1992) 253- 781 with inv~a~blc line5 (!VCUC) IOX (21 (19Y3) 357 363

L. Halpenn)

T., YCC’M. Madonna

Srccdhar.

239-263 35 81

257-174

Scldl. H.. Single-cultledncas

Spl-anger. M

I

1 (lYY3)

lir\t-order

M.1.. lntcrpretatlons

Smyth. C., w’

327 ~33.5

IO6 (2) (IO’)21 265~2x1

Schnorr. C.P.. we’ R. Mlrwald

Slowinski.

I06 (2) (1992)

756

7) (1903)

IOX (I

CRI-length

I09 (I ~2) (lYY3)

Shubiwacskl.

385 -390

7 4X

Schneider. H J.. On categorical graph grammars

Schuartbnch.

I06 (2) (1992)

310

Schmidt. W.J.. \wJ.f~

Siromonq.

of dis,iointncsa (.Yorv)

(199.3) 225

IOX (7) (1993)

Sate. T.. Ecl”i~~llcncc-prcsel-~inf Schiebcr. B.. .wc M.W.

( 1093)

2)

IO9 (lb?)

J.. .we Ch. Frougn>

Salcmi. S.. w

Iahel~

N-400

(IO’)21 ?Y--49

(I

109

G.. we B. C‘ourcelle

Ruttcn. J.J.M.M..

Stickcl.

seman(u

IX3

complcxit~

IO3 (I)

t.‘.. we CJ. Montnnari

Saharo\itch.

333

for the number

Mel-e Ianguagch 01‘ gencraliacd star hcipht I INCUC)

Roa\i. F.. .wv A. Cowadinl

Spwtclh.

well-founded

IO1 (I) (19921 59~-9X

1’.. .SOCM. Clubout

Rozenbern.

I73

IO1 (21 (1092) IO7 (I)

N.. we J. Mazoycr

Sil\c\tri.

99- 129

l33- I41

IO6 (7) (IYYZ) 265-2X1

Hooman

D.. sw A. Panconcs~

Schmid.

(1993)

179

htablc and

I06 (2) (lYY2)

IOX (I) (19931

Razbo~-ov. A.A.. On the dtstributional

Rosi.

)

(1992)

3SY

(I) (199.3) 9’)

An asymptotic

H.. we P. Klrwhenhol’cr

Roe\.

I IO (I

II )

(,V~~rcj) I02 (2) (IYY?) 355-365

Prodinger.

Rcimrn.

101

7-25

Qio. W.D..

Ranjan.

337

234 145-163

169 -I96

the trclatlons bctuccn

L. and S.S. I~cnpar.

network

(lY93)

107 (I ) (1992)

space tradcolT\ for set operations

IO1 (21 (lYY2)

D.. \<‘c’ B. Patt-ShamllDung.

I03 (2) (19921 205

and apprsximation

rcgulal- Iangunpcs and Boolean urcuita

P&g.

Praad,

(I)

B. and D. Pclcg. Time

I-‘.. l-ormula\.

263

propl-ams for local stratilication

Panconesi. A. and D. Ranjan. Quantiliers Patt-Shamir.

2x2

(lYY21 21 -60

C.. .sw F.S. dc Boer

L.. Tcatlng loyc

209~-252

IO? (2) (19921 273

102 (21 (lYY2)

324

IOX (21 llYY3)

354

251

370

and M. Wymann-BGnl.

V. and

K. Tagh\a.

H~I\v to dccidc lhc Iark (~VCUC) I10 (7) (1993) 4lY-432 Capturing strong reduction in director string calculus 107 (21 (1993)

347 M.F..

A Prolog

103 (I) (1992)

tcchnolopq

theorem

pro\cr:

a ntx

IO9 -128

Stldham Jr. S.. wc M. El-Taha

IO6 (21 (IYYZ!) 713

263

exposition

and implementation

in Prolog

Straubing.

H.

and

P. Weil,

Stlrtl~~) 104 (2) (1992) Streichcr. T.. Independence constructions

On

a conjecture

(NN~)

of the induction

103 (2) (1992)

Stuckey. P-l., .sw K. Kanchanasut Subrahmanian.

K.G..

Sudborouph.

W.. .w

K.. w

Takada.

P. Kirschenhofcr

Talcott.

C.L.. sw 1. Mason

Tanaka.

G., we M. Katsura

Tempcrlni. Thomas. Tlwari.

333

M.. ,wr C. Limongelli

Vligviilgyi.

Y. Mansour

S., we 2. FiilOp

Van Bake], S.. Complete Villemaire.

121--133

I08 (7) (1993)

185-236

Vogler, H.. .xv Z. Fiil(ip

the Tutorial

Weil. P.. wc H. Straubing

104 (2) (1992)

Wigderson.

A.. wc R. Heiman

107 (I) (1993)

Wlnkowski.

J.. w

Yajima,

M. Sprenger

S.. .we K. Hamaguchi M.-H..

Zwick.

U. and M.S. Paterwn.

135-163

247-248

106 (2) (1992)

337-349

361-371

languages

104 (2) (1992)

235-261

131-144 63-76

103 (2) (1992)

335-363

I IO (2) (1993) 419-432

103 (2) (1992)

Zhang. L. and W.D. Qiu. Decompositions Zhang.

143-159

l-3

beyond context-free I IO (I) (1993)

A. Maggiolo-Schettinl

IO? (I) (1992)

I IO (2) (1993) (Note)

I03 (I) (1992)

161-1X3

R.. .wt’ R. Frcibalds

M.. .w

207-233

129-159

1X5-236

IO5 (I) (1997)

hierarch)

type discipline

Section

I06 (2) (1992)

Wiehagen.

Wymann-Btini.

relations over c*,-words

1;. 1;) ia undecidable

108 (2) (1993)

Wechler. W.. .xv H. Kirchner Weir. D.J.. A eeomctric

+.

Huanp

(1992)

X9- I07

I07 (I) (1993)

introducing

V.. wv S.-H.%

(II

119-149

104 (I) (1992)

R., The theory of (U,

I04 (2) (1992)

104

21-60

restrictlons of the intersection

Van Lecuwen. J.. Editorial Viswanathan.

395-400

367-215

108 (I) (1993)

106 (I) (1992)

373.-383

347

and data type specification

I05 (2) (1992)

106 (2) (1992)

1X5-206

W.. Inlinite trees and ~lutomaton-definable P.. ,w

(I;undtrrnrntrr/

365--3X6 Lyndon trees (Nore)

semilinear sets from examples and via queries

C.L.. A theory for program

R.. .w(’ J. Cai

languages

and the axiom of choice in the pure calculus of

106 (2) (1992)

107 (2) (1993)

Talcott.

Tarjan.

two

27-56

and L. Mathew,

104 (2) (1992)

V. Srccdhar

Y.. Learning

principle

103 (2) (1992)

R. Siromoney

I.H.. sw C. Kim

Srpankowskl. Taghva.

dot-depth

395-408

105 (I) (1992)

V.S.. .sw W. Marek

Subramanian.

concerning

161~-183

191 204

of recognizablestrong

Data types with errors and exceptions

maximal codes

105 (2) (1992)

The mcmorq game (.~ltr/hu,,~trfi~trl

Gtrmrs)

I08 (I) (1993)

173-183

275--299 I IO (I) (1993)

169-196