The Computer Journal, Volume 28, 1985

Volume 28, Number 1, 1985

• T. I. Maude, David J. Pullinger:
  Software for Reading, Refereeing and Browsing in the BLEND System. 1-4
  
• Nicola Santoro, Ramez Khatib:
  Labelling and Implicit Routing in Networks. 5-8
  
• D. T. Goodwin:
  Further Study of a Stack-Length Model. 9-16
  
• D. Crookes, C. J. Devlin:
  An Algorithm for Optimal Procedural Nesting. 17-21
  
• J. Robinson, Alan Burns:
  A Dialogue Development System for the Design and Implementation of User Interfaces in Ada. 22-28
  
• Paul J. Layzell:
  The History of Macro Processors in Programming Language Extensibility. 29-33
  
• J. M. Triance, Paul J. Layzell:
  Macro Processors for Enhancing High-Level Languages - Some Design Principles. 34-43
  
• N. E. Goller:
  Hybrid Data Structures Defined by Indirection. 44-53
  
• Gordon V. Cormack, R. Nigel Horspool, Matthias Kaiserswerth:
  Practical Perfect Hashing. 54-58
  
• Antonio L. Furtado, T. S. E. Maibaum:
  An Informal Approach to Formal (Algebraic) Specifications. 59-67
  
• B. A. Styne, T. R. King, Neil E. Wiseman:
  Pad Structures for the Rainbow Workstation. 68-72
  
• David J. Abel:
  Some Elemental Operations on Linear Quadtrees for Geographic Information Systems. 73-77
  
• M. Howard Williams:
  A Linear Algorithm for Colouring Planar Graphs with Five Colours. 78-81
  
• Fionn Murtagh:
  A Survey of Algorithms for Contiguity-Constrained Clustering and Related Problems. 82-88
  
• J. Mottl:
  Description of a Program for Nonlinear Programming: The Centroid Program. 89-94
  

Volume 28, Number 2, 1985

• Enid Mumford:
  Defining System Requirements to Meet Business Needs: A Case Study Example. 97-104
  
• Julian R. Ullmann, Robert M. Haralick, Linda G. Shapiro:
  Computer Architecture for Solving Consistent Labelling Problems. 105-111
  
• Richard A. Frost:
  Using Semantic Concepts to Characterise Various Knowledge Representation Formalisms: A Method of Facilitating the Interface of Knowledge Base System Components. 112-116
  
• F. J. Dixon:
  Simplifying Screen Specifications - the `Full Screen Manager' Interface and `Screen Form' Generating Routines. 117-127
  
• J. M. Triance, Paul J. Layzell:
  A Language Enhancement Facility for COBOL - its Design and Implementation. 128-133
  
• M. Howard Williams, G. Chen:
  Restructuring Pascal Programs Containing Goto Statements. 134-137
  
• Peter R. Benyon:
  Exploiting Vector Computers by Replication. 138-141
  
• David Barton:
  Parallelism in Simple Algebra Systems. 142-147
  
• L. M. Delves, S. C. Mawdsley:
  DAP-Algol: A Development System for Parallel Algorithms. 148-153
  
• T. S. E. Maibaum:
  Database Instances, Abstract Data Types and Database Specification. 154-161
  
• Raymond Turner, Barry G. T. Lowden:
  An Introduction to the Formal Specification of Relational Query Languages. 162-169
  
• Yuksel Uckan:
  A Relational Schema Description and Manipulation Facility. 170-178
  
• Clement H. C. Leung, K. Wolfenden:
  Mathematical Models of File Growth. 179-183
  
• Philippe Kent:
  An Efficient New Way to Represent Multi-Dimensional Data. 184-190
  

Volume 28, Number 3, 1985

• Ronald K. Stamper:
  Information: Mystical Fluid or a Subject for Scientific Enquiry? 195-199
  
• George Rzevski:
  On Criteria For Assessing An Information Theory. 200-202
  
• G. G. Scarrott:
  Information, the Life Blood of Organisation. 203-205
  
• Colin Tully:
  Information, Human Activity and the Nature of Relevant Theories. 206-210
  
• Frank Land:
  Is an Information Theory Enough? 211-215
  
• D. H. Marwick, C. R. G. B. Rinaldi:
  The Tattoo on a Micro-Computer. 216-222
  
• Guy Fitzgerald, N. Stokes, J. R. G. Wood:
  Feature Analysis of Contemporary Information Systems Methodologies. 223-230
  
• Roland N. Ibbett, David A. Edwards, T. P. Hopkins, C. K. Cadogan, D. A. Train:
  Centrenet - A High Performance Local Area Network. 231-242
  
• S. Muir, David Hutchison, Doug Shepherd:
  Arca: A Local Network File Server. 243-249
  
• M. Howard Williams:
  Structuring Two-Level Grammar Specifications. 250-256
  
• D. T. Goodwin:
  The Computability of Stack Non-Underflow. 257-263
  
