default search action
The Computer Journal, Volume 30, 1987
Volume 30, Number 1, 1987
- D. Benyon, S. Skidmore:
Towards a Tool Kit for the Systems Analyst. 2-7 - Heinz K. Klein, Rudy Hirschheim:
A Comparative Framework of Data Modelling Paradigms and Approaches. 8-15 - Raúl Héctor Gallard:
An Extension in the Definition of a Petri Net Execution. 16-19 - Shigeyoshi Tsutsui, Yoshiji Fujimoto:
Deadlock Prevention in Process Control Computer Systems. 20-26 - Roland Carl Backhouse
, A. Khamiss:
A While-Rule in Martin-Löf's Theory of Types. 27-36 - Anthony G. Middleton:
Some Transformations of Relevance to Report Generation. 37-42 - G. Oulsnam:
The Algorithmic Transformation of Schemas to Structured Form. 43-51 - J. A. W. Faidhi, S. K. Robinson:
Programmer Experience-Level Indicators. 52-62 - Darrel C. Ince:
The Automatic Generation of Test Data. 63-69 - Jeffrey S. Rohl:
Towers of Hanoi: The Derivation of Some Iterative Versions. 70-76 - Peter M. Fenwick:
A Fast-Carry Adder with CMOS Transmission Gates. 77-79 - Timo Raita:
An Automatic System for File Compression. 80-86 - A. J. Cole:
Compaction Techniques for Raster Scan Graphics Using Space-Filling Curves. 87-92
Volume 30, Number 2, 1987
- Alex A. Verrijn-Stuart:
Themes and Trends in Information Systems: TC8, 1975-1985. 97-109 - Lewis M. Mackenzie, A. M. Macleod, D. J. Berry:
A Multiple Microprocessor System for CPU-Bound Calculations. 110-118 - Ian A. Newman, R. P. Stallard, M. C. Woodward:
A Hybrid Multiple Processor Garbage Collection Algorithm. 119-127 - Ian Sommerville, Ray Welland, Stephen Beer:
Describing Software Design Methodologies. 128-133 - Howard Barringer:
Up and Down The Temporal Way. 134-148 - John A. Llewellyn:
Data Compression for a Source with Markov Characteristics. 149-156 - S. Misbah Deen, R. R. Amin, Malcolm C. Taylor:
Implementation of a Prototype for PRECI. 157-162 - S. Nedunuri, Neil E. Wiseman:
Displaying Random Surfaces. 163-167 - C. M. A. Castle, Michael L. V. Pitteway:
An Efficient Structural Technique for Encoding 'Best-fit' Straight Lines. 168-175 - A. Unnikrishnan, Y. V. Venkatesh, Priti Shankar:
Connected Component Labelling Using Quadtrees - A Bottom-up Approach. 176-182 - Hal Berghel:
Crossword Compilation with Horn Clauses. 183-188
- M. J. Jamieson:
A Note on the Convergence of an Iterative Scheme for Solving a Quadratic Equation. 189-190
Volume 30, Number 3, 1987
- Gordon S. Blair
A Knowledge-Based Operating System. 193-200 - C. M. Reeves:
Chainmail: A Model of First-Fit Memory Allocation. 201-213 - P. C. Burkimsher:
Combinator Reduction in a Shared-Memory Multiprocessor. 214-222 - Neal S. Coulter, Robert B. Cooper, Martin K. Solomon:
Information-Theoretic Complexity of Program Specifications. 223-227 - K. A. Redish, W. F. Smyth:
Evaluating Measures of Program Quality. 228-232 - Jainendra K. Navlakha:
A Survey of System Complexity Metrics. 233-238 - D. Gray:
A Pedagogical Verification Condition Generator. 239-248 - Chin-Chen Chang:
An Information Protection Scheme Based Upon Number Theory. 249-253 - Bernd Teufel
System Design for the Remote Execution of Library Routines. 254-257 - Chin-Long Wey, Fabrizio Lombardi:
On a Novel Self-Test Approach to Digital Testing. 258-267 - John C. Nash, Seymour Shlien:
Simple Algorithms for the Partial Singular Value Decomposition. 268-275
- M. C. Er:
An Efficient Implementation of Permutation Backtracking in Lexicographic Order. 282 - D. Salomon:
A Design for an Efficient NOR-Gate only, Binary-Ripple Adder with Carry-Completion-Detection Logic. 283-285
Volume 30, Number 4, 1987
- Masahiro Sowa:
A Method for Speeding up Serial Processing in Dataflow Computers by Means of a Program Counter. 289-294 - Cs. Kecskes:
A Simple Method for Building up Large Computer Systems from Small Computers. 295-297 - Jan van Leeuwen, Richard B. Tan:
Interval Routing. 298-307 - D. J. Challab, J. D. Roberts:
Buddy Algorithms. 308-315 - David A. Duce, Elizabeth V. C. Fielding:
Formal Specification - A Comparison of Two Techniques. 316-327 - Cristina Sernadas, Rogério Carapuça:
The Role of Conceptual Modelling Abstractions in Compiler Development. 328-336 - Philip Leith:
A Programmed, Skeleton Formal Specification Method: The OUFDM. 337-342 - James K. Mullin:
Accessing Textual Documents Using Compressed Indexes of Arrays of Small Bloom Filters. 343-348 - P. A. Firby, D. J. Stone:
Colour Manipulation of Superposed Families of Curves. 349-354 - F. Warren Burton, V. J. Kollias, John G. Kollias:
A General PASCAL Program for Map Overlay of Quadtrees and Related Problems. 355-361 - A. Inkeri Verkamo:
Performance of Quicksort Adapted for Virtual Memory Use. 362-371 - S. Dvorák, Branislav Durian:
Stable Linear Time Sublinear Space Merging. 372-375
- D. Gault, Maurice Clint:
A Fast Algorithm for the Towers of Hanoi Problem. 376-378 - T. H. Tse
Towards a Single Criterion for Identifying Program Unstructuredness. 378-380
Volume 30, Number 5, 1987
- W. F. Clocksin:
Principles of the DelPhi Parallel Inference Machine. 386-392 - Péter Kacsuk, A. Bale:
DAP Prolog: A Set-Oriented Approach to Prolog. 393-403 - D. McGregor, Stephen T. McInnes, M. Henning:
An Architecture for Associative Processing of Large Knowledge Bases (LKBs). 404-412 - B. M. Forrest, Duncan Roweth, N. Stroud, D. J. Wallace, Gregory V. Wilson:
Implementing Neural Network Models on Parallel Computers. 413-419 - A. F. W. Coulson, J. F. Collins, A. Lyall:
Protein and Nucleic Acid Sequence Database Searching: A Suitable Case for Parallel processing. 420-424 - Hamid R. Arabnia, Martin A. Oliver:
A Transputer Network for the Arbitrary Rotation of Digitised Images. 425-432 - Selim G. Akl:
Adaptive and Optimal Parallel Algorithms for Enumerating Permutations and Combinations. 433-436 - F. Warren Burton:
Functional Programming for Concurrent and Distributed Computing. 437-450 - J. M. Foster, Ian F. Currie:
Remote Capabilities. 451-457 - Arie Segev:
Optimising Two-Way Joins in Horizontally Partitioned Database Systems. 458-468 - D. Godfrey, S. Gong, R. Hart, N. Koorland, S. Smit:
Project 'Clear Skies': Teaching Computer Science by Computer Based Training and Electronic Messaging in China. 469-474
- Harold W. Thimbleby
Optimising Self-Replicating Programs. 475-476
Volume 30, Number 6, 1987
- Pam J. Mayhew, Peter A. Dearnley:
An Alternative Prototyping Classification. 481-484 - M. Ramshaw, A. P. Steward, D. Stoves:
An Intelligent Retrieval and Presentation System for Management Information. 485-486 - Julie Basu, Lalit M. Patnaik, Asis K. Goswami:
Ordered Ports - A Language Concept for High-Level Distributed Programming. 487-497 - Jos C. M. Baeten, Jan A. Bergstra, Jan Willem Klop:
Ready-Trace Semantics for Concrete Process Algebra with the Priority Operator. 498-506 - T. H. Tse
The Identification of Program Unstructuredness: A Formal Approach. 507-511 - R. Geoff Dromey:
Derivation of Sorting Algorithms from a Specification. 512-518 - Elisa Bertino:
An Evaluation of Precompilation and Interpretation in Distributed Database Management Systems. 519-528 - Yannis Manolopoulos, Dimitris Kleftouris, Loukas Petrou:
A Model for an ISAM File with Multiple Overflow Chains. 529-534 - Chin-Chen Chang, C. Y. Chen:
Performance Analysis of the Generalised Disc Modulo Allocation method for Multiple Key Hashing Files on Multi-Disc Systems. 535-540 - Gordon V. Cormack, R. Nigel Horspool:
Data Compression Using Dynamic Markov Modelling. 541-550 - Godwin M. Gwei, Eric Foxley:
A Flexible Synonym Interface with Application Examples in CAL and Help Environments. 551-557 - J. Parker, A. Kennard, D. King:
The 'Window' Terminal. 558-564 - Yannis Manolopoulos, John G. Kollias, F. Warren Burton:
Batched Interpolation Search. 565-568 - M. C. Er:
Lexicographic Listing and Ranking of t-Ary Trees. 569-572
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.
last updated on 2024-12-22 18:49 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: