External Links

    Journal: Comput. J.

    Volume 34, Issue 5

    386 -- 396D. J. Challab. Implementation of Flexible Arrays Using Balanced Trees
    397 -- 405B. Srinivasan. An Adaptive Overflow Technique to Defer Splitting in B-Trees
    406 -- 414W. F. Smyth. Mu-Balancing M-Way Search Trees
    415 -- 422Sivarama P. Dandamudi, Paul G. Sorenson. Improved Partial-Match Search Algorithms for BD Trees
    423 -- 427Stephan Olariu, C. Michael Overstreet, Zhaofang Wen. A Mergeable Double-Ended Priority Queue
    428 -- 437Dalit Naor, Charles U. Martel, Norman S. Matloff. Performance of Priority Queue Structures in a Virtual Memory Environment
    438 -- 443Erkki Mäkinen. A Survey on Binary Tree Codings
    444 -- 454G. Argo. Weighting Without Waiting: The Weighted Path Length Tree
    455 -- 468Seng Fuat Ou, Alan L. Tharp. High Storage Utilisation for Single-Probe Retrieval Linear Hashing
    469 -- 474Chin-Chen Chang, C. Y. Chen, J. K. Jan. On the Design of a Machine-Independent Perfect Hashing Scheme
    475 -- 476Peter Ruzicka, Vusei-Ar. A Note on the Efficiency of an Interval Routing Algorithm
    runs on