default search action
The Computer Journal, Volume 29, 1986
Volume 29, Number 1, 1986
- M. Anderson, R. D. Pose, Chris S. Wallace:
A Password-Capability System. 1-8 - M. Howard Williams, J. Riddall:
The Segregation of Incompatible Duties. 9-11 - Rabab K. Ward:
Parity Check Codes for Logic Processors. 12-16 - Norman Y. Foo:
Dewey Indexing of Prolog Traces. 17-19 - Alan Hutchinson:
Some Practical Principles for Design of Maintainable Systems. 20-23 - J. Fucík, J. Král:
The Hierarchy of Program Control Structures. 24-32 - Tadao Takaoka:
The Semantics of New While Loop. 33-35 - Hosam M. Mahmoud:
The Expected Distribution of Degrees in Random Binary Search Trees. 36-37 - K. G. Kulkarni, Malcolm P. Atkinson:
EFDM: Extended Functional Data Model. 38-46 - Mostafa A. Bassiouni:
System and Program Models of Storage Allocation for Reducing Seek Delay. 47-51 - F. Suraweera:
Use of Doubly Chained Tree Structures in File Organisation for Optimal Searching. 52-59 - I. P. Stewart:
Quadtrees: Storage and Scan Conversion. 60-75 - Herbert Edelsbrunner, G. Haring, D. Hilbert:
Rectangular Point Location in d Dimensions with Applications. 76-82 - L. Capper:
A Philosophy for the Teaching of Computer Science and Information Technology. 83-89 - Michael P. Georgeff, Gopal K. Gupta:
Resources Needed for a University Computer Science Department. 90-95
Volume 29, Number 2, 1986
- A. P. Jagodzinski, D. D. Clarke:
A Review of Methods for Measuring and Describing Users' Attitudes as an Essential Constituent of Systems Analysis and Design. 97-102 - J. Jarosz, J. R. Jaworowski:
Computer Tree - the Power of Parallel Computations. 103-108 - N. Natarajan:
A Distributed Synchronisation Scheme for Communicating Processes. 109-117 - K. Viswanathan Iyer, Lalit M. Patnaik:
Performance Study of a Centralized Concurrency Control Algorithm for Distributed Database Systems Using SIMULA. 118-126 - N. M. Pitman, F. Warren Burton, E. W. Haddon:
Buddy Systems with Selective Splitting. 127-134 - Alan Hutchinson:
A Data Structure and Algorithm for a Self-Augmenting Heuristic Program. 135-150 - Darrel C. Ince, Mark Woodman:
The Rapid Generation of a Class of Software Tools. 151-160 - John T. Boardman, G. C. A. Robson:
Towards a Problem-Solving Methodology for Coping with Increasing Complexity: An Engineering Approach. 161-166 - James Bradley:
Use of Mean Distance Between Overflow Records to Compute Average Search Lengths in Hash Files with Open Addressing. 167-170 - Jean Marcel Pallo:
Enumerating, Ranking and Unranking Binary Trees. 171-175 - Francesco dalla Libera, F. Gosen:
Using B-Trees to Solve Geographic Range Queries. 176-181 - John 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. 182-186 - Jeffrey S. Rohl, Tamás D. Gedeon:
The Reve's Puzzle. 187-188
Volume 29, Number 3, 1986
- Joan M. Smith:
The Implications of SGML for the Preparation of Scientific Publications. 193-200 - Harold W. Thimbleby:
Experiences of 'Literate Programming' Using Cweb (A Variant of Knuth's WEB). 201-211 - Phillip Ein-Dor, Eli Segev:
Attitudes, Association and Success of MIS: Some Empirical Results from Research in the Context of a Business Game. 212-221 - D. M. Episkopou, A. T. Wood-Harper:
Towards a Framework to Choose Appropriate IS Approaches. 222-228 - Jean-Pierre Elloy, Olivier F. Roux:
Electre: A Language for Control Structuring in Real Time. 229-234 - Iain D. Craig:
The Ariadne-1 Blackboard System. 235-240 - George K. Papakonstantinou, John Kontos:
Knowledge Representation with Attribute Grammars. 241-245 - M. Howard Williams, G. Chen:
Translating Pascal for Execution on a Prolog-Based System. 246-252 - Ronald T. House:
Alternative Scope Rules for Block-Structured Languages. 253-260 - E. Wong, W. B. Samson:
The Specification of a Relational Database (PRECI) as an Abstract Data Type and its Realisation in HOPE. 261-268 - David J. Taylor, James P. Black:
A Locally Correctable B-Tree Implementation. 269-276 - Chin-Chen Chang, Richard C. T. Lee:
A Letter-Oriented Minimal Perfect Hashing Scheme. 277-281 - G. W. Smith, J. B. H. du Boulay:
The Generation of Cryptic Crossword Clues. 282-284
Volume 29, Number 4, 1986
- Sape J. Mullender, Andrew S. Tanenbaum:
The Design of a Capability-Based Distributed Operating System. 289-299 - Brian Randell:
System Design and Structuring. 300-306 - Roger G. Stone:
On the Choice of Grammar and Parser for the Compact Analytical Encoding of Programs. 307-314 - P. A. Luker, Alan Burns:
Program Generators and Generation Software. 315-321 - Giovanni Cantone, Aniello Cimitile, Ugo de Carlini:
Well-Formed Conversion of Unstructured One-in/one-out Schemes for Complexity Measurement and Program Maintenance. 322-329 - Norman E. Fenton, Robin W. Whitty:
Axiomatic Approach to Software Metrication Through Program Decomposition. 330-339 - Steve J. Young, C. Proctor:
UFL: An Experimental Frame Language Based on Abstract Data Types. 340-347 - P. Feldman, D. Miller:
Entity Model Clustering: Structuring A Data Model By Abstraction. 348-360 - J. Carden:
The Structural Stability of Corporate and Devolved Databases. 361-367 - Yannis Manolopoulos, John G. Kollias, Michael Hatzopoulos:
Sequential vs. Binary Batched Searching. 368-372 - Neil E. Wiseman, S. Nedunuri:
Computing Random Fields. 373-377
- James Bradley:
Join Dependencies in Relational Databases and the Geometry of Spatial Grids. 378-380 - Darrel C. Ince, Sharam Hekmatpour:
An Empirical Evaluation of Random Testing. 380
Volume 29, Number 5, 1986
- Nick Rushby:
A Knowledge-Engineering Approach to Instructional Design. 385-389 - Mathai Joseph, Paritosh K. Pandya:
Finding Response Times in a Real-Time System. 390-395 - John P. Penny, Paul J. Ashton, A. L. Wilkinson:
Data Recording and Monitoring for Analysis of System Response Times. 396-403 - Howard Barringer, Ian Mearns:
A Proof System for Ada Tasks. 404-415 - J. M. Foster:
Validating Microcode Algebraically. 416-422 - Roy D. Dowsing, R. Elliott:
Programming a Bounded Buffer Using the Object and Path Expression Constructs of Path Pascal. 423-429 - M. C. Er:
The Use of Termination Indicators in Computer Programming. 430-433 - A. D. Woodall:
Techniques of Program Design. 434-435 - Wen-Chin Chen, Jeffrey Scott Vitter:
Deletion Algorithms for Coalesced Hashing. 436-450 - Sakti Pramanik, Farshad Fotouhi:
Index Database Machine. 451-457 - Sushil Jajodia:
Recognizing Multivalued Dependencies in Relation Schemas. 458-459 - A. Blair, Ian Sommerville:
DSA - A Tool for Descriptive Text Analysis. 460-466 - M. Rom, S. Bergman:
A New Technique for Automatic Contouring and Contour Representation from Machine-Readable Spatial Data. 467-471 - F. Fabbrini, Claudio Montani:
Autumnal Quadtrees. 472-474 - Brian Shackel:
IBM Makes Usability as Important as Functionality. 475-476
- John M. Wilson:
A Weighted Mark-Scaling Algorithm. 477
Volume 29, Number 6, 1986
- C. J. van Rijsbergen:
A Non-Classical Logic for Information Retrieval. 481-485 - R. M. Lea:
VLSI and WSI Associative String Processors for Cost-Effective Parallel Processing. 486-494 - W. F. Clocksin:
Automatic Specilisation of Standard Designs. 495-499 - M. Elizabeth C. Hull:
Implementations of the CSP Notation for Concurrent Systems. 500-505 - Lalit M. Patnaik, Julie Basu:
Two Tools for Interprocess Communication in Distributed Data-Flow Systems. 506-521 - Reuven R. Levary, William D. Edwards:
Analysing the Impact of Adding a New Software System on Main Memory Usage. 522-526 - David Mackay, G. Ball, Malcolm K. Crowe, Michael Hughes, David G. Jenkins, Clark Nicol:
A UNIX-Based System for Software Configuration Management. 527-530 - Paritosh K. Pandya, Mathai Joseph:
A Structure-Directed Total Correctness Proof Rule for Recursive Procedure Calls. 531-537 - Anthony J. Cowling:
Type Checking in Polymorphic Languages. 538-544 - Philip Leith:
Fundamental Errors in Legal Logic Programming. 545-552 - Massimo Ancona, Leila De Floriani, Jitender S. Deogun:
Path Problems in Structured Graphs. 553-563 - K. J. MacCallum, J. M. Zhang:
Curve-Smoothing Techniques Using B-Splines. 564-571
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.