Learn More
This paper presents an improved analysis of a randomized parallel backtrack search algorithm (RPBS). Our analysis uses the single-node-donation model that each donation contains a single tree node. It is shown that with high probability the total number of messages generated by RPBS is O(phd) where p is the number of processors, and h and d are the height(More)
In this paper we continue the study of Lorentz sequence spaces d(w,p), 0 < p < 1, initiated by N. Popa [8]. First we show that the Mackey completion of d(w,p) is equal to d(v, 1) for some sequence v. Next, we prove that if d(w, p) (2 h, then it contains a complemented subspace isomorphic to lp. Finally we show that if limn_1(X)"=1 wi)1 = °°, tnen every(More)
  • 1