|
Journals in DBLP
Comput. J. 1998, volume: 41, number: 1
- Ana Cavalcanti, Jim Woodcock
A Weakest Precondition Semantics for Z. [Citation Graph (0, 0)][DBLP] Comput. J., 1998, v:41, n:1, pp:1-15 [Journal]
- Michele Flammini, Jan van Leeuwen, Alberto Marchetti-Spaccamela
The Complexity of Interval Routing on Random Graphs. [Citation Graph (0, 0)][DBLP] Comput. J., 1998, v:41, n:1, pp:16-25 [Journal]
- Soo-Mook Moon, Kemal Ebcioglu
The Performance Impact of Exploiting Branch ILP with Tree Representation of ILP Code. [Citation Graph (0, 0)][DBLP] Comput. J., 1998, v:41, n:1, pp:26-44 [Journal]
- Giuseppe Alia, Enrico Martinelli
Logic Design of a Fast Circuit for Iterative Additions in Redundant Hybrid. [Citation Graph (0, 0)][DBLP] Comput. J., 1998, v:41, n:1, pp:45-51 [Journal]
- Ding-Ming Kwai, Behrooz Parhami
Tight Bounds on the Diameter of Gaussian Cubes. [Citation Graph (0, 0)][DBLP] Comput. J., 1998, v:41, n:1, pp:52-56 [Journal]
- Cos S. Ierotheou, C.-H. Lai, C. J. Palansuriya, K. A. Pericleous
Simulation of 2-D Metal Cutting by Means of a Distributed Algorithm. [Citation Graph (0, 0)][DBLP] Comput. J., 1998, v:41, n:1, pp:57-63 [Journal]
|