JCO
2010
13 years 10 months ago
2010
In this paper, we construct a dz-disjunct matrix with the orthogonal spaces over finite fields of odd characteristic. We consider the arrangement problem of d (m−1,2(s −1),s ...
SPAA
1990
ACM
14 years 3 months ago
1990
ACM
We give the first efficient parallel algorithms for solving the arrangement problem. We give a deterministic algorithm for the CREW PRAM which runs in nearly optimal bounds of O(lo...