%A K.D. Eason
%T Undertanding the naive computer user
%J The Computer Journal
%K compjour
%V 19
%N 1
%D February 1976
%P 3-7

%A P.J. Pengilly
%T An approach to systems design
%J The Computer Journal
%K compjour
%V 19
%N 1
%D February 1976
%P 8-12

%A J.J. Florentin
%T Data base representations of application models
%J The Computer Journal
%K compjour
%V 19
%N 1
%D February 1976
%P 13-16

%A G. Schlageter
%T The problem of lock by value in large data bases
%J The Computer Journal
%K compjour
%V 19
%N 1
%D February 1976
%P 17-20

%A S.J. Waters
%T Hit ratios
%J The Computer Journal
%K compjour
%V 19
%N 1
%D February 1976
%P 21-24

%A R.B.E. Napper
%A R.N. Fisher
%T ALEC - a user extendible scientific programming language
%J The Computer Journal
%K compjour
%V 19
%N 1
%D February 1976
%P 25-31

%A L.V. Atkinson
%T The list processing language, SLPL - an informal outline
%J The Computer Journal
%K compjour
%V 19
%N 1
%D February 1976
%P 32-39

%A R.L. Hittos
%A D.S. Henderson
%T Optimisation of main memory versus speed
%J The Computer Journal
%K compjour
%V 19
%N 1
%D February 1976
%P 40-42

%A H.J. Curnow
%A B.A. Wichmann
%T A synthetic benchmark
%J The Computer Journal
%K compjour
%V 19
%N 1
%D February 1976
%P 43-49

%A R.E. Walters
%T Benchamrk techniques: a constructive approach
%J The Computer Journal
%K compjour
%V 19
%N 1
%D February 1976
%P 50-55

%A S.K. Robinson
%A I.S. Torsun
%T An empirical analysis of fortran programs
%J The Computer Journal
%K compjour
%V 19
%N 1
%D February 1976
%P 56-62

%A A.C. Norman
%T Expanding the solutions of implicit sets of ordinary differential equations
in power series
%J The Computer Journal
%K compjour
%V 19
%N 1
%D February 1976
%P 63-68

%A W.H. Southwell
%T Fitting data to nonlinear functions
with uncertainties in all measurement variables
%J The Computer Journal
%K compjour
%V 19
%N 1
%D February 1976
%P 69-73

%A Karl-Heinz Mohn
%A Roger V. Roman
%T An interactive polynomial approximation algorithm
%J The Computer Journal
%K compjour
%V 19
%N 1
%D February 1976
%P 74-78

%A W.E. McBride
%A A.K. Rigler
%T A modification of the Osborne and Watson algorithm
for nonlinear minimax approximation
%J The Computer Journal
%K compjour
%V 19
%N 1
%D February 1976
%P 79-81

%A M.R. Williams
%T The difference engines
%J The Computer Journal
%K compjour
%V 19
%N 1
%D February 1976
%P 82-89

%A Donald Perlis
%T An application of compiler simulation at the source language level
%J The Computer Journal
%K compjour
%V 19
%N 1
%D February 1976
%P 90

%A T.S. Ng
%A A. Cantoni
%T Run time interaction with fortran using mixed code
%J The Computer Journal
%K compjour
%V 19
%N 1
%D February 1976
%P 91-92

%A J.M. Kerridge
%T PATCOSY - a database system for the National Health Service
%J The Computer Journal
%K compjour
%V 19
%N 2
%D May 1976
%P 98-103

%A E.C. Coles
%A L.J. Beilin
%A C.J. Bullpitt
%A C.T. Dollery
%A B.F. Johnson
%A A.D. Munro-Faure
%A S.C. Turner
%T An approach to computer processing of clinical data
%J The Computer Journal
%K compjour
%V 19
%N 2
%D May 1976
%P 104-109

%A R.A. Davenport
%T Database integrity
%J The Computer Journal
%K compjour
%V 19
%N 2
%D May 1976
%P 110-116

%A P.A. Dearnley
%T An investigation into database resilience
%J The Computer Journal
%K compjour
%V 19
%N 2
%D May 1976
%P 117-121

%A S.J. Waters
%T CAM01: a precedence analyser
%J The Computer Journal
%K compjour
%V 19
%N 2
%D May 1976
%P 122-126

%A Y.L. Varol
%T Some remarks on computer acquisition
%J The Computer Journal
%K compjour
%V 19
%N 2
%D May 1976
%P 127-131

%A O. Marjasoo
%T A methodology for hardware and software availability analysis
%J The Computer Journal
%K compjour
%V 19
%N 2
%D May 1976
%P 132-135

%A H.C. Lucas,\ Jr.
%A R.B. Kaplan
%T A structured programming environment
%J The Computer Journal
%K compjour
%V 19
%N 2
%D May 1976
%P 136-138

%A G.R. Frank
%T Job control in the MU5 operating system
%J The Computer Journal
%K compjour
%V 19
%N 2
%D May 1976
%P 139-143

%A J. Hilden
%T Guidelines for the design of interactive systems
%J The Computer Journal
%K compjour
%V 19
%N 2
%D May 1976
%P 144-150

%A F.G. Pagan
%T On interpreter-oriented definitions of programming languages
%J The Computer Journal
%K compjour
%V 19
%N 2
%D May 1976
%P 151-155

%A J.S. Rohl
%T Programming improvements to Fike's algorithm for generating permutations
%J The Computer Journal
%K compjour
%V 19
%N 2
%D May 1976
%P 156-159

%A L.V. Atkinson
%A G.J. Duffus
%T Machine code generation within a compiler - a teaching model
%J The Computer Journal
%K compjour
%V 19
%N 2
%D May 1976
%P 160-165

%A C.J. Higley
%T Type checking in a typeless language
%J The Computer Journal
%K compjour
%V 19
%N 2
%D May 1976
%P 166-169

%A A.G. Middleton
%T On the use of macros for iteration
%J The Computer Journal
%K compjour
%V 19
%N 2
%D May 1976
%P 170-172

%A A.T. Fuller
%T The period of pseudo-random numbers generated by Lehmer's congruential method
%J The Computer Journal
%K compjour
%V 19
%N 2
%D May 1976
%P 173-177

%A D.H. McLain
%T Two dimensional interpolation from random data
%J The Computer Journal
%K compjour
%V 19
%N 2
%D May 1976
%P 178-181

%A John Mitchem
%T On various algorithms for estimating the chromatic number of a graph
%J The Computer Journal
%K compjour
%V 19
%N 2
%D May 1976
%P 182-183

%A D.J. Evans
%A M. Hatzopoulos
%T The solution of certain banded systems of linear equations
using the folding algorithm
%J The Computer Journal
%K compjour
%V 19
%N 2
%D May 1976
%P 184-187

%A B.F.M. Adamczewski
%T A formula for establishing re-order quantities for individual items
within a joint stock replenishment scheme
%J The Computer Journal
%K compjour
%V 19
%N 3
%D August 1976
%P 194-197

%A T. Alewine
%A R.A. Fleck,\ Jr.
%T Service bureau or in-house data processing
%J The Computer Journal
%K compjour
%V 19
%N 3
%D August 1976
%P 198-201

%A D. Bell
%T Programmer selection and programming errors
%J The Computer Journal
%K compjour
%V 19
%N 3
%D August 1976
%P 202-206

%A E.B. James
%A D.P. Partridge
%T Tolerance to inaccuracy in computer programs
%J The Computer Journal
%K compjour
%V 19
%N 3
%D August 1976
%P 207-212

%A R.C. Varney
%T Toward the understandability of an operating system
%J The Computer Journal
%K compjour
%V 19
%N 3
%D August 1976
%P 213-215

%A D.L. Dance
%A U.W. Pooch
%T An adaptive on line data compression system
%J The Computer Journal
%K compjour
%V 19
%N 3
%D August 1976
%P 216-224

%A B. Higman
%T The place of own variables in programming language theory
%J The Computer Journal
%K compjour
%V 19
%N 3
%D August 1976
%P 225-228

%A D.S. Henderson
%A M.R. Levy
%T An extended operator precedence parsing algorithm
%J The Computer Journal
%K compjour
%V 19
%N 3
%D August 1976
%P 229-233

%A J.M. Brady
%T A programming approach
to some concepts and results in the theory of computation
%J The Computer Journal
%K compjour
%V 19
%N 3
%D August 1976
%P 234-237

%A R. Devillers
%A G. Louchard
%T Improvement of parallelism in a finite buffer sharing policy
%J The Computer Journal
%K compjour
%V 19
%N 3
%D August 1976
%P 238-245

%A D.C. Sutcliffe
%T An algorithm for drawing the curve f(x, y) = 0
%J The Computer Journal
%K compjour
%V 19
%N 3
%D August 1976
%P 246-249

%A R.P. Loretan
%T Timing problems in electronic lockout chains
%J The Computer Journal
%K compjour
%V 19
%N 3
%D August 1976
%P 250-253

%A M.R. Patel
%A K.H. Bennett
%T Analysis of speed of a binary multiplier
using a variable number of shifts per cycle
%J The Computer Journal
%K compjour
%V 19
%N 3
%D August 1976
%P 254-257

%A Ayse Alaylioglu
%A G.A. Evans
%A J. Hyslop
%T The use of Chebyshev series for the evaluation of oscillatory integrals
%J The Computer Journal
%K compjour
%V 19
%N 3
%D August 1976
%P 258-267

%A R.M. De\ Morgan
%A I.D. Hill
%A B.A. Wichmann
%T A supplement to the Algol 60 revised report
%J The Computer Journal
%K compjour
%V 19
%N 3
%D August 1976
%P 276-288

%A F.F. Land
%T Evaluation of systems goals in determining a design strategy
for a computer based information system
%J The Computer Journal
%K compjour
%V 19
%N 4
%D November 1976
%P 290-294

%A J.M. Triance
%T The significance of the 1974 Cobol standard
%J The Computer Journal
%K compjour
%V 19
%N 4
%D November 1976
%P 295-300

%A V. Siskind
%A J. Rosenhead
%T Seek times for disc file processing: some results from probability theory
%J The Computer Journal
%K compjour
%V 19
%N 4
%D November 1976
%P 301-305

%A R.G. Casey
%A I.M. Osman
%T Replacement algorithms for storage management in relational data bases
%J The Computer Journal
%K compjour
%V 19
%N 4
%D November 1976
%P 306-314

%A J. Ferrie
%A C. Kaiser
%A D. Lanciaux
%A B. Martin
%T An extensible structure for protected systems' design
%J The Computer Journal
%K compjour
%V 19
%N 4
%D November 1976
%P 315-321

%A A. Walker
%A D. Wood
%T Locally balanced binary trees
%J The Computer Journal
%K compjour
%V 19
%N 4
%D November 1976
%P 322-325

%A C. Bays
%T A non-recursive technique for recreating a digraph
from its K-formula representation
%J The Computer Journal
%K compjour
%V 19
%N 4
%D November 1976
%P 326-328

%A T. Sakaki
%A K. Nakashima
%A Y. Hattori
%T Algorithms for finding in the lump
both bounds of the chromatic number of a graph
%J The Computer Journal
%K compjour
%V 19
%N 4
%D November 1976
%P 329-332

%A D.C. Sutcliffe
%T A remark on a contouring algorithm
%J The Computer Journal
%K compjour
%V 19
%N 4
%D November 1976
%P 333-335

%A M.A. Sabin
%T A method for displaying the intersection curve of two quadric surfaces
%J The Computer Journal
%K compjour
%V 19
%N 4
%D November 1976
%P 336-338

%A R.J. Aust
%T An improvement algorithm for school timetabling
%J The Computer Journal
%K compjour
%V 19
%N 4
%D November 1976
%P 339-343

%A I.M. Willers
%T The syntax directed graph algorithm for the input of equations
to the Taylor series system for solving ordinary differential equations
%J The Computer Journal
%K compjour
%V 19
%N 4
%D November 1976
%P 344-347

%A P.J. Hartley
%T Tensor product approximations
to data defined on rectangular meshed in N-space
%J The Computer Journal
%K compjour
%V 19
%N 4
%D November 1976
%P 348-352

%A M. Shacham
%A E. Kehat
%T A direct method for the solution of large sparse systems of linear equations
%J The Computer Journal
%K compjour
%V 19
%N 4
%D November 1976
%P 353-359

%A R.M. De\ Morgan
%A I.D. Hill
%A B.A. Wichmann
%T Modified report on the algorithmic language Algol 60
%J The Computer Journal
%K compjour
%V 19
%N 4
%D November 1976
%P 364-379

%A S.J. Waters
%T CAM02: a structured precedence analyser
%J The Computer Journal
%K compjour
%V 20
%N 1
%D February 1977
%P 2-5

%A B.M. Leavenworth
%T Non-procedural data processing
%J The Computer Journal
%K compjour
%V 20
%N 1
%D February 1977
%P 6-9

%A B.J. Edwards
%T Choice of block sizes for magnetic tape files
%J The Computer Journal
%K compjour
%V 20
%N 1
%D February 1977
%P 10-14

%A Alfonso F. Cardenas
%A James P. Sagamang
%T Doubly-chained tree data base organisation - analysis and design strategies
%J The Computer Journal
%K compjour
%V 20
%N 1
%D February 1977
%P 15-26

%A K. Forbes
%A A.W. Goldsworthy
%T A prescheduling algorithm - scheduling a suitable mix prior to processing
%J The Computer Journal
%K compjour
%V 20
%N 1
%D February 1977
%P 27-29

%A N. Dudds
%T The design of the MAX macroprocessor
%J The Computer Journal
%K compjour
%V 20
%N 1
%D February 1977
%P 30-36

%A C. Piney
%T A generalised interactive system for the acquisition of structured data
%J The Computer Journal
%K compjour
%V 20
%N 1
%D February 1977
%P 37-44

%A M.H. Williams
%T Generating structured flow diagrams: the nature of unstructuredness
%J The Computer Journal
%K compjour
%V 20
%N 1
%D February 1977
%P 45-50

%A B.G.T. Lowden
%A I.R. MacCallum
%T Some consequences of deferred binding in Cobol
%J The Computer Journal
%K compjour
%V 20
%N 1
%D February 1977
%P 51-55

%A D.T. Goodwin
%T Conditions for underflow and overflow of an arithmetic stack
%J The Computer Journal
%K compjour
%V 20
%N 1
%D February 1977
%P 56-62

%A D. Wood
%T Two variations on n-parallel finite state generators
%J The Computer Journal
%K compjour
%V 20
%N 1
%D February 1977
%P 63-67

%A M.J.B. Duff
%A D.M. Watson
%T The cellular logic array image processor
%J The Computer Journal
%K compjour
%V 20
%N 1
%D February 1977
%P 68-72

%A A. Tosser
%A D. Dubus
%T Algebraic optimisation of NAND-NOR switching circuits
%J The Computer Journal
%K compjour
%V 20
%N 1
%D February 1977
%P 73-77

%A A.M. Macnaghten
%A C.A.R. Hoare
%T Fast Fourier transform free from tears
%J The Computer Journal
%K compjour
%V 20
%N 1
%D February 1977
%P 78-83

%A J.W. Akitt
%T Function minimisation using the Nelder and Mead simplex method
with limited arithmetic precision: the self regenerative simplex
%J The Computer Journal
%K compjour
%V 20
%N 1
%D February 1977
%P 84-85

%A A. Parkin
%T The probable outcomes of a data processing project
%J The Computer Journal
%K compjour
%V 20
%N 2
%D May 1977
%P 98-101

%A R.K. Stamper
%T The LEGOL 1 prototype system and language
%J The Computer Journal
%K compjour
%V 20
%N 2
%D May 1977
%P 102-108

%A R.H. Pierce
%A J. Rowell
%T A transformation-directed compiling system
%J The Computer Journal
%K compjour
%V 20
%N 2
%D May 1977
%P 109-115

%A K.J. McDonell
%T An inverted index implementation
%J The Computer Journal
%K compjour
%V 20
%N 2
%D May 1977
%P 116-123

%A H.R.A. Townsend
%T SST - a program for the automatic generation of symbol state tables
%J The Computer Journal
%K compjour
%V 20
%N 2
%D May 1977
%P 124-127

%A P. Kammerer
%T Excluding regions
%J The Computer Journal
%K compjour
%V 20
%N 2
%D May 1977
%P 128-131

%A Y. Wallach
%T Scheduling algorithms for concurrent execution
%J The Computer Journal
%K compjour
%V 20
%N 2
%D May 1977
%P 132-136

