The Computer Journal

Articles

D. Giles

Editorial – Data Structures
The Computer Journal 1991 34: 385; doi:10.1093/comjnl/34.5.385 [PDF] [Request Permissions]  

D. J. Challab

Implementation of Flexible Arrays Using Balanced Trees
The Computer Journal 1991 34: 386-396; doi:10.1093/comjnl/34.5.386 [Abstract] [PDF] [Request Permissions]  

K. Bhaskar

Review: Book Review
The Computer Journal 1991 34: 396; doi:10.1093/comjnl/34.5.396 [PDF] [Request Permissions]  

B. Srinivasan

An Adaptive Overflow Technique to Defer Splitting in B-trees
The Computer Journal 1991 34: 397-405; doi:10.1093/comjnl/34.5.397 [Abstract] [PDF] [Request Permissions]  

F. Hussain and M. L. V. Pitteway

Correspondence
The Computer Journal 1991 34: 405; doi:10.1093/comjnl/34.5.405 [PDF] [Request Permissions]  

W. F. Smyth

Mu-balancing M-way Search Trees
The Computer Journal 1991 34: 406-414; doi:10.1093/comjnl/34.5.406 [Abstract] [PDF] [Request Permissions]  

Announcements
The Computer Journal 1991 34: 414; doi:10.1093/comjnl/34.5.414 [PDF] [Request Permissions]  

S. P. Dandamudi and P. G. Sorenson

Improved Partial-Match Search Algorithms for BD Trees
The Computer Journal 1991 34: 415-422; doi:10.1093/comjnl/34.5.415 [Abstract] [PDF] [Request Permissions]  

S. Maybank

Review: Book Review
The Computer Journal 1991 34: 422; doi:10.1093/comjnl/34.5.422 [PDF] [Request Permissions]  

B. Wichmann

Review: Book Review
The Computer Journal 1991 34: 422; doi:10.1093/comjnl/34.5.422-a [PDF] [Request Permissions]  

S. Olariu, C. M. Overstreet, and Z. Wen

A Mergeable Double-ended Priority Queue
The Computer Journal 1991 34: 423-427; doi:10.1093/comjnl/34.5.423 [Abstract] [PDF] [Request Permissions]  

C. T. Bhunia

Correspondence
The Computer Journal 1991 34: 427; doi:10.1093/comjnl/34.5.427 [PDF] [Request Permissions]  

D. Naor, C. U. Martel, and N. S. Matloff

Performance of Priority Queue Structures in a Virtual Memory Environment
The Computer Journal 1991 34: 428-437; doi:10.1093/comjnl/34.5.428 [Abstract] [PDF] [Request Permissions]  

Announcement
The Computer Journal 1991 34: 437; doi:10.1093/comjnl/34.5.437 [PDF] [Request Permissions]  

E. Mäkinen

A Survey on Binary Tree Codings
The Computer Journal 1991 34: 438-443; doi:10.1093/comjnl/34.5.438 [Abstract] [PDF] [Request Permissions]  

G. Argo

Weighting Without Waiting: the Weighted Path Length Tree
The Computer Journal 1991 34: 444-449; doi:10.1093/comjnl/34.5.444 [Abstract] [PDF] [Request Permissions]  

P. M. Fenwick

A New Technique for Self-Organising Linear Searches
The Computer Journal 1991 34: 450-454; doi:10.1093/comjnl/34.5.450 [Abstract] [PDF] [Request Permissions]  

Announcement
The Computer Journal 1991 34: 454; doi:10.1093/comjnl/34.5.454 [PDF] [Request Permissions]  

S. F. Ou and A. L. Tharp

High Storage Utilisation for Single-Probe Retrieval Linear Hashing
The Computer Journal 1991 34: 455-468; doi:10.1093/comjnl/34.5.455 [Abstract] [PDF] [Request Permissions]  

E. Oxborrow

Review: Book Review
The Computer Journal 1991 34: 468; doi:10.1093/comjnl/34.5.468 [PDF] [Request Permissions]  

Announcement
The Computer Journal 1991 34: 468; doi:10.1093/comjnl/34.5.468-a [PDF] [Request Permissions]  

C. C. Chang, C. Y. Chen, and J. K. Jan

On the Design of a Machine-Independent Perfect Hashing Scheme
The Computer Journal 1991 34: 469-474; doi:10.1093/comjnl/34.5.469 [Abstract] [PDF] [Request Permissions]  

D. Shepherd

Review: Book Review
The Computer Journal 1991 34: 474; doi:10.1093/comjnl/34.5.474 [PDF] [Request Permissions]  

P. Ruzicka

Short Note: A Note on the Efficiency of an Interval Routing Algorithm
The Computer Journal 1991 34: 475-476; doi:10.1093/comjnl/34.5.475 [Abstract] [PDF] [Request Permissions]  

Announcement
The Computer Journal 1991 34: 476; doi:10.1093/comjnl/34.5.476 [PDF] [Request Permissions]  

To see an article, click its [Full Text] or [PDF] link. To review many abstracts, check the boxes to the left of the titles you want, and click the 'Get All Checked Abstract(s)' button. To see one abstract at a time, click its [Abstract] link.