Acta Informatica 1997: Vol 34 Index

3 Pages·1997·0.7 MB·English

Springer Verlag 1997
Index Volume 34 1997
Aczél J, Ertel W: A new formula for speedup Engelfriet J, Vereijken JJ: Context-free
and its characterization 637 graph grammars and concatenation of
Agarwal R — Burnetas A graphs 773
Ertel W > Aczél J
Baier Ch, Majster-Cederbaum ME: Metric Esparza J: Decidability of model checking
semantics from partial order seman- for infinite-state Concurrent systems 85
tics 701
Barbuti R, De Francesco N, Santone A Fernau H: Unconditional transfer in regula-
Algebraic computational models of ted rewriting 837
OR-parallel execution of Prolog 449 Fiilép Z, Vagvélgyi S: Minimal equational
Brisaboa NR, Hernandez HJ: Testing bag- representations of recognizable tree langu-
containment of conjunctive queries 557 ages +9
Bruno J, Coffman Jr EG: Optimal fault-
tolerant computing on multiprocessor Garg VK, Tomlinson AI: Using the causal
systems 881 domain to specify and verify distributed
Burnetas A, Solow D, Agarwal R: An analy- programs 667
sis and implementation of an efficient Gente M > Trogemann G
in-place bucket sort 687 Gorrieri R > Corradini F
“hang M-S — Liang YD Hakala I, Kortelainen J: On the system of
‘hanson ST — Hui C-C word equations x} x5 - x},=y) Yo-" Yi
‘hau S-C — Wang K (iz 1, 2, inafree monoid 217
‘offman Jr EG — Bruno J Hemaspaandra LA, Rothe J, Wechsung G
‘orradini F, De Nicola R: Locality based Easy sets and hard certificate sche-
semantics for process algebras 291 mes 859
‘orradini F, Gorrieri R, Roccetti M: Perfor- Hernandez HJ — Brisaboa NR
mance preorder and competitive equiva- Hsieh CS: A fine-grained data-flow analysis
lence 805 framework 653
‘ulik Ii K, Dube S: Implementing Daube- Huang Y — Rangarajan S
chies wavelet transform with weighted Hui C-C, Chanson ST: Minimal communica-
finite automata 347 tion cost software construction in the Inter-
“ulik I] K, Kari J: Computational fractal net environment 579
geometry with WFA 151
Janicki R, Koutny M: Fundamentals of mo-
De Francesco N — Barbuti R delling concurrency using discrete relatio-
De Nicola R — Corradini F nal structures 367
Djidjev HN, Venkatesan SM: Reduced con-
stants for simple cycle graph separa- Kari J — Culik II K
tion 231 Katoen J-P — Nymeyer A
Dube S > Culik II K Keesmaat NW, Kleijn HCM: Net-based con-
trol versus rational control. The relation
Efe K, Eleser N: An optimal emulator and between ITNC vector languages and ratio-
VLSI layout for complete binary trees 429 nal relations 23
Eiter T, Mannila H: Distance measures for Kleijn HCM — Keesmaat NW
point sets and their computation 109 Kortelainen J — Hakala I
Eleser N — Efe K Koutny M — Janicki R
I\
Laurent D, Phan Luong V, Spyratos N: The Rus T, Pemmaraju S: Using graph coloring in
use of deleted tuples in database, querying an algebraic compiler 191
and updating 905 RuBmann A: Dynamic LL(&) parsing A
Levene M, Loizou G The additivity problem
for functional dependencie Ss in incomplete Santone A — Barbuti R
relations 135 Savicky P, Wegener I: Efficient algorithms
Liang YD, Chang M-S: Minimum feedback for the transformation between different
vertex sets in cocomparability graphs and types of binary decision diagrams 2yA4 )
convex bipartite graphs Shapiro A: A generalized distribution model
Lippe I > ter Hofstede AHM for random recursive trees 211
Loizou G > Levene M Solow D — Burnetas A
Spyratos N — Laurent D
Mayjster-( ederbaum MI Stephens R: A survey of stream
np rocessing 49]
ter Hofstede AHM, Lippe E, van der Weide
rP: Applications of a categorical frame-
work for conceptual data modelling 927
Tomlinson Al > Garg VK
grammar classes and Tripathi SK + Rangarajan S
acceptors SdY Trogemann G, Gente M Performance analy-
sis of parallel programs based on directed
ishihara N > Morita K acyclic graphs 411
Nymeyer A, Katoen J-P: Code generation
based on formal BURS theory and heuristic Vagvolgyi S — Fiildp Z
} 59° van der Weide TP — ter Hofstede \HM
Venkatesan SM — Djidjev HN
Vereijken JJ — Engelfriet J
Wang K, Zhang W, Chau S-C: Weakly inde-
pend jent database schemes |
Wechsung G — Hemaspaandra LA
Wegener I — SavickyP
imamoto } > Morita K
amazaki K \ hierarchy of the class of apex
NLC graph languages by bounds on the
pathi SK On the number of nonterminal nodes in produc-
scalability an re tions <
resilient t protocol
toccetti M > Corradini fF Zhang W + Wang K
Zhang Z > Morita K
e
e
SE ghtE AS SP aey
eeeefo r EE fe . ..
e