%A E.G. Mallach
%T Scatter storage techniques:
a unifying viewpoint and a method for reducing retrieval times
%J The Computer Journal
%K compjour
%V 20
%N 2
%D May 1977
%P 137-140

%A J.R. Ullman
%T A binary n-gram technique for automatic correction
of substitution, deletion insertion and reversal errors in words
%J The Computer Journal
%K compjour
%V 20
%N 2
%D May 1977
%P 141-147

%A D. de\ Champeaux
%A L. Sint
%T An optimality theorem for a bi-directional heuristic search algorithm
%J The Computer Journal
%K compjour
%V 20
%N 2
%D May 1977
%P 148-150

%A J. Schwartz
%T Generic commands - a tool for partial correctness formalisms
%J The Computer Journal
%K compjour
%V 20
%N 2
%D May 1977
%P 151-155

%A W.S. Ford
%A V.C. Hamacher
%T Low level architecture features for supporting process communication
%J The Computer Journal
%K compjour
%V 20
%N 2
%D May 1977
%P 156-162

%A A. Kaletzky
%A D.W. Lewin
%T Problem orientated language for logic design
%J The Computer Journal
%K compjour
%V 20
%N 2
%D May 1977
%P 163-169

%A J.N. Lyness
%A J.J. Kaganove
%T A technique for comparing automatic quadrature routines
%J The Computer Journal
%K compjour
%V 20
%N 2
%D May 1977
%P 170-177

%A Y.L. Varol
%T On the generation of the pseudo-remainder in polynomial division
%J The Computer Journal
%K compjour
%V 20
%N 2
%D May 1977
%P 178-180

%A D.J. Evans
%T On the use of fast methods for solving boundary value problems
%J The Computer Journal
%K compjour
%V 20
%N 2
%D May 1977
%P 181-184

%A R.J. Clasen
%T A note on the use of the conjugate gradient method
in the solution of a large system of sparse equations
%J The Computer Journal
%K compjour
%V 20
%N 2
%D May 1977
%P 185-186

%A P. Stecher
%T Proposal for an interface system
between the business and data processing systems
%J The Computer Journal
%K compjour
%V 20
%N 3
%D August 1977
%P 194-201

%A A.D. Wilkie
%T Table look-up (with examples in Cobol)
%J The Computer Journal
%K compjour
%V 20
%N 3
%D August 1977
%P 202-206

%A S.J. Waters
%T Majority verdicts in multi-processing - any two from three
%J The Computer Journal
%K compjour
%V 20
%N 3
%D August 1977
%P 207-212

%A Deane B. Blazie
%A L.S. Levy
%T A cross compiler for pocket calculators
%J The Computer Journal
%K compjour
%V 20
%N 3
%D August 1977
%P 213-221

%A W.D. Haseman
%A A.B. Whinston
%T Automatic application program interface to a data base
%J The Computer Journal
%K compjour
%V 20
%N 3
%D August 1977
%P 222-226

%A R.N. Ibbett
%A M.A. Husband
%T The MU5 name store
%J The Computer Journal
%K compjour
%V 20
%N 3
%D August 1977
%P 227-231

%A R.G. Hamlet
%T Testing programs with finite sets of data
%J The Computer Journal
%K compjour
%V 20
%N 3
%D August 1977
%P 232-237

%A A.G. Middleton
%T A case for type and form flow analysis
%J The Computer Journal
%K compjour
%V 20
%N 3
%D August 1977
%P 238-241

%A J.M. Robson
%T Worst case fragmentation
of first fit and best fit storage allocation strategies
%J The Computer Journal
%K compjour
%V 20
%N 3
%D August 1977
%P 242-244

%A O. Nevalainen
%A M. Vesterinen
%T Determining blocking factors for sequential files by heuristic methods
%J The Computer Journal
%K compjour
%V 20
%N 3
%D August 1977
%P 245-247

%A P. Scheuermann
%T Modelling the information space in physical storage
at different levels of detail
%J The Computer Journal
%K compjour
%V 20
%N 3
%D August 1977
%P 248-256

%A P.W. Williams
%A M.T. Khallaghi
%T Document retrieval using a substring index
%J The Computer Journal
%K compjour
%V 20
%N 3
%D August 1977
%P 257-262

%A A.D. McGettrick
%T Teaching mathematics by computer
%J The Computer Journal
%K compjour
%V 20
%N 3
%D August 1977
%P 263-268

%A B.E. Carpenter
%A R.W. Doran
%T The other Turing machine
%J The Computer Journal
%K compjour
%V 20
%N 3
%D August 1977
%P 269-279

%A D.H.R. Huxtable
%A J.M.M. Pinkerton
%T The hardware/software interface of the ICL 2900 range of computers
%J The Computer Journal
%K compjour
%V 20
%N 4
%D November 1977
%P 290-295

%A P.J. Pengilly
%T An approach to systems design II: the popularisation of PROPLAN
%J The Computer Journal
%K compjour
%V 20
%N 4
%D November 1977
%P 296-297

%A T.C. Ting
%A Y.W. Wang
%T Multiway replacement selection sort with dynamic reservoir
%J The Computer Journal
%K compjour
%V 20
%N 4
%D November 1977
%P 298-301

%A J.G. Kollias
%A P.M. Stocker
%A P.A. Dearnley
%T Improving the performance of an intelligent data management system
%J The Computer Journal
%K compjour
%V 20
%N 4
%D November 1977
%P 302-307

%A P.J. Clapson
%T Toward a performance science: a comparative analysis of computing systems
%J The Computer Journal
%K compjour
%V 20
%N 4
%D November 1977
%P 308-315

%A S. Mamrak
%A J.M. Randal
%T An analysis of a software engineering failure
%J The Computer Journal
%K compjour
%V 20
%N 4
%D November 1977
%P 316-320

%A B.M. Nicklas
%A G. Schlageter
%T Index structuring in inverted data bases by tries
%J The Computer Journal
%K compjour
%V 20
%N 4
%D November 1977
%P 321-324

%A R.A. Reynolds
%T Character string handling in fortran
%J The Computer Journal
%K compjour
%V 20
%N 4
%D November 1977
%P 325-329

%A K.A. Steele
%T CPM network analysis with a storage tube terminal
%J The Computer Journal
%K compjour
%V 20
%N 4
%D November 1977
%P 330-334

%A P.J. Willis
%T A real time hidden surface technique
%J The Computer Journal
%K compjour
%V 20
%N 4
%D November 1977
%P 335-339

%A L.S. Levy
%A R. Melville
%T The algebraic anatomy of programs
%J The Computer Journal
%K compjour
%V 20
%N 4
%D November 1977
%P 340-345

%A A.D. Woodall
%T Generation of permutation sequences
%J The Computer Journal
%K compjour
%V 20
%N 4
%D November 1977
%P 346-349

%A S. Soule
%T A note on the nonrecursive traversal of binary trees
%J The Computer Journal
%K compjour
%V 20
%N 4
%D November 1977
%P 350-352

%A J.M. Brady
%T Hints on proofs by recursion induction
%J The Computer Journal
%K compjour
%V 20
%N 4
%D November 1977
%P 353-355

%A J.M. Wilson
%T Boolean simplification and integer inequalities
%J The Computer Journal
%K compjour
%V 20
%N 4
%D November 1977
%P 356-358

%A R. Moneja
%T Hierarchical grouping methods and stopping rules: an evaluation
%J The Computer Journal
%K compjour
%V 20
%N 4
%D November 1977
%P 359-363

%A D. Defays
%T An efficient algorithm for complete link method
%J The Computer Journal
%K compjour
%V 20
%N 4
%D November 1977
%P 364-366

%A W.L. Price
%T A controlled random search procedure for global optimisation
%J The Computer Journal
%K compjour
%V 20
%N 4
%D November 1977
%P 367-370

%A N.W. Wiseman
%A C.I.C. Campbell
%A J. Harradine
%T On making graphic quality output by computer
%J The Computer Journal
%K compjour
%V 21
%N 1
%D February 1978
%P 2-6

%A R.A. Davenport
%T Distributed or centralised data base
%J The Computer Journal
%K compjour
%V 21
%N 1
%D February 1978
%P 7-14

%A P. Dearnley
%T Monitoring database system performance
%J The Computer Journal
%K compjour
%V 21
%N 1
%D February 1978
%P 15-19

%A J.J. Donovan
%T A note on performance of VM/370 in the integration of models and data bases
%J The Computer Journal
%K compjour
%V 21
%N 1
%D February 1978
%P 20-24

%A I.A. Clark
%T STREMA: specifying application processes using streams
%J The Computer Journal
%K compjour
%V 21
%N 1
%D February 1978
%P 25-30

%A J.P. Fitch
%A A.C. Norman
%T A note on compactifying garbage collection
%J The Computer Journal
%K compjour
%V 21
%N 1
%D February 1978
%P 31-34

%A W.R. Campbell
%T A compiler definition facility based on the syntactic macro
%J The Computer Journal
%K compjour
%V 21
%N 1
%D February 1978
%P 35-41

%A J.G. Wolff
%T Recoding of natural language for economy of transmission or storage
%J The Computer Journal
%K compjour
%V 21
%N 1
%D February 1978
%P 42-44

%A R.M. Lea
%T Text compression with an Associative Parallel Processor
%J The Computer Journal
%K compjour
%V 21
%N 1
%D February 1978
%P 45-56

%A P.W. Williams
%T Criteria for choosing subsets to obtain maximum relative entropy
%J The Computer Journal
%K compjour
%V 21
%N 1
%D February 1978
%P 57-62

%A P.W. Williams
%T The relationship between entropy and file search times
%J The Computer Journal
%K compjour
%V 21
%N 1
%D February 1978
%P 63-65

%A J.L. Szwarczfiter
%A L.B. Wilson
%T Some properties of ternary trees
%J The Computer Journal
%K compjour
%V 21
%N 1
%D February 1978
%P 66-72

%A C.R. Edwards
%T Some improved designs for the digital summation threshold logic (DSTL) gate
%J The Computer Journal
%K compjour
%V 21
%N 1
%D February 1978
%P 73-78

%A J.M. Eves
%A S.L. Hurst
%T Improvements in multioutput threshold-logic gates
%J The Computer Journal
%K compjour
%V 21
%N 1
%D February 1978
%P 79-85

%A J.F. Barlow
%T An algorithm for the solution of the postman's problem
%J The Computer Journal
%K compjour
%V 21
%N 1
%D February 1978
%P 86-89

%A William L. Honig
%A C. Robert Carlson
%T Toward an understanding of (actual) data structures
%J The Computer Journal
%K compjour
%V 21
%N 2
%D May 1978
%P 98-104

%A N. Ahutiv
%A I. Borovits
%T Analysis of the purchase option of computers
%J The Computer Journal
%K compjour
%V 21
%N 2
%D May 1978
%P 105-109

%A R.H. Bonczek
%A C.W. Holsapple
%A A.B. Whinston
%T Information transferral within a distributed data base
via a generalised mapping language
%J The Computer Journal
%K compjour
%V 21
%N 2
%D May 1978
%P 110-116

%A R.V. Evans
%A G.S. Lockington
%A T.N. Reid
%T A compiler compiler and methodology
for problem oriented language compiler implementors
%J The Computer Journal
%K compjour
%V 21
%N 2
%D May 1978
%P 117-121

%A A. Parkin
%A R.B. Coats
%T EDSIM - event based discrete simulation
using general purpose languages such as Fortran
%J The Computer Journal
%K compjour
%V 21
%N 2
%D May 1978
%P 122-127

%A W.N. Holmes
%T Is APL a programming language ?
%J The Computer Journal
%K compjour
%V 21
%N 2
%D May 1978
%P 128-131

%A J.G. Kollias
%T An estimate of seek time
for batched searching of random or index sequential structured files
%J The Computer Journal
%K compjour
%V 21
%N 2
%D May 1978
%P 132-133

%A D.R. Hanson
%T Filters in SL5
%J The Computer Journal
%K compjour
%V 21
%N 2
%D May 1978
%P 134-143

%A G.V. Bochmann
%A P. Ward
%T Compiler writing system for attribute grammars
%J The Computer Journal
%K compjour
%V 21
%N 2
%D May 1978
%P 144-148

%A I. Bratko
%A D. Kopec
%A D. Michie
%T Pattern-based representation of chess end-game knowledge
%J The Computer Journal
%K compjour
%V 21
%N 2
%D May 1978
%P 149-153

%A G.M. Bull
%A S. Gilbey
%A Kathleen Levine
%A A.G. Lippiatt
%A C.H.C. Machin
%T Proteus - a microcoded multiprocessor system
%J The Computer Journal
%K compjour
%V 21
%N 2
%D May 1978
%P 154-160

%A M.H. Williams
%A H.L. Ossher
%T Conversion of unstructured flow diagrams to structured form
%J The Computer Journal
%K compjour
%V 21
%N 2
%D May 1978
%P 161-167

%A P.J. Green
%A R. Sibson
%T Computing Dirichlet tessalations in the plane
%J The Computer Journal
%K compjour
%V 21
%N 2
%D May 1978
%P 168-173

%A D.A. Smith
%A Pamela S. Guipre
%T Modifications to the Forsythe-Moler algorithm
for solving linear algebraic systems
%J The Computer Journal
%K compjour
%V 21
%N 2
%D May 1978
%P 174-177

%A A.D. Chambers
%T Computer fraud and abuse
%J The Computer Journal
%K compjour
%V 21
%N 3
%D August 1978
%P 194-198

%A I. Borovits
%A S. Neumann
%T Internal pricing for computer services
%J The Computer Journal
%K compjour
%V 21
%N 3
%D August 1978
%P 199-204

%A Eric Foxley
%T A hybrid computer performance modelling system
%J The Computer Journal
%K compjour
%V 21
%N 3
%D August 1978
%P 205-209

%A W.B. Samson
%A R.H. Davis
%T Search times using hash tables for records with non-unique keys
%J The Computer Journal
%K compjour
%V 21
%N 3
%D August 1978
%P 210-214

%A J.L. Armstrong
%T PRM a parallel computer for robot vision
%J The Computer Journal
%K compjour
%V 21
%N 3
%D August 1978
%P 215-218

%A W.L. Price
%T Simulation studies of data communication network operating in datagram mode
%J The Computer Journal
%K compjour
%V 21
%N 3
%D August 1978
%P 219-223

%A P.G. Barker
%A P.S. Jones
%T Syntactic definition and parsing of molecular formulae, part 2:
graphical synthesis of mulecular formulae for data base queries
%J The Computer Journal
%K compjour
%V 21
%N 3
%D August 1978
%P 224-233

%A M.H. Williams
%T Static semantic features of Algol 60 and Basic
%J The Computer Journal
%K compjour
%V 21
%N 3
%D August 1978
%P 234-242

%A R. Sibson
%T Locally equiangular triangulations
%J The Computer Journal
%K compjour
%V 21
%N 3
%D August 1978
%P 243-245

%A M.R. Patel
%A K.H. Bennett
%T Analysis of speed of a binary divider
using a variable number of shifts per cycle
%J The Computer Journal
%K compjour
%V 21
%N 3
%D August 1978
%P 246-252

%A A. van\ Oosterom
%T Triangulating the human torso
%J The Computer Journal
%K compjour
%V 21
%N 3
%D August 1978
%P 253-258

%A H.R.A. Townsend
%T Analysing electroencephalograms
%J The Computer Journal
%K compjour
%V 21
%N 3
%D August 1978
%P 259-262

%A J. Mottl
%A Ludmila Mottlova
%T Description of a program for solving problems of nonlinear programming
%J The Computer Journal
%K compjour
%V 21
%N 3
%D August 1978
%P 263-269

%A R. Maes
%T On the representation of program structures by decision tables:
a critical assessment
%J The Computer Journal
%K compjour
%V 21
%N 4
%D November 1978
%P 290-295

%A M.K. Roy
%T Evaluation of permutation algorithms
%J The Computer Journal
%K compjour
%V 21
%N 4
%D November 1978
%P 296-301

%A J.S. Rohl
%T Generating permutations by choosing
%J The Computer Journal
%K compjour
%V 21
%N 4
%D November 1978
%P 302-305

%A P.A. Lee
%T A reconsideration of the recovery block scheme
%J The Computer Journal
%K compjour
%V 21
%N 4
%D November 1978
%P 306-310

