Journals in DBLP

Comput. J.
1991, volume: 34, number: 5

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