![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
The Computer Journal, Volume 19, 1976
Volume 19, Number 1, February 1976
- Ken D. Eason:
Understanding the Naive Computer User. 3-7 - P. J. Pengilly:
An Approach to Systems Design. 8-12 - J. J. Florentin:
Data Base Representations of Application Models. 13-16 - Gunter Schlageter:
The Problem of Lock by Value in Large Data Bases. 17-20 - S. J. Waters:
Hit Ratios. 21-24
- R. B. E. Napper, Richard N. Fisher:
ALEC - A User Extensible Scientific Programming Language. 25-31 - L. V. Atkinson:
The List Processing Language, SLPL - An Informal Outline. 32-39 - R. L. Hittos, D. S. Henderson:
Optimisation of Main Memory Size Versus Speed. 40-42 - H. J. Curnow, Brian A. Wichmann:
A Synthetic Benchmark. 43-49 - R. E. Walters:
Benchmark Techniques: A Constructive Approach. 50-55 - S. K. Robinson, I. S. Torsun:
An Empirical Analysis of FORTRAN Programs. 56-62
- A. C. Norman:
Expanding the Solutions of Implicit Sets of Ordinary Differential Equations in Power Series. 63-68
- W. H. Southwell:
Fitting Data to Nonlinear Functions with Uncertainties in all Measurement Variables. 69-73 - Karl-Heinz Mohn, Roger V. Roman:
An Interactive Polynomial Approximation Algorithm. 74-78 - W. E. McBride, A. K. Rigler:
A Modification of the Osborne and Watson Algorithm for Nonlinear Minimax Approximation. 79-81
- Michael R. Williams:
The Difference Engines. 82-89
- Donald Perlis:
An Application of Compiler Simulation at the Source Language Level. 90 - T. S. Ng, Antonio Cantoni:
Run Time Interaction with FORTRAN Using Mixed Code. 91-92 - W. B. Samson:
Testing Overflow Algorithms for a Table of Variable Size. 92
Volume 19, Number 2, May 1976
- Jon M. Kerridge
:
PATCOSY - A Database System for the National Health Service. 98-103 - E. C. Coles, L. J. Beilin, C. J. Bulpitt, C. T. Dollery, B. F. Johnson, A. D. Munro-Faure, S. C. Turner:
An Approach to Computer Processing of Clinical Data. 104-109 - R. A. Davenport:
Database Integrity. 110-116 - Peter A. Dearnley:
An Investigation Into Database Resilience. 117-121 - S. J. Waters:
CAM 01: A Precedence Analyser. 122-126
- Yaakov L. Varol:
Some Remarks on Computer Acquisition. 127-131 - O. Marjasoo:
A Methodology for Hardware and Software Availability Analysis. 132-135 - Henry C. Lucas Jr., R. B. Kaplan:
A Structured Programming Experiment. 136-138 - G. R. Frank:
Job Control in the MU5 Operating System. 139-143 - J. Hilden:
Guidelines for the Design of Interactive Systems. 144-150 - Frank G. Pagan:
On Interpreter-Oriented Definitions of Programming Languages. 151-155 - Jeffrey S. Rohl:
Programming Improvements to Fike's Algorithm for Generating Permutations. 156-159 - L. V. Atkinson, G. J. Duffus:
Machine Code Generation Within a Compiler - A Teaching Model. 160-165 - C. J. Higley:
Type Checking in Typeless Language. 166-169 - Anthony G. Middleton:
On the Use of Macros for Iteration. 170-172
- A. T. Fuller:
The Period of Pseudo-Random Numbers Generated by Lehmer's Congruential Method. 173-177 - D. H. McLain:
Two Dimensional Interpolation from Random Data. 178-181 - John Mitchem:
On Various Algorithms for Estimating the Chromatic Number of a Graph. 182-183 - David J. Evans, Michael Hatzopoulos:
The Solution of Certain Banded Systems of Linear Equations Using the Folding Algorithm. 184-187
Volume 19, Number 3, August 1976
- B. F. M. Adamczewski:
A Formula for Establishing Re-Order Quantities for Individual Items Within a Joint Stock Replenishment Scheme. 194-197 - T. Alewine, Robert A. Fleck Jr.:
Service Bureau or In-House Data Processing. 198-201
- David A. Bell:
Programmer Selection and Programming Errors. 202-206 - E. B. James, Derek Partridge:
Tolerance to Inaccuracy in Computer Programs. 207-212 - Robert C. Varney:
Toward the Understandability of an Operating System. 213-215 - Dennis L. Dance, Udo W. Pooch:
An Adaptive On Line Data Compression System. 216-224
- B. Higman:
The Place of Own Variables in Programming Language Theory. 225-228 - D. S. Henderson, Michael R. Levy:
An Extended Operator Precedence Parsing Algorithm. 229-233 - Michael Brady:
A Programming Approach to Some Concepts and Results in the Theory of Computation. 234-237 - Raymond R. Devillers, Guy Louchard:
Improvement of Parallelism in a Finite Buffer Sharing Policy. 238-245 - D. C. Sutcliffe:
An Algorithm for Drawing the Curve f(x, y) = 0. 246-249
- R. P. Lorétan:
Timing Problems in Electronic Lockout Chains. 250-253 - M. R. Patel, Keith H. Bennett:
Analysis of Speed of a Binary Multiplier Using a Variable Number of Shifts per Cycle. 254-257
- Ayse Alaylioglu, G. A. Evans, J. Hyslop:
The Use of Chebyshev Series for the Evaluation of Oscillatory Integrals. 258-267
Volume 19, Number 4, 1976
- Frank F. Land:
Evaluation of Systems Goals in Determining a Design Strategy for a Computer Based Information System. 290-294
- J. M. Triance:
The Significance of the 1974 COBOL Standard. 295-300 - V. Siskind, Jonathan Rosenhead:
Seek Times for Disc File Processing: Some Results from Probability Theory. 301-305 - Richard G. Casey, I. M. Osman:
Replacement Algorithms for Storage Management in Relational Data Bases. 306-314 - Jean Ferrié, Claude Kaiser, Didier Lanciaux, Bernard Martin:
An Extensible Structure for Protected Systems' Design. 315-321
- A. Walker, Derick Wood:
Locally Balanced Binary Trees. 322-325 - Carter Bays:
A Non-Recursive Technique for Recreating a Digraph from its K-Formula Representation. 326-328 - T. Sakaki, K. Nakashima, Y. Hattori:
Algorithms for Finding in the Lump Both Bounds of Chromatic Number of a Graph. 329-332 - D. C. Sutcliffe:
A Remark on a Contouring Algorithm. 333-335 - Malcolm A. Sabin:
A Method for Displaying the Intersection Curve of Two Quadric Surfaces. 336-338
- R. J. Aust:
An Improvement Algorithm for School Timetabling. 339-343 - I. M. Willers:
The Syntax Directed Graph Algorithm for the Input of Equations to the Taylor Series System for Solving Ordinary Differential Equations. 344-347 - P. J. Hartley:
Tensor Product Approximations to Data Defined on Rectangular Meshes in N-Space. 348-352 - Mordechai Shacham
, E. Kehat:
A Direct Method for the Solution of Large Sparse Systems of Linear Equations. 353-359
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.