%A M. Osborne
%A F. Little
%T An implementation of structured programming in APL
%J The Computer Journal
%K compjour
%V 21
%N 4
%D November 1978
%P 311-315

%A A.S. Tanenbaum
%T A comparison of Pascal and Algol 68
%J The Computer Journal
%K compjour
%V 21
%N 4
%D November 1978
%P 316-323

%A B.A. Lewis
%A J.S. Robinson
%T Triangulation of planar regions with applications
%J The Computer Journal
%K compjour
%V 21
%N 4
%D November 1978
%P 324-332

%A M.A. Hennell
%T An experimental testbed for numerical software
%J The Computer Journal
%K compjour
%V 21
%N 4
%D November 1978
%P 333-336

%A W.M. Turski
%T A model of nonmorphological data collection based on sentential calculus
%J The Computer Journal
%K compjour
%V 21
%N 4
%D November 1978
%P 337-340

%A P.W. Williams
%T Balancing demand in a hierarchical structure
%J The Computer Journal
%K compjour
%V 21
%N 4
%D November 1978
%P 341-346

%A A.K. Burston
%A D.J. Kinniment
%A Hilary Kahn
%T A design language for asynchronous logic
%J The Computer Journal
%K compjour
%V 21
%N 4
%D November 1978
%P 347-354

%A J.C. Romao
%A R. Vilela Mendes
%T Algorithms for multidimensional numerical integration with singularities
%J The Computer Journal
%K compjour
%V 21
%N 4
%D November 1978
%P 355-358

%A A. Swift
%A G.R. Lindfield
%T Comparison of a continuation method with Brent's method
for the numerical solution of a single nonlinear equation
%J The Computer Journal
%K compjour
%V 21
%N 4
%D November 1978
%P 359-362

%A J.R. Cash
%A C.B. Liem
%T On the computational aspects of semi-implicit Runge-Kutta methods
%J The Computer Journal
%K compjour
%V 21
%N 4
%D November 1978
%P 363-365

%A B.S. Lee
%T Use of case studies in teaching data processing
%J The Computer Journal
%K compjour
%V 21
%N 4
%D November 1978
%P 366-372

%A R. Burdekin
%A R.S. Scowen
%T Computers and the construction of economic models
%J The Computer Journal
%K compjour
%V 22
%N 1
%D February 1979
%P 3-10

%A T. Briggs
%T A review of road traffic simulation methods
using a general purpose digital computer
%J The Computer Journal
%K compjour
%V 22
%N 1
%D February 1979
%P 11-16

%A C.B. Spengler
%A J.B. Westwood
%T Assessing data retrieval capabilities: a case study
%J The Computer Journal
%K compjour
%V 22
%N 1
%D February 1979
%P 17-21

%A Eva Huzan
%T Modelling of indexed sequential files: monitoring disc transfers
%J The Computer Journal
%K compjour
%V 22
%N 1
%D February 1979
%P 22-27

%A J.F.A. Wiederhold
%T Tuning to service standards without monitors
%J The Computer Journal
%K compjour
%V 22
%N 1
%D February 1979
%P 28-36

%A R. Chattergy
%A U.W. Pooch
%T A distributed function computer with dedicated processors
%J The Computer Journal
%K compjour
%V 22
%N 1
%D February 1979
%P 37-40

%A Y. Kobayashi
%A T.L. Kunii
%T A simulation of a minicomputer controlled system
and its use as a debugging tool
%J The Computer Journal
%K compjour
%V 22
%N 1
%D February 1979
%P 41-49

%A P.J. Brown
%T Software methods for virtual storage of executable code
%J The Computer Journal
%K compjour
%V 22
%N 1
%D February 1979
%P 50-52

%A M.A. Hennell
%A D. Hedley
%T An experimental testbed for numerical software, part 2: Algol 68
%J The Computer Journal
%K compjour
%V 22
%N 1
%D February 1979
%P 53-56

%A J.C. Turner
%T The conditional distribution of waiting time given queue length
in a computer system
%J The Computer Journal
%K compjour
%V 22
%N 1
%D February 1979
%P 57-62

%A F.G. Pagan
%T Algol 68 as a metalanguage for denotational semantics
%J The Computer Journal
%K compjour
%V 22
%N 1
%D February 1979
%P 63-66

%A P.W. Williams
%A D. Woodhead
%T Computer assisted analysis oc cryptic crosswords
%J The Computer Journal
%K compjour
%V 22
%N 1
%D February 1979
%P 67-70

%A A.G. Bell
%A N. Jacobi
%T How to read, make and store chess moves
%J The Computer Journal
%K compjour
%V 22
%N 1
%D February 1979
%P 71-75

%A G.Z. Ben-Yaakov
%T Interactive computation and data management for power system studies
%J The Computer Journal
%K compjour
%V 22
%N 1
%D February 1979
%P 76-79

%A G.W. Hill
%T Cyclic properties of pseudo-random sequences of Mersenne prime residues
%J The Computer Journal
%K compjour
%V 22
%N 1
%D February 1979
%P 80-85

%A Susan Jones
%T A network display program
%J The Computer Journal
%K compjour
%V 22
%N 2
%D May 1979
%P 98-104

%A A.T. Arblaster
%A M.E. Sime
%A T.R.G. Green
%T Jumping to some purpose
%J The Computer Journal
%K compjour
%V 22
%N 2
%D May 1979
%P 105-109

%A F. Mavaddat
%A G. Parhami
%T A data structure for family relations
%J The Computer Journal
%K compjour
%V 22
%N 2
%D May 1979
%P 110-113

%A J.R. Oliver
%A R.S. Newton
%T Practical experience with Algol 68-RT
%J The Computer Journal
%K compjour
%V 22
%N 2
%D May 1979
%P 114-118

%A Sallie S. Nelson
%T CONSIM: a study of control issues in conversational simulation
%J The Computer Journal
%K compjour
%V 22
%N 2
%D May 1979
%P 119-126

%A S.J. Harrington
%T A new symbolic integration system in Reduce
%J The Computer Journal
%K compjour
%V 22
%N 2
%D May 1979
%P 127-131

%A P.I.P. Boulton
%A J.R. Goguen
%T A machine description language
%J The Computer Journal
%K compjour
%V 22
%N 2
%D May 1979
%P 132-135

%A G.A. Korn
%A O.A. Palusinski
%T Application of a digital computer simulation language
to control hybrid computer Monte Carlo studies
%J The Computer Journal
%K compjour
%V 22
%N 2
%D May 1979
%P 136-141

%A A. Silberschatz
%T On the safety of the IO primitive in Concurrent Pascal
%J The Computer Journal
%K compjour
%V 22
%N 2
%D May 1979
%P 142-145

%A J.L. Keedy
%A K. Ramamohanarao
%A J. Rosenberg
%T On implementing semaphores with sets
%J The Computer Journal
%K compjour
%V 22
%N 2
%D May 1979
%P 146-150

%A R.S. Bird
%T Recursion elimination with variable parameters
%J The Computer Journal
%K compjour
%V 22
%N 2
%D May 1979
%P 151-154

%A D.M. Nessett
%A O.W. Rechard
%T Allocation algorithms
for dynamically microprogrammable multiprocessor systems
%J The Computer Journal
%K compjour
%V 22
%N 2
%D May 1979
%P 155-163

%A M.H. Williams
%T Conditions for extended operator precedence parsing
%J The Computer Journal
%K compjour
%V 22
%N 2
%D May 1979
%P 164-168

%A S.S. Yau
%A Y.S. Tang
%T Generation of shortest test sequences
for detection individual faults of sequentrial circuits
%J The Computer Journal
%K compjour
%V 22
%N 2
%D May 1979
%P 169-172

%A S.L. Hurst
%T An engineering consideration of spectral transforms
for ternary logic synthesis
%J The Computer Journal
%K compjour
%V 22
%N 2
%D May 1979
%P 173-183

%A J.R. Cash
%A J.C.P. Miller
%T On an iterative approach to the numerical solution of difference schemes
%J The Computer Journal
%K compjour
%V 22
%N 2
%D May 1979
%P 184-187

%A S.J. Waters
%T Towards comprehensive specifications
%J The Computer Journal
%K compjour
%V 22
%N 3
%D August 1979
%P 195-199

%A P.A. Dearnley
%T Application level microcode to speed data base management
%J The Computer Journal
%K compjour
%V 22
%N 3
%D August 1979
%P 200-202

%A C. Lazos
%A J.R. Yandle
%T Improving CPU utilisation in multiprogramming system
%J The Computer Journal
%K compjour
%V 22
%N 3
%D August 1979
%P 203-205

%A F.W. Burton
%A J. Kollias
%T Optimising disc head movements in secondary key retrievals
%J The Computer Journal
%K compjour
%V 22
%N 3
%D August 1979
%P 206-208

%A G. Haring
%A R. Posch
%A C. Leonhardt
%A G. Gell
%T The use of a syntheic jobstream in performance evaluation
%J The Computer Journal
%K compjour
%V 22
%N 3
%D August 1979
%P 209-219

%A C. Nevalainen
%A J. Teuhola
%T Priority queue administration by sublist index
%J The Computer Journal
%K compjour
%V 22
%N 3
%D August 1979
%P 220-225

%A E.F. Elsworth
%T Compilation via an intermediate language
%J The Computer Journal
%K compjour
%V 22
%N 3
%D August 1979
%P 226-233
%K UNCOL

%A M. Di\ Manzio
%A A.L. Frisiani
%A G. Olimpo
%T Loop optimisation for parallel processing
%J The Computer Journal
%K compjour
%V 22
%N 3
%D August 1979
%P 234-239

%A P. Deransart
%T Proof by semantic attributes of a Lisp compiler
%J The Computer Journal
%K compjour
%V 22
%N 3
%D August 1979
%P 240-245

%A M. Bozyigit
%A Y. Paker
%T A fixed routing problem in large and high connectivity networks
%J The Computer Journal
%K compjour
%V 22
%N 3
%D August 1979
%P 246-250

%A Z.M. Lofti
%A A.J. Tosser
%T Minimising the NAND-NOR-XOR network of modulo 2 sum of bollean products
%J The Computer Journal
%K compjour
%V 22
%N 3
%D August 1979
%P 251-255

%A J. Motti
%T Description of aporgram for nonlinear programming
%J The Computer Journal
%K compjour
%V 22
%N 3
%D August 1979
%P 256-261

%A P.J. Green
%A B.W. Silverman
%T Constructing the convex hull of a set of points in the plane
%J The Computer Journal
%K compjour
%V 22
%N 3
%D August 1979
%P 262-266

%A R.H. Barlow
%A D.J. Evans
%T A parallel organisation of the bisection algorithm
%J The Computer Journal
%K compjour
%V 22
%N 3
%D August 1979
%P 267-269

%A K.A. Robinson
%T An entity/event data modelling method
%J The Computer Journal
%K compjour
%V 22
%N 3
%D August 1979
%P 270-281

%A T.J. Howkins
%A M.T. Harandi
%T Towards more portable Cobol
%J The Computer Journal
%K compjour
%V 22
%N 4
%D November 1979
%P 290-295

%A L. Moore
%T Design for a transportable job organisation language
%J The Computer Journal
%K compjour
%V 22
%N 4
%D November 1979
%P 296-302

%A E. Gudes
%A H.S. Koch
%A F.A. Stahl
%T Security in a multi-level structured model of a data base
%J The Computer Journal
%K compjour
%V 22
%N 4
%D November 1979
%P 303-306

%A W. Burton
%T A Fortran preprocessor to support encapsulated data abstraction definitions
%J The Computer Journal
%K compjour
%V 22
%N 4
%D November 1979
%P 307-312

%A T. Leipala
%A O. Nevalainen
%T A plotter sequencing system
%J The Computer Journal
%K compjour
%V 22
%N 4
%D November 1979
%P 313-316

%A B.A. Wichmann
%A J. Du\ Croz
%T A program to calculate the GAMM measure
%J The Computer Journal
%K compjour
%V 22
%N 4
%D November 1979
%P 317-322

%A C. Lazos
%A A. Vafiadis
%T A method to estimate the I/O buffer size in a computer system
%J The Computer Journal
%K compjour
%V 22
%N 4
%D November 1979
%P 323-327

%A P.I.P. Boulton
%A M.A.R. Kittler
%T Estimating program reliability
%J The Computer Journal
%K compjour
%V 22
%N 4
%D November 1979
%P 328-331

%A H.R. Simpson
%A K. Jackson
%T Process synchronisation in MASCOT
%J The Computer Journal
%K compjour
%V 22
%N 4
%D November 1979
%P 332-345

%A C.M. Reeves
%T Free store distribution uynder random fit allocation: part 1
%J The Computer Journal
%K compjour
%V 22
%N 4
%D November 1979
%P 346-351

%A J.R. Haley
%A A.S. Noetzel
%T A study of processing repetition
%J The Computer Journal
%K compjour
%V 22
%N 4
%D November 1979
%P 352-356

%A J. Loetzsch
%A M. Machura
%A W. Paetzold
%T Sample implementation a special purpose language by the DEPOT system
%J The Computer Journal
%K compjour
%V 22
%N 4
%D November 1979
%P 357-362

%A J. Jelinek
%T An algebraic theory for parallel processor design
%J The Computer Journal
%K compjour
%V 22
%N 4
%D November 1979
%P 363-375

%A M.J.C. Gordon
%T On the power of list iteration
%J The Computer Journal
%K compjour
%V 22
%N 4
%D November 1979
%P 376-379

%A Enid Mumford
%T Social aspects of systems analysis
%J The Computer Journal
%K compjour
%V 23
%N 1
%D February 1980
%P 5-7

%A P. hammersley
%T The impact of changing technology
%J The Computer Journal
%K compjour
%V 23
%N 1
%D February 1980
%P 7-9

%A P. Prowse
%T The data base approach
%J The Computer Journal
%K compjour
%V 23
%N 1
%D February 1980
%P 9-12

%A J.N.G. Brittan
%T Design for a changing environment
%J The Computer Journal
%K compjour
%V 23
%N 1
%D February 1980
%P 13-19

%A K. Nygaard
%T The impact of social movements
%J The Computer Journal
%K compjour
%V 23
%N 1
%D February 1980
%P 19-22

%A P.H. Prowse
%A R.G. Johnson
%T A natural language data base interface to the user
%J The Computer Journal
%K compjour
%V 23
%N 1
%D February 1980
%P 22-25

%A E.B. James
%T The user interface
%J The Computer Journal
%K compjour
%V 23
%N 1
%D February 1980
%P 25-28

%A H.G. Perros
%T A regression model for predicting the response time of a disc I/O system
%J The Computer Journal
%K compjour
%V 23
%N 1
%D February 1980
%P 34-36

%A N. Zvegintzov
%T Partial-match retrieval in an index sequential directory
%J The Computer Journal
%K compjour
%V 23
%N 1
%D February 1980
%P 37-40

%A Jay-Louise Weldon
%T Using data base abstractions for logical design
%J The Computer Journal
%K compjour
%V 23
%N 1
%D February 1980
%P 41-45

%A R.A. Earnshaw
%T Line tracking for incremental plotters
%J The Computer Journal
%K compjour
%V 23
%N 1
%D February 1980
%P 46-52

%A E.J. Yannakoukadis
%A F.H. Ayres
%A J.A.W. Huggill
%T Character coding for bibliographical record control
%J The Computer Journal
%K compjour
%V 23
%N 1
%D February 1980
%P 53-60

%A K.L. Clark
%A J. Darlington
%T Algorithm classification through synthesis
%J The Computer Journal
%K compjour
%V 23
%N 1
%D February 1980
%P 61-65

%A D.J. Evans
%A Shirley A. Williams
%T Analysis and detection of parallel processable code
%J The Computer Journal
%K compjour
%V 23
%N 1
%D February 1980
%P 66-72

%A Y. Igarashi
%T The size of arrays for a rpime implicant generating algorithm
%J The Computer Journal
%K compjour
%V 23
%N 1
%D February 1980
%P 73-77

%A I.H. Witten
%T Algorithms for adaptive linear prediction
%J The Computer Journal
%K compjour
%V 23
%N 1
%D February 1980
%P 78-84

%A J.V. Hansen
%A Lynn J. McKell
%T A Co aid for the analysis of complex systems
%J The Computer Journal
%K compjour
%V 23
%N 2
%D May 1980
%P 98-106

%A R.E. Griswold
%T The use of character sets and character mappings in Icon
%J The Computer Journal
%K compjour
%V 23
%N 2
%D May 1980
%P 107-114

