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, M. 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
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
Copyright © Tue Nov 24 20:44:56 2009
by Michael Ley (ley@uni-trier.de)
