The Computer Journal, Volume 25, 1982

Volume 25, Number 1, 1982

• Frank W. Allen:
  A File Index for Document Storage and Retrieval Utilizing. Descriptor Fragments. 2-6
  
• I. P. Schagen:
  Automatic Contouring from Scattered Data Points. 7-11
  
• A. T. Wood-Harper, Guy Fitzgerald:
  A Taxonomy of Current Approaches to Systems Analysis. 12-16
  
• Richard B. Kieburtz, Abraham Silberschatz:
  On the Static Access-Control Mechanism in Concurrent Pascal. 17-21
  
• Nenad Marovac:
  The Rotating Bus as a Basis for Interprocess Communication in Distributed Systems. 22-31
  
• Ivor P. Page:
  Optimal Fit Of Arbitrary Sized Segments. 32-36
  
• A. J. B. Travis:
  An Aid to Pattern Recognition. 37-44
  
• Jarmo Ernvall, Olli Nevalainen:
  An Algorithm for Unbiased Random Sampling. 45-47
  
• Emmanuel Skordalakis, George K. Papakonstantinou:
  A Control Structure for a Variable Number of Nested Loops. 48-51
  
• J. J. Cocu, Raymond R. Devillers:
  On a Class of Allocation Strategies Inducing Bounded Delays Only. 52-55
  
• R. H. Barlow, D. J. Evans:
  Parallel Algorithms for the Iterative Solution to Linear Systems. 56-60
  
• Charles B. Dunham:
  The Necessity of Publishing Programs. 61-62
  
• Frank G. Pagan:
  Semantic Specification Using Two-Level Grammars: Labels and GOTO Statements. 63-67
  
• C. Robert Carlson, Adarsh K. Arora, Miroslava Milosavljevic Carlson:
  The Application of Functional Dependency Theory to Relational Databases. 68-73
  
• Robert J. T. Morris, J. S. Kaufman:
  Performance Comparison of I/0 Access Disciplines for Transaction-Processing Systems. 74-83
  
• Bernd Schmidt:
  Simulation of Discrete Systems Using GPSS-FORTRAN. 84-86
  
• M. Bozyigit, Y. Paker:
  A Topology Reconfiguration Mechanism for Distributed Computer Systems. 87-92
  
• M. C. Er, Barry G. T. Lowden:
  The Theory and Practice of Constructing an Optimal Polyphase Sort. 93-101
  
• C. M. McCulloch:
  QUICKSHUNT - A Distributive Sorting Algorithm. 102-104
  
• Donald Michie:
  Experiments on the Mechanization of Game-Learning. 2-Rule-Based Learning and the Human Window. 105-113
  
• Michael L. V. Pitteway, A. J. R. Green:
  Bresenham's Algorithm with Run Line Coding Shortcut. 114-115
  
• Jack Bresenham:
  Incremental Line Compaction. 116-120
  
• James Leslie Keedy, John Rosenberg, Kotagiri Ramamohanarao:
  On Synchronizing Readers and Writers with Semaphores. 121-125
  
• Michael Hatzopoulos, John G. Kollias:
  The Determination of the Optimum Database Maintenance Points. 126-129
  
• Julie Scoltock:
  A Survey of the Literature of Cluster Analysis. 130-134
  
• R. W. A. Hudson, John A. Self:
  A Dialogue System to Teach Database Concepts. 135-139
  
• A. J. Wilkes, Neil E. Wiseman:
  A Soft-Edged Character Set and its Derivation. 140-147
  
• R. C. Thomas, Alan Burns:
  The Case for Distributed Decision Making Systems. 148-152
  

Volume 25, Number 2, 1982

• Brian Shackel:
  The BLEND System: Programme for the Study of Some 'Electronic Journals'. 161-168
  
• J. S. Johnson, D. B. Webster:
  Updating an Inverted Index - A Performance Comparison of Two Techniques. 169-175
  
• Graham Lee:
  DOPLs: A New Style of Programming. 176-182
  
• E. J. Yannakoudakis, A. K. P. Wu:
  Quasi-Equifrequent Group Generation an Evaluation. 183-187
  
• Reginald Muchsel:
  Performance Measurements - A Practical Example from a German University Computing Centre. 188-192
  
• Clement H. C. Leung:
  A Simple Model for the Performance Analysis of Disc Storage Fragmentation. 193-198
  
