The SCEAS System
Navigation Menu

Journals in DBLP

Comput. J.
1988, volume: 31, number: 1

  1. Hugo T. Jankowitz
    Detecting Plagiarism in Student Pascal Programs. [Citation Graph (0, 0)][DBLP]
    Comput. J., 1988, v:31, n:1, pp:1-8 [Journal]
  2. Lloyd Allison
    Some Applications of Continuations. [Citation Graph (0, 0)][DBLP]
    Comput. J., 1988, v:31, n:1, pp:9-11 [Journal]
  3. M. Razaz, J. L. Schonfelder
    Test Procedures for Measurement of Floating-Point Characteristics of Computing Environments. [Citation Graph (0, 0)][DBLP]
    Comput. J., 1988, v:31, n:1, pp:13-16 [Journal]
  4. Martin D. Davis, Elaine J. Weyuker
    Metric Space- Based Test-Data Adequacy Criteria. [Citation Graph (0, 0)][DBLP]
    Comput. J., 1988, v:31, n:1, pp:17-24 [Journal]
  5. Roger A. Clarke
    Judicial Understanding of Information Technology: The Case of the Wombat ROMs. [Citation Graph (0, 0)][DBLP]
    Comput. J., 1988, v:31, n:1, pp:25-33 [Journal]
  6. Csaba J. Egyhazy, Konstantinos P. Triantis
    A Query Processing Algorithm for Distributed Relational Database Systems. [Citation Graph (1, 0)][DBLP]
    Comput. J., 1988, v:31, n:1, pp:34-40 [Journal]
  7. Werner Kießling
    Access Path Selection in Databases with Intelligent Disc Subsystems. [Citation Graph (1, 0)][DBLP]
    Comput. J., 1988, v:31, n:1, pp:41-50 [Journal]
  8. Lawrence J. Henschen, Bob P. Weems
    A Top-Down Inference Procedure for Template Dependencies. [Citation Graph (0, 0)][DBLP]
    Comput. J., 1988, v:31, n:1, pp:51-55 [Journal]
  9. Wm. Randolph Franklin, Varol Akman
    Adaptive Grid for Polyhedral Visibility in Object Space: An Implementation. [Citation Graph (0, 0)][DBLP]
    Comput. J., 1988, v:31, n:1, pp:56-60 [Journal]
  10. M. C. Er
    A Simple Algorithm for Generating Non-Regular Trees in Lexicographic Order. [Citation Graph (0, 0)][DBLP]
    Comput. J., 1988, v:31, n:1, pp:61-64 [Journal]
  11. Ivan Stojmenovic, Masahiro Miyakawa
    Applications of a Subset-Generating Algorithm to Base Enumeration, Knapsack and Minimal Covering Problems. [Citation Graph (0, 0)][DBLP]
    Comput. J., 1988, v:31, n:1, pp:65-70 [Journal]
  12. Mirka Miller, Ivan Fris
    Minimum Diameter of Diregular Digraphs of Degree 2. [Citation Graph (0, 0)][DBLP]
    Comput. J., 1988, v:31, n:1, pp:71-0 [Journal]
  13. Selim M. Selim
    Split Vertices in Vertex Colouring and Their Application in Developing a Solution to the Faculty Timetable Problem. [Citation Graph (0, 0)][DBLP]
    Comput. J., 1988, v:31, n:1, pp:76-82 [Journal]
  14. Graham M. Megson, David J. Evans
    The Unification of Systolic Differencing Algorithms. [Citation Graph (0, 0)][DBLP]
    Comput. J., 1988, v:31, n:1, pp:83-91 [Journal]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002