%A J.M. Bishop
%A D.W. Barron
%T Procedure calling and structured architecture
%J The Computer Journal
%K compjour
%V 23
%N 2
%D May 1980
%P 115-123

%A S.A. Kent
%T A minicomputer based high level network control language
%J The Computer Journal
%K compjour
%V 23
%N 2
%D May 1980
%P 124-131

%A R. Haskell
%A P.G. Harrison
%T System conventions for non procedural languages
%J The Computer Journal
%K compjour
%V 23
%N 2
%D May 1980
%P 132-141

%A R.H. Perrott
%A A.K. Raja
%A P.C. O'Kane
%T A simulation experiment using two languages
%J The Computer Journal
%K compjour
%V 23
%N 2
%D May 1980
%P 142-146

%A I.C. Wand
%T Dynamic resource allocation and supervision
with the programming language Modula
%J The Computer Journal
%K compjour
%V 23
%N 2
%D May 1980
%P 147-152

%A D.T. Goodwin
%T Partial non-underflow and non-overflow of an arithmetic stack
%J The Computer Journal
%K compjour
%V 23
%N 2
%D May 1980
%P 153-160

%A B. Dasarathy
%A Cheng Yang
%T A transformation on ordered trees
%J The Computer Journal
%K compjour
%V 23
%N 2
%D May 1980
%P 161-164

%A M. Rabel
%A D. Dubus
%A A. Tosser
%T Saving of NAND/NOR gates by inhibition or d-inhibition
%J The Computer Journal
%K compjour
%V 23
%N 2
%D May 1980
%P 165-185

%A D. Westreich
%T An efficient predictor-corrector algorithm
%J The Computer Journal
%K compjour
%V 23
%N 2
%D May 1980
%P 186

%A D. Westreich
%T Improving polynomial evaluation at an approximate root
%J The Computer Journal
%K compjour
%V 23
%N 2
%D May 1980
%P 187

%A M.D. Atkinson
%T Permutation groups and set union algorithms
%J The Computer Journal
%K compjour
%V 23
%N 2
%D May 1980
%P 187

%A J.A.T. Maddison
%T Fast lookup in hash tables with direct rehashing
%J The Computer Journal
%K compjour
%V 23
%N 2
%D May 1980
%P 188-190

%A J.M. Triance
%T Structured programming in Cobol - the current options
%J The Computer Journal
%K compjour
%V 23
%N 3
%D August 1980
%P 194-200

%A S.M. Deen
%T A canonical schema for a generalised data model with local interfaces
%J The Computer Journal
%K compjour
%V 23
%N 3
%D August 1980
%P 201-206

%A M. Hatzopoulos
%A J.G. Kollias
%T Some rules for introducing indexing paths in a primary file
%J The Computer Journal
%K compjour
%V 23
%N 3
%D August 1980
%P 207-211

%A R.B.E. Napper
%A R.N. Fisher
%T RCC - a user-extendible systems implementation language
%J The Computer Journal
%K compjour
%V 23
%N 3
%D August 1980
%P 212-222

%A R.N. Horspool
%A N. Marovac
%T An approach to the problem of detranslation of computer programs
%J The Computer Journal
%K compjour
%V 23
%N 3
%D August 1980
%P 223-229

%A W.T. Jones
%A S.A. Kirk
%T APL as a software design specification language
%J The Computer Journal
%K compjour
%V 23
%N 3
%D August 1980
%P 230-232

%A A.F. Eidelson
%A I.J. Robinson
%T Implementation of BEDSOCS: an interactive simulation language
%J The Computer Journal
%K compjour
%V 23
%N 3
%D August 1980
%P 233-236

%A G.R. Garside
%A P.E. Pintelas
%T An Algol 68 package for implementing graph algorithms
%J The Computer Journal
%K compjour
%V 23
%N 3
%D August 1980
%P 237-242

%A D.F. Cowell
%A D.F. Gillies
%A A.A. Kaposi
%T Synthesis and structural analysis of abstract programs
%J The Computer Journal
%K compjour
%V 23
%N 3
%D August 1980
%P 243-247

%A T. Ottmann
%A D. Wood
%T 1-2 brother trees or AVL trees revisited
%J The Computer Journal
%K compjour
%V 23
%N 3
%D August 1980
%P 248-255

%A A. Albano
%A R. Orsini
%T A tree search approach to the M-partition and knapsack problems
%J The Computer Journal
%K compjour
%V 23
%N 3
%D August 1980
%P 256-261

%A R.K. Lutz
%T An algorithm for the real-time analysis of digitised images
%J The Computer Journal
%K compjour
%V 23
%N 3
%D August 1980
%P 262-269

%A A.J.T. Colin
%A A.D. McGettrick
%A P.D. Smith
%T Sorting trains
%J The Computer Journal
%K compjour
%V 23
%N 3
%D August 1980
%P 270-273

%A I.J. Riddell
%A L.M. Delves
%T The comparison of routines
for solving Fredholm integral equations of the second kind
%J The Computer Journal
%K compjour
%V 23
%N 3
%D August 1980
%P 274-285

%A L. Lipsky
%T A study of time sharing systems
considered as queueing network of exponential servers
%J The Computer Journal
%K compjour
%V 23
%N 4
%D November 1980
%P 290-297

%A C.M. Reeves
%T Free store distribution under random fit allocation: part 2
%J The Computer Journal
%K compjour
%V 23
%N 4
%D November 1980
%P 298-306

%A G. Schmidt
%A T. Strohlein
%T Timetable construction - an annotated bibliography
%J The Computer Journal
%K compjour
%V 23
%N 4
%D November 1980
%P 307-316

%A A. Boccalatte
%A M. Di\ Manzo
%T An approach to the detection of semantic errors
%J The Computer Journal
%K compjour
%V 23
%N 4
%D November 1980
%P 317-323

%A D.Y. Feng
%A R.F. Riesenfeld
%T Some new surface forms for computer aided geometric design
%J The Computer Journal
%K compjour
%V 23
%N 4
%D November 1980
%P 324-331

%A T.I. Fenner
%A G. Loizou
%T A binary tree representation and related algorithms
for generating integer partitions
%J The Computer Journal
%K compjour
%V 23
%N 4
%D November 1980
%P 332-337

%A A. Albano
%A R. Orsini
%T A heuristic solution of the rectangular cutting stock problem
%J The Computer Journal
%K compjour
%V 23
%N 4
%D November 1980
%P 338-343

%A Y.L. Varol
%T On a subset of all the permutations of n marks
%J The Computer Journal
%K compjour
%V 23
%N 4
%D November 1980
%P 344-346

%A M.A. Bramer
%T Correct and optimal strategies in game playing programs
%J The Computer Journal
%K compjour
%V 23
%N 4
%D November 1980
%P 347-352
%K chess

%A I. Bratko
%A D. Michie
%T An advice program for a complex chess programming task
%J The Computer Journal
%K compjour
%V 23
%N 4
%D November 1980
%P 353-359

%A J. Mottl
%T Description of a program for nonlinear programming:
special problem of bivalent nonlinear programming
%J The Computer Journal
%K compjour
%V 23
%N 4
%D November 1980
%P 360-368

%A Donald Michie
%T Expert systems
%J The Computer Journal
%K compjour
%V 23
%N 4
%D November 1980
%P 369-376

%A M. Healey
%T The possible impact of minicomputers and microprocessors
on mainframe computer manufacturers
%J The Computer Journal
%K compjour
%V 24
%N 1
%D 1981
%P 3-9

%A E.B. James
%T Microelectronics: the impact on computer centres
%J The Computer Journal
%K compjour
%V 24
%N 1
%D 1981
%P 10-13

%A P. Hammersley
%T The impact of microcomputer systems on commercial data processing
%J The Computer Journal
%K compjour
%V 24
%N 1
%D 1981
%P 14-16

%A K. Ekanadham
%A A. Mahjoub
%T Microcomputer networks
%J The Computer Journal
%K compjour
%V 24
%N 1
%D 1981
%P 17-24

%A J.C. Cavouras
%A R.H. Davis
%T Simulation tools in computer system design methodologies
%J The Computer Journal
%K compjour
%V 24
%N 1
%D 1981
%P 25-28

%A J.G. Kollias
%A M. Hatzopoulos
%T Criteria to aid in solving the problem
of allocating copies of a file in a computer network
%J The Computer Journal
%K compjour
%V 24
%N 1
%D 1981
%P 29-30

%A R.A. Davenport
%T Design of distributed data base systems
%J The Computer Journal
%K compjour
%V 24
%N 1
%D 1981
%P 31-41

%A M.J.R. Shave
%T Entities, functions and binary relations:
steps to a conceptual schema
%J The Computer Journal
%K compjour
%V 24
%N 1
%D 1981
%P 42-47

%A Naveen Prakash
%A P. Sadanandan
%A S.M. Desai
%A K. Rama Rao
%A P.N. Gejji
%T Samhita - a data base management system
%J The Computer Journal
%K compjour
%V 24
%N 1
%D 1981
%P 48-51

%A Wendy J. Milne
%T A framework for the investigation of a spatial data base
%J The Computer Journal
%K compjour
%V 24
%N 1
%D 1981
%P 52-55

%A A. Sernadas
%T SYSTEMATICS: its syntax and semantics as a query language (1)
%J The Computer Journal
%K compjour
%V 24
%N 1
%D 1981
%P 56-61

%A I.H. Witten
%A Y.H. Ng
%T An ideographic language front end processor
for accessing English language computer systems
%J The Computer Journal
%K compjour
%V 24
%N 1
%D 1981
%P 62-70

%A K. Ewusi-Mensah
%T Computer network usage control through peak load pricing
%J The Computer Journal
%K compjour
%V 24
%N 1
%D 1981
%P 71-77

%A A. Silberschatz
%T Port directed communication
%J The Computer Journal
%K compjour
%V 24
%N 1
%D 1981
%P 78-82
%K CSP

%A Y.L. Varol
%A D. Rotem
%T An algorithm to generate all topological sorting arrangements
%J The Computer Journal
%K compjour
%V 24
%N 1
%D 1981
%P 83-84

%A R.D. Dutton
%A R.C. Brigham
%T A new graph coloring algorithm
%J The Computer Journal
%K compjour
%V 24
%N 1
%D 1981
%P 85-86

%A P. Stecher
%A Volker Allenstein
%T The application controller concept: a first experience
%J The Computer Journal
%K compjour
%V 24
%N 2
%D 1981
%P 97-106

%A P.D. Smith
%A S.Y. Steen
%T A prototype crossword compiler
%J The Computer Journal
%K compjour
%V 24
%N 2
%D 1981
%P 107-111

%A S. Alagic
%A A. Kulenovic
%T Relational Pascal data base interface
%J The Computer Journal
%K compjour
%V 24
%N 2
%D 1981
%P 112-117

%A K.W. Short
%T Protection in data type abstractions using constraints on data values
%J The Computer Journal
%K compjour
%V 24
%N 2
%D 1981
%P 118-124

%A Amilcar Sernadas
%T SYSTEMATICS: its syntax and semantics as a query language (2)
%J The Computer Journal
%K compjour
%V 24
%N 2
%D 1981
%P 125-129

%A W.B. Samson
%T Hash table collision handling on storage devices with latency
%J The Computer Journal
%K compjour
%V 24
%N 2
%D 1981
%P 130-131

%A W.T. Graybeal
%A U.W. Pooch
%T The design of calibration experiments for synthetic jobs
%J The Computer Journal
%K compjour
%V 24
%N 2
%D 1981
%P 132-138

%A Tony P. Lucido
%A Rahul Chattergy
%A Udo W. Pooch
%T A survey of microprogram verification and validation methods
%J The Computer Journal
%K compjour
%V 24
%N 2
%D 1981
%P 139-142

%A F.G. Pagan
%T A style for writing the syntactic portions
of complete definitions of programming languages
%J The Computer Journal
%K compjour
%V 24
%N 2
%D 1981
%P 143-147

%A K. Brinck
%A N.Y. Foo
%T Analysis of algorithms on threaded trees
%J The Computer Journal
%K compjour
%V 24
%N 2
%D 1981
%P 148-155

%A M.A. Harrison
%A A. Yehudai
%T Eliminating null rules in linear time
%J The Computer Journal
%K compjour
%V 24
%N 2
%D 1981
%P 156-161

%A A. Bowyer
%T Computing Dirichlet tessellations
%J The Computer Journal
%K compjour
%V 24
%N 2
%D 1981
%P 162-166

%A D.F. Watson
%T Computing the n-dimensional Delaunay tesselation
with application to Voronoi polytopes
%J The Computer Journal
%K compjour
%V 24
%N 2
%D 1981
%P 167-172

%A Yaakov L. Varol
%A Doron Rotem
%T Some experiences with the Johnson-Trotter
permutation generation algorithm
%J The Computer Journal
%K compjour
%V 24
%N 2
%D 1981
%P 173-176

%A W.A. Sentance
%A A.P. Cliff
%T The determination of eigenvalues of symmetric quindiagonal matrices
%J The Computer Journal
%K compjour
%V 24
%N 2
%D 1981
%P 177-179

%A S.O. Bateman
%A S.D. Danielpoulos
%T Computerised analytic solutions of second order differential equations
%J The Computer Journal
%K compjour
%V 24
%N 2
%D 1981
%P 180-183

%A L.M. Delves
%A L.F. Abd-Elal
%A J.A. Hendry
%T A set of modules for the solution of integral equations
%J The Computer Journal
%K compjour
%V 24
%N 2
%D 1981
%P 184-190

%A F.S. Zahran
%T A universal data model holder for data dictionary systems
%J The Computer Journal
%K compjour
%V 24
%N 3
%D 1981
%P 193-199

%A S.M. Deen
%A D. Nikodem
%A A. Vashishta
%T The design of a canonical database system (PRECI)
%J The Computer Journal
%K compjour
%V 24
%N 3
%D 1981
%P 200-209

%A J.M. Bishop
%A D.W. Barron
%T Principles of descriptors
%J The Computer Journal
%K compjour
%V 24
%N 3
%D 1981
%P 210-221

%A L.V. Atkinson
%A J.J. McGregor
%A S.D. North
%T Context sensitive editing as an approach to incremental compilation
%J The Computer Journal
%K compjour
%V 24
%N 3
%D 1981
%P 222-229

%A C. Lazos
%T Increasing computer system productivity software and hardware methods:
a comparative case study
%J The Computer Journal
%K compjour
%V 24
%N 3
%D 1981
%P 230-234

%A M.E. Falla
%T The Gamma software engineering system
%J The Computer Journal
%K compjour
%V 24
%N 3
%D 1981
%P 235-242

%A H. Wettstein
%T Locking operations for maximum concurrency
%J The Computer Journal
%K compjour
%V 24
%N 3
%D 1981
%P 243-248

%A H.W. Thimbleby
%T A word boundary algorithm for text processing
%J The Computer Journal
%K compjour
%V 24
%N 3
%D 1981
%P 249-255

%A G.F. Butler
%A J. Pike
%T A free-format data input scheme written in standard Fortran (ANSI 66)
%J The Computer Journal
%K compjour
%V 24
%N 3
%D 1981
%P 256-257

%A Ronald E. Prather
%A Shirla G. Giulieri
%T Decomposition of flowchart schemata
%J The Computer Journal
%K compjour
%V 24
%N 3
%D 1981
%P 258-262

%A Z. Zdrahal
%A I. Bratko
%A A. Shapiro
%T Recognition of complex patterns using cellular arrays
%J The Computer Journal
%K compjour
%V 24
%N 3
%D 1981
%P 263-270
%K chess

%A Brian A. Barsky
%A Spencer W. Thomas
%T TRANSPLINE - a system for representing curves
using tansformations among four spline formulations
%J The Computer Journal
%K compjour
%V 24
%N 3
%D 1981
%P 271-277

%A Donald Michie
%T A theory of evaluative comments in chess with a note on minimaxing
%J The Computer Journal
%K compjour
%V 24
%N 3
%D 1981
%P 278-286

%A I<P. Page
%A R.T. Wood
%T A shaded-picture scanning attachment for incremental plotters
%J The Computer Journal
%K compjour
%V 24
%N 3
%D 1981
%P 287

%A Edward M. Reingold
%T A comment on the evaluation of Polish postfix expressions
%J The Computer Journal
%K compjour
%V 24
%N 3
%D 1981
%P 288

%A A.D. Chambers
%T Current strategies for computer auditing within an organisation
%J The Computer Journal
%K compjour
%V 24
%N 4
%D 1981
%P 290-294

