External Links

    Journal: Comput. J.

    Volume 29, Issue 6

    481 -- 485C. J. van Rijsbergen. A Non-Classical Logic for Information Retrieval
    486 -- 494R. M. Lea. VLSI and WSI Associative String Processors for Cost-Effective Parallel Processing
    495 -- 499W. F. Clocksin. Automatic Specilisation of Standard Designs
    500 -- 505M. Elizabeth C. Hull. Implementations of the CSP Notation for Concurrent Systems
    506 -- 521Lalit M. Patnaik, Julie Basu. Two Tools for Interprocess Communication in Distributed Data-Flow Systems
    522 -- 526Reuven R. Levary, William D. Edwards. Analysing the Impact of Adding a New Software System on Main Memory Usage
    527 -- 530D. Mackay, G. Ball, Malcolm K. Crowe, M. Hughes, David G. Jenkins, Clark Nicol. A UNIX-Based System for Software Configuration Management
    531 -- 537Paritosh K. Pandya, Mathai Joseph. A Structure-Directed Total Correctness Proof Rule for Recursive Procedure Calls
    538 -- 544Anthony J. Cowling. Type Checking in Polymorphic Languages
    545 -- 552Philip Leith. Fundamental Errors in Legal Logic Programming
    553 -- 563Massimo Ancona, Leila De Floriani, Jitender S. Deogun. Path Problems in Structured Graphs
    564 -- 571K. J. MacCallum, J. M. Zhang. Curve-Smoothing Techniques Using B-Splines

    Volume 29, Issue 5

    385 -- 389Nick Rushby. A Knowledge-Engineering Approach to Instructional Design
    390 -- 395Mathai Joseph, Paritosh K. Pandya. Finding Response Times in a Real-Time System
    396 -- 403John P. Penny, Paul J. Ashton, A. L. Wilkinson. Data Recording and Monitoring for Analysis of System Response Times
    404 -- 415Howard Barringer, I. Mearns. A Proof System for Ada Tasks
    416 -- 422J. M. Foster. Validating Microcode Algebraically
    423 -- 429Roy D. Dowsing, R. Elliott. Programming a Bounded Buffer Using the Object and Path Expression Constructs of Path Pascal
    430 -- 433M. C. Er. The Use of Termination Indicators in Computer Programming
    436 -- 450Wen-Chin Chen, Jeffrey Scott Vitter. Deletion Algorithms for Coalesced Hashing
    451 -- 457Sakti Pramanik, Farshad Fotouhi. Index Database Machine
    458 -- 459Sushil Jajodia. Recognizing Multivalued Dependencies in Relation Schemas
    460 -- 466A. Blair, Ian Sommerville. DSA - A Tool for Descriptive Text Analysis
    472 -- 474F. Fabbrini, Claudio Montani. Autumnal Quadtrees
    475 -- 476Brian Shackel. IBM Makes Usability as Important as Functionality
    477 -- 0J. M. Wilson. A Weighted Mark-Scaling Algorithm

    Volume 29, Issue 4

    289 -- 299Sape J. Mullender, Andrew S. Tanenbaum. The Design of a Capability-Based Distributed Operating System
    300 -- 306Brian Randell. System Design and Structuring
    307 -- 314R. G. Stone. On the Choice of Grammar and Parser for the Compact Analytical Encoding of Programs
    315 -- 321P. A. Luker, Alan Burns. Program Generators and Generation Software
    322 -- 329Giovanni Cantone, Aniello Cimitile, Ugo de Carlini. Well-Formed Conversion of Unstructured One-in/one-out Schemes for Complexity Measurement and Program Maintenance
    330 -- 339Norman E. Fenton, Robin W. Whitty. Axiomatic Approach to Software Metrication Through Program Decomposition
    340 -- 347S. J. Young, C. Proctor. UFL: An Experimental Frame Language Based on Abstract Data Types
    348 -- 360P. Feldman, D. Miller. Entity Model Clustering: Structuring A Data Model By Abstraction
    361 -- 367J. Carden. The Structural Stability of Corporate and Devolved Databases
    368 -- 372Yannis Manolopoulos, John G. Kollias, Michael Hatzopoulos. Sequential vs. Binary Batched Searching
    373 -- 377Neil E. Wiseman, S. Nedunuri. Computing Random Fields
    378 -- 380J. Bradley. Join Dependencies in Relational Databases and the Geometry of Spatial Grids
    380 -- 0Darrel C. Ince, S. Hekmatpour. An Empirical Evaluation of Random Testing

    Volume 29, Issue 3

    193 -- 200Joan M. Smith. The Implications of SGML for the Preparation of Scientific Publications
    201 -- 211Harold W. Thimbleby. Experiences of Literate Programming Using Cweb (A Variant of Knuth s WEB)
    212 -- 221Phillip Ein-Dor, Eli Segev. Attitudes, Association and Success of MIS: Some Empirical Results from Research in the Context of a Business Game
    222 -- 228D. M. Episkopou, A. T. Wood-Harper. Towards a Framework to Choose Appropriate IS Approaches
    229 -- 234J. P. Elloy, Olivier Roux. Electre: A Language for Control Structuring in Real Time
    235 -- 240I. D. Craig. The Ariadne-1 Blackboard System
    241 -- 245George K. Papakonstantinou, John Kontos. Knowledge Representation with Attribute Grammars
    246 -- 252M. Howard Williams, G. Chen. Translating Pascal for Execution on a Prolog-Based System
    253 -- 260Ronald T. House. Alternative Scope Rules for Block-Structured Languages
    261 -- 268E. Wong, W. B. Samson. The Specification of a Relational Database (PRECI) as an Abstract Data Type and its Realisation in HOPE
    269 -- 276David J. Taylor, James P. Black. A Locally Correctable B-Tree Implementation
    277 -- 281Chin-Chen Chang, Richard C. T. Lee. A Letter-Oriented Minimal Perfect Hashing Scheme
    282 -- 284G. W. Smith, J. B. H. du Boulay. The Generation of Cryptic Crossword Clues

    Volume 29, Issue 2

    97 -- 102A. P. Jagodzinski, D. D. Clarke. A Review of Methods for Measuring and Describing Users Attitudes as an Essential Constituent of Systems Analysis and Design
    103 -- 108J. Jarosz, J. R. Jaworowski. Computer Tree - the Power of Parallel Computations
    109 -- 117N. Natarajan. A Distributed Synchronisation Scheme for Communicating Processes
    118 -- 126Kailasam Viswanathan Iyer, Lalit M. Patnaik. Performance Study of a Centralized Concurrency Control Algorithm for Distributed Database Systems Using SIMULA
    127 -- 134N. M. Pitman, F. Warren Burton, E. W. Haddon. Buddy Systems with Selective Splitting
    135 -- 150A. Hutchinson. A Data Structure and Algorithm for a Self-Augmenting Heuristic Program
    151 -- 160Darrel C. Ince, Mark Woodman. The Rapid Generation of a Class of Software Tools
    161 -- 166John T. Boardman, G. C. A. Robson. Towards a Problem-Solving Methodology for Coping with Increasing Complexity: An Engineering Approach
    167 -- 170J. Bradley. Use of Mean Distance Between Overflow Records to Compute Average Search Lengths in Hash Files with Open Addressing
    171 -- 175Jean Marcel Pallo. Enumerating, Ranking and Unranking Binary Trees
    176 -- 181Francesco dalla Libera, F. Gosen. Using B-Trees to Solve Geographic Range Queries
    182 -- 186John T. Boardman, C. Garrett, G. C. A. Robson. A Recursive Algorithm for the Optimal Solution of a Complex Allocation Problem Using a Dynamic Programming Formulation
    187 -- 188Jeffrey S. Rohl, Tamás D. Gedeon. The Reve s Puzzle

    Volume 29, Issue 1

    1 -- 8M. Anderson, R. D. Pose, Chris S. Wallace. A Password-Capability System
    9 -- 11M. Howard Williams, J. Riddall. The Segregation of Incompatible Duties
    12 -- 16Rabab K. Ward. Parity Check Codes for Logic Processors
    17 -- 19Norman Y. Foo. Dewey Indexing of Prolog Traces
    20 -- 23A. Hutchinson. Some Practical Principles for Design of Maintainable Systems
    24 -- 32J. Fucík, J. Král. The Hierarchy of Program Control Structures
    33 -- 35Tadao Takaoka. The Semantics of New While Loop
    36 -- 37Hosam M. Mahmoud. The Expected Distribution of Degrees in Random Binary Search Trees
    38 -- 46K. G. Kulkarni, Malcolm P. Atkinson. EFDM: Extended Functional Data Model
    47 -- 51Mostafa A. Bassiouni. System and Program Models of Storage Allocation for Reducing Seek Delay
    52 -- 59F. Suraweera. Use of Doubly Chained Tree Structures in File Organisation for Optimal Searching
    76 -- 82Herbert Edelsbrunner, G. Haring, D. Hilbert. Rectangular Point Location in d Dimensions with Applications
    83 -- 89L. Capper. A Philosophy for the Teaching of Computer Science and Information Technology
    90 -- 95Michael P. Georgeff, Gopal K. Gupta. Resources Needed for a University Computer Science Department
    runs on