The Computer Journal, Volume 16, 1973

Volume 16, Number 1, 1973

Maurice V. Wilkes: The Dynamics of Paging. 4-9
P. J. Brown: UNRAVEL - A Programming Language to Put Intelligence Into Dumps. 10-12
Valerie G. Coulson, I. D. Hill, Valerie F. Hillier: ALGOL Survey Program. 13-15
I. R. MacCallum: A Simple Analysis of the n^th Order Polyphase Sort. 16-18
P. L. Higginson, Peter T. Kirstein: On the Computation of Cyclic Redundancy Checks by Program. 19-22
John Fitch: On Algebraic Simplification. 23-27
R. I. Chaplin, R. E. Crosbie, J. L. Hay: A Graphical Representation of the Backus-Naur Form. 28-29
R. Sibson: SLINK: An Optimally Efficient Algorithm for the Single-Link Cluster Method. 30-34
J. G. Griffiths: Drawing Opaque Solids Using an Incremental Plotter. 35-38
D. J. Grover: Message Orientated Interactive Graphics. 39-45
Michael F. Lynch, J. Howard Petrie: A Program Suite for the Production of Articulated Subject Indexes. 46-51
D. M. Jackson: Closed Form Approximations for Random Errors in Distance Functions. 52-56
D. M. Boulton, Chris S. Wallace: Occupancy of a Rectangular Array. 57-63
A. D. Maude: Interpolation - Mainly for Graph Plotters. 64-65
V. Zakian, R. K. Littlewood: Numerical Inversion of Laplace Transforms by Weighted Least-Squares Approximation. 66-68
J. A. Grant, G. D. Hitchins: The Solution of Polynomial Equations in Interval Arithmetic. 69-72
F. Oliveira-Pinto: Simultaneous Trigonometric Approximation of the Function and its First Derivative. 73-76
G. A. Watson: On Estimating Best Approximations of Functions Defined by Integral Equations. 77-80

Peter M. Stocker, P. A. Dearnley: Self-Organising Data Management Systems. 100-105
M. M. Lehman: Computer Usage Control. 106-110
Daniel W. Lozier, L. C. Maximon, W. L. Sadowski: A Bit Comparison Program for Algorithm Testing. 111-117
B. Gay, S. G. Payne: Interactive Digital Simulation on a Small Computer. 118-121
P. J. Brown: A Practical Usage of Outer and Inner Syntax. 122-123
C. R. Jordan: A Note on LISP Universal S-Functions. 124-125
Carter Bays: Some Techniques for Structuring Chained Hash Tables. 126-131
A. J. Szanser: Bracketing Technique in Elastic Matching. 132-134
F. P. Wyman: Binary Programming: A Decision Rule for Selecting Optimal vs Heuristic Techniques. 135-140
Z. Kohavi, J. A. Rivierre, I. Kohavi: Machine Distinguishing Experiments. 141-147
F. W. M. Stentiford, D. W. Lewin: An Evolutionary Approach to the Concept of Randomness. 148-151
Nenad Marovac: A Single Data-Display Structure: A New View on Interactive Computer Graphics in CAD. 152-156
A. Ricci: A Constructive Geometry for Computer Graphics. 157-160
M. Ahmad: The Computing Speed of a New Machine. 161-164
S. L. Hurst: The Application of Chow Parameters and Rademacher Walsh Matrices in the Synthesis of Binary Functions. 165-173
D. Zissos, F. G. Duncan: Boolean Minimisation. 174-179
K. Spyropoulos, E. Kiountouzis, A. Young: Discrete Approximation in the L₁ Norm. 180-186

R. Jorré, G. Boyfield, J. Darkin: Data Communication User Research in the Post Office: Part 1. 196-204
J. K. Broadbent, George Coulouris: MEMBERS - A Microprogrammed Experimental Machine with a Basic Executive for Real-Time Systems. 205-208
C. A. R. Hoare: A Structured Paging System. 209-215
J. L. Dawson: Combining Interpretive Code with Machine Code. 216-219
R. J. Dakin, Peter C. Poole: A Mixed Code Approach. 219-222
John A. Llewellyn: The Deadly Embrace - A Finite State Model Approach. 223-225
Henry C. Lucas Jr., Leon Presser: A Method of Software Evaluation: The Case of Programming Language Translators. 226-231
Gérrine Terrine: Coordinate Grammars and Parsers. 232-244
Spyros G. Tzafestas: State Estimation Algorithms for Non-Linar Stochastic Sequential Machines. 245-253
D. M. Boulton, Chris S. Wallace: An Information Measure for Hierarchic Classification. 254-261
Nicos Christofides: Large Scheduling Problems with Bivalent Costs. 262-264
Charles B. Dunham: When Absolute Approximations are Optimal in Function Subroutines. 265
N. G. Meadows: Automatic Frequency and Mikhailov Locus Plotting for Systems with Distributed Lags: A New Analogue Computer Technique. 266-268
A. G. Bell: Himmelbett. 269-272

R. Jorré, G. Boyfield, J. Darkin: Data Communication User Research in the Post Office: Part 2. 292-302
J. Inglis, E. G. Dee: Flexibility of Block-Length for Magnetic Files. 303-307
R. J. Leaman, M. H. Lloyd, C. S. Repton: The Development and Testing of a Processor Self-Test Program. 308-314
M. I. Padgett: Tree Driven Data Input and its Validation. 315-321
Paul B. Schneck, Ellinor Angel: A FORTRAN to FORTRAN Optimising Compiler. 322-330
Harry Whitfield, Alex S. Wight: EMAS - The Edinburg Multi-Access System. 331-346
E. A. Akkoyunlu: A Linear Algorithm for Computing the Optimum University Timetable. 347-350
J. Bordier, H. Saya: A Necessary and Sufficient Condition for a Power Language to be LL(k). 351-356
R. C. Varney, M. G. Gotterer: The Structural Foundation for an Operating System. 357-359
D. H. Green, R. G. Kelsch: Nonlinear Ternary Feedback Shift Registers. 360-367
P. F. Stojak: Hybrid and Digital Computation Results in Multicomponent Distillation Simulation. 368-374
F. Oliveira-Pinto: Generalised Chebyshev Polynomials and Their Use in Numerical Approximation. 375-379