|
|
Journals in DBLP
Comput. J.
1991, volume: 34, number: 1
- A. J. J. Dick
An Introduction to Knuth-Bendix Completion. [Citation Graph (0, 0)][DBLP]
Comput. J., 1991, v:34, n:1, pp:2-15 [Journal]
- A. J. J. Dick, Phil Watson
Order-Sorted Term Rewriting. [Citation Graph (0, 0)][DBLP]
Comput. J., 1991, v:34, n:1, pp:16-19 [Journal]
- Miki Hermann, Claude Kirchner, Hélène Kirchner
Implementations of Term Rewriting Systems. [Citation Graph (0, 0)][DBLP]
Comput. J., 1991, v:34, n:1, pp:20-33 [Journal]
- Tobias Nipkow
Constructive Rewriting. [Citation Graph (0, 0)][DBLP]
Comput. J., 1991, v:34, n:1, pp:34-41 [Journal]
- Peter Padawitz
Reduction and Narrowing for Horn Clause Theories. [Citation Graph (0, 0)][DBLP]
Comput. J., 1991, v:34, n:1, pp:42-51 [Journal]
- Péter Kacsuk
A Parallel Prolog Abstract Machine and its Multi-Transputer Implementation. [Citation Graph (0, 0)][DBLP]
Comput. J., 1991, v:34, n:1, pp:52-63 [Journal]
- Jukka Paakki
Prolog in Practical Compiler Writing. [Citation Graph (0, 0)][DBLP]
Comput. J., 1991, v:34, n:1, pp:64-72 [Journal]
- Levent V. Orman
Constraint Maintenance as a Data Model Design Criterion. [Citation Graph (0, 0)][DBLP]
Comput. J., 1991, v:34, n:1, pp:73-79 [Journal]
- Farokh B. Bastani, Ing-Ray Chen, Wael Hilal Bahaa-El-Din
A Model for the Stability Analysis of Maintenance Stragies for Linear List. [Citation Graph (0, 0)][DBLP]
Comput. J., 1991, v:34, n:1, pp:80-87 [Journal]
- Mark Allen Weiss
Empirical Study of the Expected Running Time of Shellsort. [Citation Graph (0, 0)][DBLP]
Comput. J., 1991, v:34, n:1, pp:88-91 [Journal]
- J.-L. Wu, S.-T. Cheng
A Neural Network Simulating System. [Citation Graph (0, 0)][DBLP]
Comput. J., 1991, v:34, n:1, pp:92-93 [Journal]
|