%A Donald Millington
%T Structured systems analysis and design using standard flowcharting symbols
%J The Computer Journal
%K compjour
%V 24
%N 4
%D 1981
%P 295-300

%A W.T. Izatt
%A E.A. Schmitz
%T Data structures and descriptors in the ICL 2900 series and beyond
%J The Computer Journal
%K compjour
%V 24
%N 4
%D 1981
%P 301-307

%A F. Warren Burton
%A Brian J. Lings
%T Abstract data types, subtypes and data independence
%J The Computer Journal
%K compjour
%V 24
%N 4
%D 1981
%P 308-311

%A Ian A. Macleod
%T The relational model as a basis for document retrieval system design
%J The Computer Journal
%K compjour
%V 24
%N 4
%D 1981
%P 312-315

%A Steven J. Harrington
%T Space efficient copying storage recovery
%J The Computer Journal
%K compjour
%V 24
%N 4
%D 1981
%P 316-319

%A Alison M. Pringle
%T Justification with fewer hyphens
%J The Computer Journal
%K compjour
%V 24
%N 4
%D 1981
%P 320-323

%A J. Pike
%T Text compression using a 4 bit coding scheme
%J The Computer Journal
%K compjour
%V 24
%N 4
%D 1981
%P 324-330

%A K. Hopper
%T Retained objects and operating system interfaces
%J The Computer Journal
%K compjour
%V 24
%N 4
%D 1981
%P 331-338

%A I.P. Page
%A R.T. Wood
%T Empirical analysis of a moving head disc model
with two heads separated by a fixed number of tracks
%J The Computer Journal
%K compjour
%V 24
%N 4
%D 1981
%P 339-342

%A A.D. Elliman
%A A.R. Sudhindra
%T Performances of two microprocessor-based multiplexor techniques
%J The Computer Journal
%K compjour
%V 24
%N 4
%D 1981
%P 343-346

%A E. Foxley
%A O. Salman
%T Validation of an analytic model of computer performance
%J The Computer Journal
%K compjour
%V 24
%N 4
%D 1981
%P 347-352

%A Adrian Bowyer
%A Philip J. Willis
%A John R. Woodwark
%T 353-357

%A H. Gomaa
%T A hybrid simulation/regression model of a virtual storage system
%J The Computer Journal
%K compjour
%V 24
%N 4
%D 1981
%P 358-366

%A James K. Mullin
%T Change area B-trees: a technique to aid error recovery
%J The Computer Journal
%K compjour
%V 24
%N 4
%D 1981
%P 367-373

%A I. Sklenar
%T Affine splines
%J The Computer Journal
%K compjour
%V 24
%N 4
%D 1981
%P 374-377

%A Robin Sibson
%A Graeme D. Thomson
%T A seamed quadratic element for contouring
%J The Computer Journal
%K compjour
%V 24
%N 4
%D 1981
%P 378-382

%A F.W. Allen
%T A file index for document storage and retrieval
utilizing descriptor fragments
%J The Computer Journal
%K compjour
%V 25
%N 1
%D 1982
%P 2-6

%A I.P. Schagen
%T Automatic contouring from scattered data points
%J The Computer Journal
%K compjour
%V 25
%N 1
%D 1982
%P 7-11

%A A.T. Wood-Harper
%A G. Fitzgerald
%T A taxonomy of current approaches to systems analysis
%J The Computer Journal
%K compjour
%V 25
%N 1
%D 1982
%P 12-16

%A Richard Kieburtz
%A Abraham Silberschatz
%T On the static access-control mechanism in Concurrent Pascal
%J The Computer Journal
%K compjour
%V 25
%N 1
%D 1982
%P 17-21

%A Nenad Marovac
%T The rotating bus as a basis for interprocess communication
in distributed systems
%J The Computer Journal
%K compjour
%V 25
%N 1
%D 1982
%P 22-31

%A I.P. Page
%T Optimal fit of arbitrary sized segments
%J The Computer Journal
%K compjour
%V 25
%N 1
%D 1982
%P 32-33

%A Abraham Silberschatz
%T Priority and queueing specification in "Distributed Processes"
%J The Computer Journal
%K compjour
%V 25
%N 1
%D 1982
%P 34-36

%A A.J.B. Travis
%T An aid to pattern recognition
%J The Computer Journal
%K compjour
%V 25
%N 1
%D 1982
%P 37-44

%A Jarmo Ernvall
%A Olli Nevalainen
%T An algorithm for unbiased random sampling
%J The Computer Journal
%K compjour
%V 25
%N 1
%D 1982
%P 45-47

%A E. Skordalakis
%A G. Papakonstantinou
%T A control structure for a variable number of nested loops
%J The Computer Journal
%K compjour
%V 25
%N 1
%D 1982
%P 48-51

%A J.J. Cocu
%A R.E. Devillers
%T On a class of allocation strategies inducing bounded delays only
%J The Computer Journal
%K compjour
%V 25
%N 1
%D 1982
%P 52-55

%A R.H. Barlow
%A D.J. Evans
%T Parallel algorithms for the iterative solution to linear systems
%J The Computer Journal
%K compjour
%V 25
%N 1
%D 1982
%P 56-60

%A Charles B. Dunham
%T The necessity of publishing programs
%J The Computer Journal
%K compjour
%V 25
%N 1
%D 1982
%P 61-62

%A Frank G. Pagan
%T Semantic specification using two-level grammars:
labels and GOTO statements
%J The Computer Journal
%K compjour
%V 25
%N 1
%D 1982
%P 63-67

%A C. Robert Carlson
%A Adarsh K. Arora
%A Miroslava Milosavljevic Carlson
%T The application of functional dependency theory to relational databases
%J The Computer Journal
%K compjour
%V 25
%N 1
%D 1982
%P 68-73

%A R.J.. Morris
%A J.S. Kaufman
%T Performance comparison of I/O access disciplines
for transaction-processing systems
%J The Computer Journal
%K compjour
%V 25
%N 1
%D 1982
%P 74-83

%A B. Schmidt
%T Simulation of discrete systems using GPSS-Fortran
%J The Computer Journal
%K compjour
%V 25
%N 1
%D 1982
%P 84-86

%A M. Bozygit
%A Y. Paker
%T A topology reconfiguration mechanism for distributed computer systems
%J The Computer Journal
%K compjour
%V 25
%N 1
%D 1982
%P 87-92

%A M.C. Er
%A B.G.T. Lowden
%T The theory and practice of constructing an optimal polyphase sort
%J The Computer Journal
%K compjour
%V 25
%N 1
%D 1982
%P 93-101

%A C.M. McCulloch
%T QUICKSHUNT - a distributive sorting algorithm
%J The Computer Journal
%K compjour
%V 25
%N 1
%D 1982
%P 102-104

%A Donald Michie
%T Experiments on the mechanization of game-learning
2 - rule-based learning and the human window
%J The Computer Journal
%K compjour
%V 25
%N 1
%D 1982
%P 105-113

%A M.L.V. Pitteway
%A A.J.R. Green
%T Bresenham's algorithm with run line coding shortcut
%J The Computer Journal
%K compjour
%V 25
%N 1
%D 1982
%P 114-115

%A Jack E. Bresenham
%T Incremental line compaction
%J The Computer Journal
%K compjour
%V 25
%N 1
%D 1982
%P 116-120

%A J.L. Keedy
%A J. Rosenberg
%A K. Ramamohanarao
%T On synchronizing readers and writers with semaphores
%J The Computer Journal
%K compjour
%V 25
%N 1
%D 1982
%P 121-125

%A M. Hatzopoulos
%A J.G. Kollias
%T The determination of the optimum database maintenance points
%J The Computer Journal
%K compjour
%V 25
%N 1
%D 1982
%P 126-129

%A Julie Scoltock
%T A survey of the literature of cluster analysis
%J The Computer Journal
%K compjour
%V 25
%N 1
%D 1982
%P 130-134

%A R.W.A. Hudson
%A J.A. Self
%T A dialogue system to teach database concepts
%J The Computer Journal
%K compjour
%V 25
%N 1
%D 1982
%P 135-139

%A A.J. Wilkes
%A N.E. Wiseman
%T A soft-edged character set and its derivation
%J The Computer Journal
%K compjour
%V 25
%N 1
%D 1982
%P 140-147

%A R.C. Thomas
%A A. Burns
%T The case for distributed decision making systems
%J The Computer Journal
%K compjour
%V 25
%N 1
%D 1982
%P 148-152

%A B. Shackel
%T The BLEND system: programme for the study of some "electronic journals"
%J The Computer Journal
%K compjour
%V 25
%N 2
%D 1982
%P 161-168

%A J.S. Johnson
%A D.B. Webster
%T Updating an inverted index - a performance comparison of two techniques
%J The Computer Journal
%K compjour
%V 25
%N 2
%D 1982
%P 169-175

%A Graham Lee
%T DOPLs: a new style of programming
%J The Computer Journal
%K compjour
%V 25
%N 2
%D 1982
%P 176-182

%A E.J. Yannakoudakis
%A A.K.P. Wu
%T Quasi-equifrequent group generation and evaluation
%J The Computer Journal
%K compjour
%V 25
%N 2
%D 1982
%P 183-187

%A Reginald Muchsel
%T Performance measurements -
a practical example from a german university computing centre
%J The Computer Journal
%K compjour
%V 25
%N 2
%D 1982
%P 188-192

%A C.H.C. Leung
%T A simple model for the performance analysis of disc storage fragmentation
%J The Computer Journal
%K compjour
%V 25
%N 2
%D 1982
%P 193-198

%A C.H.C. Leung
%T An improved optimal-fit procedure for dynamic storage allocation
%J The Computer Journal
%K compjour
%V 25
%N 2
%D 1982
%P 199-206

%A Philip C. Treleaven
%A Richard P. Hopkins
%A Paul W. Rautenbach
%T Combining data flow and control flow computing
%J The Computer Journal
%K compjour
%V 25
%N 2
%D 1982
%P 207-217

%A N.E. Goller
%T Triodic logic and its use in structured program design
%J The Computer Journal
%K compjour
%V 25
%N 2
%D 1982
%P 218-226

%A William E. Wright
%T Single versus double buffering in constrained merging
%J The Computer Journal
%K compjour
%V 25
%N 2
%D 1982
%P 227-230

%A A. Blake
%T Fixed point solutions of recursive operations on boolean arrays
%J The Computer Journal
%K compjour
%V 25
%N 2
%D 1982
%P 231-234

%A J.R. Woodwark
%T The explicit quad tree as a structure for computer graphics
%J The Computer Journal
%K compjour
%V 25
%N 2
%D 1982
%P 235-238

%A G. Papakonstantinou
%T Optimal evaluation of queries
%J The Computer Journal
%K compjour
%V 25
%N 2
%D 1982
%P 239-241

%A J.R. Lin Sin Cho
%T Automatic report formatting from a report specimen
%J The Computer Journal
%K compjour
%V 25
%N 2
%D 1982
%P 242-247

%A B.A. Wichmann
%T A comparison of Pascal and Ada
%J The Computer Journal
%K compjour
%V 25
%N 2
%D 1982
%P 248-252

%A P.A. Dearnley
%T Software development for microcomputer data processing systems
%J The Computer Journal
%K compjour
%V 25
%N 2
%D 1982
%P 253-256

%A R.W. Topor
%T Functional programs for generating permutations
%J The Computer Journal
%K compjour
%V 25
%N 2
%D 1982
%P 257-263

%A P.G. Harrison
%T Efficient storage management for functional languages
%J The Computer Journal
%K compjour
%V 25
%N 2
%D 1982
%P 264-271

%A Chris Corbett
%A Ian H. Witten
%T On the inclusion and placement
of documentation graphics in computer typesetting
%J The Computer Journal
%K compjour
%V 25
%N 2
%D 1982
%P 272-277

%A M.H. Williams
%T The programming language BPL
%J The Computer Journal
%K compjour
%V 25
%N 3
%D 1982
%P 289-306

%A C.J. Rosenquist
%T Entity life cycle models and their applicability
to information systems development life cycles
%J The Computer Journal
%K compjour
%V 25
%N 3
%D 1982
%P 307-315

%A Dusan M. Velasevic
%T Right-to-left code generation for arithmetic expressions
%J The Computer Journal
%K compjour
%V 25
%N 3
%D 1982
%P 316-326

%A K.P. Tan
%A L.S. Hsu
%T Block sorting of a large file in external storage by a 2-component key
%J The Computer Journal
%K compjour
%V 25
%N 3
%D 1982
%P 327-330

%A A. Boccalatte
%A M. Di Manzo
%A D. Sciarra
%T Error recovery with attribute grammars
%J The Computer Journal
%K compjour
%V 25
%N 3
%D 1982
%P 331-337

%A Charles J. Colbourn
%T Computing the chromatic index of Steiner triple systems
%J The Computer Journal
%K compjour
%V 25
%N 3
%D 1982
%P 338-339

%A R. Nigel Horspool
%A Laurence W. Dunkelman
%T Analysis and optimization of set expressions
%J The Computer Journal
%K compjour
%V 25
%N 3
%D 1982
%P 330-346

%A Per-Ake Larson
%T Expected worst-case performance of hash files
%J The Computer Journal
%K compjour
%V 25
%N 3
%D 1982
%P 347-352

%A Bengt-Erik Bengtsson
%T Packing rectangular pieces - a heuristic approach
%J The Computer Journal
%K compjour
%V 25
%N 3
%D 1982
%P 353-357

%A R.A. Frost
%T Binary-relational storage structures
%J The Computer Journal
%K compjour
%V 25
%N 3
%D 1982
%P 358-367

%A Arvola Chan
%A Bahram Niamir
%T On estimating the cost of accessing records in blocked database organizations
%J The Computer Journal
%K compjour
%V 25
%N 3
%D 1982
%P 368-374

%A Peter J.L. Wallis
%T The preparation of guidelines for portable programming
in high-level languages
%J The Computer Journal
%K compjour
%V 25
%N 3
%D 1982
%P 375-378

%A G. Oulsnam
%T Unravelling unstructured programs
%J The Computer Journal
%K compjour
%V 25
%N 3
%D 1982
%P 379-387

%A M.D. McIlroy
%T The number of states of a dynamic storage allocation system
%J The Computer Journal
%K compjour
%V 25
%N 3
%D 1982
%P 388-392

%A M.H. Williams
%T A comment on the decomposition of flowchart schemata
%J The Computer Journal
%K compjour
%V 25
%N 3
%D 1982
%P 393-396

%A A. Parkin
%T Data analysis and system design by entity-relationship modelling
- a practical example
%J The Computer Journal
%K compjour
%V 25
%N 4
%D 1982
%P 401-409

%A C.R. Symons
%A P. Tijsma
%T A systematic and practical approach to the definition of data
%J The Computer Journal
%K compjour
%V 25
%N 4
%D 1982
%P 410-422

%A M. Mor
%A A.S. Fraenkel
%T Permutation generation on vector processors
%J The Computer Journal
%K compjour
%V 25
%N 4
%D 1982
%P 423-428

%A D.J. Tomplinson
%T An aid to hidden surface removal in real time CGI systems
%J The Computer Journal
%K compjour
%V 25
%N 4
%D 1982
%P 429-441

%A M.C. Er
%T A representation approach to the tower of Hanoi problem
%J The Computer Journal
%K compjour
%V 25
%N 4
%D 1982
%P 442-447

%A R.A. Brooker
%T A "database" subsystem for BCPL
%J The Computer Journal
%K compjour
%V 25
%N 4
%D 1982
%P 448-464

%A Elaine J. Weyuker
%T On testing non-testable programs
%J The Computer Journal
%K compjour
%V 25
%N 4
%D 1982
%P 465-470

%A R. Sacks-Davis
%T Applications of redundant number representations to decimal arithmetic
%J The Computer Journal
%K compjour
%V 25
%N 4
%D 1982
%P 471-477

%A K. Ramamohanarao
%A John W. Lloyd
%T Dynamic hashing schemes
%J The Computer Journal
%K compjour
%V 25
%N 4
%D 1982
%P 478-485

%A D.A. Bell
%A S.M. Deen
%T Key space compression and hashing in PRECI
%J The Computer Journal
%K compjour
%V 25
%N 4
%D 1982
%P 486-492

%A Philip Leith
%T Hierarchically structured production rules
%J The Computer Journal
%K compjour
%V 26
%N 1
%D 1983
%P 1-5

