Last update:
Fri Oct 20 15:21:31 MDT 2023
G. M. Stacey The role of virtual memory in the
handling of application files . . . . . 1--3
F. G. Duncan and
D. Zissos Programmed simulation of sequential
circuits . . . . . . . . . . . . . . . . 4--6
H. A. Maurer The solution of a problem by Ginsburg 7--11 (or 7--10??)
D. Zissos and
F. G. Duncan Programmed simulation of race hazards in
sequential circuits . . . . . . . . . . 11--13
W. Henhapl and
C. B. Jones A run-time mechanism for referencing
variables . . . . . . . . . . . . . . . 14--16
T. H. Merret General programs for management systems 17--20
H. Karlgren Stacking without really stacking when
reducing categorical expressions . . . . 21--22
Donald E. Knuth and
R. W. Floyd Erratum: ``Notes on avoiding `go to'
statements'' . . . . . . . . . . . . . . 23--31
Donald E. Knuth and
R. W. Floyd Notes on avoiding ``go to'' statements 23--31
J. Hopcroft and
R. E. Tarjan A $V^2$ algorithm for determining
isomorphism of planar graphs . . . . . . 32--34
G. Salton The performance of interactive
information retrieval . . . . . . . . . 35--41
D. Tsichritzis A note on comparison of subrecursive
hierarchies . . . . . . . . . . . . . . 42--44
B. F. Caviness and
P. L. Pollack and
C. M. Rubald An existence lemma for canonical forms
in symbolic mathematics . . . . . . . . 45--46
D. L. Milgram and
A. Rosenfeld A note on scattered context grammars . . 47--50
D. G. Corneil An $n^2$ algorithm for determining the
bridges of a graph . . . . . . . . . . . 51--55
I. Munro Efficient determination of the
transitive closure of a directed graph 56--58
E. Gelenbe The two-thirds rule for dynamic storage
allocation under equilibrium . . . . . . 59--60
H. Scheiding Representation and equality of modes . . 61--65
A. Borodin and
I. Munro Evaluating polynomials at many points 66--68
S. G. Tzafestas Input-output modeling and identification
of linear automata . . . . . . . . . . . 69--75 (or 69--70??)
J. C. Ogilvie and
C. L. Olson On the use of complete subgraphs in
cluster analysis . . . . . . . . . . . . 76--79
A. van Dam and
F. Wm. Tompa Software data paging and segmentation
for complex systems . . . . . . . . . . 80--86
J. F. Whale The critical value of the basic
parameter of a nonlinear differential
equation . . . . . . . . . . . . . . . . 87--90
N. Solntseff A classification of extensible
programming languages . . . . . . . . . 91--96
N. Solntseff and
A. Yezerski ECT: an extensible-contractable
translator system . . . . . . . . . . . 97--99
D. Gries Programming by induction . . . . . . . . 100--107
R. Zimmer Soft precedence . . . . . . . . . . . . 108--110
G. Chroust Expression evaluation with minimum
average working storage . . . . . . . . 111--114
B. H. Mayoh Recursion and stacks . . . . . . . . . . 115--116
C. Bron Outline of a machine without branch
instructions . . . . . . . . . . . . . . 117--119
R. E. Tarjan Determining whether a groupoid is a
group . . . . . . . . . . . . . . . . . 120--124
D. Tsichritzis Protection in operating systems . . . . 127--131
R. L. Graham An efficient algorithm for determining
the convex hull of a finite planar set 132--133
J. M. Carroll and
W. Fraser and
G. Gill Automatic content analysis in an on-line
environment . . . . . . . . . . . . . . 134--140
P. Branquart and
J. P. Cardinael and
J. P. Delescaille and
J. Lewi A context-free syntax of ALGOL 68 . . . 141--148
L. Siklóssy Fast and read-only algorithms for
traversing trees without an auxiliary
stack . . . . . . . . . . . . . . . . . 149--152
G. T. Toussaint Feature evaluation with quadratic mutual
information . . . . . . . . . . . . . . 153--156
E. Horowitz A fast method for interpolation using
preconditioning . . . . . . . . . . . . 157--163
J. Král A new additive pseudorandom number
generator for extremely short
word-length . . . . . . . . . . . . . . 164--167
I. N. Molchanov and
L. D. Nikolenko On an approach to integrating boundary
problems with a non-unique solution . . 168--172
Donald E. Knuth and
E. B. Kaehler An experiment in optimal sorting . . . . 173--176
E. W. Dijkstra Information streams sharing a finite
buffer . . . . . . . . . . . . . . . . . 179--180
H. Vantilborgh and
A. van Lamsweerde On an extension of Dijkstra's semaphore
primitives . . . . . . . . . . . . . . . 181--186
R. C. Varney Priority processes used for scheduling
within a tree structured operating
system . . . . . . . . . . . . . . . . . 187--190
Nicholas V. Findler Short Note on a Heuristic Search
Strategy in Long-Term Memory Networks 191--196
R. S. Anderssen A refinement procedure for pure random
search . . . . . . . . . . . . . . . . . 197--200
G. Rozenberg The equivalence problem for
deterministic T0L-systems is undecidable 201--204
I. N. Molchanov and
N. I. Stepanets Iterative methods for solving difference
equations of the theory of elasticity
not depending on the spacing of the
difference net . . . . . . . . . . . . . 205--210
G. B. Krepyshev and
Ya. A. Pollack Synthesis of a discrete-time optimal
filter algorithm with reduced
sensitivity to deviations of a priori
statistics . . . . . . . . . . . . . . . 211--215
E. Horowitz Erratum: ``A fast method for
interpolation using preconditioning'' 216--216
J. Král Erratum: ``A new additive pseudorandom
number generator for extremely short
word-length'' . . . . . . . . . . . . . 216--216
A. Brandstetter Storage Requirements in Stochastic Data
Acquisition Systems . . . . . . . . . . 217--219
J. Nievergelt and
J. Pradels and
C. K. Wong and
P. C. Yue Bounds on the Weighted Path Length of
Binary Trees . . . . . . . . . . . . . . 220--225
R. Bayer Oriented balanced trees and equivalence
relations . . . . . . . . . . . . . . . 226--228
J. Engelfriet A note on infinite trees . . . . . . . . 229--232
G. Rozenberg Direct proofs of the undecidability of
the equivalence problem for sentential
forms of linear context-free grammars
and the equivalence problem for 0L
systems . . . . . . . . . . . . . . . . 233--235
S. G. Tzafestas Design parameters for a multiserver
computer processing buffering system
with feedback . . . . . . . . . . . . . 236--243
J. L. Baker An unintentional omission from ALGOL 68 244--245
R. Reddy and
W. Broadley and
L. Erman and
R. Johnsson and
J. Newcomer and
G. Robertson and
J. Wright Xcribl --- a Hardcopy Scan Line Graphics
System for Document Generation . . . . . 246--251
G. Rozenberg Erratum: ``The equivalence problem for
deterministic T0L-systems is
undecidable'' . . . . . . . . . . . . . 252--252
Naftaly H. Minsky Representation of Binary Trees on
Associative Memories . . . . . . . . . . 1--5
G. Salton Experiments in Multi-Lingual Information
Retrieval . . . . . . . . . . . . . . . 6--11
J. M. Robson An improved algorithm for traversing
binary trees without auxiliary stack . . 12--14
E. G. Coffman, Jr. and
C. J. M. Turnbull A note on the relative performance of
two disk scanning policies . . . . . . . 15--17
R. A. Jarvis On the Identification of the Convex Hull
of a Finite Set of Points in the Plane 18--21
J. Král and
J. Demner A note on the number of states of the De
Remer's recognizer . . . . . . . . . . . 22--23
G. Várhegyi Numerical differentiation of
experimental data . . . . . . . . . . . 24--25
W. Henhapl A transformation of marked graphs . . . 26--29
A. B. Cremers and
H. A. Maurer and
O. Mayer A note on leftmost restricted random
context grammars . . . . . . . . . . . . 31--33
S. I. Roschke and
A. L. Furtado An algorithm for obtaining the chromatic
number and an optimal coloring of a
graph . . . . . . . . . . . . . . . . . 34--38
Joel Coffy On Computing the Time Complexity of
Transitive Closure Algorithms . . . . . 39--42
Azriel Rosenfeld and
David L. Milgram Parallel/Sequential Array Automata . . . 43--46
Gary Lindstrom Scanning List Structures Without Stacks
or Tag Bits . . . . . . . . . . . . . . 47--51
Edward N. Adams, III Another Representation of Binary Tree
Traversal . . . . . . . . . . . . . . . 52--54
D. Holnapy and
M. Szöts and
A. Botár A generalization of the method of finite
differences . . . . . . . . . . . . . . 55--59
Gabor T. Herman On Universal Computer-Constructors . . . 61--64
D. T. Tang and
C. K. Wong A modified branch-and-bound strategy . . 65--69
A. Ehrenfeucht and
G. Rozenberg A limit theorem for sets of subwords in
deterministic T0L languages . . . . . . 70--73
Masaharu Mizumoto and
Junichi Toyoda and
Kohkichi Tanaka Examples of Formal Grammars with Weights 74--78
T. B. Boffey Applying the Minimax Rule over Graphs
Which are not Trees . . . . . . . . . . 79--81
C. A. R. Hoare A general conservation law for queueing
disciplines . . . . . . . . . . . . . . 82--85
I. N. Molchanov and
M. F. Iakovlev On One Class of Iterative Methods for
Obtaining the Generalized Solution of
Non-Consistent Systems of Linear
Algebraic Equations . . . . . . . . . . 86--90
Ravi Sethi A note on implementing parallel
assignment instructions . . . . . . . . 91--95
Stein Krogdahl A dynamic storage allocation problem . . 96--99
J. Cohen Syntax-directed unit conversion . . . . 100--102
G. Yuval On a problem connected with topological
sorting . . . . . . . . . . . . . . . . 103--104
R. Devillers and
G. Louchard Realization of Petri Nets without
Conditional Statements . . . . . . . . . 105--107
Nicholas D. Roussopoulos A ${\rm max}(m,n)$ algorithm for
determining the graph $H$ from its line
graph $G$ . . . . . . . . . . . . . . . 108--112
V. N. Kasyanov Some Properties of Fully Reducible
Graphs . . . . . . . . . . . . . . . . . 113--117
I. N. Molchanov and
E. F. Galba On the Convergence of Difference Schemes
Approximating a Plane Static Problem of
the Theory of Elasticity with Mixed
Boundary Conditions . . . . . . . . . . 118--122
Robert W. Floyd and
Alan J. Smith A linear time two tape merge . . . . . . 123--126 (or 123--125??)
J. K. R. Barnett A technique for reducing comparison
times in certain applications of the
merging method of sorting . . . . . . . 127--128
H. S. Warren, Jr. Minimal comparison sorting by choosing
most efficient comparisons . . . . . . . 129--130
Juhani Karhumäki An example of a PD2L-system with the
growth type $2 1/2$ . . . . . . . . . . 131--134
L. Boasson The inclusion of the substitution
closure of linear and one-counter
languages in the largest sub-AFL of the
family of algebraic languages is proper 135--140
Nissim Francez and
Giora Slutzky On the Non-Compactness of the Class of
Program Schemas . . . . . . . . . . . . 141--142
Barry Dwyer Simple Algorithms for Traversing a Tree
without an Auxiliary Stack . . . . . . . 143--145
H. T. Kung A new upper bound on the complexity of
derivative evaluation . . . . . . . . . 146--147
H. Heuer and
I. N. Molchanov Numerical Solution of a Boundary Problem
for Equations of Elastic Equilibrium of
Bodies in Transferences . . . . . . . . 148--151
Donald E. Knuth and
Jayme L. Szwarcfiter A Structured Program to Generate All
Topological Sorting Arrangements . . . . 153--157
N. Solntseff On a Notational Device for the
Description of Pointer-Free Operations
on Structured Data . . . . . . . . . . . 158--159
R. E. Tarjan A note on finding the bridges of a graph 160--161
Robert B. K. Dewar A stable minimum storage sorting
algorithm . . . . . . . . . . . . . . . 162--164
C. A. R. Hoare Optimization of store size for garbage
collection . . . . . . . . . . . . . . . 165--166
A. G. Middleton Cost-Oriented Program Optimisation . . . 167--170
A. Hansal `Software devices' for processing graphs
using PL/1 compile time facilities . . . 171--179
L. Wayne Jackson and
Subrata Dasgupta The identification of parallel
micro-operations . . . . . . . . . . . . 180--184
K. P. Lee and
G. Rozenberg The length sets of D0L languages are
uniformly bounded . . . . . . . . . . . 185--188
Jack Minker and
Gordon J. VanderBrug The Earley algorithm as a problem
representation . . . . . . . . . . . . . 1--7
K. Noshita Median selection of $9$ elements in $14$
comparisons . . . . . . . . . . . . . . 8--12
Robert Endre Tarjan A new algorithm for finding weak
components . . . . . . . . . . . . . . . 13--15
Lee W. Cooprider and
F. Heymans and
P. J. Courtois and
David L. Parnas Information Streams Sharing a Finite
Buffer: Other Solutions . . . . . . . . 16--21
J. van Leeuwen and
C. H. Smith An improved bound for detecting looping
configurations in deterministic DPA's 22--24
Oscar H. Ibarra A note on semilinear sets and
bounded-reversal multihead pushdown
automata . . . . . . . . . . . . . . . . 25--28
David A. Fisher Bounded Workspace Garbage Collection in
an Address-Order Preserving List
Processing Environment . . . . . . . . . 29--32
A. D. Jovanovich Note on a modification of the
fundamental cycles finding algorithm . . 33
T. Takaoka A note on the ambiguity of context-free
grammars . . . . . . . . . . . . . . . . 35--36
J. A. Campbell Optimal use of storage in a simple model
of garbage collection . . . . . . . . . 37--38
M. V. Zelkowitz Structured operating system organization 39--42
L. E. Deimel, Jr. Remark on the computational power of a
Turing machine variant . . . . . . . . . 43--45
Stefan Arnborg Abstract Computation Model Used for a
Production Compiler . . . . . . . . . . 46--50
R. E. Tarjan A good algorithm for edge-disjoint
branching . . . . . . . . . . . . . . . 51--53
Kojiro Kobayashi A note on extending equivalence theories
of algorithms . . . . . . . . . . . . . 54--56
N. S. Sridharan Computer Generation of Vertex Graphs . . 57--63
Donald E. Knuth and
Jayme L. Szwarcfiter Erratum: ``A Structured Program to
Generate All Topological Sorting
Arrangements'' . . . . . . . . . . . . . 64--64
Richard J. Lipton and
Robert W. Tuttle A synchronization anomaly . . . . . . . 65--66
Chiharu Hosono On the Cardinality of Some Lattices . . 67--68
S. H. Von Solms On T0L Languages over Terminals . . . . 69--70
Subrata Dasgupta and
John Tartar On the Minimization of Control Memories 71--74
T. Kameda On the Vector Representation of the
Reachability in Planar Directed Graphs 75--77
S. Crespi-Reghizzi and
D. Mandrioli A decidability theorem for a class of
vector-addition systems . . . . . . . . 78--80
P. M. Camerini and
F. Maffioli Bounds for $3$-matroid intersection
problems . . . . . . . . . . . . . . . . 81--83
John F. Reiser and
Donald E. Knuth Evading the Drift in Floating-Point
Addition . . . . . . . . . . . . . . . . 84--87
Ivan Dal Bono and
Mauro Diligenti and
Concetta Mosca and
Antonio Ricci and
Antonio Villani A simple FORTRAN support for
computer-assisted instruction . . . . . 88--90
Klaus Weihrauch Program Schemata with Polynomial Bounded
Counters . . . . . . . . . . . . . . . . 91--96
S. Galand and
C. Loncour Structured Implementation of Symbolic
Execution: a First Part in a Program
Verifier . . . . . . . . . . . . . . . . 97--103
Jacques Cohen Interpretation of Non-Deterministic
Algorithms in Higher-Level Languages . . 104--109
Fanica Gavril An algorithm for testing chordality of
graphs . . . . . . . . . . . . . . . . . 110--112
G. Yuval Finding near neighbours in
$K$-dimensional space . . . . . . . . . 113--114
I. Cahit and
R. Cahit On the Graceful Numbering of Spanning
Trees . . . . . . . . . . . . . . . . . 115--118
B. Wegbreit Retrieval from context trees . . . . . . 119--120
S. de Wolf and
G. de Mey Numerical Methods for Solving Integral
Equations of Potential Problems . . . . 121--124
J. M. Robson A simple solution to the interleaved
memory bandwidth problem . . . . . . . . 125--126
Constantine Lazos A Comparison of Simulation Results and a
Mathematical Model of a Multiprogramming
System . . . . . . . . . . . . . . . . . 127--134
J. Kittler On the divergence and the Joshi
dependence measure in feature selection 135--137
Jan Van Leeuwen The membership question for
ET0L-languages is polynomially complete 138--143
F. P. Preparata and
D. E. Muller The time required to evaluate
division-free arithmetic expressions . . 144--146
H. Asai and
S. C. Lee Design of Queueing Buffer Register Size 147--152
A. Stevens An elementary computer algorithm for the
calculation of the coefficient of
inbreeding . . . . . . . . . . . . . . . 153--163
S. Crespi-Reghizzi and
D. Mandrioli Erratum: ``A decidability theorem for a
class of vector-addition systems'' . . . 164--164
John F. Reiser and
Donald E. Knuth Erratum: ``Evading the Drift in
Floating-Point Addition'' . . . . . . . 164--164
N. S. Sridharan Erratum: ``Computer Generation of Vertex
Graphs'' . . . . . . . . . . . . . . . . 164--164
Per Brinch Hansen Universal Types in Concurrent Pascal . . 165--166
D. A. Zave A fast compacting garbage collector . . 167--169
J. L. Bentley and
D. F. Stanat Analysis of range searches in quad trees 170--173
C. Ghezzi LL(1) grammars supporting an efficient
error handling . . . . . . . . . . . . . 174--176
H. F. de Groote On the complexity of quaternion
multiplication . . . . . . . . . . . . . 177--179
Stefan Pleszczy\'nski On the Generation of Permutations . . . 180--183
M. Rem On the programming of elastic stores . . 184--187
R. A. Keir Should the stable rounding rule be
radix-dependent? . . . . . . . . . . . . 188--189
Andrew C. Yao An $O(|E|) \log \log |V|$ algorithm for
finding minimum spanning trees . . . . . 21--23
G. Germano and
A. Maggiolo-Schettini Sequence-to-sequence recursiveness . . . 1--6
K. Ruohonen Three results of comparison between $L$
languages with and without interaction 7--10
Martti Penttonen ET0L-Grammars and $N$-Grammars . . . . . 11--13
J. Nieminen On homomorphic images of transition
graphs . . . . . . . . . . . . . . . . . 14--15
J. Nieminen Some observations on the determination
of an upper bound for the clique number
of a graph . . . . . . . . . . . . . . . 16--17
A. N. C. Kang and
D. A. Ault Some properties of a centroid of a free
tree . . . . . . . . . . . . . . . . . . 18--20
A. C. Yao An $O(|E|) \log \log |V|$ algorithm for
finding minimum spanning trees . . . . . 21--23
J. Misra and
R. E. Tarjan Optimal chain partitions of trees . . . 24--26
Andrzej Rowicki A note on optimal scheduling for
two-processor systems . . . . . . . . . 27--30
Stanislaw Jarzabek and
Tomasz Krawczyk LL-regular grammars . . . . . . . . . . 31--37
M. R. Levy Complete operator precedence . . . . . . 38--40
E. Cockayne and
S. Goodman and
S. Hedetniemi A linear algorithm for the domination
number of a tree . . . . . . . . . . . . 41--44
L. Hyafil and
J. P. Van de Wiele On the additive complexity of specific
polynomials . . . . . . . . . . . . . . 45--47
R. S. Anderssen and
A. J. Guttmann A rationale for the numerical
differentiation of experimental data . . 48--50
A. A. Sekey A generating function for entropy . . . 51
Donald B. Johnson Priority Queues with Update and Finding
Minimum Spanning Trees . . . . . . . . . 53--57
D. Rotem On a correspondence between binary trees
and a certain type of permutation . . . 58--61
D. W. Clark A fast algorithm for copying binary
trees . . . . . . . . . . . . . . . . . 62--63
J. Banerjee and
V. Rajaraman A dual link data structure for random
file organization . . . . . . . . . . . 64--69
A. G. Duncan and
L. Yelowitz Loop unravelling: a practical tool in
proving program correctness . . . . . . 70--72
R. Christensen Crossvalidation: Minimizing the entropy
of the future . . . . . . . . . . . . . 73--76
Judea Pearl On the Complexity of Inexact
Computations . . . . . . . . . . . . . . 77--81
H. G. Barrow and
R. M. Burstall Subgraph isomorphism, matching
relational structures and maximal
cliques . . . . . . . . . . . . . . . . 83--84
Zvi Galil Two Fast Simulations Which Imply Some
Fast String Matching and
Palindrome-Recognition Algorithms . . . 85--87
L. Lamport Comments on ``A synchronization
anomaly'' . . . . . . . . . . . . . . . 88--89
Russell L. Wessner Optimal Alphabetic Search Trees with
Restricted Maximal Height . . . . . . . 90--94
Tomas Lang and
Eduardo B. Fernandez Scheduling of Unit-Length Independent
Tasks with Execution Constraints . . . . 95--98
M. S. Krishnamurthy and
H. R. Ramesha Chandra A note on precedence functions . . . . . 99--100
H. D. Ehrich and
W. Lipski, Jr. On the Storage Space Requirement of
Consecutive Retrieval with Redundancy 101--104
Stefan Feyock Noiselike Transforms of $\omega$-Events 105--108
D. R. Hanson A simple variant of the boundary-tag
algorithm for the allocation of
coroutine environments . . . . . . . . . 109--112 (or 109--111??)
Stanislaw Chrobot Layer --- a Language Construction for
Concurrent Structural Program Design . . 113--117
R. J. Cunningham and
M. E. J. Gilford A note on the semantic definition of
side effects . . . . . . . . . . . . . . 118--120
Wolfgang Coy The logical meaning of programs of a
subrecursive language . . . . . . . . . 121--126
G. Rozenberg On slicing of $K$-iteration grammars . . 127--131
Jon Louis Bentley and
Walter A. Burkhard Heuristics for Partial-Match Retrieval
Data Base Design . . . . . . . . . . . . 132--135
S. de Wolf and
G. de Mey Numerical Solution of Integral Equations
for Potential Problems by a Variational
Principle . . . . . . . . . . . . . . . 136--139
P. A. Pritchard A proof rule for multiple coroutine
systems . . . . . . . . . . . . . . . . 141--143
Peter J. A. Reusch Generalized Lattices Applicable in
Retrieval Models . . . . . . . . . . . . 144--148
D. Dobkin and
J. Van Leeuwen The complexity of vector-products . . . 149--154
G. Yuval An algorithm for finding all shortest
paths using $N^{2.81}$
infinite-precision multiplications . . . 155--156
J. Engelfriet and
S. Skyum Copying theorems . . . . . . . . . . . . 157--161
G. Rozenberg and
D. Wood A note on $K$-iteration grammars . . . . 162--164
Roman Krzemie\'n and
Andrezej \Lukasiewicz Automatic Generation of Lexical
Analyzers in a Compiler-Compiler . . . . 165--168
B. K. Gairola and
V. Rajaraman A distributed index sequential access
method . . . . . . . . . . . . . . . . . 1--5
G. K. Manacher An application of pattern matching to a
problem in geometrical complexity . . . 6--7
E. Arjomandi On finding all unilaterally connected
components of a digraph . . . . . . . . 8--10
H. A. Maurer and
Th. Ottmann and
H.-W. W. Six Implementing Dictionaries Using Binary
Trees of Very Small Height . . . . . . . 11--14
L. Hyafil and
R. L. Rivest Constructing optimal binary decision
trees is NP-complete . . . . . . . . . . 15--17
A. B. Barak On the parallel evaluation of
division-free arithmetic expressions
with fan-in of three . . . . . . . . . . 18--19
L. G. Valiant Relative complexity of checking and
evaluating . . . . . . . . . . . . . . . 20--23
Patrick Shen-Pei Wang Recursiveness of Monotonic Array
Grammars and a Hierarchy of Array
Languages . . . . . . . . . . . . . . . 24--26
G. Marsaglia and
K. Ananthanarayanan and
N. J. Paul Improvements on Fast Methods for
Generating Normal Random Variables . . . 27--30
M. Sassa and
E. Goto A Hashing Method for Fast Set Operations 31--34
C. J. Lucena and
D. D. Cowan Toward a system's environment for
computer assisted programming . . . . . 35--40
Niel K. Madsen and
Garry H. Rodrigue and
Jack I. Karush Matrix Multiplication by Diagonals on a
Vector/Parallel Processor . . . . . . . 41--45
R. L. Probert Commutativity, non-commutativity, and
bilinearity . . . . . . . . . . . . . . 46--49
P. Hansen A cascade algorithm for the logical
closure of a set of binary relations . . 50--54
S. Kundu A linear algorithm for the Hamiltonian
completion number of a tree . . . . . . 55--57
D. Mandrioli $n$-Reconstructability of context-free
grammars . . . . . . . . . . . . . . . . 58--62
G. Yuval Finding nearest neighbours . . . . . . . 63--65
E. L. Lawler A note on the complexity of the
chromatic number problem . . . . . . . . 66--67
F. Luccio and
F. P. Preparata Storage for Consecutive Retrieval . . . 68--71
Nicola Santoro Full Table Search by Polynomial
Functions . . . . . . . . . . . . . . . 72--74
D. A. Zave A series expansion involving the
harmonic numbers . . . . . . . . . . . . 75--77
E. L. Lozinskii On a problem in storage optimization . . 78--80
R. K. Shyamasundar A note on linear precedence functions 81
J. L. Bentley and
A. Chi-Chih Yao An almost optimal algorithm for
unbounded searching . . . . . . . . . . 82--87
K. S. Trivedi On a semaphore anomaly . . . . . . . . . 88--89
Patrick Shen-Pei Wang Erratum: ``Recursiveness of Monotonic
Array Grammars and a Hierarchy of Array
Languages'' . . . . . . . . . . . . . . 90--90
Donald R. Innes and
Shalom Tsur Interval Analysis, Pagination and
Program Locality . . . . . . . . . . . . 91--96
L. Meertens A space-saving technique for assigning
ALGOL 68 multiple values . . . . . . . . 97--99
C. T. Yu and
D. T. Johnson On the complexity of finding the set of
candidate keys for a given set of
functional dependencies . . . . . . . . 100--101
G. Rozenberg More on ET0L systems versus random
context grammars . . . . . . . . . . . . 102--106
Behrokh Samadi $B$-Trees in a System with Multiple
Users . . . . . . . . . . . . . . . . . 107--112
H. N. Gabow Some improved bounds on the number of
$1$-factors of $n$-connected graphs . . 113--115
G. V. Bochmann Comments on monitor definition and
implementation . . . . . . . . . . . . . 116--117
M. Boari and
A. Natali Some properties of deadlock detection
and recovery in readers' and writers'
problems . . . . . . . . . . . . . . . . 118--123 (or 118--122??)
P. Hansen Erratum: ``A cascade algorithm for the
logical closure of a set of binary
relations'' . . . . . . . . . . . . . . 124--124
K. Delcour and
A. J. W. Duijvestein Enclosures: an access control mechanism
with applications in parallel
programming and other areas of system
programming . . . . . . . . . . . . . . 125--135
M. A. Hennell and
M. R. Woodward and
D. Hedley On Program Analysis . . . . . . . . . . 136--140
Giovanni Guida and
Marco Somalvico Semantics in Problem Representation and
Search . . . . . . . . . . . . . . . . . 141--145
Jon Doyle and
Ronald L. Rivest Linear Expected Time of a Simple
Union-Find Algorithm . . . . . . . . . . 146--148
M. Linna The D0L-ness for context-free languages
is decidable . . . . . . . . . . . . . . 149--151
J. Duske and
R. Parchmann and
H. Schumacher A pattern representation of indexed
languages . . . . . . . . . . . . . . . 152--154
Daniel P. Friedman and
David S. Wise Output Driven Interpretation of
Recursive Programs, or Writing Creates
and Destroys Data Structures . . . . . . 155--160
Daniel P. Friedman and
David S. Wise Garbage Collecting a Heap Which Includes
a Scatter Table . . . . . . . . . . . . 161--164
H. N. Gabow A note on degree-constrained star
subgraphs of bipartite graphs . . . . . 165--167
K. Mehlhorn Bracket-languages are recognizable in
logarithmic space . . . . . . . . . . . 168--170
R. Kaye A Gray Code for set partitions . . . . . 171--173
H. Partsch and
P. Pepper A family of rules for recursion removal 174--177
Donald E. Knuth A generalization of Dijkstra's algorithm 1--5
G. Yuval Theil's estimator . . . . . . . . . . . 6--7
E. Goto and
T. Ida and
T. Gunji Parallel Hashing Algorithms . . . . . . 8--13
Narsingh Deo and
M. S. Krishnamoorthy and
Ajit B. Pai Generalizations of line graphs and
applications . . . . . . . . . . . . . . 14--17
F. Chin and
K. Steiglitz A fast error evaluation algorithm for
polynomial approximation . . . . . . . . 18--21
S. S. Reddi Alternate solutions to the cigarette
smokers' problem without conditionals 22--24
A. Rowicki A note on optimal preemptive scheduling
for two-processor systems . . . . . . . 25--28
T. H. Merret Relations as programming language
elements . . . . . . . . . . . . . . . . 29--33
C. P. Schnorr and
H. Klupp A universally hard set of formulae with
respect to non-deterministic Turing
acceptors . . . . . . . . . . . . . . . 35--37
A. P. Ershov On the partial computation principle . . 38--41
R. Zuczek The universal space for parallel
computation . . . . . . . . . . . . . . 42--45
A. Endres and
H.-G. Stork FIFO-optimal placement on pages of
independently referenced sectors . . . . 46--49
Masataka Sassa and
Eiichi Goto ``V-Tape'', a Virtual Memory Oriented
Data Type, and its Resource Requirements 50--55
J. P. Banatre Producing optimised code for coercions 56--59
M. H. Williams Complete operator precedence conditions 60--62
V. Rajaraman and
Om Vikas A first-in-first-out buffered cyclic
memory . . . . . . . . . . . . . . . . . 63--68
T. Hikita and
E. Goto An $O(N)$ Algorithm for Finding
Periodicity of a Sequence Using Hash
Coding . . . . . . . . . . . . . . . . . 69--71
Daniel P. Friedman and
David S. Wise Erratum: ``Garbage Collecting a Heap
Which Includes a Scatter Table'' . . . . 72--72
E. A. Dinic and
A. K. Kelmans and
M. A. Zaitsev Nonisomorphic trees with the same
$T$-polynomial . . . . . . . . . . . . . 73--76
J. Kittler A method for determining class subspaces 77--79
P. van Emde Boas Preserving order in a forest in less
than logarithmic time and linear space 80--82
A. Javor An adaptive time advancement algorithm
for discrete simulation . . . . . . . . 83--86
H. Würgens Comments on ``Error resynchronisation in
producer consumer systems'' . . . . . . 87--90
W. Lipski, Jr. One more polynomial complete consecutive
retrieval problem . . . . . . . . . . . 91--93
S. Kundu Sorting tree, nestling tree and inverse
permutation . . . . . . . . . . . . . . 94--96
K.-J. Räihä and
M. Saarinen An optimization of the alternating
semantic evaluator . . . . . . . . . . . 97--100
J. Cohen and
J. Katcoff Automatic solution of a certain class of
combinatorial problems . . . . . . . . . 101--104
Jozef Winkowski An algebraic characterization of the
behaviour of non-sequential systems . . 105--109
N. D. Jones A note on linear time simulation of
deterministic two-way pushdown automata 110--112
D. A. Turner Error diagnosis and recovery in one pass
compilers . . . . . . . . . . . . . . . 113--115
S. H. Talbert On the formal specification of the
semantics of processed information . . . 116--119
Y. Kobuchi Two characterization theorems of locally
catenative developmental systems . . . . 120--124
A. Brandwajn and
B. Mouneix A study of a page-on-demand system . . . 125--132
V. V. Raghavan and
C. T. Yu A note on a multidimensional searching
problem . . . . . . . . . . . . . . . . 133--135
G. H. Gonnet and
L. D. Rogers The interpolation-sequential search
algorithm . . . . . . . . . . . . . . . 136--139
M. Shaw and
J. F. Traub Selection of good algorithms from a
family of algorithms for polynomial
derivative evaluation . . . . . . . . . 141--145
L. \Lukaszewicz Functional grammars . . . . . . . . . . 146--150
George E. Collins and
David R. Musser Analysis of the Pope--Stein Division
Algorithm . . . . . . . . . . . . . . . 151--155
J. Grant Null Values in a Relational Data Base 156--157
T. D. Bui On an $L$-stable method for stiff
differential equations . . . . . . . . . 158--161
J. B\lazewicz Simple algorithms for multiprocessor
scheduling to meet deadlines . . . . . . 162--164
S. Matwin On the completeness of a set of
transformations optimizing linear
programs . . . . . . . . . . . . . . . . 165--167
R. S. Bird Two dimensional pattern matching . . . . 168--170
I. Cahit Realization of graceful permutation by a
shuffle-exchange network . . . . . . . . 171--173
P. W. Grant Recognition of E0L languages in less
than quatric time . . . . . . . . . . . 174--176 (or 174--175??)
S. Matwin An experimental investigation of
Geschke's method of global program
optimization . . . . . . . . . . . . . . 177--179
J. M. Steckelberg and
S. C. Seth On a relation between algebraic programs
and Turing machines . . . . . . . . . . 180--183
S. M. Selkow The tree-to-tree editing problem . . . . 184--186
J. Madsen An experiment in formal definition of
operating system facilities . . . . . . 187--189
J. Albert and
H. A. Maurer The class of context-free languages is
not an E0L family . . . . . . . . . . . 190--195
N. Francez A case for a forward predicate
transformer . . . . . . . . . . . . . . 196--198
Fanica Gavril Testing for equality between maximum
matching and minimum node covering . . . 199--202
I. S. Herschberg and
J. C. A. Boekhorst Concurrent file access under
unpredictability . . . . . . . . . . . . 203--208
Jon L. Bentley and
Donald F. Stanat and
E. Hollins Williams, Jr. The complexity of finding fixed-radius
near neighbors . . . . . . . . . . . . . 209--212
I. H. Sudborough A note on weak operator precedence
grammars . . . . . . . . . . . . . . . . 213--218
Yehoshua Perl and
Edward M. Reingold Understanding the complexity of
interpolation search . . . . . . . . . . 219--222
Lyle Ramshaw Binomial coefficients with non-integral
lower index . . . . . . . . . . . . . . 223--226
P. W. Grant Addendum: ``Recognition of E0L languages
in less than quatric time'' . . . . . . 228--228
W\lodzimierz Dobosiewicz Sorting by Distributive Partitioning . . 1--6
Danny Dolev and
Eliahu Shamir Commutation Relations of Slices
Characterize Some Synchronization
Primitives . . . . . . . . . . . . . . . 7--9
P. M. Camerini The Min-Max Spanning Tree Problem and
Some Extensions . . . . . . . . . . . . 10--14
Andreas Karayiannis and
Georghios Loizou Cycle Detection in Critical Path
Networks . . . . . . . . . . . . . . . . 15--19
Shalom Tsur Analysis of Queuing Networks in Which
Processes Exhibit Locality-Transition
Behaviour . . . . . . . . . . . . . . . 20--23
Stefano Crespi-Reghizzi and
Dino Mandrioli A Class of Grammar Generating
Non-Counting Languages . . . . . . . . . 24--26
Motoaki Terashima and
Eiichi Goto Genetic order and compactifying garbage
collectors . . . . . . . . . . . . . . . 27--32
Karel Culik, II The Decidability of $\nu$-Local
Catenativity and of Other Properties of
D0L systems . . . . . . . . . . . . . . 33--35
W. E. Howden Lindenmayer Grammars and Symbolic
Testing . . . . . . . . . . . . . . . . 36--39
D. S. Hirschberg An Information-Theoretic Lower Bound for
the Longest Common Subsequence Problem 40--41
Jan Bergstra What is an abstract data type? . . . . . 42--43
F. James Rohlf A Probabilistic Minimum Spanning Tree
Algorithm . . . . . . . . . . . . . . . 44--48
Katsushi Inoue and
Itsuo Takanami and
Akira Nakamura A Note on Two-Dimensional Finite
Automata . . . . . . . . . . . . . . . . 49--52
Kenneth R. Anderson A Reevaluation of an Efficient Algorithm
for Determining the Convex Hull of a
Finite Planar Set . . . . . . . . . . . 53--55
J. Koplowitz and
D. Jouppi A More Efficient Convex Hull Algorithm 56--57
Dennis de Champeaux SUBSTAD: For Fast Substitution in LISP,
With an Application on Unification . . . 58--62
J. Winkowski Erratum: ``An algebraic characterization
of the behaviour of non-sequential
systems'' . . . . . . . . . . . . . . . 63--63
Anonymous A tribute to referees . . . . . . . . . 64--64
W. F. McColl The maximum depth of monotone formulae 65
Yahiko Kambayashi and
Takaki Hayashi and
Yoshikazu Tanaka and
Shuzo Yajima A linear storage space algorithm for a
reference structure index . . . . . . . 66--71
A. S. Sethi and
V. Rajaraman and
P. S. Kenjale An error-correcting coding scheme for
alphanumeric data . . . . . . . . . . . 72--77
A. Brandwajn and
Ph. Kruchten and
J. A. Hernandez ARCADE: a system for research and
education in computer architecture . . . 78--85
S. G. Akl Comments on: G. Manacher, ``An
application of pattern matching to a
problem in geometrical complexity'' . . 86
J. L. Bentley and
M. I. Shamos Divide and conquer for linear expected
time . . . . . . . . . . . . . . . . . . 87--91
Eero Peltola and
Hannu Erkiö Insertion Merge Sorting . . . . . . . . 92--99
G. P\uaun On the generative capacity of simple
matrix grammars of finite index . . . . 100--102
H. Samet A canonical form algorithm for proving
equivalence of conditional forms . . . . 103--106
J. Paredaens On the expressive power of the
relational algebra . . . . . . . . . . . 107--111
M. Boari and
A. Natali Multiple access to a tree in the context
of readers and writers problem . . . . . 112--121
B. F. Caviness and
H. I. Epstein A note on the complexity of algebraic
differentiation . . . . . . . . . . . . 122--124
G. A. Cheston A correction to a unilaterally connected
components algorithm . . . . . . . . . . 125
S. G. Akl and
G. T. Toussaint An improved algorithm to check for
polygon similarity . . . . . . . . . . . 127--128
S. Istrail Tag systems generating Thue irreducible
sequences . . . . . . . . . . . . . . . 129--131
Radha Krishan Arora and
R. K. Subramanian An optimal demand prepaging algorithm 132--136
W. J. Hansen A predecessor algorithm for ordered
lists . . . . . . . . . . . . . . . . . 137--138
L. Allison Phrase structures, non-determinism and
backtracking . . . . . . . . . . . . . . 139--143
G. Huet An algorithm to generate the basis of
solutions to homogeneous linear
Diophantine equations . . . . . . . . . 144--147 (or 144--146??)
F. P. Preparata and
D. V. Sarwate An Improved Parallel Processor Bound in
Fast Matrix Inversion . . . . . . . . . 148--150
S. Sokolowski A method for proving programming
languages non context-free . . . . . . . 151--153
N. Illies A counterexample to the generalized
Aanderaa-Rosenberg conjecture . . . . . 154--155
R. E. Devillers and
P. E. Lauer A general mechanism for avoiding
starvation with distributed control . . 156--158
A. Reiser A linear selection algorithm for sets of
elements with weights . . . . . . . . . 159--162
G. H. Gonnet Notes on the derivation of asymptotic
expressions from summations . . . . . . 165--169
Joost Engelfriet On tree transducers for partial
functions . . . . . . . . . . . . . . . 170--172
S. M. Selkow New bounds for the clique number of a
graph . . . . . . . . . . . . . . . . . 173--174
M. R. Garey and
D. S. Johnson and
F. P. Preparata and
R. E. Tarjan Triangulating a Simple Polygon . . . . . 175--179
G. Schachtel A noncommutative algorithm for
multiplying $5 \times 5$ matrices using
$103$ multiplications . . . . . . . . . 180--182
G. Bongiovanni and
F. Luccio On Cahit's result on graceful
permutations . . . . . . . . . . . . . . 183--184
Richard J. Lipton and
Raymond E. Miller A batching method for coloring planar
graphs . . . . . . . . . . . . . . . . . 185--188
D. T. Lee and
F. P. Preparata The all nearest-neighbor problem for
convex polygons . . . . . . . . . . . . 189--192
R. A. DeMillo and
R. J. Lipton A probabilistic remark on algebraic
program testing . . . . . . . . . . . . 193--195
J. Jaffe Counting productions in context-free
derivations . . . . . . . . . . . . . . 196--200
Charles E. Hughes The equivalence of vector addition
systems to a subclass of Post canonical
systems . . . . . . . . . . . . . . . . 201--204
W. Burton Comments on: Sorting by distributive
partitioning . . . . . . . . . . . . . . 205--206
W. Dobosiewicz Author's reply to Warren Burton's
comments on distributive partitioning
sorting . . . . . . . . . . . . . . . . 206--206
M. Boari and
A. Natali Erratum: ``Multiple access to a tree in
the context of readers and writers
problem'' . . . . . . . . . . . . . . . 207--207
K. Ruohonen A note on language equations involving
morphisms . . . . . . . . . . . . . . . 209--212
I. H. Sudborough A note on weak operator precedence
grammars . . . . . . . . . . . . . . . . 213--218
Selim G. Akl and
Godfried T. Toussaint A fast convex hull algorithm . . . . . . 219--222
I. Bratko Proving correctness of strategies in the
AL1 assertional language . . . . . . . . 223--230
M. R. Brown A storage scheme for height-balanced
trees . . . . . . . . . . . . . . . . . 231--232
Radha Krishan Arora and
R. K. Subramanian Exploiting the Optimal Paging Algorithms 233--236
Kohei Noshita and
Etsuo Masuda and
Hajime Machida On the expected behaviors of the
Dijkstra's shortest path algorithm for
complete graphs . . . . . . . . . . . . 237--243
L. Czaja Implementation approach to parallel
systems . . . . . . . . . . . . . . . . 244--249
T. H. Merret QT logic: simpler and more expressive
than predicate calculus . . . . . . . . 251--255
V. M. Glushkov and
G. E. Tseytlin and
E. L. Yushchenko Certain problems of the theory of
structured programs schemes . . . . . . 256--260
K. S. Natarajan and
Lee J. White Optimum Domination in Weighted Trees . . 261--265
János Demetrovics On the Number of Candidate Keys . . . . 266--269
Miklós Ajtai and
János Komlós and
Endre Szemerédi There is No Fast Single Hashing
Algorithm . . . . . . . . . . . . . . . 270--273
Michael R. Garey and
Robert E. Tarjan A linear-time algorithm for finding all
feedback vertices . . . . . . . . . . . 274--276
V. M. Malhotra and
M. Pramodh Kumar and
S. N. Maheshwari An $O(V^3)$ algorithm for finding
maximum flows in networks . . . . . . . 277--278
Robert Giegerich and
Reinhard Wilhelm Counter-One-Pass Features in One-Pass
Compilation: a Formalization Using
Attribute Grammars . . . . . . . . . . . 279--284
G. Yuval A simple proof of Strassen's result . . 285--286
E. P. Friedman and
S. A. Greibach On Equivalence and Subclass Containment
Problems for Deterministic Context-Free
Languages . . . . . . . . . . . . . . . 287--290
Ludwik Czaja Parallel Implementation of Path
Expressions . . . . . . . . . . . . . . 291--295
A. Bykat Convex hull of a finite set of points in
two dimensions . . . . . . . . . . . . . 296--298
Joseph Shortt An iterative program to calculate
Fibonacci numbers in $O(\log n)$
arithmetic operations . . . . . . . . . 299--303
M. Jakobsson Huffman coding in bit-vector compression 304--307
Jukka Teuhola A compression method for clustered
bit-vectors . . . . . . . . . . . . . . 308--311
D. W. Clark and
C. C. Green A note on shared list structure in LISP 312--314
Christos H. Papadimitriou Efficient search for rationals . . . . . 1--4
K. Culik, II Some decidability results about regular
and pushdown translations . . . . . . . 5--8
Aviezri S. Fraenkel Paired Sequential Lists in a Memory
Interval . . . . . . . . . . . . . . . . 9--10
Sylvia L. Osborn Testing for Existence of a Covering
Boyce-Codd Normal Form . . . . . . . . . 11--14
Katsushi Inoue and
Itsuo Takanami A note on cyclic closure operations . . 15--16
Dana Angluin A note on a construction of Margulis . . 17--19
Steve Fortune and
John Hopcroft A note on Rabin's nearest-neighbor
algorithm . . . . . . . . . . . . . . . 20--23
Yossi Shiloach Edge-disjoint branching in directed
multigraphs . . . . . . . . . . . . . . 24--27
Adi Shamir Factoring numbers in $O(\log n)$
arithmetic steps . . . . . . . . . . . . 28--31
M. Jantzen A note on vector grammars . . . . . . . 32--33
Katsushi Inoue and
Itsuo Takanami A note on bottom-up pyramid acceptors 34--37
A. Buda Generalized ${}^{1,5}$ Sequential
Machine Maps . . . . . . . . . . . . . . 38--40
Daniel P. Friedman and
David S. Wise Reference Counting Can Manage the
Circular Environments of Mutual
Recursion . . . . . . . . . . . . . . . 41--45
O. M. Makarov Using duality to compute the pair of
matrix products $QY$ and $Y^{T}Q$ over a
commutative ring . . . . . . . . . . . . 46--49
Alberto Bertoni and
Giancarlo Mauri and
Mauro Torelli Three efficient algorithms for counting
problems . . . . . . . . . . . . . . . . 50--53
G. H. Gonnet Erratum to ``Notes on the derivation of
asymptotic expressions from summations''
[Inform. Process. Lett. \bf 7(4), June
1978, pp. 165--169] . . . . . . . . . . 54--54
Gordon Lyon Batch Scheduling from Short Lists . . . 57--59
Jacek B\la\.zewicz Deadline scheduling of tasks with ready
times and resource constraints . . . . . 60--63
Dan A. Simovici and
Gh. Grigora\cedlas Even initial feedback vertex set problem
is NP-complete . . . . . . . . . . . . . 64--66
J. L. W. Kessels and
A. J. Martin Two implementations of the conditional
critical region using a split binary
semaphore . . . . . . . . . . . . . . . 67--71
M. Van Der Nat Binary Merging by Partitioning . . . . . 72--75
J. M. Morris A starvation-free solution to the mutual
exclusion problem . . . . . . . . . . . 76--80
Jayadev Misra Space-time trade off in implementing
certain set operations . . . . . . . . . 81--85
H. W. Lenstra, Jr. Miller's primality test . . . . . . . . 86--88
Steven P. Reiss Rational search . . . . . . . . . . . . 89--90
H. S. M. Kruijer Self-stabilization (in spite of
distributed control) in tree-structured
systems . . . . . . . . . . . . . . . . 91--95
David Dobkin and
Richard J. Lipton and
Steven P. Reiss Linear programming is log-space hard for
$P$ . . . . . . . . . . . . . . . . . . 96--97
T. H. Pequeno and
C. J. Lucena An approach for data type specification
and its use in program verification . . 98--103
Gheorghe P\uaun On Szilard's languages associated to a
matrix grammar . . . . . . . . . . . . . 104--105
J. C. Cherniavsky On finding test data sets for loop free
programs . . . . . . . . . . . . . . . . 106--107
S. G. Akl Two remarks on a convex hull algorithm 108--109
Yu. G. Stoyan and
V. Z. Socolovsky The minimization method for some
permutation functionals . . . . . . . . 110--111
C. C. Rick and
D. J. Evans An Improved Bisection Algorithm . . . . 112--113
Wojciech Cellary A new safety test for deadlock avoidance 115--120
Bengt Aspvall and
Michael F. Plass and
Robert Endre Tarjan A linear-time algorithm for testing the
truth of certain quantified Boolean
formulas . . . . . . . . . . . . . . . . 121--123
Om Vikas Analysis of a Periodically Inspected
Buffer . . . . . . . . . . . . . . . . . 124--130
Rudolf Mathon A note on the graph isomorphism counting
problem . . . . . . . . . . . . . . . . 131--132
Jon Louis Bentley and
Hermann A. Maurer A note on Euclidean near neighbor
searching in the plane . . . . . . . . . 133--136
Gerard J. M. Sang Ajang and
Frank Teer An efficient algorithm for detection of
combined occurrences . . . . . . . . . . 137--140
Sukhamay Kundu An intermediate-value theorem for
optimum tree valuation . . . . . . . . . 141--145
Yossi Shiloach Strong linear orderings of a directed
network . . . . . . . . . . . . . . . . 146--148
Jan van Leeuwen On Compromising Statistical Data-Bases
with a Few Known Elements . . . . . . . 149--153
M. R. Brown Addendum to ``A storage scheme for
height-balanced trees'' . . . . . . . . 154--156
S. G. Akl and
G. T. Toussaint Addendum to ``An improved algorithm to
check for polygon similarity'' . . . . . 157--158
M. A. Bonuccelli and
D. P. Bovet Minimum Node Disjoint Path Covering for
Circular-Arc Graphs . . . . . . . . . . 159--161
Ludwik Czaja A specification of parallel problems . . 162--167
Martin Huits and
Vipin Kumar The Practical Significance of
Distributive Partitioning Sort . . . . . 168--169
W\lodzimierz Dobosiewicz The Practical Significance of D.P. Sort
Revisited . . . . . . . . . . . . . . . 170--172
Alain Fournier Comments on convex hull of a finite set
of points in two dimensions [Inform.
Process. Lett. \bf 7 (1978), no. 6,
296--298; MR 80b:68041] . . . . . . . . 173--173
Hirosi Hitotumatu and
Kohei Noshita A technique for implementing backtrack
algorithms and its application . . . . . 174--175
J. Henno The depth of monotone functions in
multivalued logic . . . . . . . . . . . 176--177
Ronald L. Rivest and
Jean-Paul Van de Wiele An $\Omega((n/\lg n)^{1/2})$ lower bound
on the number of additions necessary to
compute $0$-$1$ polynomials over the
ring of integer polynomials . . . . . . 178--180
K. Culik, II and
H. A. Maurer Secure Information Storage and Retrieval
Using New Results in Cryptography . . . 181--186
Esko Ukkonen The nonexistence of some covering
context-free grammars . . . . . . . . . 187--192
C. C. Yang and
D. T. Lee A note on the all nearest-neighbor
problem for convex polygons . . . . . . 193--194
David Harel Two results on process logic . . . . . . 195--198
J. Plesník The NP-completeness of the Hamiltonian
cycle problem in planar digraphs with
degree bound two . . . . . . . . . . . . 199--201
P. S. Pankov and
Si. L. Dolmatov Substantiable evaluations by electronic
computers and their application to one
problem in combinatorial geometry . . . 202--203
Felix J. Fridman and
Glenn H. Holloway and
Naftaly H. Minsky and
Josef Stein Abstract FOR-loops over several
aggregates . . . . . . . . . . . . . . . 204--206
Jörg Mühlbacher $F$-factors of graphs: a generalized
matching problem . . . . . . . . . . . . 207--214
Harold Abelson A note on time-space tradeoffs for
computing continuous functions . . . . . 215--217
T. D. Bui Erratum: ``On an $L$-stable method for
stiff differential equations'' . . . . . 218--218
Y. V. Silva-Filho Average Case Analysis of Region Search
in Balanced $k$-$d$ Trees . . . . . . . 219--223
M. Broy and
M. Wirsing and
J.-P. Finance and
A. Quéré and
J.-L. Remy Methodical Solution of the Problem of
Ascending Subsequences of Maximum Length
Within a Given Sequence . . . . . . . . 224--229
Timo Leipälä On a Generalization of Binary Search . . 230--233
Dario Bini and
Milvio Capovani and
Francesco Romani and
Grazia Lotti $O(n^{2.7799})$ complexity for $n\times
n$ approximate matrix multiplication . . 234--235
Yossi Shiloach A fast equivalence-checking algorithm
for circular lists . . . . . . . . . . . 236--238
Wolfgang Reising A note on the representation of finite
tree automata . . . . . . . . . . . . . 239--240
D. Van der Knijff and
J.-L. Lassez A clarification of the comparison
between some measures of software
science . . . . . . . . . . . . . . . . 241--243
Jon Louis Bentley Decomposable Searching Problems . . . . 244--251
Georghios Loizou Mathematical Solution for a Data
Processing System . . . . . . . . . . . 252--256
Keijo Ruohonen The decidability of the F0L-D0L
equivalence problem . . . . . . . . . . 257--260
C. N. Fischer and
K. C. Tai and
D. R. Milton Immediate error detection in strong
${\rm LL}(1)$ parsers . . . . . . . . . 261--266
Eitan M. Gurari and
Oscar H. Ibarra On the Space Complexity of Recursive
Algorithms . . . . . . . . . . . . . . . 267--271
Arnold L. Rosenberg A note on paths embedded in trees . . . 272--273
N. Soundararajan Axiomatic proofs of total correctness of
programs . . . . . . . . . . . . . . . . 274--277
G. Yuval Corrigendum: ``A simple proof of
Strassen's result'' (Inform. Process.
Lett. \bf 7 (1978), no. 6, 285--286) . . 278--278
Hamish I. E. Gunn and
Ronald Morrison On the implementation of constants . . . 1--4
P. A. S. Veloso Characterizing the regular prefix codes
and right power-bounded languages . . . 5--7
John C. Cherniavsky and
John Keohane and
Peter B. Henderson A note concerning top down program
development and restricted exit control
structures . . . . . . . . . . . . . . . 8--12
D. M. Berry and
R. L. Schwartz United and discriminated record types in
strongly typed languages . . . . . . . . 13--18
P. J. Eberlein A note on median selection and spider
production . . . . . . . . . . . . . . . 19--22
A. Bykat On polygon similarity . . . . . . . . . 23--25
H. B. M. Jonkers A fast garbage compaction algorithm . . 26--30
Glenn K. Manacher and
Albert L. Zobrist Neither the Greedy nor the Delaunay
triangulation of a planar point set
approximates the optimal triangulation 31--34
R. A. De Millo and
R. E. Miller Implicit computation of synchronization
primitives . . . . . . . . . . . . . . . 35--38
Marek J. Lao A new data structure for the UNION-FIND
problem . . . . . . . . . . . . . . . . 39--45
Dario Bini and
Milvio Capovani Lower bounds of the complexity of linear
algebras . . . . . . . . . . . . . . . . 46--47
Andrew C. Yao A note on a conjecture of Kam and Ullman
concerning statistical databases . . . . 48--50
A. Nijholt From left-regular to Greibach normal
form grammars . . . . . . . . . . . . . 51--55
M. R. Brown Some observations on random $2$-$3$
trees . . . . . . . . . . . . . . . . . 57--59
Jan Grabowski The unsolvability of some Petri net
language problems . . . . . . . . . . . 60--63
F. N. Teskey Document retrieval using associative
processors . . . . . . . . . . . . . . . 64--67
F. Frances Yao Graph $2$-isomorphism is NP-complete . . 68--72
Akihiro Nozaki A note on the complexity of
approximative evaluation of polynomials 73--75
R. L. Schwartz Aliasing among pointers in EUCLID . . . 76--79
W. S. Luk `Possible' membership of a multivalued
dependency in a relational database . . 80--83
Andrzej Ehrenfeucht and
Grzegorz Rozenberg An observation on scattered grammars . . 84--85
Andrzej Ehrenfeucht and
Grzegorz Rozenberg Finding a homomorphism between two words
is NP-complete . . . . . . . . . . . . . 86--88
B. Srinivasan and
V. Rajaraman On the normalization of relational
databases . . . . . . . . . . . . . . . 89--92
A. Sengupta and
S. Bandyopadhyay and
P. K. Srimani On identification of CR property in file
organisation . . . . . . . . . . . . . . 93--96
John Grant Partial Values in a Tabular Database
Model . . . . . . . . . . . . . . . . . 97--99
Boguslaw L. Jackowski and
Ryszard Kubiak and
Stefan Soko\lowski Complexity of sorting by distributive
partitioning . . . . . . . . . . . . . . 100--100
Daniel P. Friedman and
David S. Wise Erratum: ``Output Driven Interpretation
of Recursive Programs, or Writing
Creates and Destroys Data Structures'' 101--101
Eike Best A note on the proof of a concurrent
program . . . . . . . . . . . . . . . . 103--104
Alain Fournier and
Zvi Kedem Comments on the all nearest-neighbor
problem for convex polygons . . . . . . 105--107
Charles J. Colbourn The complexity of symmetrizing matrices 108--109
Sandra L. Mitchell and
Stephen Hedetniemi Linear algorithms for edge-coloring
trees and unicyclic graphs . . . . . . . 110--112
R. K. Arora and
S. P. Rana On module assignment in two-processor
distributed systems . . . . . . . . . . 113--117
Alon Itai A randomized algorithm for checking
equivalence of circular lists . . . . . 118--121
M. H. Williams and
A. R. Bulmer A transportable code generator generator
system . . . . . . . . . . . . . . . . . 122--125
M. Ferrari and
G. Guida DB: A LISP-type data base system . . . . 126--134
Amiram Yehudai A note on the pumping lemma for regular
languages . . . . . . . . . . . . . . . 135--136
K. Itano Reduction of page swaps on the two
dimensional transforms in a paging
environment . . . . . . . . . . . . . . 137--140
F. Dévai and
T. Szendrényi Comments on convex hull of a finite set
of points in two dimensions . . . . . . 141--142
Gianfranco Prini Stack implementation of shallow binding
in languages with mixed scoping . . . . 143--154
Hans Langmaack and
Wolfram Lippe and
Franz Wagner The formal termination problem for
programs with finite ALGOL $68$-modes 155--159
D. Harel Erratum: ``Two results on process
logic'' . . . . . . . . . . . . . . . . 160--160
W. Randolph Franklin Padded lists: set operations in expected
$\theta (\log \log N)$ time . . . . . . 161--166
Joseph Y.-T.-T. Leung Bounds on list scheduling of UET tasks
with restricted resource constraints . . 167--170
E. J. Cockayne and
F. Ruskey and
A. G. Thomason An algorithm for the most economic link
addition in a tree communications
network . . . . . . . . . . . . . . . . 171--175
J. Strother Moore A mechanical proof of the termination of
Takeuchi's function . . . . . . . . . . 176--181
A. G. Akritas On the solution of polynomial equations
using continued fractions . . . . . . . 182--184
K. M. Chandy and
J. Misra Deadlock absence proofs for networks of
communicating processes . . . . . . . . 185--189
D. T. Lee and
C. C. Yang Location of multiple points in a planar
subdivision . . . . . . . . . . . . . . 190--193
J. L. Szwarcfiter Systems of distinct representatives for
$k$ families of sets . . . . . . . . . . 195--196
J. M. Morris Traversing binary trees simply and
cheaply . . . . . . . . . . . . . . . . 197--200
Duncan McCallum and
David Avis A linear algorithm for finding the
convex hull of a simple polygon . . . . 201--206
G. Oulsnam Cyclomatic numbers do not measure
complexity of unstructured programs . . 207--211
Nachum Dershowitz A note on simplification orderings . . . 212--215
A. M. Andrew Another efficient algorithm for convex
hulls in two dimensions . . . . . . . . 216--219
J. M. Robson The emptiness of complement problem for
semi extended regular expressions
requires $c^n$ space . . . . . . . . . . 220--222
Kevin Q. Brown Voronoi diagrams from convex hulls . . . 223--228
Sandra L. Mitchell Linear algorithms to recognize
outerplanar and maximal outerplanar
graphs . . . . . . . . . . . . . . . . . 229--232
R. S\lowi\'nski Cost-minimal preemptive scheduling of
independent jobs with release and due
dates on open shop under resource
constraints . . . . . . . . . . . . . . 233--237
Errol L. Lloyd List Scheduling Bounds for UET Systems
with Resources . . . . . . . . . . . . . 28--31
Jan van Leeuwen and
Derick Wood Dynamization of decomposable searching
problems . . . . . . . . . . . . . . . . 51--56
Peter van Emde Boas On the $\Omega(n\log n)$ lower bound for
convex hull and maximal vector
determination . . . . . . . . . . . . . 132--136
A. M. Andrew Corrigendum: ``Another efficient
algorithm for convex hulls in two
dimensions'' (Inform. Process. Lett. \bf
9 (1979), no. 5, 216--219) . . . . . . . 168--168
F. Luccio and
S. Mazzone A cryptosystem for multiple
communication . . . . . . . . . . . . . 180--183
Mark H. Overmars and
Jan van Leeuwen Further comments on A. Bykat's convex
hull algorithm: ``Convex hull of a
finite set of points in two dimensions''
[Inform. Process. Lett. \bf 7 (1978),
no. 6, 296--298; MR 80b:68041] . . . . . 209--212
Henk Meijer and
Selim G. Akl The Design and Analysis of a New Hybrid
Sorting Algorithm . . . . . . . . . . . 213--218
Akira Nakamura and
Katsushi Inoue A remark on two-dimensional finite
automata: ``Some properties of
two-dimensional on-line tessellation
acceptors'' [Inform. Sci. \bf 13 (1977),
no. 2, 95--121; MR 80e:68143] . . . . . 219--222
A. Ehrenfeucht and
G. Rozenberg On the emptiness of the intersection of
two D0S languages problem . . . . . . . 223--225
K. M. Chung and
F. Luccio and
C. K. Wong A new permutation algorithm for bubble
memories . . . . . . . . . . . . . . . . 226--230
Corrado Böhm and
Antonio Mach\`i and
Giovanna Sontacchi Complexity bounds for equivalence and
isomorphism of Latin squares . . . . . . 231--233
Ludwik Czaja Deadlock and Fairness in Parallel
Schemas: a Set-Theoretic
Characterization and Decision Problems 234--239
Kellogg S. Booth Lexicographically least circular
substrings . . . . . . . . . . . . . . . 240--242
Peter Buneman and
Leon Levy The Towers of Hanoi problem . . . . . . 243--244
Katsushi Inoue and
Itsuo Takanami A note on decision problems for
three-way two-dimensional finite
automata . . . . . . . . . . . . . . . . 245--248
Edsger W. Dijkstra and
C. S. Scholten Termination detection for diffusing
computations . . . . . . . . . . . . . . 1--4
W\lodzimierz Dobosiewicz An Efficient Variation of Bubble Sort 5--6
D. C. S. Allison and
M. T. Noga Selection by distributive partitioning 7--8
Tomasz Krawczyk Error correction by mutational grammars 9--15
Kabekode V. S. Bhat On the complexity of testing a graph for
$n$-cube . . . . . . . . . . . . . . . . 16--19
Jan Grabowski The decidability of persistence for
vector addition systems . . . . . . . . 20--23
Michael C. Loui A note on the pebble game . . . . . . . 24--26
J. D. Day On the internal $S$-stability of
Rosenbrock methods . . . . . . . . . . . 27--30
J. D. Day Comments on: ``On an $L$-stable method
for stiff differential equations''
[Inform. Process. Lett. 6 (1977), no. 5,
158--161; MR \bf 56 #10015] by T. D. Bui 31--32
G. Loizou On a cycle finding algorithm . . . . . . 33--36
Donna J. Brown An improved BL lower bound . . . . . . . 37--39
J. L. Peterson A note on colored Petri nets . . . . . . 40--43
L. G. Valiant Computing multivariate polynomials in
parallel . . . . . . . . . . . . . . . . 44--45
R. P. Brent On the area of binary tree layouts . . . 46--48
Charles R. Dyer A fast parallel algorithm for the
closest pair problem . . . . . . . . . . 49--52
Luc Devroye A note on finding convex hulls via
maximal vectors . . . . . . . . . . . . 53--56
E. L. Lloyd Errata: ``List scheduling bounds for UET
systems with resources'' [Inform.
Process. Lett. \bf 10 (1980), no. 1,
28--31; MR 81a:68042] . . . . . . . . . 57--57
J. van Leeuwen and
D. Wood Errata: ``List scheduling bounds for UET
systems with resources'' [Inform.
Process. Lett. \bf 10 (1980), no. 1,
28--31; MR 81a:68042] . . . . . . . . . 57--57
Lech Banachowski A complement to Tarjan's result about
the lower bound on the complexity of the
set union problem . . . . . . . . . . . 59--65
Friedrich J. Urbanek An $O(\log n)$ algorithm for computing
the $n$th element of the solution of a
difference equation . . . . . . . . . . 66--67
David Gries and
Gary Levin Computing Fibonacci numbers (and
similarly defined functions) in log time 68--69
Jürgen Ebert A note on odd and even factors of
undirected graphs . . . . . . . . . . . 70--72
Lishing Liu and
Alan Demers An algorithm for testing lossless join
property in relational databases . . . . 73--76
Franco P. Preparata and
Jean E. Vuillemin Area-Time Optimal VLSI Networks for
Multiplying Matrices . . . . . . . . . . 77--80
K. M. Chung and
F. Luccio and
C. K. Wong Minimum number of steps for permutation
in a bubble memory . . . . . . . . . . . 81--83
Andrew C. Yao A Note on the Analysis of Extendible
Hashing . . . . . . . . . . . . . . . . 84--86
M. Broy Transformational Semantics for
Concurrent Programs . . . . . . . . . . 87--91
Robert B. Johnson, Jr. The complexity of a VLSI adder . . . . . 92--93
J. Calmet and
R. Loos An improvement of Rabin's probabilistic
algorithm for generating irreducible
polynomials over GF($p$) . . . . . . . . 94--95
Charles J. Colbourn and
Brendan D. McKay A correction to Colbourn's paper on the
complexity of matrix symmetrizability:
``The complexity of symmetrizing
matrices'' [Inform. Process. Lett. \bf 9
(1979), no. 3, 108--109; MR 81a:68045] 96--97
Paris C. Kanellakis On the computational complexity of
cardinality constraints in relational
databases . . . . . . . . . . . . . . . 98--101
E. Luque and
A. Ripoll Tuning Architecture via Microprogramming 102--109
E. Leiss A note on a signature system based on
probabilistic logic . . . . . . . . . . 110--113
Joseph Y.-T. Leung and
M. L. Merrill A note on preemptive scheduling of
periodic, real-time tasks . . . . . . . 115--118
J. M. Robson Storage allocation is NP-hard . . . . . 119--125
David Avis Comments on a lower bound for convex
hull determination: ``On the
$\Omega(n\log n)$ lower bound for convex
hull and maximal vector determination''
by van Emde Boas [Inform. Process. Lett.
\bf 10(3), 18 April 1980, pp. 132--136] 126--126
Arnaldo Moura A note on grammatical covers . . . . . . 127--129
T. A. Bailey and
R. G. Dromey Fast string searching by finding subkeys
in subtext . . . . . . . . . . . . . . . 130--133
Francesco Romani Shortest-path problem is not harder than
matrix multiplication . . . . . . . . . 134--136
H. Erkio Internal merge sorting with delayed
selection . . . . . . . . . . . . . . . 137--140
N. Dershowitz The Schorr--Waite marking algorithm
revisited . . . . . . . . . . . . . . . 141--143
E. B. Kinber On inclusion problem for deterministic
multitape automata . . . . . . . . . . . 144--146
A. Laut Safe procedural implementations of
algebraic types . . . . . . . . . . . . 147--151
J. Paredaens and
F. Ponsaert Grant levels in an authorization
mechanism . . . . . . . . . . . . . . . 152--155
Greg N. Frederickson Probabilistic analysis for simple one-
and two-dimensional bin packing
algorithms . . . . . . . . . . . . . . . 156--161
Oscar H. Ibarra and
Shlomo Moran and
Louis E. Rosier A note on the parallel complexity of
computing the rank of order $n$ matrices 162--162
D. R. Hanson Code improvement via lazy evaluation . . 163--167
J. H. ter Bekke Convertibility in databases . . . . . . 168--171
Alberto Pettorossi Derivation of an $O(k^2\,\log n)$
algorithm for computing order-$k$
Fibonacci numbers from the $O(k^3\,\log
n)$ matrix multiplication method . . . . 172--179
M. H. Williams Cubic map configurations . . . . . . . . 180--185
M. H. Williams Batch sizes for the batching method of
colouring planar maps . . . . . . . . . 186--189
Mila E. Majster-Cederbaum A simple relation between relational and
predicate transformer semantics for
nondeterministic programs . . . . . . . 190--192
Rossella Petreschi and
Bruno Simeone A switching algorithm for the solution
of quadratic Boolean equations . . . . . 193--198
R. K. Arora and
S. P. Rana Heuristic algorithms for process
assignment in distributed computing
systems . . . . . . . . . . . . . . . . 199--203
Hiroya Kawai A formal system for parallel programs in
discrete time and space . . . . . . . . 204--210
J. ten Hoopen Consecutive retrieval with redundancy:
an optimal linear and an optimal cyclic
arrangement and their storage space
requirements . . . . . . . . . . . . . . 211--217
Peter Kandzia and
Margret Mangelmann On covering Boyce-Codd normal forms . . 218--223
Seppo Pajunen On two theorems of Lenstra . . . . . . . 224--228
Alfons J. Jammel and
Helmut G. Stiegler On expected costs of deadlock detection 229--231
S. Mauceri and
A. Restivo A family of codes commutatively
equivalent to prefix codes . . . . . . . 1--4
Nai Kuan Tsao The numerical instability of Bini's
algorithm . . . . . . . . . . . . . . . 17--19
Dorothy E. Denning and
Fred B. Schneider Master keys for group sharing . . . . . 23--25
R. Petreschi and
B. Simeone Erratum: ``A switching algorithm for the
solution of quadratic Boolean
equations'' . . . . . . . . . . . . . . 109--109
H. Meijer A note on ``A cryptosystem for multiple
communication'' [Inform. Process. Lett.
\bf 10(4--5), 5 July 1980, pp. 180--183] 179--181
M. E. Hellman Another cryptanalytic attack on ``A
cryptosystem for multiple
communication'' [Inform. Process. Lett.
\bf 10(4--5), 5 July 1980, pp. 180--183] 182--183
Shlomo Moran A note on: ``Shortest-path problem is
not harder than matrix multiplication''
[Inform. Process. Lett. \bf 11 (1980),
no. 3, 134--136; MR 81k:68036] by F.
Romani. With a reply by Romani . . . . . 85--86
Alfred Schmitt On the computational power of the floor
function . . . . . . . . . . . . . . . . 1--3
Ben-Zion Chor Arithmetic of finite fields . . . . . . 4--6
Dhruva Nath and
S. N. Maheshwari Parallel Algorithms for the Connected
Components and Minimal Spanning Tree
Problems . . . . . . . . . . . . . . . . 7--11
Andries E. Brouwer and
Peter van Emde Boas A note on: ``Master keys for group
sharing'' [Inform. Process. Lett. \bf 12
(1981), no. 1, 23--25; MR 82d:94046] by
D. E. Denning and F. B. Schneider . . . 12--14
Ronald Backhouse Writing a number as the sum of two
squares: a new solution . . . . . . . . 15--17
E. Gelenbe and
D. Gardy On the size of projections . . . . . . . 18--21
Hamish I. E. Gunn Compile Time Type Checking of Structure
Field Accessing . . . . . . . . . . . . 22--25
R. Endre Tarjan A hierarchical clustering algorithm
using strong components . . . . . . . . 26--29
Robert Endre Tarjan Sensitivity analysis of minimum spanning
trees and shortest path trees . . . . . 30--33
Jan van Leeuwen and
Maurice Nivat Efficient recognition of rational
relations . . . . . . . . . . . . . . . 34--38
Ker-I Ko Some observations on the probabilistic
algorithms and NP-hard problems . . . . 39--43
Shmuel Zaks Generation and ranking of $K$-ary trees 44--48
L. Fariñas Del Cerro A simple deduction method for modal
logic . . . . . . . . . . . . . . . . . 49--51
A. O. Slisenko Context-free grammars as a tool for
describing polynomial-time subclasses of
hard problems . . . . . . . . . . . . . 52--56
M. H. Graham and
A. O. Mendelzon Strong equivalence of relational
expressions under dependencies . . . . . 57--62
J. C. Lagarias and
D. E. Swartwout Minimal storage representations for
binary relations . . . . . . . . . . . . 63--66
Guiseppina Gini The automatic synthesis of iterative
programs . . . . . . . . . . . . . . . . 67--73
H. Edelsbrunner and
H. A. Maurer and
D. G. Kirkpatrick Polygonal intersection searching . . . . 74--79
J. A. Bergstra and
J.-J. Ch. Meyer A simple transfer lemma for algebraic
specifications . . . . . . . . . . . . . 80--85
Eliezer Upfal Formal correctness proofs of a
nondeterministic program . . . . . . . . 86--92
Lud\vek Ku\vcera Parallel computation and conflicts in
memory access . . . . . . . . . . . . . 93--96
Takashi Yokomori and
Derick Wood and
Klaus-Jörn Lange A three-restricted normal form theorem
for ETOL languages . . . . . . . . . . . 97--100
Jorma Tarhio LR Parsing of Some Ambiguous Grammars 101--103
Dietmar Wätjen and
Werner Struckmann An algorithm for verifying equations of
morphisms in a category . . . . . . . . 104--108
K. N. King and
Barbara Smith-Thomas An optimal algorithm for sink-finding 109--111
J.-L. Lassez and
V. L. Nguyen and
E. A. Sonenberg Fixed point theorems and semantics: a
folk tale . . . . . . . . . . . . . . . 112--116
R. H. Barlow and
D. J. Evans and
J. Shanehchi Parallel multisection for the
determination of the eigenvalues of
symmetric quindiagonal matrices . . . . 117--118
Johannes Röhrich A hybrid of Quicksort with $O(n \log n)$
worst case complexity . . . . . . . . . 119--123
Herbert Edelsbrunner and
Mark H. Overmars On the equivalence of some rectangle
problems . . . . . . . . . . . . . . . . 124--127
Calvin C. Elgot and
Alan J. Perlis and
Lawrence Snyder A syntax-free semantics for the APL
operators . . . . . . . . . . . . . . . 128--131
Dzenan Ridjanovic and
Michael L. Brodie Defining Database Dynamics with
Attribute Grammars . . . . . . . . . . . 132--138
J. F. Korsh Growing nearly optimal binary search
trees . . . . . . . . . . . . . . . . . 139--143
Dario Bini Reply to the paper: ``The numerical
instability of Bini's algorithm''
[Inform. Process. Lett. \bf 12 (1981),
no. 1, 17--19; MR 82i:65029] by N. K.
Tsao . . . . . . . . . . . . . . . . . . 144--145
M. Jakobsson Evaluation of a hierarchical bit-vector
compression technique . . . . . . . . . 147--149
Jack A. Orenstein Multidimensional Tries Used for
Associative Searching . . . . . . . . . 150--157
Hiroshi Umeo and
Kenichi Morita and
Kazuhiro Sugata Deterministic One-Way Simulation of
Two-Way Real-Time Cellular Automata and
its Related Problems . . . . . . . . . . 158--161
G. Beretta Monte Carlo estimation of numerical
stability in fast algorithms for systems
of bilinear forms . . . . . . . . . . . 162--167
Paul Franchi-Zannettacci An extension to trees of the Sardinas
and Patterson algorithm . . . . . . . . 168--173
R. Demolombe Generalized division for relational
algebraic language . . . . . . . . . . . 174--178
Ernst-E. E. Doberkat Asymptotic estimates for the higher
moments of the expected behavior of
straight insertion sort . . . . . . . . 179--182
Michael J. Fischer and
Nancy A. Lynch A lower bound for the time to assure
interactive consistency . . . . . . . . 183--186
Jiann H. Jou and
Patrick C. Fischer The complexity of recognizing $3{\rm
NF}$ relation schemes . . . . . . . . . 187--190
Jack Minker and
Guy Zanon An extension to linear resolution with
selection function . . . . . . . . . . . 191--194
Bengt Aspvall and
Michael F. Plass and
Robert Endre Tarjan Erratum: ``A linear-time algorithm for
testing the truth of certain quantified
Boolean formulas'' [Inform. Process.
Lett. \bf 8 (1979), no. 3, 121--123; MR
80b:68050] . . . . . . . . . . . . . . . 195--195
R. E. Krichevsky Letter to the editor: ``A family of
codes commutatively equivalent to prefix
codes'' [Inform. Process. Lett. \bf 12
(1981), no. 1, 1--4; MR 82j:94021] by S.
Mauceri and A. Restivo . . . . . . . . . 238--238
Lud\vek Ku\vcera Erratum and addendum to: ``Parallel
computation and conflicts in memory
access'' [Inform. Process. Lett. \bf 14
(1982), no. 2, 93--96; MR 83g:68038] . . 107--107
Takashi Yokomori and
Derick Wood and
Klaus-Jörn Lange Erratum: ``A three-restricted normal
form theorem for ETOL languages''
[Inform. Process. Lett. \bf 14 (1982),
no. 3, 97--100; MR 83g:68115] . . . . . 53--53
J. K. Annot and
M. D. Janssens and
A. J. Van De Goor Comments on Morris's starvation-free
solution to the mutual exclusion problem 91--97
R. E. Tarjan Corrigendum: ``Sensitivity analysis of
minimum spanning trees and shortest path
trees'' [Inform. Process. Lett. \bf
14(1), 27 March 1982, pp. 30--33] . . . 219--219
David Gries and
Ivan Stojmenovic A Note on Graham's Convex Hull Algorithm 323--327