• Clement H. C. Leung:
  An Improved Optimal-Fit Procedure for Dynamic Storage Allocation. 199-206
  
• Philip C. Treleaven, Richard P. Hopkins, Paul W. Rautenbach:
  Combining Data Flow and Control Flow Computing. 207-217
  
• N. E. Goller:
  Triodic Logic and its Use in Structured Program. 218-226
  
• William E. Wright:
  Single Versus Double Buffering in Constrained Merging. 227-230
  
• Andrew Blake:
  Fixed Point Solutions of Recursive Operations on Boolean Arrays. 231-234
  
• John R. Woodwark:
  The Explicit Quad Tree as a Structure for Computer Graphics. 235-238
  
• George K. Papakonstantinou:
  Optimal Evaluation of Queries. 239-241
  
• J. R. Lin Sin Cho:
  Automatic Report Formatting from a Report Specimen. 242-247
  
• Brian A. Wichmann:
  A Comparison of Pascal and Ada. 248-252
  
• P. A. Dearnley:
  Software Development for Microcomputer Data Processing Systems. 253-256
  
• Rodney W. Topor:
  Functional Programs for Generating Permutations. 257-263
  
• Peter G. Harrison:
  Efficient Storage Management for Functional Languages. 264-271
  
• Chris Corbett, Ian H. Witten:
  On the Inclusion and Placement of Documentation Graphics in Computer Typesetting. 272-277
  

Volume 25, Number 3, 1982

• M. Howard Williams:
  The Programming Language BPL. 289-306
  
• C. J. Rosenquist:
  Entity Life Cycle Models and Their Applicability to Information Systems Development Life Cycles. 307-315
  
• Dusan M. Velasevic:
  Right-to Left Code Generation for Arithmetic Expressions. 316-326
  
• K. P. Tan, L. S. Hsu:
  Block Sorting of a Large File in External Storage by a 2-Component Key. 327-330
  
• Antonio Boccalatte, Mauro Di Manzo, D. Sciarra:
  Error Recovery with Attribute Grammars. 331-337
  
• Charles J. Colbourn:
  Computing the Chromatic Index of Steiner Triple Systems. 338-339
  
• R. Nigel Horspool, Laurence W. Dunkelman:
  Analysis and Optimization of Set Expressions. 340-346
  
• Per-Åke Larson:
  Expected Worst-Case Performance of Hash Files. 347-352
  
• Bengt-Erik Bengtsson:
  Packing Rectangular Pieces - A Heuristic Approach. 353-357
  
• Richard A. Frost:
  Binary-Relational Storage Structures. 358-367
  
• Arvola Chan, Bahram Niamir:
  On Estimating the Cost of Accessing Records in Blocked Database Organizations. 368-374
  
• Peter J. L. Wallis:
  The Preparation of Guidelines for Portable Programming in High-Level Languages. 375-378
  
• G. Oulsnam:
  Unravelling Unstructured Programs. 379-387
  
• M. Douglas McIlroy:
  The Number of States of a Dynamic Storage Allocation System. 388-392
  
• M. Howard Williams:
  A Comment on the Decomposition of Flowchart Schemata. 393-396
  

Volume 25, Number 4, 1982

• A. Parkin:
  Data Analysis and System Design by Entity-Relationship Modelling. A Practiacal Example. 401-409
  
• C. R. Symons, P. Tijsma:
  A Systematic and Practical Approach to the Definition of Data. 410-422
  
• Moshe Mor, Aviezri S. Fraenkel:
  Permutation Generation on Vector Processors. 423-428
  
• D. J. Tomlinson:
  An Aid to Hidden Surface Removal in Real Time CGI Systems. 429-441
  
• M. C. Er:
  A Representation Approach to the Tower of Hanoi Problem. 442-447
  
• R. A. Brooker:
  A `Database' Subsystem for BCPL. 448-464
  
• Elaine J. Weyuker:
  On Testing Non-Testable Programs. 465-470
  
• Ron Sacks-Davis:
  Applications of Redundant Number Representations to Decimal Arithmetic. 471-477
  
• Kotagiri Ramamohanarao, John W. Lloyd:
  Dynamic Hashing Schemes. 478-485
  
• David A. Bell, S. Misbah Deen:
  Key Space Compression and Hashing in PRECI. 486-492
  

Last update Wed May 22 17:08:57 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page