Journals in DBLP

Comput. J.
1989, volume: 32, number: 1

1. T. H. Tse, L. Pong
   Towards a Formal Foundation for DeMarco Data Flow Diagrams. [Citation Graph (0, 0)][DBLP]
   Comput. J., 1989, v:32, n:1, pp:1-12 [Journal]
   
2. Chris J. Mitchell
   Multi-Destination Secure Electronic Mail. [Citation Graph (0, 0)][DBLP]
   Comput. J., 1989, v:32, n:1, pp:13-15 [Journal]
   
3. Timothy C. Bell, Alistair Moffat
   A Note on the DMC Data Compression Scheme. [Citation Graph (0, 0)][DBLP]
   Comput. J., 1989, v:32, n:1, pp:16-20 [Journal]
   
4. S. Hekmatpour
   A Window Manager for UNIX. [Citation Graph (0, 0)][DBLP]
   Comput. J., 1989, v:32, n:1, pp:21-23 [Journal]
   
5. Bernd Freisleben, James Leslie Keedy
   Priority Semaphores. [Citation Graph (0, 0)][DBLP]
   Comput. J., 1989, v:32, n:1, pp:24-28 [Journal]
   
6. Paolo Corsini, Graziano Frosini, G. Speranza
   The Parallel Interpretation of Logic Programs in Distributed Architectures. [Citation Graph (0, 0)][DBLP]
   Comput. J., 1989, v:32, n:1, pp:29-35 [Journal]
   
7. Balanjaninath Edupuganty, Barrett R. Bryant
   Two-Level Grammar as a Functional Programming Language. [Citation Graph (0, 0)][DBLP]
   Comput. J., 1989, v:32, n:1, pp:36-44 [Journal]
   
8. Ivor P. Page, R. T. Jacob
   The Solution of Mutual Exclusion Problems which can be Described Graphically. [Citation Graph (0, 0)][DBLP]
   Comput. J., 1989, v:32, n:1, pp:45-54 [Journal]
   
9. N. Parimala, Naveen Prakash, B. L. N. Rao, Narasimha Bolloju
   A Query Facility to a Network DBMS. [Citation Graph (0, 0)][DBLP]
   Comput. J., 1989, v:32, n:1, pp:55-62 [Journal]
   
10. A. Hutchinson
    Inheritance and Kinds of Slots. [Citation Graph (0, 0)][DBLP]
    Comput. J., 1989, v:32, n:1, pp:63-67 [Journal]
    
11. Joseph C. Culberson, J. Ian Munro
    Explaining the Behaviour of Binary Search Trees Under Prolonged Updates: A Model and Simulations. [Citation Graph (0, 0)][DBLP]
    Comput. J., 1989, v:32, n:1, pp:68-75 [Journal]
    
12. M. C. Er
    Classes of Admissible Permutations that are Generatable by Depth-First Traversals of Ordered Trees. [Citation Graph (0, 0)][DBLP]
    Comput. J., 1989, v:32, n:1, pp:76-85 [Journal]
    
13. Alan R. Halbert, Stephen Todd, John R. Woodwark
    Generalizing Active Zones for Set-Theoretic Solid Models. [Citation Graph (0, 0)][DBLP]
    Comput. J., 1989, v:32, n:1, pp:86-89 [Journal]
    
14. Mauro Negri, Giuseppe Pelagatti, Licia Sbattella
    Semantics and Probelms of Universal Quantification in SQL. [Citation Graph (1, 0)][DBLP]
    Comput. J., 1989, v:32, n:1, pp:90-91 [Journal]
    
15. Martha Sideri, Sophocles Efremidis, G. Papaconstantinou
    Semantically Driven Parsing of Context-Free Languages. [Citation Graph (0, 0)][DBLP]
    Comput. J., 1989, v:32, n:1, pp:91-93 [Journal]
    
16. M. J. Jamieson
    Rapidly Converging Iterative Formulae for Finding Square Roots and Their Computational Efficiencies. [Citation Graph (0, 0)][DBLP]
    Comput. J., 1989, v:32, n:1, pp:93-94 [Journal]