%A R.H. Barlow
%A D.J. Evans
%A J. Shanehchi
%T Parallel multisection applied to the eigenvalue problem
%J The Computer Journal
%K compjour
%V 26
%N 1
%D 1983
%P 6-9

%A C.H.C. Leung
%A K. Wolfenden
%T Disc database efficiency: a scheme for detailed assessment
based on semi-Markov models
%J The Computer Journal
%K compjour
%V 26
%N 1
%D 1983
%P 10-14

%A S.O. Anderson
%A R.C. Backhouse
%A E.H. Bugge
%A C.P. Stirling
%T An assessment of locally least-cost error recovery
%J The Computer Journal
%K compjour
%V 26
%N 1
%D 1983
%P 15-24

%A C.M. Reeves
%T Free store distribution under random fit allocation: part 3
%J The Computer Journal
%K compjour
%V 26
%N 1
%D 1983
%P 25-35

%A P.A. Dearnley
%A P.J. Mayhew
%T In favour of system prototypes
and the integration into the systems development cycle
%J The Computer Journal
%K compjour
%V 26
%N 1
%D 1983
%P 36-42

%A William E. Wright
%T Some file structure considerations pertaining to magnetic bubble memory
%J The Computer Journal
%K compjour
%V 26
%N 1
%D 1983
%P 43-51

%A N.H. Gehani
%T High level form definition in office information systems
%J The Computer Journal
%K compjour
%V 26
%N 1
%D 1983
%P 52-59

%A J.M. Triance
%T The proposed Cobol standard - its significance
%J The Computer Journal
%K compjour
%V 26
%N 1
%D 1983
%P 60-67

%A D.G.N. Hunter
%A A.R. McKenzie
%T Experiments with relaxation algorithms
for breaking simple substitution ciphers
%J The Computer Journal
%K compjour
%V 26
%N 1
%D 1983
%P 68-71

%A S.B. Wampler
%A R.E. Griswold
%T Co-expressions in Icon
%J The Computer Journal
%K compjour
%V 26
%N 1
%D 1983
%P 72-78

%A A.T. Wood-Harper
%A D.J. Flynn
%T Action learning for teaching information systems
%J The Computer Journal
%K compjour
%V 26
%N 1
%D 1983
%P 79-82

%A M.A. Oliver
%A N.E. Wiseman
%T Operations on quadtree encoded images
%J The Computer Journal
%K compjour
%V 26
%N 1
%D 1983
%P 83-91

%A Phalguni Gupta
%A G.P. Bhattacharjee
%T Parallel generation of permutations
%J The Computer Journal
%K compjour
%V 26
%N 2
%D 1983
%P 97-105

%A Gaston H. Gonnet
%A Henk J. Olivic
%A Derick Wood
%T Height-ratio-balanced trees
%J The Computer Journal
%K compjour
%V 26
%N 2
%D 1983
%P 106-108

%A C.G. Broyden
%T A mark-scaling algorithm
%J The Computer Journal
%K compjour
%V 26
%N 2
%D 1983
%P 109-112

%A C.H.C. Leung
%T Analysis of disc fragmentation using Markov chains
%J The Computer Journal
%K compjour
%V 26
%N 2
%D 1983
%P 113-116

%A J.G. Kollias
%T The effect of missing, retroactive, erroneous and/or late data
in designing accounting applications
%J The Computer Journal
%K compjour
%V 26
%N 2
%D 1983
%P 117-123

%A R.A. Frost
%A S. Whittaker
%T A step towards the automatic maintenance
of the semantic integrity of databases
%J The Computer Journal
%K compjour
%V 26
%N 2
%D 1983
%P 124-133

%A John C. Cavouras
%T Computer system evaluation through supervisor replication
%J The Computer Journal
%K compjour
%V 26
%N 2
%D 1983
%P 134-141

%A David A. Watt
%A Ole Lehrmann Madsen
%T Extended attribute grammars
%J The Computer Journal
%K compjour
%V 26
%N 2
%D 1983
%P 142-153

%A B. Lesuisse
%T Some lessons drawn from the history of the binary search algorithm
%J The Computer Journal
%K compjour
%V 26
%N 2
%D 1983
%P 154-163

%A Lloyd Allison
%T Programming denotational semantics
%J The Computer Journal
%K compjour
%V 26
%N 2
%D 1983
%P 164-174

%A R.E. Griswold
%A Michael Novak
%T Programmer-defined control operations
%J The Computer Journal
%K compjour
%V 26
%N 2
%D 1983
%P 175-183

%A D.J. Evans
%A F. Abdollahzadeh
%T Efficient construction of balanced binary trees
%J The Computer Journal
%K compjour
%V 26
%N 3
%D 1983
%P 193-195

%A C.H.C. Leung
%T A model for disc locality referencing
%J The Computer Journal
%K compjour
%V 26
%N 3
%D 1983
%P 196-198

%A A.M.R. Smith
%A L.S. Lee
%A D.J. Hand
%T Interactive user-friendly interfaces to statistical packages
%J The Computer Journal
%K compjour
%V 26
%N 3
%D 1983
%P 199-204

%A M.C. Er
%T A note on generating well-formed parenthesis strings lexicographically
%J The Computer Journal
%K compjour
%V 26
%N 3
%D 1983
%P 205-207

%A J.V. Woods
%A A.J.T. Wheen
%T MU6P: an advanced microprocessor architecture
%J The Computer Journal
%K compjour
%V 26
%N 3
%D 1983
%P 208-217

%A Jan Schlorer
%T Information loss in partitioned statistical databases
%J The Computer Journal
%K compjour
%V 26
%N 3
%D 1983
%P 218-223

%A M.C. Er
%T A fast algorithm for computing order-K Fibonacci numbers
%J The Computer Journal
%K compjour
%V 26
%N 3
%D 1983
%P 224-227

%A R.A. Frost
%T SCHEMAL: yet another conceptual schema definition language
%J The Computer Journal
%K compjour
%V 26
%N 3
%D 1983
%P 228-234

%A R.E.J. Clark
%A S.K. Robinson
%T A graphically interacting program monitor
%J The Computer Journal
%K compjour
%V 26
%N 3
%D 1983
%P 235-238

%A A.F. Smeaton
%A C.J. van Rijsbergen
%T The retrieval effects of query expansion
on a feedback document retrieval system
%J The Computer Journal
%K compjour
%V 26
%N 3
%D 1983
%P 239-246

%A B. Shackel
%A D.J. Pullinger
%A T.I. Maude
%A W.P. Dodd
%T The BLEND-LINC project on "electronic journals" after two years
%J The Computer Journal
%K compjour
%V 26
%N 3
%D 1983
%P 247-254

%A J.R. Quinlan
%T Inferno: a cautious approach to uncertain inference
%J The Computer Journal
%K compjour
%V 26
%N 3
%D 1983
%P 255-269

%A M.H. Williams
%T Flowchart schemata and the problem of nomenclature
%J The Computer Journal
%K compjour
%V 26
%N 3
%D 1983
%P 270-276

%A Eric C.R. Hehner
%A Brad A. Silverberg
%T Programming with grammars:
an exercise in methodology-directed language design
%J The Computer Journal
%K compjour
%V 26
%N 3
%D 1983
%P 277-281

%A Pierre Lescanne
%T Behavioural categoricity of abstract data type specifications
%J The Computer Journal
%K compjour
%V 26
%N 4
%D 1983
%P 289-292

%A M.C. Er
%T A parallel computation approach to topological sorting
%J The Computer Journal
%K compjour
%V 26
%N 4
%D 1983
%P 293-295

%A P.D. Smith
%T XENO: computer-assisted compilation of crossword puzzles
%J The Computer Journal
%K compjour
%V 26
%N 4
%D 1983
%P 296-302

%A John A. Llewellyn
%T Finite state models in the study of comma-free codes
%J The Computer Journal
%K compjour
%V 26
%N 4
%D 1983
%P 303-311

%A P.K. Ghosh
%A S.P. Mudur
%T Parametric curves for graphic design systems
%J The Computer Journal
%K compjour
%V 26
%N 4
%D 1983
%P 312-319

%A J.S. Deogun
%T On scheduling with ready times to minimize mean flow time
%J The Computer Journal
%K compjour
%V 26
%N 4
%D 1983
%P 320-328

%A Naveen Prakash
%A N. Parimala
%A N. Bolloju
%T Data definition facilities in Admin
%J The Computer Journal
%K compjour
%V 26
%N 4
%D 1983
%P 329-335

%A Aviezri S. Fraenkel
%A Moshe Mor
%T Combinatorial compression and partitioning of large dictionaries
%J The Computer Journal
%K compjour
%V 26
%N 4
%D 1983
%P 336-343

%A John K. Slape
%A Peter J.L. Wallis
%T Conversion of Fortran to Ada using and intermediate tree representation
%J The Computer Journal
%K compjour
%V 26
%N 4
%D 1983
%P 344-353

%A F. Murtagh
%T A survey of recent advances in hierarchical clustering algorithms
%J The Computer Journal
%K compjour
%V 26
%N 4
%D 1983
%P 354-359

%A M.P. Atkinson
%A P.J. Bailey
%A K.J. Chisholm
%A P.W. Cockshott
%A R. Morrison
%T An approach to persistent programming
%J The Computer Journal
%K compjour
%V 26
%N 4
%D 1983
%P 360-365

%A R.T. House
%T A proposal for an extended form of type checking of expressions
%J The Computer Journal
%K compjour
%V 26
%N 4
%D 1983
%P 366-374

%A M.A. Oliver
%A N.E. Wiseman
%T Operations on quadtree leaves and related image areas
%J The Computer Journal
%K compjour
%V 26
%N 4
%D 1983
%P 375-380

%A Maurice V. Wilkes
%T Security management and protection - a personal approach
%J The Computer Journal
%K compjour
%V 27
%N 1
%D 1984
%P 3-7

%A William A. Gale
%A Roger Koenker
%T Pricing interactive computer services
%J The Computer Journal
%K compjour
%V 27
%N 1
%D 1984
%P 8-17

%A I.P. Page
%T Analysis of a cyclic placement scheme
%J The Computer Journal
%K compjour
%V 27
%N 1
%D 1984
%P 18-26

%A P.G. Harrison
%T The distributed of cycle times in tree-like networks of queues
%J The Computer Journal
%K compjour
%V 27
%N 1
%D 1984
%P 27-36

%A D.H.J. Brown
%T Transitions to Ada: an incremental approach
%J The Computer Journal
%K compjour
%V 27
%N 1
%D 1984
%P 37-41

%A L.V. Atkinson
%T Jumping about and getting into a state
%J The Computer Journal
%K compjour
%V 27
%N 1
%D 1984
%P 42-46

%A David M. Harland
%T User-defined types in a polymorphic language
%J The Computer Journal
%K compjour
%V 27
%N 1
%D 1984
%P 47-56

%A Adarsh K. Arora
%A C.R. Carlson
%T Normalization could be useful
%J The Computer Journal
%K compjour
%V 27
%N 1
%D 1984
%P 57-61

%A N. Parimala
%A Naveen Prakash
%A N. Bolloju
%T Concurrency control in Admin
%J The Computer Journal
%K compjour
%V 27
%N 1
%D 1984
%P 62-66

%A K.T. Fung
%T A reorganization model based on the database entropy concept
%J The Computer Journal
%K compjour
%V 27
%N 1
%D 1984
%P 67-71

%A C.M. Reeves
%T Complexity analyses of event set algorithms
%J The Computer Journal
%K compjour
%V 27
%N 1
%D 1984
%P 72-79

%A M.C. Er
%T The colour towers of Hanoi: a generalization
%J The Computer Journal
%K compjour
%V 27
%N 1
%D 1984
%P 80-82

%A Donald E. Knuth
%T Literate programming
%J The Computer Journal
%K compjour
%V 27
%N 2
%D 1984
%J The Computer Journal
%K compjour
%V 27
%N 2
%D 1984
%P 97-111

%A A.J. Wilkes
%A D.W. Singer
%A J.J. Gibbons
%A T.R. King
%A P. Robinson
%A N.E. Wiseman
%T The Rainbow workstation
%J The Computer Journal
%K compjour
%V 27
%N 2
%D 1984
%P 112-120

%A John A. Mariani
%A Douglas R. McGregor
%T Vulcan: a modified viewdata system
with improved indexing and formal hierarchy definition language
%J The Computer Journal
%K compjour
%V 27
%N 2
%D 1984
%P 121-126

%A P. Corsini
%A G. Frosini
%A L. Lopriore
%T The implementation of abstract objects
in a capability based addressing architecture
%J The Computer Journal
%K compjour
%V 27
%N 2
%D 1984
%P 127-134

%A C.M. Reeves
%T A lumped-state model of clustering in dynamic storage allocation
%J The Computer Journal
%K compjour
%V 27
%N 2
%D 1984
%P 135-142

%A R.H. Davis
%A P. Coumpas
%T A dynamic file organization model
%J The Computer Journal
%K compjour
%V 27
%N 2
%D 1984
%P 143-150

%A Keld Helsgaun
%T Backtrack programming with Simula
%J The Computer Journal
%K compjour
%V 27
%N 2
%D 1984
%P 151-158

%A D. Barton
%T A problem with algebra systems - revisited
%J The Computer Journal
%K compjour
%V 27
%N 2
%D 1984
%P 159-164

%A M.H. Williams
%A K.T. Milne
%T The performance of algorithms for colouring planar graphs
%J The Computer Journal
%K compjour
%V 27
%N 2
%D 1984
%P 165-170

%A M.C. Er
%T The cyclic towers of Hanoi: a representation approach
%J The Computer Journal
%K compjour
%V 27
%N 2
%D 1984
%P 171-175

%A Alan D. Kalvin
%A Yaakov L. Varol
%T On two problems reducible to topological sorting
%J The Computer Journal
%K compjour
%V 27
%N 2
%D 1984
%P 176-177

%A A. El Sayed Noor
%T A framework for the creation and management
of national computing strategies in developing countries
%J The Computer Journal
%K compjour
%V 27
%N 3
%D 1984
%P 193-200

%A A. Mahjoub
%T On the static evaluation of distributed systems performance
%J The Computer Journal
%K compjour
%V 27
%N 3
%D 1984
%P 201-208

%A Naveen Prakash
%A N. Parimala
%A N. Bolloju
%T Specifying integrity constraints in a network DBMS
%J The Computer Journal
%K compjour
%V 27
%N 3
%D 1984
%P 209-217

%A D.A. Bell
%A S.M. Deen
%T Hash trees versus B-trees
%J The Computer Journal
%K compjour
%V 27
%N 3
%D 1984
%P 218-224

%A J.R. Woodwark
%T Compressed quad trees
%J The Computer Journal
%K compjour
%V 27
%N 3
%D 1984
%P 225-229

%A Art Lew
%T Proof of correctness of decision table programs
%J The Computer Journal
%K compjour
%V 27
%N 3
%D 1984
%P 230-232

%A G. Adorni
%A A. Boccalatte
%A M. Di\ Manzo
%T Top-down semantic analysis
%J The Computer Journal
%K compjour
%V 27
%N 3
%D 1984
%P 233-237

%A Richard B. Bunt
%A Jennifer M. Murphy
%T The measurement of locality and the behaviour of programs
%J The Computer Journal
%K compjour
%V 27
%N 3
%D 1984
%P 238-245

%A R.K. Ward
%A M. Tabandeh
%T Error correction and detection, a geometric approach
%J The Computer Journal
%K compjour
%V 27
%N 3
%D 1984
%P 246-253

%A M.P. Papazoglou
%A P.I. Georgiadis
%A D.G. Maritsas
%J The Computer Journal
%K compjour
%V 27
%N 3
%D 1984
%P 254-259

%A F.S. Wong
%A M.R. Ito
%T Parallel sorting on a re-circulating systolic sorter
%J The Computer Journal
%K compjour
%V 27
%N 3
%D 1984
%P 260-269

%A H.W. Six
%A L. Wegner
%T Sorting a random access file in situ
%J The Computer Journal
%K compjour
%V 27
%N 3
%D 1984
%P 270-275

%A Hannu Erkio
%T The worst case permutation for median-of-three quicksort
%J The Computer Journal
%K compjour
%V 27
%N 3
%D 1984
%P 276-277

%A M.C. Er
%T The generalized colour towers of Hanoi: an iterative algorithm
%J The Computer Journal
%K compjour
%V 27
%N 3
%D 1984
%P 278-282

