The Computer Journal, Volume 33, 1990

Volume 33, Number 1, 1990

K. H. Baik, L. L. Miller:
Topological Approach for Testing Equivalence in Heterogeneous Relational Databases. 2-10
Nandlal L. Sarda:
Algebra and Query Language for A Historical Data Model. 11-18
Mark Levene, George Loizou:
The Nested Relation Type Model: An Application of Domain Theory to Databases. 19-30
Manoochehr Azmoodeh:
BRMQ: A Database Interface Facility Based on Graph Traversals and Extended Relationships on Groups of Entities. 31-39
David A. Bell, J. Shao, M. Elizabeth C. Hull:
Integrated Deductive Database System Implementation: A Systematic Study. 40-48
Malcolm C. Taylor:
Logical Optimisation of Distributed Knowledge Base Queries. 49-60
Patrick Martin, K. H. Lam, Judy I. Russell:
An Evaluation of Site Selection Algorithms for Distributed Query Processing. 61-70
Divyakant Agrawal, Amr El Abbadi:
Integrating Security with Fault-Tolerant Distributed Databases. 71-78
Ravi Mukkamala, Steven C. Bruell:
Efficient Schemes to Evaluate Transaction Performance in Distributed Database Systems. 79-89

Ralph E. Griswold:
String Scanning in the Icon Programming Language. 98-107
Paul Philbrow, Malcolm P. Atkinson:
Events and Exception Handling in PS-Algol. 108-125
R. Geoff Dromey, T. A. Chorvat:
Structure Clashes - An Alternative to Program Inversion. 126-132
Matti O. Jokinen:
Parameter Transmission Abstractions. 133-139
G. Whale:
Indentification of Program Similarity in Large Populations. 140-146
Gordon Davies, Alan Burns:
The Teaching Language Pascal-FC. 147-154
C. F. Reynolds:
CODIL: The Architecture of an Information Language. 155-163
G. D. P. Dueck, Gordon V. Cormack:
Modular Attribute Grammars. 164-172
Marian Petre, Russel L. Winder:
On Languages, Models and Programming Styles. 173-180
Hal Berghel, Richard Rankin:
A Proposed Standard for Measuring Crossword Compilation Efficiency. 181-184

Short Note

R. Govindarajan, Lalit M. Patnaik:
Lenient Execution and Concurrent Execution of Re-Entrant Routines: Efficient Implementation in Data Flow Systems. 185-187

Oscar G. Plata, Javier D. Bruguera, Francisco F. Rivera, Ramon Doallo, Emilio L. Zapata:
ACLE: A Software Package for SIMD Computer Simulation. 194-203
Sandeep Gulati, S. Sitharama Iyengar, Jacob Barhen:
The Pebble-Crunching Model for Fault-Tolerant Load Balancing in Hypercube Ensembles. 204-214
K. W. Ng, Ho-Fung Leung:
Competition: A Model of AND-Parallel Execution of Logic Programs. 215-218
Camille C. Price, M. A. Salama:
Scheduling of Precedence-Constrained Tasks on Multiprocessors. 219-229
David Abramson, Gregory K. Egan:
The RMIT Data Flow Computer: A Hybrid Architecture. 230-240
Sujit Dey, Pradip K. Srimani:
A New Parallel Sorting Algorithm and its Efficient VLSI Implementation. 241-246
P. Chaudhuri:
Finding and Updating Depth-First Spanning Trees of Acyclic Digraphs in Parallel. 247-251
Ferng-Ching Lin, Kung Chen:
On the Design of an Integrated Systolic Array for Solving Simultaneous Linear Equations. 252-260
Graham M. Megson:
An Efficient Double Pipe Systolic Array for Matrix Product. 261-265
H. Wills:
Fundamentals of Pricing and Scheduling Computer Services and Investment in Computer Equipment. 266-273
Jeffrey S. Rohl:
Reversing is Not Inherent in Lexiocographical Permutation Generation. 274-278

Short Note

F. Warren Burton, John G. Kollias, D. G. Matsakis, V. G. Kollias:
Implementation of Overlapping B-Trees for Time and Space Efficient Representation of Collections of Similar Files. 279-280
Gu Xunrang, Zhu Yuzhang:
A New HEAPSORT Algorithm and the Analysis of Its Complexity. 281-282

