Last update:
Sat Nov 23 12:16:05 MST 2019
J. C. Simon and
G. Guiho On algorithms preserving neighborhood,
to file and retrieve information in a
memory . . . . . . . . . . . . . . . . . 3--15
K. O. Biss and
R. T. Chien and
F. A. Stahl A data structure for cognitive
information retrieval . . . . . . . . . 17--27
L. W. Hunter A data representation code for text
processing systems . . . . . . . . . . . 29--42
J. T. Tou and
R. C. Gonzalez Automatic recognition of handwritten
characters via feature extraction and
multi-level decision . . . . . . . . . . 43--65
M. Terrenoire and
M. Simonet An evaluation of ALGOL 68 for
interrogation process algorithms . . . . 67--73
T. Ibaraki and
T. K. Liu and
C. R. Baugh and
S. Muroga An implicit enumeration program for
zero-one integer programming . . . . . . 75--92
H. Katzan, Jr. An APL approach to the representation
and manipulation of data structures . . 93--113
A. D. Inselberg and
E. B. Altman 2-SLIDS: a two-stage linked storage
structure with link-dependent data
capabilities . . . . . . . . . . . . . . 115--133
K. S. Fu and
T. Huang Stochastic grammars and languages . . . 135--170
C. Bohm and
M. Dezani A CUCH-machine: the automatic treatment
of bound variables . . . . . . . . . . . 171--191
M. B. Wells and
J. B. Morris The unified data structure capability in
Madcap VI . . . . . . . . . . . . . . . 193--208
D. S. Wile and
C. M. Geschke An implementation base for efficient
data structuring . . . . . . . . . . . . 209--224
M. V. Wilkes Associative tabular data structures . . 225--233
V. A. Busam A dictionary structure for a PL/1
compiler . . . . . . . . . . . . . . . . 235--253
K. Maruyama A procedure to determine intersections
between polyhedral objects . . . . . . . 255--266
D. J. Mishelevich Computer-based semantic analyzers . . . 267--286
A. van Dam Some implementation issues relating to
data structures for interactive graphics 287--314
M. V. Wilkes and
W. D. Manville The associative language AL-1 . . . . . 315--327
G. J. Lipovski Data structures in content-addressed
cellular memories . . . . . . . . . . . 329--353
C. E. Hughes Degrees of unsolvability associated with
Markov algorithms . . . . . . . . . . . 355--365
K. Walk Modeling of storage properties of
higher-level languages . . . . . . . . . 1--24
Y. Zalcstein On the semigroups of linear sequential
machines . . . . . . . . . . . . . . . . 25--28
A. G. Ivakhnenko Problems of complex system modeling and
applied mathematical statistics . . . . 49--60
E. Diday The dynamic clusters method in
nonhierarchical clustering . . . . . . . 61--88
K. Brunnstein and
J. W. Schmidt Structuring and retrieving information
in computer-based learning . . . . . . . 89--101
C. Chitti Babu On the application of probabilistic
distance measures for the extraction of
features from imperfectly labeled
patterns . . . . . . . . . . . . . . . . 103--114
J. Rickman and
W. E. Walden Structures for an interactive on-line
thesaurus . . . . . . . . . . . . . . . 115--127
R. V. Book On the structure of context-sensitive
grammars . . . . . . . . . . . . . . . . 129--139
W. H. Payne Partial sorting: a large vector
technique and its application . . . . . 141--156
C. Bohm and
M. Dezani Notes on `A CUCH-machine: the automatic
treatment of bound variables' . . . . . 157--160
N. V. Findler and
D. Chen On the problems of time, retrieval of
temporal relations, causality, and
coexistence . . . . . . . . . . . . . . 161--185
J. M. Burke and
J. T. Rickman Bitmaps and filters for
attribute-oriented searches . . . . . . 187--200
M. J. Spier A model implementation for protective
domains . . . . . . . . . . . . . . . . 201--229
V. K. Jain ECG waveform feature extraction and its
application to automated prognosis . . . 231--247
L. L. Rose and
M. H. Gotterer A theory of dynamic file management in a
multilevel store . . . . . . . . . . . . 249--256
R. E. Osteen and
J. T. Tou A clique-detection algorithm based on
neighborhoods in graphs . . . . . . . . 257--268
J. L. Clark PATRICIA-II. Two-level overlaid indexes
for large libraries . . . . . . . . . . 269--292
G. C. Ealer and
N. F. Jensen and
E. G. Monaco Data base organization and retrieval
techniques for steam turbine engineering 293--309
G. Rozenberg Extension of tabled 0L-systems and
languages . . . . . . . . . . . . . . . 311--336
J. Cohen and
L. Trilling and
P. Wegner A nucleus of a theorem-prover described
in ALGOL-68 . . . . . . . . . . . . . . 1--31
E. K. Bowdon, Sr. and
S. A. Mamrak and
F. R. Salz A simulation tool for performance
evaluation of the IBM 360/75 . . . . . . 33--57
J. P. Ignizio and
R. M. Harnett Heuristically aided set-covering
algorithms . . . . . . . . . . . . . . . 59--70
A. Bouckaert Computer diagnosis of goiters. IV.
Optimal planning of physical
observations . . . . . . . . . . . . . . 71--92
B. Shneiderman A model for optimizing indexed file
structures . . . . . . . . . . . . . . . 93--103
J. Minker and
J. R. McSkimin and
D. H. Fishman MRPPS --- an interactive refutation
proof procedure system for question
answering . . . . . . . . . . . . . . . 105--122
S. Nishihara and
H. Hagiwara A full table quadratic search method
eliminating secondary clustering . . . . 123--128
A. Kandel Application of fuzzy logic to the
detection of static hazards in
combinational switching systems . . . . 129--139
E. S. Santos One-way acceptors and languages . . . . 141--151
C. A. Mateescu and
I. O. Stamatescu On an information processing model
applied to optical illusions and
computer simulations . . . . . . . . . . 153--166
M. Stonebraker The choice of partial inversions and
combined indices . . . . . . . . . . . . 167--188
J. Earley Syntax extension using a run time model 189--196
G. Lindstrom Algorithms for list structure
condensation . . . . . . . . . . . . . . 197--216
J. Minker and
G. J. VanderBrug Representations of the language
recognition problem for a theorem prover 217--250
Hung Chi Lai and
S. Muroga and
T. Nakagawa Redundancy check technique for designing
optimal networks by branch-and-bound
method . . . . . . . . . . . . . . . . . 251--271
F. R. D. Velasco and
C. De-Renna e. Souza Sequential syntactical decoding . . . . 273--287
S. A. Greibach Some restrictions on W-grammars . . . . 289--327
B. H. McCormick and
S. N. Jayaramamurthy Time series model for texture synthesis 329--343
A. Bouckaert Computer diagnosis of goiters. The
optimal size of optimal
subsymptomatologies . . . . . . . . . . 345--362
B. H. McCormick and
S. N. Jayaramamurthy A decision theory method for the
analysis of texture . . . . . . . . . . 1--38
S. Treu On-line student debate: an experiment in
communication using computer networks 39--51
D. Wood A note on Lindenmayer systems, Szilard
languages, spectra, and equivalence . . 53--62
M. Dal Cin Fuzzy-state automata: their stability
and fault tolerance . . . . . . . . . . 63--80
M. Dal Cin Modification tolerance of fuzzy-state
automata . . . . . . . . . . . . . . . . 81--93
H. J. Shyr and
G. Thierrin Left-noncounting languages . . . . . . . 95--102
C. A. R. Hoare Recursive data structures . . . . . . . 105--132
M. J. Spier A pragmatic proposal for the improvement
of program modularity and reliability 133--149
S. K. Shrivastava Process synchronization in high-level
languages . . . . . . . . . . . . . . . 151--169
Y. R. Wang On data retrieval from unambiguous bit
matrices . . . . . . . . . . . . . . . . 171--187
A. L. Rosenberg On storing arbitrarily many extendible
arrays of arbitrary dimensions . . . . . 189--196
L. L. Rose and
M. H. Gotterer File evaluation in auxiliary storage . . 197--204
E. Persoon and
K. S. Fu Sequential classification of strings
generated by SCFG's . . . . . . . . . . 205--217
A. Ehrenfeucht and
K. P. Lee and
G. Rozenberg Subword complexities of various classes
of deterministic developmental languages
with interactions . . . . . . . . . . . 219--236
K. Hwang Some structural complexities of
time-varying sequential machines . . . . 237--245
Hsi-Han Yeh Parameter optimization of stochastic
automata operating in random
environments . . . . . . . . . . . . . . 247--263
J. A. Moyne Relevance of computer science to
linguistics and vice versa . . . . . . . 265--279
P. C. Yue and
C. K. Wong Near-optimal heuristics for an
assignment problem in mass storage . . . 281--294
H. Kameda The analysis of an adaptive workload
balancing strategy in computing system
resources management . . . . . . . . . . 295--306
P. C. Yue and
C. K. Wong Storage cost considerations in secondary
index selection . . . . . . . . . . . . 307--327
Beng-Tung Ang A heuristic-adaptive procedure for
segmentation of time patterns . . . . . 329--348
P. C. Parks and
A. G. Ivakhnenko and
L. M. Boichuk and
Svetalsky and
B. K. A self-organizing model of the British
economy for control with optimal
prediction using the
balance-of-variables criterion . . . . . 349--379
B. V. Dasarathy and
A. L. Lakshminarasimhan Sequential learning employing unfamiliar
teacher hypothesis (SLEUTH) with
concurrent estimation of both the
parameters and teacher characteristics 1--7
W. S. Bowie Applications of graph theory in computer
systems . . . . . . . . . . . . . . . . 9--31
B. Shneiderman and
S. C. Shapiro Toward a theory of encoded data
structures and data translation . . . . 33--43
L. W. Fung and
K. S. Fu An error-correcting syntactic decoder
for computer networks . . . . . . . . . 45--58
J. W. White An off-line simulation system for
development of real-time FORTRAN
programs . . . . . . . . . . . . . . . . 59--79
M. G. Thomason and
E. W. Page Boolean difference techniques in fault
tree analysis . . . . . . . . . . . . . 81--88
A. L. Furtado Characterizing sets of data structures
by the connectivity relation . . . . . . 89--109
A. J. Guttmann Programming recursively defined
functions in FORTRAN . . . . . . . . . . 111--122
B. Shneiderman Exploratory experiments in programmer
behavior . . . . . . . . . . . . . . . . 123--143
R. C. Gonzalez and
J. J. Edwards and
M. G. Thomason An algorithm for the inference of tree
grammars . . . . . . . . . . . . . . . . 145--164
D. Dorrough Pattern classes: a technique for
recovering their distributions . . . . . 165--199
J.-L. Lassez Circular codes and synchronization . . . 201--208
H. C. Johnston Cliques of a graph-variations on the
Bron-Kerbosch algorithm . . . . . . . . 209--238
M. Maekawa Detection of parallelism between
statements by decomposing into separate
sequential processes . . . . . . . . . . 239--255
R. L. Cannon, Jr. An algebraic technique for
context-sensitive parsing . . . . . . . 257--276
H. Hinomoto Observations of a firm's information
processing with a data base management
system . . . . . . . . . . . . . . . . . 277--302
W. Stallings An application of coroutines and
backtracking in interactive systems . . 303--313
T. Ibaraki Theoretical comparisons of search
strategies in branch-and-bound
algorithms . . . . . . . . . . . . . . . 315--344
H. N. Gabow Using Euler partitions to edge color
bipartite multigraphs . . . . . . . . . 345--355
R. V. Skavaril and
O. R. Miller Binary input, output, and manipulation
extensions of conversational programming
with some biological applications . . . 357--373
H. Hellerman and
R. Cavallo On the solution of multiattribute
problems involving counting in
intersecting sets . . . . . . . . . . . 1--7
S. R. Jordan A natural language understander based on
a freely associated learned memory net 9--25
Hwang Kai On syntactic edge detection in noisy
pictures . . . . . . . . . . . . . . . . 27--40
S. A. Starks and
R. J. P. de Figueiredo and
D. L. Van Rooy An algorithm for optimal single linear
feature extraction from several Gaussian
pattern classes . . . . . . . . . . . . 41--54
T. P. Neff and
A. Kandel Simplification of fuzzy switching
functions . . . . . . . . . . . . . . . 55--70
J. S. Hughes and
A. Kandel Applications of fuzzy algebra to hazard
detection in combinational switching
circuits . . . . . . . . . . . . . . . . 71--82
K. Tanatsugu and
S. Arikawa On characteristics sets and degrees of
finite automata . . . . . . . . . . . . 83--93
H. P. Edmundson Statistical inference in mathematical
and computational linguistics . . . . . 95--129
K. Maruyama and
D. T. Tang and
S. K. Chang A general packing algorithm for
multidimensional resource requirements 131--149
J. C. Muzio A prefix operator for a switching
algebra . . . . . . . . . . . . . . . . 151--163
S. Iscovici Field analysis: a mathematical method of
analysis for information handling
processes . . . . . . . . . . . . . . . 165--178
J. Minker A note on answer extraction in
resolution-based systems . . . . . . . . 179--192
H. S. Koch Information system design for real-time
multiprocessing systems . . . . . . . . 193--209
T. C. Ting Compacting homogeneous text for
minimizing storage space . . . . . . . . 211--221
S. Aalto and
E. Schuegraf Determination of the number of
unambiguous bit matrices . . . . . . . . 223--235
A. Bouckaert Computer diagnosis of goiters. V. The
input . . . . . . . . . . . . . . . . . 237--261
R. G. Hamlet Execution traces and
programming-language semantics . . . . . 263--278
A. Thesen and
T. Pinkerton Predicting the availability of
contiguous memory . . . . . . . . . . . 279--287
F. R. Dias Velasco and
C. de Renna e Souza An application of formal linguistics to
scene recognition . . . . . . . . . . . 289--306
B. V. Dasarathy FEAST: feature evaluation and selection
technique for deployment in unsupervised
nonparametric environments . . . . . . . 307--315
H. M. Srivastava and
H. B. Kekre and
Y. N. Bapat G/M/1 queue study of buffer behavior in
the decoding system of computer
communication . . . . . . . . . . . . . 317--326
J. A. Moyne Simple-English for data base
communication . . . . . . . . . . . . . 327--343
K. B. Salomon String and graph grammar
characterizations of bounded regular
languages . . . . . . . . . . . . . . . 1--10
D. M. Berry and
L. M. Chirica and
D. F. Martin and
A. Sorkin and
J. B. Johnson Time required for reference count
management in retention block-structured
languages. I . . . . . . . . . . . . . . 11--64
A. W. Biermann Automatic insertion of indexing
instructions in program synthesis . . . 65--90
D. M. Berry and
L. M. Chirica and
D. F. Martin and
A. Sorkin and
J. B. Johnston On the time required for reference count
management in retention block-structured
languages. II . . . . . . . . . . . . . 91--119
M. Hofri A generating-function analysis of
multiprogramming queues . . . . . . . . 121--155
N. Minsky An operation-control scheme for
authorization in computer systems . . . 157--191
D. W. Hunter and
G. S. Shedler Multivariate point process models for
response times in multiprogrammed
systems . . . . . . . . . . . . . . . . 193--217
Clarence A. Ellis Analysis of some abstract measures of
protection in computer systems . . . . . 219--251
B. V. Dasarathy and
K. P. Bharath Kumar CHITRA: cognitive handprinted
input-trained recursively analyzing
system for recognition of alphanumeric
characters . . . . . . . . . . . . . . . 253--282
Shanker Singh and
Vijendra Pal Singh A probabilistic approach for testing
large-scale integrated circuits . . . . 283--294
T. C. Chen and
K. P. Eswaran and
V. Y. Lum and
C. Tung Simplified odd-even sort using multiple
shift-register loops . . . . . . . . . . 295--314
Toshihide Ibaraki Depth-$m$ search in branch-and-bound
algorithms . . . . . . . . . . . . . . . 315--343
Robert W. Sebesta and
Neil D. Jones Parsers for indexed grammars . . . . . . 345--359
D. M. Berry and
A. Sorkin Time required for garbage collection in
retention block-structured languages . . 361--404
J. T. Tou Zoom-thresholding technique for boundary
determination . . . . . . . . . . . . . 3--8
H. I. Epstein and
B. F. Caviness A structure theorem for the elementary
functions and its application to the
identity problem . . . . . . . . . . . . 9--37
C. C. Gotlieb and
A. L. Furtado Data schemata based on directed graphs 39--73
B. V. Dasarathy and
A. L. Lakshminarasimhan Learning under a VEDIC teacher (pattern
recognition) . . . . . . . . . . . . . . 75--88
Fred J. Maryanski and
Michael G. Thomason Properties of stochastic syntax-directed
translation schemata . . . . . . . . . . 89--110
A. G. Ivakhnenko Development of models of optimal
complexity using self-organization
theory . . . . . . . . . . . . . . . . . 111--127
Arie P. Schinnar Generalized inverse solutions of
multiattribute accounting problems . . . 129--139
Robert L. Cannon, Jr. Notes on canonical label languages . . . 141--148
Steven A. Vere Composition of relational productions
for plans and programs . . . . . . . . . 149--179
H. P. Edmundson and
Immanuel I. Tung The notion of a probabilistic cellular
acceptor . . . . . . . . . . . . . . . . 181--208
A. Thayse Encoding of parallel program schemata by
vector addition systems . . . . . . . . 209--218
B. Shneiderman and
R. Mayer Syntactic/semantic interactions in
programmer behavior: a model and
experimental results . . . . . . . . . . 219--238
B. V. Sheela and
B. V. Dasarathy OPAL: a new algorithm for optimal
partitioning and learning in
nonparametric unsupervised environments 239--253
A. V. Anisimov and
D. E. Knuth Inhomogeneous sorting . . . . . . . . . 255--260
A. V. An\=\i s\=\i mov and
D. E. Knuth Inhomogeneous sorting . . . . . . . . . 255--260
Ronald Alter and
Johnson M. Hart Enumerating syntactical graphs and
lattices of derivations . . . . . . . . 261--277
S. S. Al-Fedaghi and
Y. H. Chin Algorithmic approach to the consecutive
retrieval property . . . . . . . . . . . 279--301
S. Tangwongsan and
K. S. Fu An application of learning to robotic
planning . . . . . . . . . . . . . . . . 303--333
K. Culik, II and
D. Wood Doubly deterministic tabled OL systems 335--347
Gyula A. Magó A network of microprocessors to execute
reduction languages. I . . . . . . . . . 349--385
G. A. Mago A network of microprocessors to execute
reduction languages. I . . . . . . . . . 349--385
Elaine J. Weyuker The applicability of program schema
results to programs . . . . . . . . . . 387--403
Andrzej Proskurowski Minimum dominating cycles in $2$-trees 405--417
D. R. Stoutemyer Computer algebra for the calculus of
variations, the maximum principle and
automatic control . . . . . . . . . . . 419--434
G. A. Mago A network of microprocessors to execute
reduction languages. II . . . . . . . . 435--471
Hikyoo Koh and
Henry Y. H. Chuang Finding a minimal set of base paths of a
program . . . . . . . . . . . . . . . . 473--488
Yves Kodratoff A class of functions synthesized from a
finite number of examples and a LISP
program scheme . . . . . . . . . . . . . 489--521
Gregor V. Bochmann Semantic equivalence of covering
attribute grammars . . . . . . . . . . . 523--539
Julius T. Tou DYNOC---a dynamic optimal
cluster-seeking technique . . . . . . . 541--547
J. T. Tou An approach to understanding geometrical
configurations by computer . . . . . . . 1--13
C. J. Stephenson A method for constructing binary search
trees by making insertions at the root 15--29
T. S. E. Maibaum and
Carlos J. Lucena Higher order data types . . . . . . . . 31--53
Tsong Yueh Chen Formalization of correctness of
recursive definitions . . . . . . . . . 55--61
J. M. Lemme and
J. R. Rice Adaptive quadrature algorithms for the
ILLIAC IV . . . . . . . . . . . . . . . 63--72
G. S. Shedler Response-time simulation of multivariate
point process models for multiprogrammed
jobstreams . . . . . . . . . . . . . . . 73--91
Judy A. Townley A pragmatic approach to resolution-based
theorem proving . . . . . . . . . . . . 93--116
Chao Chih Yang and
Charmane P. May Algorithms for finding directed graph
isomorphisms by finite automata . . . . 117--140
M. Bernorio and
M. Bertoni and
A. Dabbene and
M. Somalvico Querying databases with a
domain-oriented natural language
understanding system . . . . . . . . . . 141--159
P. R. F. Cunha and
C. J. Lucena and
T. S. E. Maibaum On the design and specification of
message oriented programs . . . . . . . 161--191
J. Cohen and
R. Stachel An interpreter for a nondeterministic
language . . . . . . . . . . . . . . . . 193--217
D. T. Lee and
B. J. Schachter Two algorithms for constructing a
Delaunay triangulation . . . . . . . . . 219--242
D. M. Dhamdhere and
J. R. Isaac A composite algorithm for strength
reduction and code movement optimization 243--273
J. T. Tou Knowledge Engineering . . . . . . . . . 275--285
S. K. Arora and
K. C. Smith WCRL: a data model independent language
for database systems . . . . . . . . . . 287--305
Johnson M. Hart Fast recognition of Baxter permutations
using syntactical and complete bipartite
composite dag's . . . . . . . . . . . . 307--321
James C. Bezdek and
Michael P. Windham and
Robert Ehrlich Statistical parameters of cluster
validity functionals . . . . . . . . . . 323--336
Robert B. Cutler and
Saburo Muroga Useless prime implicants of incompletely
specified multiple-output switching
functions . . . . . . . . . . . . . . . 337--350
Anne Putkonen The order of merging operations for
queries in inverted file systems . . . . 351--369
Paulo A. S. Veloso Characterizations for the regular prefix
codes and related families . . . . . . . 371--382
M. Maekawa A classification of process coordination
schemes in descriptive power . . . . . . 383--406
Peter A. Ng and
Lun Tsai The design and implementation of a
scheme for large ordered indices . . . . 407--434
J. J. Dujmovic Computer selection and criteria for
computer performance evaluation . . . . 435--458
J. A. Moyne Language use: a performance model . . . 459--481
A. Charnes and
W. W. Cooper and
S. Duffuaa and
M. Kress Complexity and computability of
solutions to linear programming systems 483--506
Stephanie M. Boyles and
Gerhard X. Ritter The encoding of arbitrary
two-dimensional geometric configurations 1--25
C. H. Huang and
F. J. Taylor A new technique for WFTA input/output
reordering . . . . . . . . . . . . . . . 27--37
M. Di Santo and
L. Nigro and
W. Russo On the efficient implementation of
retention block-structured languages . . 39--54
Arthur Farley and
Stephen Hedetniemi and
Andrzej Proskurowski Partitioning trees: matching,
domination, and maximum diameter . . . . 55--61
I. Kobayashi Evaluation of queries based on the
extended relational calculi . . . . . . 63--103
H. Jappinen Sense-controlled flexible robot behavior 105--125
Andrzej Proskurowski and
Maciej M. Sys\lo Minimum dominating cycles in outerplanar
graphs . . . . . . . . . . . . . . . . . 127--139
Ronald R. Yager Approximate reasoning and possibilistic
models in classification . . . . . . . . 141--175
T. Leipala On the design of one-level indexed
sequential files . . . . . . . . . . . . 177--186
Sudhir K. Arora and
K. C. Smith A graphical interpretation of dependency
structures in relational data bases . . 187--213
F. D. Lewis Stateless Turing machines and fixed
points . . . . . . . . . . . . . . . . . 215--218
N. L. Sarda and
J. R. Isaac Computer aided design of database
internal schema . . . . . . . . . . . . 219--234
S. K. Arora and
K. C. Smith Graphical normal forms based on root
dependencies in relational data base
systems . . . . . . . . . . . . . . . . 235--259
S. K. Arora and
S. R. Dumpala Theta-join and normalization . . . . . . 261--281
G. Guida An effective preprocessor for structured
FORTRAN: the HENTRAN system . . . . . . 283--297
C. S. dos Santos and
T. S. E. Maibaum and
A. L. Furtado Conceptual modeling of data base
operations . . . . . . . . . . . . . . . 299--314
B. Bhargava and
L. Lilien On optimal scheduling of integrity
assertions in a transaction processing
system . . . . . . . . . . . . . . . . . 315--330
H. Jürgensen and
D. E. Matthews and
D. Wood Cut point languages of Markov DTOL
systems . . . . . . . . . . . . . . . . 331--340
H. Jurgensen and
D. E. Matthews and
D. Wood Cut point languages of Markov DTOL
systems . . . . . . . . . . . . . . . . 331--340
M. Zaki Magnetic bubble memory structures for
relational database management systems 341--358
B. Bhargava and
C. Hua Cost analysis of recovery block scheme
and its implementation issues . . . . . 359--382
A. S. Zaki and
J. L. Baer Query costs in HB(1) trees versus
$2$-$3$ trees . . . . . . . . . . . . . 383--395
M. N. Murty and
G. Krishna A hybrid clustering procedure for
concentric and chain-like clusters . . . 397--412
Marvin Shapiro A note on Lee and Schachter's algorithm
for Delaunay triangulation . . . . . . . 413--418
J. W. Tai and
K. S. Fu Inference of a class of CFPG by means of
semantic rules . . . . . . . . . . . . . 1--23
W. K. Giloi and
R. Gueth Concepts and realization of a
high-performance data type architecture 25--54
Quentin F. Stout Searching and encoding for infinite
ordered sets . . . . . . . . . . . . . . 55--72
M. G. Thomason Syntactic/semantic techniques in pattern
recognition: a survey . . . . . . . . . 75--100
J. W. Hooper and
K. D. Reilly Simulation strategies . . . . . . . . . 101--122
G. Alia and
E. Martinelli On switching network functionalities and
their relationships . . . . . . . . . . 123--138
J.-L. Rémy and
P. A. S. Veloso Comparing data type specifications via
their normal forms . . . . . . . . . . . 141--153
Th. Ottman and
D. Wood A comparison of iterative and defined
classes of search trees . . . . . . . . 155--178
Th. Ottmann and
D. Wood A comparison of iterative and defined
classes of search trees . . . . . . . . 155--178
John Grant and
Jack Minker On optimizing the evaluation of a set of
expressions . . . . . . . . . . . . . . 179--191
E. J. Brody A procedure for the unsupervised
abduction of linguistic distributional
classes in probabilistic languages . . . 193--210
Jian Hua Xu and
Julius T. Tou Predictive searching for chain encoding
by computers . . . . . . . . . . . . . . 213--229
David T. Barnard and
Richard C. Holt Hierarchic syntax error repair for LR
grammars . . . . . . . . . . . . . . . . 231--258
D. C. Voukalis Remarks concerning the optimization of
matrix codes . . . . . . . . . . . . . . 259--273
Z. W. Ras An algebraic approach to information
retrieval systems . . . . . . . . . . . 275--293
Zbigniew W. Ra\'s An algebraic approach to information
retrieval systems . . . . . . . . . . . 275--293
P. A. S. Veloso Methodical specification of abstract
data types via rewriting systems . . . . 295--323
Shi Kuo Chang and
An Chi Liu File allocation in a distributed
database . . . . . . . . . . . . . . . . 325--340
Zdzis\law Pawlak Rough sets . . . . . . . . . . . . . . . 341--356
J. V. Hassen and
W. F. Messier, Jr. Expert systems for decision support in
EDP auditing . . . . . . . . . . . . . . 357--379
Dalia Motzkin and
Christina L. Hansen An efficient external sorting with
minimal space requirement . . . . . . . 381--396
Ewa Or\lowska Representation of temporal information 397--408
E. Orlowska Representation of temporal information 397--408
Edward T. Lee An efficient algorithm for finding
Kleene closure of regular expression
matrices . . . . . . . . . . . . . . . . 409--415
Wei Chung Lin and
King Sun Fu Conversion and parsing of tree
transducers for syntactic pattern
analysis . . . . . . . . . . . . . . . . 417--458
A. Barrero and
M. G. Thomason and
R. C. Gonzalez Regular-like tree expressions . . . . . 1--11
A. Barrero and
M. G. Thomason and
R. C. Gonzalez Regular-like tree expressions . . . . . 1--121
A. S. Zaki A comparative study of $2$-$3$ trees and
AVL trees . . . . . . . . . . . . . . . 13--33
J. V. Hansen and
W. F. Messier, Jr. Scheduling the monitoring of EDP
controls in online systems . . . . . . . 35--46
P. K. Srimani and
B. P. Sinha A simple way to near minimization of
microprogram control memory . . . . . . 47--64
James Bradley Application of SQL/N to the
attribute-relation associations implicit
in functional dependencies . . . . . . . 65--86
J. Bradley Application of SQL/N to the
attribute-relation associations implicit
in functional dependencies . . . . . . . 65--86
D. T. Lee On finding the convex hull of a simple
polygon . . . . . . . . . . . . . . . . 87--98
F. Badi'i and
B. Peikari Approximation of multipath planar shapes
in pattern analysis . . . . . . . . . . 99--110
J. W. Hooper and
K. D. Reilly The GPSS-GASP combined (GGC) system . . 111--136
E. J. Brody A topological formulation of linguistic
typology . . . . . . . . . . . . . . . . 137--150
Marco A. Casanova A theory of data dependencies over
relational expressions . . . . . . . . . 151--191
A. Kostovetsky Time separation technique for large
databases . . . . . . . . . . . . . . . 193--209
V. D. Gligor The verification of the protection
mechanisms of high-level language
machines . . . . . . . . . . . . . . . . 211--246
M. Gyssens and
J. Paredaens Another view of functional and
multivalued dependencies in the
relational database model . . . . . . . 247--267
S. Jajodia and
P. A. Ng and
F. N. Springsteel Entity-relationship diagrams which are
in BCNF . . . . . . . . . . . . . . . . 269--283
Sushil Jajodia and
Peter A. Ng and
Frederick N. Springsteel Entity-relationship diagrams which are
in BCNF . . . . . . . . . . . . . . . . 269--283
A. G. Akritas and
S. S. Iyengar and
A. A. Rampuria Computationally efficient algorithms for
a one-time pad scheme . . . . . . . . . 285--316
Tony T. Lee A state space approach to the finite
automata . . . . . . . . . . . . . . . . 317--335
Subhash C. Kak Exponentiation modulo a polynomial for
data security . . . . . . . . . . . . . 337--346
Godfried T. Toussaint Computing largest empty circles with
location constraints . . . . . . . . . . 347--358
H. Jürgensen and
G. Thierrin On $\omega $-languages whose syntactic
monoid is trivial . . . . . . . . . . . 359--365
H. Jurgensen and
G. Thierrin On omega-languages whose syntactic
monoid is trivial . . . . . . . . . . . 359--365
Dana S. Nau On game graph structure and its
influence on pathology . . . . . . . . . 367--383
Timo Niemi Formal restructuring functions for
hierarchical data bases . . . . . . . . 385--411
Timothy A. Budd Safety in grammatical protection systems 413--431
Lawrence A. Ankeney and
Gerhard X. Ritter Cellular topology and its applications
in image processing . . . . . . . . . . 433--456
D. Landskov Microcode compaction; extending the
boundaries . . . . . . . . . . . . . . . 1--21
D. T. Lee An optimal time and minimal space
algorithm for rectangle intersection
problems . . . . . . . . . . . . . . . . 23--32
H. R. Lu and
K. S. Fu Inferability of context-free programmed
grammars . . . . . . . . . . . . . . . . 33--58
H. R. Lu and
K. S. Fu Inferability of context-free programmed
grammars . . . . . . . . . . . . . . . . 33--58
Chao Chih Yang and
Hou Kuan Huang Algorithms for the inverse and a
generalization of the state space
approach to finite automata . . . . . . 59--76
Thomas Ottmann and
Arnold L. Rosenberg and
Hans-Werner Six and
Derick Wood Binary search trees with binary
comparison cost . . . . . . . . . . . . 77--101
S. C. Kak On the method of puzzles for key
distribution . . . . . . . . . . . . . . 103--109
Ging-Shung Yu and
S. Muroga Parallel multipliers with NOR gates
based on G-minimum adders . . . . . . . 111--121
M. C. Er An iterative algorithm for the cyclic
Towers of Hanoi problem . . . . . . . . 123--129
Nicola Santoro On the message complexity of distributed
problems . . . . . . . . . . . . . . . . 131--147
L. Orman Familial model of data . . . . . . . . . 149--175
H. Fukuda and
K. Kamata Inference of tree automata from sample
sets of trees . . . . . . . . . . . . . 177--196
Godfried T. Toussaint Complexity, convexity, and unimodality 197--217
W. Richard Stark A glimpse into the paradise of
combinatory algebra . . . . . . . . . . 219--236
A. Kostovetsky Frequency decomposition technique for
large archivable databases . . . . . . . 237--249
Roy P. Pargas Parallel solution of recurrences on a
tree machine . . . . . . . . . . . . . . 251--277
Mikhail J. Atallah Checking similarity of planar figures 279--290
Wei Dong Kou and
Zheng Hu CH transform . . . . . . . . . . . . . . 291--307
D. C. Voukalis Further remarks for the matrix
type-${B}$ codes . . . . . . . . . . . . 309--326
Camilla B. Schwind Embedding deductive capabilities in
relational database systems . . . . . . 327--338
V. P. Srini and
B. D. Shrivr A methodology for designing and modeling
reconfigurable systems . . . . . . . . . 339--394
S. K. Chang and
J. C. Dorng Concatenated hash code selection . . . . 395--412
Keisuke Tanatsugu A grammatical inference for harmonic
linear languages . . . . . . . . . . . . 413--423
T. Niemi Specification of data restructuring
software based on the attribute method 425--460
Subrata Dasgupta and
Alan Wagner The use of Hoare logic in the
verification of horizontal microprograms 461--490
A. R. Hurson A VLSI design for the parallel finite
state automaton and its performance
evaluation as a hardware scanner . . . . 491--508
Lena Chang and
Arthur T. Poe Surjections and coverings . . . . . . . 509--520
N. Roussopoulos and
L. Mark Schema manipulation in self-describing
and self-documenting data models . . . . 1--28
A. Dutta Modeling of multiple copy update costs
for file allocation in distributed
databases . . . . . . . . . . . . . . . 29--34
H. Jürgensen and
A. Salomaa Syntactic monoids in the construction of
systolic tree automata . . . . . . . . . 35--49
H. Jurgensen and
A. Salomaa Syntactic monoids in the construction of
systolic tree automata . . . . . . . . . 35--49
P. Biswas Architectural support for variable
addressing in Ada --- a design approach 51--72
S.-H. S. Huang Multidimensional extendible hashing for
partial-match queries . . . . . . . . . 73--82
J. W. Hooper BPL: a set-based language for
distributed system prototyping . . . . . 83--105
Howard E. Motteler and
Carl H. Smith A complexity measure for data flow
models . . . . . . . . . . . . . . . . . 107--122
J. T. Tou Knowledge engineering revisited . . . . 123--134
S. P. Dandamudi and
P. G. Sorenson An empirical performance comparison of
some variations of the $k$-$d$ tree and
BD tree . . . . . . . . . . . . . . . . 135--159
P. A. D. de Maine and
S. Leong and
C. G. Davis A transportable programming language
(TPL) system. I Overview . . . . . . . . 161--182
Joseph O'Rourke Finding minimal enclosing boxes . . . . 183--199
L. D. Mlodinow and
I. O. Stamatescu An evolutionary procedure for machine
learning . . . . . . . . . . . . . . . . 201--219
B. Chan and
H. Meijer A note on the method of puzzles for key
distribution . . . . . . . . . . . . . . 221--223
Jin Hua Chen LL(1) grammars and sub-LL(1) grammars 225--234
Jinhua Chen LL(1) grammar and Sub-LL(1) grammars . . 225--234
K. G. Subramanian A note on regular-controlled
apical-growth filamentous systems . . . 235--242
K. G. Subramanian A note on regular-controlled
apical-growth filamentous systems . . . 235--242
Y. Ishida and
N. Adachi and
H. Tokumaru An analysis of self-diagnosis model by
conditional fault set . . . . . . . . . 243--259
Y. Ishida and
N. Adachi and
H. Tokumaru An analysis of self-diagnosis model by
conditional fault set . . . . . . . . . 243--259
A. R. Hurson and
B. Shirazi A class of systolic multiplier units for
VLSI technology . . . . . . . . . . . . 261--275
V. K. Agrawal and
L. M. Patnaik and
P. S. Goel Towards formal specification of a
distributed computing system . . . . . . 277--306
A. K. Elmagarmid and
A. P. Sheth A partially distributed deadlock
detection algorithm . . . . . . . . . . 307--330
Ming Huei Young and
Saburo Muroga Minimal covering problem and PLA
minimization . . . . . . . . . . . . . . 337--364
D. Brzakovic and
J. T. Tou An approach to computer-aided document
examination . . . . . . . . . . . . . . 365--385
J. A. Brzozowski and
S. Muro On serializability . . . . . . . . . . . 387--403
R. M. Harnett and
G. C. Kiel Optimal taxiway repair: a set-covering
approach . . . . . . . . . . . . . . . . 405--419
Jia Rong Hong AE1: an extension matrix approximate
method for the general covering problem 421--437
S. K. Chang and
B. Luo and
C. C. Yang and
M. C. K. Yang Trace confirmation with given object
position . . . . . . . . . . . . . . . . 439--453
S. S. Tseng and
R. C. T. Lee A parallel sorting scheme whose basic
operation sorts $N$ elements . . . . . . 455--467