%A M. Elizabeth C. Hull
%A R.M. McKeag
%T Concurrency in the design of data processing systems
%J The Computer Journal
%K compjour
%V 27
%N 4
%D 1984
%P 289-293

%A David S. Bowers
%T A database architecture for aggregate-incomplete data
%J The Computer Journal
%K compjour
%V 27
%N 4
%D 1984
%P 294-300

%A Steve Talbot
%T An investigation into logical optimization
of relational query languages
%J The Computer Journal
%K compjour
%V 27
%N 4
%D 1984
%P 301-309

%A N. Parimala
%A Naveen Prakash
%A N. Bolloju
%T New corecs and new cosets in Admin
%J The Computer Journal
%K compjour
%V 27
%N 4
%D 1984
%P 310-314

%A David A. Bell
%T Difficult data placement problems
%J The Computer Journal
%K compjour
%V 27
%N 4
%D 1984
%P 315-320

%A D.D. Kouvatsos
%A S.K. Wong
%T On optimal blocking of sequential files
%J The Computer Journal
%K compjour
%V 27
%N 4
%D 1984
%P 321-327

%A G.Ch. Pflug
%T Dynamic memory allocation - a Markovian analysis
%J The Computer Journal
%K compjour
%V 27
%N 4
%D 1984
%P 328-333

%A Wlodzimierz Dobosiewicz
%T Replacement selection in 3-level memories
%J The Computer Journal
%K compjour
%V 27
%N 4
%D 1984
%P 334-339

%A Ronald E. Prather
%T An axiomatic theory of software complexity measure
%J The Computer Journal
%K compjour
%V 27
%N 4
%D 1984
%P 340-347

%A P.J. Brown
%T Embedded macro processor
%J The Computer Journal
%K compjour
%V 27
%N 4
%D 1984
%P 348-353

%A Michael Stubbs
%T An examination of the resolution of structure clashes
by structure inversion
%J The Computer Journal
%K compjour
%V 27
%N 4
%D 1984
%P 354-361

%A A.J.B. Travis
%T An aid to pattern recognition, part 2
%J The Computer Journal
%K compjour
%V 27
%N 4
%D 1984
%P 362-367

%A T.I. Maude
%A D.J. Pullinger
%T Software for reading, refereeing and browsing in the BLEND system
%J The Computer Journal
%K compjour
%V 28
%N 1
%D 1985
%P 1-4

%A Nicola Santoro
%A Ramez Khatib
%T Labelling and implicit routing in networks
%J The Computer Journal
%K compjour
%V 28
%N 1
%D 1985
%P 5-8

%A D.T. Goodwin
%T Further study of a stack-length model
%J The Computer Journal
%K compjour
%V 28
%N 1
%D 1985
%P 9-16

%A D. Crookes
%A C.J. Devlin
%T An algorithm for optimal procedural nesting
%J The Computer Journal
%K compjour
%V 28
%N 1
%D 1985
%P 17-21

%A J. Robinson
%A A. Burns
%T A dialogue development system
for the design and implementation of user interfaces in Ada
%J The Computer Journal
%K compjour
%V 28
%N 1
%D 1985
%P 22-28

%A P.J. Layzell
%T The history of macro processors in programming language extensibility
%J The Computer Journal
%K compjour
%V 28
%N 1
%D 1985
%P 29-33

%A J.M. Triance
%A P.J. Layzell
%T Macro processors for enhancing high-level languages
- some design principles
%J The Computer Journal
%K compjour
%V 28
%N 1
%D 1985
%P 34-43

%A N.E. Goller
%T Hybrid data structures defines by indirection
%J The Computer Journal
%K compjour
%V 28
%N 1
%D 1985
%P 44-53

%A G.V. Cormack
%A R.N.S. Horspool
%A M. Kaiserswerth
%T Practical perfect hashing
%J The Computer Journal
%K compjour
%V 28
%N 1
%D 1985
%P 54-58

%A A.L. Furtado
%A T.S.E Maibaum
%T An informal approach to formal (algebraic) specifications
%J The Computer Journal
%K compjour
%V 28
%N 1
%D 1985
%P 59-67

%A B.A. Styne
%A T.R. King
%A N.E. Wiseman
%T Pad structures for the Rainbow workstation
%J The Computer Journal
%K compjour
%V 28
%N 1
%D 1985
%P 68-72

%A D.J. Abel
%T Some elemental operations on linear quadtrees
for geographic information systems
%J The Computer Journal
%K compjour
%V 28
%N 1
%D 1985
%P 73-77

%A M.H. Williams
%T A linear algorithm for colouring planar graphs with five colours
%J The Computer Journal
%K compjour
%V 28
%N 1
%D 1985
%P 78-81

%A E. Murtagh
%T A survey of algorithms for contiguity-constrained clustering
and related problems
%J The Computer Journal
%K compjour
%V 28
%N 1
%D 1985
%P 82-88

%A J. Mottl
%T Description of a program for nonlinear programming:
the centroid program
%J The Computer Journal
%K compjour
%V 28
%N 1
%D 1985
%P 89-94

%A Enid Mumford
%T Defining system requirements to meet business needs:
a case study example
%J The Computer Journal
%K compjour
%V 28
%N 2
%D 1985
%P 97-104

%A Julian R. Ullmann
%A Robert M. Haralick
%A Linda G. Shapiro
%T Computer architecture for solving consistent labelling problems
%J The Computer Journal
%K compjour
%V 28
%N 2
%D 1985
%P 105-111

%A R.A. Frost
%T Using semantic concepts to characterize
various knowledge representation formalisms:
a method of facilitating the interface
of knowledge base system components
%J The Computer Journal
%K compjour
%V 28
%N 2
%D 1985
%P 112-116

%A F.J. Dixon
%T Simplifying screen specifications:
the 'full screen manager' interface
and 'screen form' generating routines
%J The Computer Journal
%K compjour
%V 28
%N 2
%D 1985
%P 117-127

%A J.M. Triance
%A P.J. Layzell
%T A language enhancement facility for Cobol -
its design and implementation
%J The Computer Journal
%K compjour
%V 28
%N 2
%D 1985
%P 128-133

%A M.H. Williams
%A G. Chen
%T Restructuring Pascal programs containing goto statements
%J The Computer Journal
%K compjour
%V 28
%N 2
%D 1985
%P 134-137

%A Peter R. Benyon
%T Exploiting vector computers by replication
%J The Computer Journal
%K compjour
%V 28
%N 2
%D 1985
%P 138-141

%A David Barton
%T Parallelism in simple algebra systems
%J The Computer Journal
%K compjour
%V 28
%N 2
%D 1985
%P 142-147

%A L.M. Delves
%A S.C. Mawdsley
%T DAP-Algol: a development system for parallel algorithms
%J The Computer Journal
%K compjour
%V 28
%N 2
%D 1985
%P 148-153

%A T.S.E. Maibaum
%T Database instances, abstract data types and database specification
%J The Computer Journal
%K compjour
%V 28
%N 2
%D 1985
%P 154-161

%A R. Turner
%A R.G.T. Lowden
%T An introduction to the formal specification
of relational query languages
%J The Computer Journal
%K compjour
%V 28
%N 2
%D 1985
%P 162-169

%A Yuksel Uckan
%T A relational schema description and manipulation facility
%J The Computer Journal
%K compjour
%V 28
%N 2
%D 1985
%P 170-178

%A C.H.C. Leung
%A K. Wolfenden
%T Mathematical models of file growth
%J The Computer Journal
%K compjour
%V 28
%N 2
%D 1985
%P 179-183

%A Philippe Kent
%T An efficient new way to represent multi-dimensional data
%J The Computer Journal
%K compjour
%V 28
%N 2
%D 1985
%P 184-190

%A R.K. Stamper
%T Information: mystical fluid or a subject for scientific enquiry ?
%J The Computer Journal
%K compjour
%V 28
%N 3
%D 1985
%P 195-199

%A George Rzevski
%T On criteria for assessing an information theory
%J The Computer Journal
%K compjour
%V 28
%N 3
%D 1985
%P 200-202

%A G.G. Scarrott
%T Information, the life blood of organisation
%J The Computer Journal
%K compjour
%V 28
%N 3
%D 1985
%P 203-205

%A C.J. Tully
%T Information, human activity and the nature of relevant theories
%J The Computer Journal
%K compjour
%V 28
%N 3
%D 1985
%P 206-210

%A Frank Land
%T Is an information theory enough ?
%J The Computer Journal
%K compjour
%V 28
%N 3
%D 1985
%P 211-215

%A D.H. Marwick
%A C.R.G.B. Rinaldi
%T The tattoo on a micro-computer
%J The Computer Journal
%K compjour
%V 28
%N 3
%D 1985
%P 216-222

%A G. Fitzgerald
%A N. Stokes
%A J.R.G. Wood
%T Feature analysis of contemporary information systems methodologies
%J The Computer Journal
%K compjour
%V 28
%N 3
%D 1985
%P 223-230

%A R.N. Ibbett
%A D.A. Edwards
%A T.P. Hopkins
%A C.K. Cadogan
%A D.A. Train
%T Centrenet - a high performance local area network
%J The Computer Journal
%K compjour
%V 28
%N 3
%D 1985
%P 231-242

%A S. Muir
%A D. Hutchison
%A D. Shepherd
%T Arca: a local network file server
%J The Computer Journal
%K compjour
%V 28
%N 3
%D 1985
%P 243-249

%A M.H. Williams
%T Structuring two-level grammar specifications
%J The Computer Journal
%K compjour
%V 28
%N 3
%D 1985
%P 250-256

%A D.T. Goodwin
%T The computability of stack non-underflow
%J The Computer Journal
%K compjour
%V 28
%N 3
%D 1985
%P 257-263

%A Sakti Pramanik
%A Chung-ta King
%T A hardware pattern matching algorithm on a dataflow
%J The Computer Journal
%K compjour
%V 28
%N 3
%D 1985
%P 264-269

%A R.N. Maddison
%A A.J. Gawrosnki
%T A data dictionary for learning data analysis
%J The Computer Journal
%K compjour
%V 28
%N 3
%D 1985
%P 270-281

%A S.M. Eden
%A R.R. Amin
%A G.O. Ofori-Dwumfuo
%A M.C. Taylor
%T The architecture of a generalised distributed database system - PRECI
%J The Computer Journal
%K compjour
%V 28
%N 3
%D 1985
%P 282-290

%A S. Misbah-deen
%T A tuple placement technique for databases
%J The Computer Journal
%K compjour
%V 28
%N 3
%D 1985
%P 291-297

%A T.D. Kimura
%A W.D. Gillett
%A J.R. Cox,\ Jr.
%T A design of a data model based on abstraction of symbols
%J The Computer Journal
%K compjour
%V 28
%N 3
%D 1985
%P 298-308

%A W.B. Samson
%A A. Bendell
%T Rank order distributions and secondary key indexing
%J The Computer Journal
%K compjour
%V 28
%N 3
%D 1985
%P 309-312

%A Gordon Lyon
%T Achieving hash table searches in one or two bucket probes
%J The Computer Journal
%K compjour
%V 28
%N 3
%D 1985
%P 313-318

%A Per-Ake Larson
%T Performance analysis of a single-file version of linear hashing
%J The Computer Journal
%K compjour
%V 28
%N 3
%D 1985
%P 319-329

%A James K. Mullin
%T Spiral storage: efficient dynamic hashing with constant performance
%J The Computer Journal
%K compjour
%V 28
%N 3
%D 1985
%P 330-334

%A A. Oxley
%T Surface fitting by triangulation
%J The Computer Journal
%K compjour
%V 28
%N 3
%D 1985
%P 335-339

%A M. Clint
%A C. Holt
%A R.H. Perrott
%A A. Stewart
%T A DAP fortran subroutine
for the eigensolution of real symmetric matrices
%J The Computer Journal
%K compjour
%V 28
%N 3
%D 1985
%P 340-342

%A D.G.N. Hunter
%T RSA key calculation in Ada
%J The Computer Journal
%K compjour
%V 28
%N 3
%D 1985
%P 343-348

%A K.T. Fung
%T An entropy approach to solving some network reliability problems
%J The Computer Journal
%K compjour
%V 28
%N 4
%D 1985
%P 353-356

%A Jovan Djordjevic
%A Mario Barbacci
%A Brad Hosler
%T A PMS level notation
for the description and simulation of digital systems
%J The Computer Journal
%K compjour
%V 28
%N 4
%D 1985
%P 357-365

%A M.L. Schneider
%T Weighed decision tables - an alternative solution for ambiguity
%J The Computer Journal
%K compjour
%V 28
%N 4
%D 1985
%P 366-371

%A Kazimierz Subieta
%T A simple method of data correction
%J The Computer Journal
%K compjour
%V 28
%N 4
%D 1985
%P 372-374

%A Allan Ramsay
%T On efficient context switching
%J The Computer Journal
%K compjour
%V 28
%N 4
%D 1985
%P 375-378

%A John A. Llewellyn
%T The construction of variable-length comma-free codes
%J The Computer Journal
%K compjour
%V 28
%N 4
%D 1985
%P 379-390

%A F. Cesarini
%A G. Soda
%T Design and implementation of a relational DBMS for microcomputers
%J The Computer Journal
%K compjour
%V 28
%N 4
%D 1985
%P 391-397

%A R. Bonnanno
%A D. Maio
%A P. Tiberio
%T An approximation algorithm for secondary index selection
in relational database physical design
%J The Computer Journal
%K compjour
%V 28
%N 4
%D 1985
%P 398-405

%A Michael Hatzopoulos
%A Yiannis Kollias
%T On the selection of a reduced set of indexes
%J The Computer Journal
%K compjour
%V 28
%N 4
%D 1985
%P 406-408

%A C.H.C. Leung
%A K. Wolfenden
%T Estimating disc access patterns using diffusion models
%J The Computer Journal
%K compjour
%V 28
%N 4
%D 1985
%P 409-411

%A Matti Jakobsson
%T Sampling without replacement in linear time
%J The Computer Journal
%K compjour
%V 28
%N 4
%D 1985
%P 412-413

%A F. Warren Burton
%A Matthew M. Huntbach
%A Yianns G. Kollias
%T Multiple generation text files using overlapping tree structures
%J The Computer Journal
%K compjour
%V 28
%N 4
%D 1985
%P 414-416

%A Nivio Zivani
%A Henk J. Olivie
%A Gastin H. Gonnet
%T The analysis of an improved symmetric binary B-tree algorithm
%J The Computer Journal
%K compjour
%V 28
%N 4
%D 1985
%P 417-425

%A Keith Brinck
%T The expected performance of traversal algorithms in binary trees
%J The Computer Journal
%K compjour
%V 28
%N 4
%D 1985
%P 426-432

%A David McLean
%T A method of generating surfaces as a composite of cyclide patches
%J The Computer Journal
%K compjour
%V 28
%N 4
%D 1985
%P 433-438

%A D.J. Abel
%A W.T. Williams
%T A re-examination of four classificatory fusion strategies
%J The Computer Journal
%K compjour
%V 28
%N 4
%D 1985
%P 439-443

%A Enrico Spoletini
%T Generation of permutations in direct lexicographic ordering
by arithmetic methods
%J The Computer Journal
%K compjour
%V 28
%N 4
%D 1985
%P 444-445

%A M.W. Shields
%T Concurrent machines
%J The Computer Journal
%K compjour
%V 28
%N 5
%D 1985
%P 449-465

%A K. Kant
%A A. Silberschatz
%T Error propagation and recovery in concurrent environments
%J The Computer Journal
%K compjour
%V 28
%N 5
%D 1985
%P 466-473

%A Lawrence C. Paulson
%T Lessons learned from LCF: a survey of natural deduction proofs
%J The Computer Journal
%K compjour
%V 28
%N 5
%D 1985
%P 474-479

%A Lloyd Allison
%T Programming denotational semantics II
%J The Computer Journal
%K compjour
%V 28
%N 5
%D 1985
%P 480-486

%A Z. Markusz
%A A.A. Kapos
%T Complexity control in logic-based programming
%J The Computer Journal
%K compjour
%V 28
%N 5
%D 1985
%P 487-495
%K software metrics, complexity measures

%A Robert M. O'Keefe
%T Comment on 'complexity analyses of event set algorithms'
%J The Computer Journal
%K compjour
%V 28
%N 5
%D 1985
%P 496-497

%A Nader Shebini
%T FEDOS: a finite element database for offshore structures
%J The Computer Journal
%K compjour
%V 28
%N 5
%D 1985
%P 498-500

