Advances in Computers, Volume 43

Front Cover
Academic Press, Aug 30, 1996 - Computers - 309 pages
0 Reviews
Since its first volume in 1960, Advances in Computers has presented detailed coverage of innovations in hardware and software and in computer theory, design, and applications. It has also provided contributorswith a medium in which they can examine their subjects in greater depth and breadth than that allowed by standard journal articles. As a result, many articles have become standard references that continue to be of significant, lasting value despite the rapid growth taking place in the field.
 

What people are saying - Write a review

We haven't found any reviews in the usual places.

Contents

III
2
IV
3
V
4
VI
5
VII
6
VIII
13
IX
23
X
27
LXI
164
LXII
169
LXIII
172
LXIV
175
LXV
177
LXVI
178
LXVII
180
LXVIII
188

XI
32
XII
35
XIII
36
XIV
37
XV
39
XVI
41
XVII
43
XVIII
44
XIX
45
XX
46
XXI
52
XXII
54
XXIII
56
XXV
57
XXVI
58
XXVII
60
XXVIII
61
XXIX
62
XXX
63
XXXI
68
XXXII
69
XXXIII
73
XXXIV
85
XXXV
87
XXXVIII
89
XXXIX
91
XL
97
XLI
101
XLIII
125
XLIV
126
XLV
131
XLVI
133
XLVII
134
XLVIII
142
XLIX
143
L
144
LI
145
LII
147
LIII
148
LIV
152
LV
153
LVI
154
LVII
156
LVIII
157
LIX
160
LX
161
LXIX
193
LXX
197
LXXII
199
LXXIII
202
LXXIV
206
LXXV
210
LXXVI
216
LXXVII
217
LXXVIII
218
LXXIX
219
LXXXI
221
LXXXII
222
LXXXIII
223
LXXXIV
224
LXXXVI
226
LXXXVII
228
LXXXVIII
231
LXXXIX
233
XC
234
XCI
235
XCII
237
XCIII
238
XCIV
239
XCV
240
XCVI
241
XCVII
244
XCVIII
245
XCIX
246
C
250
CII
251
CIV
252
CV
253
CVI
255
CVII
258
CVIII
259
CIX
262
CX
264
CXI
265
CXII
271
CXIII
273
CXIV
276
CXV
280
CXVI
288
CXVII
298
Copyright

Other editions - View all

Common terms and phrases

Popular passages

Page 1 - A hundred times every day I remind myself that my inner and outer life depend on the labors of other men, living and dead, and that I must exert myself in order to give in the same measure as I have received and am still receiving.
Page 15 - Is , is a graph containing all vertices on which s has a transitive flow or control dependence (ie, all vertices that can reach s via flow...
Page 13 - G P iff one of the following holds: 1. u is the entry vertex, and v represents a component of P that is not nested within any loop or conditional; these edges are labeled true. 2.

References to this book

Bibliographic information