Chris J. Mitchell, Dave Rush, Michael Walker:
A Secure Messaging Architecture Implementing the X.400-1988 Security Features. 290-295
Aviezri S. Fraenkel, Shmuel T. Klein:
Bidirectional Huffman Coding. 296-307
R. L. Bailey, Ravi Mukkamala:
Pipelining Data Compression Algorithms. 308-313
Peter M. Fenwick:
Performance Measurements on a 39 km Extended Ethernet. 314-322
Yi Pan, Rami G. Melhem:
Short Circuits in Buffered Multi-Stage Interconnection Networks. 323-329
F. Warren Burton, Geoff P. McKeown, Victor J. Rayward-Smith:
Applications of UET Scheduling Theory to the Implementation of Declarative Languages. 330-336
D. Alcock, D. Brown:
PRAXIS: A Program for Reproducing Proforma Design Calculations. 337-343
Massimo Ancona, Leila De Floriani, Jitender S. Deogun:
Structured Spanning Trees. 344-355
Ronen Feldman, Martin Charles Golumbic:
Optimization Algorithms for Student Scheduling via Constraint Satisfiability. 356-364
Bruce K. Haddon:
Cycle-Sort: A Linear Sorting Method. 365-367
B. John Oommen, David T. H. Ng:
On Generating Random Permutations with Arbitrary Distributions. 368-374
H. Miyakoshi:
A Literal Code Method For Minimizing Boolean Functions. 375-380

Short Note

Sarah B. M. Bell, David C. Mason:
Tesseral Quaternions for the Octtree. 386-397
Andrew Hunter, Philip J. Willis:
A Note on the Optimal Labelling of Quadtree Nodes. 398-401
Kevin G. Suffern:
Quadtree Algorithms for Contouring Functions of Two Variables. 402-407
L. R. Neal, Michael L. V. Pitteway:
Yet More Circle Generators. 408-411
Binh Pham:
Algorithms for Calculating Cubic Beta-Splines. 412-416
Paolo Puliti, Guido Tascini:
Interpreting Technical Drawings. 417-423
Frank K. H. A. Dehne, L. Ficocelli:
An Efficient Computational Geometry Method for Detecting Dotted Lines in Noisy Images. 424-428
Laura Moltedo, A. Noferini:
An Implementation of 7-Bit Character Encoding for Standard Computer Graphics Environments. 429-436
Francis Neelamkavil, O. Mullarney:
Separating Graphics from Application in the Design of User Interfaces. 437-443
M. Bilodeau, D. L. Laguitton:
Development of Screen Management Subroutines Compatible with Microsoft FORTRAN Compiler. 444-452
K. Bowden:
Kron's Method of Tearing on a Transputer Array. 453-459
Lloyd Allison:
Continuations Implement Generators and Streams. 460-465
Tom Axford:
Reference Counting of Cyclic Graphs for Functional Programs. 466-470

Short Note

Arne Andersson:
A Note on the Expected Behaviour of Binary Tree Traversals. 471-472
Giuseppe Alia, Enrico Martinelli:
VLSI Binary-Residue Converters for Pipelined Processing. 473-475

Keith L. Clark:
Parallel Logic Programming. 482-493
Kazunori Ueda, Takashi Chikayama:
Design of the Kernel Language for the Parallel Inference Machine. 494-500
Ian T. Foster, Carl Kesselman, Stephen Taylor:
Concurrency: Simple Concepts and Powerful Tools. 501-507
I. Shizgal:
The Amoeba-Prolog System. 508-517
J. Gerard Wolff:
Simplicity and Power - Some Unifying Ideas in Computing. 518-534
K. G. Waugh, M. Howard Williams, Quinzheng Kong, S. Salvini, G. Chen:
Designing SQUIRREL: An Extended SQL for a Deductive Database System. 535-546
Norman W. Paton, Peter M. D. Gray:
Optimising and Executing DAPLEX Queries Using Prolog. 547-555
H. J. Roberts:
Expert Systems. Clubs: Design Methods. 556-561
Graham M. Megson, David J. Evans:
A Systolic Array Solution for the Assignment Problem. 562-569
T. Y. Chen:
On the Consistency of Multi-Valued Functions. 570-572

Last update Mon May 20 00:00:01 2013 CET by the DBLP Team —

Data released under the ODC-BY 1.0 license — See also our legal information page