%A P.M.D. Gray
%A P. Esslemont
%T The performance of a relational interface to a Codasyl database
%J The Computer Journal
%K compjour
%V 28
%N 5
%D 1985
%P 501-507

%A D.J. Flynn
%A A.H.F. Laender
%T Mapping from a conceptual schema to a target internal schema
%J The Computer Journal
%K compjour
%V 28
%N 5
%D 1985
%P 508-517

%A C.H.C. Leung
%A K. Wolfenden
%T Analysis and optimization of data currency and consistency
in replicated distributed databases
%J The Computer Journal
%K compjour
%V 28
%N 5
%D 1985
%P 518-523

%A Michalis Hatzopoulos
%A J.G. Kollias
%T Towards the optimal secondary index organization
and secondary index selection
%J The Computer Journal
%K compjour
%V 28
%N 5
%D 1985
%P 524-529

%A A.J. Compton
%T An algorithm for the even distributed of entities in one dimension
%J The Computer Journal
%K compjour
%V 28
%N 5
%D 1985
%P 530-537

%A M.C. Er
%T Enumerating ordered trees lexicographically
%J The Computer Journal
%K compjour
%V 28
%N 5
%D 1985
%P 538-542

%A M. Anderson
%A R.D. Rose
%A C.S. Wallce
%T A password-capability system
%J The Computer Journal
%K compjour
%V 29
%N 1
%D February 1986
%P 1-8

%A M.H. Williams
%A J. Riddall
%T The segregation of incompatible duties
%J The Computer Journal
%K compjour
%V 29
%N 1
%D February 1986
%P 9-11

%A R.K. Ward
%T Parity check codes for logic processors
%J The Computer Journal
%K compjour
%V 29
%N 1
%D February 1986
%P 12-16

%A N.Y. Foo
%T Dewey indexing of Prolog traces
%J The Computer Journal
%K compjour
%V 29
%N 1
%D February 1986
%P 17-19

%A A. Hutchinson
%T Some practical principles for design of maintainable systems
%J The Computer Journal
%K compjour
%V 29
%N 1
%D February 1986
%P 20-23

%A J. Fucik
%A J. Kral
%T The hierarchy of program control structures
%J The Computer Journal
%K compjour
%V 29
%N 1
%D February 1986
%P 24-32

%A Tadao Takaoka
%T The semantics of new while loop
%J The Computer Journal
%K compjour
%V 29
%N 1
%D February 1986
%P 33-35

%A H.M. Mahmoud
%T The expected distribution of degrees
in random binary search trees
%J The Computer Journal
%K compjour
%V 29
%N 1
%D February 1986
%P 36-37

%A K.G. Kulkarni
%A M.P. Atkinson
%T EFDM: extended functional data model
%J The Computer Journal
%K compjour
%V 29
%N 1
%D February 1986
%P 38-46

%A M.A. Bassiouni
%T System and program models of storage allocation
for reducing seek delay
%J The Computer Journal
%K compjour
%V 29
%N 1
%D February 1986
%P 47-51

%A F. Suraweera
%T Use of doubly chained tree structures
in file organisation for optimal searching
%J The Computer Journal
%K compjour
%V 29
%N 1
%D February 1986
%P 52-59

%A I.P. Stewart
%T Quadtrees: storage and scan conversion
%J The Computer Journal
%K compjour
%V 29
%N 1
%D February 1986
%P 60-75

%A H. Edelsburnner
%A G. Haring
%A D. Hilbert
%T Rectangular point location in d dimensions with applications
%J The Computer Journal
%K compjour
%V 29
%N 1
%D February 1986
%P 76-82

%A L. Capper
%T A philosophy for the teaching
of computer science and information technology
%J The Computer Journal
%K compjour
%V 29
%N 1
%D February 1986
%P 83-89

%A M.P. Georgeff
%A G.K. Gupta
%T Resources needed for a university computer science department
%J The Computer Journal
%K compjour
%V 29
%N 1
%D February 1986
%P 90-95

%A A.P. Jagodzinski
%A D.D. Clarke
%T A review of methods for measuring and describing users' attitudes
as an essential constituent of systems analysis and design
%J The Computer Journal
%K compjour
%V 29
%N 2
%D April 1986
%P 97-102

%A J. Jarosz
%A J.R. Jaworowski
%T Computer tree - the power of parallel computations
%J The Computer Journal
%K compjour
%V 29
%N 2
%D April 1986
%P 103-108

%A N. Natarajan
%T A distributed synchronization scheme for communicating processes
%J The Computer Journal
%K compjour
%V 29
%N 2
%D April 1986
%P 109-117

%A K. Viswanathan Iyer
%A L.M. Patnaik
%T Performance study of a centralized concurrency control algorithm
for distributed database systems using SIMULA
%J The Computer Journal
%K compjour
%V 29
%N 2
%D April 1986
%P 118-126

%A N.M. Pitman
%A F.W. Burton
%A E.W. Haddon
%T Buddy systems with selective splitting
%J The Computer Journal
%K compjour
%V 29
%N 2
%D April 1986
%P 127-134

%A A. Hutchinson
%T A data structure and algorithm
for a self-augmenting heuristic program
%J The Computer Journal
%K compjour
%V 29
%N 2
%D April 1986
%P 135-150

%A D. Ince
%A M. Woodman
%T The rapid generation of a class of software tools
%J The Computer Journal
%K compjour
%V 29
%N 2
%D April 1986
%P 151-160

%A J.T. Boardman
%A G.C.A. Robson
%T Towards a problem-solving methodology
for coping with increasing complexity: an engineering approach
%J The Computer Journal
%K compjour
%V 29
%N 2
%D April 1986
%P 161-166

%A J. Bradley
%T Use of mean distance between overflow records
to compute average search lengths in hash files with open addressing
%J The Computer Journal
%K compjour
%V 29
%N 2
%D April 1986
%P 167-170

%A J.M. Pallo
%T Enumerating, ranking and unranking binary trees
%J The Computer Journal
%K compjour
%V 29
%N 2
%D April 1986
%P 171-175

%A F.D. Libera
%A F. Gosen
%T Using B-trees to solve geographic range queries
%J The Computer Journal
%K compjour
%V 29
%N 2
%D April 1986
%P 176-181

%A J.T. Boardman
%A C. Garrett
%A G.C.A. Robson
%T A recursive algorithm for the optimal solution
of a complex allocation problem using a dynamic programming formulation
%J The Computer Journal
%K compjour
%V 29
%N 2
%D April 1986
%P 182-186

%A J.S. Rohl
%A T.D. Gedeon
%T The Reve's puzzle
%J The Computer Journal
%K compjour
%V 29
%N 2
%D April 1986
%P 187-188

%A Joan M. Smith
%T The implications of SGML
for the preparation of scientific publications
%J The Computer Journal
%K compjour
%V 29
%N 3
%D June 1986
%P 193-200

%A H. Thimbleby
%T Experiences of "literate programming" using cweb
(a variant of Knuth's WEB)
%J The Computer Journal
%K compjour
%V 29
%N 3
%D June 1986
%P 201-211

%A P. Ein-dor
%A E. Segev
%T Attitudes, association and success of MIS:
some empirical results from research in the context of a business game
%J The Computer Journal
%K compjour
%V 29
%N 3
%D June 1986
%P 212-221

%A D.M. Episkopou
%A A.T. Wood-Harpers
%T Towards a framework to choose appropriate I.S. approachs
%J The Computer Journal
%K compjour
%V 29
%N 3
%D June 1986
%P 222-228

%A J.P. Elloy
%A O. Roux
%T Electre: a language for control structuring in real time
%J The Computer Journal
%K compjour
%V 29
%N 3
%D June 1986
%P 229-234

%A I.D. Craig
%T The Ariadne-1 blackboard system
%J The Computer Journal
%K compjour
%V 29
%N 3
%D June 1986
%P 235-240

%A G. Papakonstantinou
%A J. Kontos
%T Knowledge representation with attribute grammars
%J The Computer Journal
%K compjour
%V 29
%N 3
%D June 1986
%P 241-245

%A M.H. Williams
%A G. Chen
%T Translating Pascal for execution on a Prolog-based system
%J The Computer Journal
%K compjour
%V 29
%N 3
%D June 1986
%P 246-252

%A R.T. House
%T Alternative scope rules for block-structured languages
%J The Computer Journal
%K compjour
%V 29
%N 3
%D June 1986
%P 253-260

%A E. Wong
%A W.B. Samson
%T The specification of a relational database (PRECI)
as an abstract data type and its realisation in HOPE
%J The Computer Journal
%K compjour
%V 29
%N 3
%D June 1986
%P 261-268

%A D.J. Taylor
%A J.P. Black
%T A locally correctable B-tree implementation
%J The Computer Journal
%K compjour
%V 29
%N 3
%D June 1986
%P 269-276

%A C.C. Chang
%A R.C.T. Lee
%T A letter-oriented minimal perfect hashing scheme
%J The Computer Journal
%K compjour
%V 29
%N 3
%D June 1986
%P 277-281

%A G.W. Smith
%A J.B.H. du\ Boulay
%T The generation of cryptic crossword clues
%J The Computer Journal
%K compjour
%V 29
%N 3
%D June 1986
%P 282-283

%A S.J. Mullender
%A A.S. Tanenbaum
%T The design of a capability-based distributed operating system
%J The Computer Journal
%K compjour
%V 29
%N 4
%D August 1986
%P 289-299
%K Amoeba

%A B. Randell
%T System design and structuring
%J The Computer Journal
%K compjour
%V 29
%N 4
%D August 1986
%P 300-306

%A R.G. Stone
%T On the choice of grammar and parser
for the compact analytical encoding of programs
%J The Computer Journal
%K compjour
%V 29
%N 4
%D August 1986
%P 307-314

%A P.A. Luker
%A A. Burns
%T Program generators and generation software
%J The Computer Journal
%K compjour
%V 29
%N 4
%D August 1986
%P 315-321

%A G. Cantone
%A A. Cimitile
%A U. de\ Carlini
%T Well-formed conversion of unstructured on-in/one-out schemes
for complexity measurement and program maintenance
%J The Computer Journal
%K compjour
%V 29
%N 4
%D August 1986
%P 322-329

%A N.E. Fenton
%A R.W. Whitty
%T Axiomatic approach to software metrication
through program decomposition
%J The Computer Journal
%K compjour
%V 29
%N 4
%D August 1986
%P 330-339

%A S.J. Young
%A C. Proctor
%T UFL: an experimental frame language based on abstract data types
%J The Computer Journal
%K compjour
%V 29
%N 4
%D August 1986
%P 340-347

%A P. Feldman
%A D. Miller
%T Entity model clustering: structuring a data model by abstraction
%J The Computer Journal
%K compjour
%V 29
%N 4
%D August 1986
%P 348-360

%A J. Carden
%T The structural stability of corporate and devolved databases
%J The Computer Journal
%K compjour
%V 29
%N 4
%D August 1986
%P 361-367

%A Y. Manolopoulos
%A J.G. Kollias
%A M. Hatzopoulos
%T Sequential vs. binary batched searching
%J The Computer Journal
%K compjour
%V 29
%N 4
%D August 1986
%P 368-372

%A N.E. Wiseman
%A S. Nedunuri
%T Computing random fields
%J The Computer Journal
%K compjour
%V 29
%N 4
%D August 1986
%P 373-377

%A Nick Rushby
%T A knowledge-engineering approach to instructional design
%J The Computer Journal
%K compjour
%V 29
%N 5
%D October 1986
%P 385-389

%A M. Joseph
%A P. Pandya
%T Finding response times in a real-time system
%J The Computer Journal
%K compjour
%V 29
%N 5
%D October 1986
%P 390-395

%A J.P. Penny
%A P.J. Ashton
%A A.L. Wilkinson
%T Data recording and monitoring for analysis of system response times
%J The Computer Journal
%K compjour
%V 29
%N 5
%D October 1986
%P 396-403

%A H. Barringer
%A I. Mearns
%T A proof system for Ada tasks
%J The Computer Journal
%K compjour
%V 29
%N 5
%D October 1986
%P 404-415

%A J.M. Foster
%T Validating microcode algebraically
%J The Computer Journal
%K compjour
%V 29
%N 5
%D October 1986
%P 416-422

%A R.D. Dowsing
%A R. Elliott
%T Programming a bounded buffer
using the "object" and "path expression" constructs of Path Pascal
%J The Computer Journal
%K compjour
%V 29
%N 5
%D October 1986
%P 423-429

%A M.C. Er
%T The use of termination indicators in computer programming
%J The Computer Journal
%K compjour
%V 29
%N 5
%D October 1986
%P 430-433

%A A.D. Woodall
%T Techniques of program design
%J The Computer Journal
%K compjour
%V 29
%N 5
%D October 1986
%P 434-435

%A W.C. Chen
%A J.S. Vitter
%T Deletion algorithms for coalesced hashing
%J The Computer Journal
%K compjour
%V 29
%N 5
%D October 1986
%P 436-450

%A S. Pramanik
%A F. Fotouhi
%T Index database machine
%J The Computer Journal
%K compjour
%V 29
%N 5
%D October 1986
%P 451-457

%A S. Jajodia
%T Recognizing multivalued dependencies in relation schemas
%J The Computer Journal
%K compjour
%V 29
%N 5
%D October 1986
%P 458-459

%A A. Blair
%A I. Sommerville
%T DSA - a tool for descriptive text analysis
%J The Computer Journal
%K compjour
%V 29
%N 5
%D October 1986
%P 460-466

%A M. Rom
%A S. Bergman
%T A new technique for automatic contouring and contour representation
from machine-readable spatial data
%J The Computer Journal
%K compjour
%V 29
%N 5
%D October 1986
%P 467-471

%A F. Fabbrini
%A C. Montani
%T Autumnal quadtrees
%J The Computer Journal
%K compjour
%V 29
%N 5
%D October 1986
%P 472-474

%A B. Shackel
%T IBM makes usability as important as functionality
%J The Computer Journal
%K compjour
%V 29
%N 5
%D October 1986
%P 475-476

%A C.J. van\ Rijsbergen
%T A non-classical logic for information retrieval
%J The Computer Journal
%K compjour
%V 29
%N 6
%D December 1986
%P 481-485

%A R.M. Lea
%T VLSI and WSI associative string processors
for cost-effective parallel processing
%J The Computer Journal
%K compjour
%V 29
%N 6
%D December 1986
%P 486-494

%A W.F. Clocksin
%T Automatic specialisation of standard designs
%J The Computer Journal
%K compjour
%V 29
%N 6
%D December 1986
%P 495-499

%A M. Elizabeth C. Hull
%T Implementations of the CSP notation for concurrent systems
%J The Computer Journal
%K compjour
%V 29
%N 6
%D December 1986
%P 500-505

%A L.M. Patnik
%A Julie Basu
%T Two tools for interprocess communication in distributed data-flow systems
%J The Computer Journal
%K compjour
%V 29
%N 6
%D December 1986
%P 506-521

%A R.R. Levary
%A W.D. Edwards
%T Analysing the impact of adding a new software system on main memory usage
%J The Computer Journal
%K compjour
%V 29
%N 6
%D December 1986
%P 522-526

%A D. Mackay
%A G. Ball
%A M. Crowe
%A M. Hughes
%A D. Jenkins
%A C. Nicol
%T A Unix-based system for software configuration management
%J The Computer Journal
%K compjour
%V 29
%N 6
%D December 1986
%P 527-530

%A P. Pandya
%A M. Joseph
%T A structure-directed total correctness proof rule
for recursive procedure calls
%J The Computer Journal
%K compjour
%V 29
%N 6
%D December 1986
%P 531-537

%A A.J. Cowling
%T Type checking in polymorphic languages
%J The Computer Journal
%K compjour
%V 29
%N 6
%D December 1986
%P 538-544

%A P. Leith
%T Fundamental errors in legal logic programming
%J The Computer Journal
%K compjour
%V 29
%N 6
%D December 1986
%P 545-552

%A M. Ancona
%A L. de\ Floriani
%A J.S. Deogun
%T Path problems in structured graphs
%J The Computer Journal
%K compjour
%V 29
%N 6
%D December 1986
%P 553-563

%A K.J. Maccallum
%A J.-M. Zhang
%T Curve-smoothing techniques using B-splines
%J The Computer Journal
%K compjour
%V 29
%N 6
%D December 1986
%P 564-571