Journals in DBLP

Comput. J.
1987, volume: 30, number: 4

1. M. Sowa
   A Method for Speeding up Serial Processing in Dataflow Computers by Means of a Program Counter. [Citation Graph (0, 0)][DBLP]
   Comput. J., 1987, v:30, n:4, pp:289-294 [Journal]
   
2. Cs. Kecskes
   A Simple Method for Building up Large Computer Systems from Small Computers. [Citation Graph (0, 0)][DBLP]
   Comput. J., 1987, v:30, n:4, pp:295-297 [Journal]
   
3. Jan van Leeuwen, Richard B. Tan
   Interval Routing. [Citation Graph (0, 0)][DBLP]
   Comput. J., 1987, v:30, n:4, pp:298-307 [Journal]
   
4. D. J. Challab, J. D. Roberts
   Buddy Algorithms. [Citation Graph (0, 0)][DBLP]
   Comput. J., 1987, v:30, n:4, pp:308-315 [Journal]
   
5. David A. Duce, E. V. C. Fielding
   Formal Specification - A Comparison of Two Techniques. [Citation Graph (0, 0)][DBLP]
   Comput. J., 1987, v:30, n:4, pp:316-327 [Journal]
   
6. Cristina Sernadas, Rogério Carapuça
   The Role of Conceptual Modelling Abstractions in Compiler Development. [Citation Graph (0, 0)][DBLP]
   Comput. J., 1987, v:30, n:4, pp:328-336 [Journal]
   
7. Philip Leith
   A Programmed, Skeleton Formal Specification Method: The OUFDM. [Citation Graph (0, 0)][DBLP]
   Comput. J., 1987, v:30, n:4, pp:337-342 [Journal]
   
8. James K. Mullin
   Accessing Textual Documents Using Compressed Indexes of Arrays of Small Bloom Filters. [Citation Graph (0, 0)][DBLP]
   Comput. J., 1987, v:30, n:4, pp:343-348 [Journal]
   
9. P. A. Firby, D. J. Stone
   Colour Manipulation of Superposed Families of Curves. [Citation Graph (0, 0)][DBLP]
   Comput. J., 1987, v:30, n:4, pp:349-354 [Journal]
   
10. F. Warren Burton, V. J. Kollias, John G. Kollias
    A General PASCAL Program for Map Overlay of Quadtrees and Related Problems. [Citation Graph (0, 0)][DBLP]
    Comput. J., 1987, v:30, n:4, pp:355-361 [Journal]
    
11. A. Inkeri Verkamo
    Performance of Quicksort Adapted for Virtual Memory Use. [Citation Graph (0, 0)][DBLP]
    Comput. J., 1987, v:30, n:4, pp:362-371 [Journal]
    
12. S. Dvorák, Branislav Durian
    Stable Linear Time Sublinear Space Merging. [Citation Graph (0, 0)][DBLP]
    Comput. J., 1987, v:30, n:4, pp:372-375 [Journal]
    
13. D. Gault, Maurice Clint
    A Fast Algorithm for the Towers of Hanoi Problem. [Citation Graph (0, 0)][DBLP]
    Comput. J., 1987, v:30, n:4, pp:376-378 [Journal]
    
14. T. H. Tse
    Towards a Single Criterion for Identifying Program Unstructuredness. [Citation Graph (0, 0)][DBLP]
    Comput. J., 1987, v:30, n:4, pp:378-380 [Journal]