|
Journals in DBLP
BIT 1986, volume: 26, number: 1
- Becky Chan, Selim G. Akl
Generating Combinations in Parallel. [Citation Graph (0, 0)][DBLP] BIT, 1986, v:26, n:1, pp:2-6 [Journal]
- R. C. Chang, Richard C. T. Lee
An O(N log N) Minimal Spanning Tree Algorithm for N Points in the Plane. [Citation Graph (0, 0)][DBLP] BIT, 1986, v:26, n:1, pp:7-16 [Journal]
- Guy Louchard
Brownian Motion and Algorithm Complexity. [Citation Graph (0, 0)][DBLP] BIT, 1986, v:26, n:1, pp:17-34 [Journal]
- Michael J. Quinn, Narsingh Deo
An Upper Bound for the Speedup of Parallel Best-Bound Branch-And-Bound Algorithms. [Citation Graph (0, 0)][DBLP] BIT, 1986, v:26, n:1, pp:35-43 [Journal]
- Pawel Winter
An Algorithm for the Enumeration of Spanning Trees. [Citation Graph (0, 0)][DBLP] BIT, 1986, v:26, n:1, pp:44-62 [Journal]
|