• Sakti Pramanik, Chung-Ta King:
  A Hardware Pattern Matching Algorithm on a Dataflow. 264-269
  
• R. N. Maddison, A. J. Gawronski:
  A Data Dictionary for Learning Data Analysis. 270-281
  
• S. Misbah Deen, R. R. Amin, G. O. Ofori-Dwumfuo, Malcolm C. Taylor:
  The Architecture of a Generalised Distributed Database System - PRECI. 282-290
  
• S. Misbah Deen:
  A Tuple Placement Technique For Databases. 291-297
  
• T. D. Kimura, Will D. Gillett, Jerome R. Cox Jr.:
  A Design of a Data Model Based on Abstraction of Symbols. 298-308
  
• W. B. Samson, A. Bendell:
  Rank Order Distributions and Secondary Key Indexing. 309-312
  
• Gordon Lyon:
  Achieving Hash Table Searches In One Or Two Bucket Probes. 313-318
  
• Per-Åke Larson:
  Performance Analysis of a Single-File Version of Linear Hashing. 319-329
  
• James K. Mullin:
  Spiral Storage: Efficient Dynamic Hashing with Constant Performance. 330-334
  
• A. Oxley:
  Surface Fitting By Triangulation. 335-339
  

Volume 28, Number 4, 1985

• K. T. Fung:
  An Entropy Approach to Solving Some Network Reliability Problems. 353-356
  
• Jovan Djordjevic, Mario Barbacci, Brad Hosler:
  A PMS Level Notation for the Description and Simulation of Digital Systems. 357-365
  
• M. L. Schneider:
  Weighted Decision Tables - An Alternative Solution for Ambiguity. 366-371
  
• Kazimierz Subieta:
  A Simple Method of Data Correction. 372-374
  
• Allan Ramsay:
  On Efficient Context Switching. 375-378
  
• John A. Llewellyn:
  The Construction of Variable-Length Comma-Free Codes. 379-390
  
• Francesca Cesarini, Giovanni Soda:
  Design and Implementation of a Relational DBMS for Microcomputers. 391-397
  
• R. Bonnano, Dario Maio, Paolo Tiberio:
  An Approximation Algorithm for Secondary Index Selection in Relational Database Physical Design. 398-405
  
• Michael Hatzopoulos, John G. Kollias:
  On the Selection of a Reduced Set of Indexes. 406-408
  
• Clement H. C. Leung, K. Wolfenden:
  Estimating Disc Access Patterns Using Diffusion Models. 409-411
  
• Matti Jakobsson:
  Sampling without Replacement in Linear Time. 412-413
  
• F. Warren Burton, Matthew M. Huntbach, John G. Kollias:
  Multiple Generation Text Files Using Overlapping Tree Structures. 414-416
  
• Nivio Ziviani, Henk J. Olivié, Gaston H. Gonnet:
  The Analysis of an Inproved Symmetric Binary B-Tree Algorithm. 417-425
  
• Keith Brinck:
  The Expected Performance of Traversal Algorithms in Binary Trees. 426-432
  
• David McLean:
  A Method of Generating Surfaces as a Composite of Cyclide Patches. 433-438
  
• D. J. Abel, W. T. Williams:
  A Re-Examination of Four Classificatory Fusion Strategies. 439-443
  

Volume 28, Number 5, 1985

• M. W. Shields:
  Concurrent Machines. 449-465
  
• Krishna Kant, Abraham Silberschatz:
  Error Propagation and Recovery in Concurrent Environments. 466-473
  
• Lawrence C. Paulson:
  Lessons Learned from LCF: A Survey of Natural Deduction Proofs. 474-479
  
• Lloyd Allison:
  Programming Denotational Semantics II. 480-486
  
• Zsuzsanna Markusz, A. A. Kaposi:
  Complexity Control in Logic-Based Programming. 487-495
  
• Robert M. O'Keefe:
  Comment on `Complexity Analyses of Event Set Algorithms'. 496-497
  
• Nader Chebini:
  FEDOS: A Finite Element Database for Offshore Structures. 498-500
  
• Peter M. D. Gray, P. Esslemont:
  The Performance of a Relational Interface to a Codasyl Database. 501-507
  
• Donal J. Flynn, Alberto H. F. Laender:
  Mapping from a Conceptual Schema to a Target Internal Schema. 508-517
  
• Clement H. C. Leung, K. Wolfenden:
  Analysis and Optimisation of Data Currency and Consistency in Replicated Distributed Databases. 518-523
  
• Michael Hatzopoulos, John G. Kollias:
  Towards the Optimal Secondary Index Organisation and Secondary Index Selection. 524-529
  
• A. J. Compton:
  An Algorithm for the Even Distribution of Entities in One Dimension. 530-537
  
• M. C. Er:
  Enumerating Ordered Trees Lexicographically. 538-542
  

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