Alan Gibbons
- 1.A.M. Gibbons, A tutorial introduction to distributed memory models of parallel computation, Research report 185~ Dep~rtment of Computer Science, University of W~rwick, Muy 1991. Google Scholar
Digital Library
- 2.A.M. Gibbons and W. Rytter, Efficient P~raim Algorithms, Cambridge University Press, Cambridge, 1988.Google Scholar
- 3.A.M. Gibbons and Y.N. Srikant, A class of problems efficiently solvable on the meshconnected computer including dynamic expression evaluation, Information Processing Letters 32 (1989) 305-311. Google ScholarDigital Library
- 4.A.M. Gibbons and R. Ziani, The balanced binary tree technique on mesh-connected computers, Information Processing Letters ~7 (199 ) 101- 09. Google ScholarDigital Library
- 5.D. Nassimi and S. Sahni, An optimal routing algorithm for mesh-connected parallel computers, Journal of the ACM 27 (1980) 6-29. Google ScholarDigital Library
- 6.D. Nassimi and S. Sahni, Finding connected components and connected ones on a meshconnected computer, SIAM J. Computing 9 (1980) 744-757.Google Scholar
- 7.D. B. Skillicorn, Architecture-independent parallel computation, 1EEE Computer 23 (1990) 38-50. Google ScholarDigital Library
- 8.C. Thompson and H.T. Kung, Sorting on a mesh-connected parallel computer, Communications of the ACM 20 (1977) 263-271. Google ScholarDigital Library
- 9.L.G. Valiant, General purpose parallel architectures, in Chapter 18, Handbook of Theoretical Computer Science, Volume A, Jaa van Leeuwen (ed), Elsevier Science Publishers, 1990. Google ScholarDigital Library
- 10.L.G. Valiant and G.J. Brebner, Universal schemes for parallel computation, Proceedings 13th A CM Symposium on Theory of Computing (1981) 263-277. Google ScholarDigital Library
Index Terms
- Dense edge-disjoint embedding of binary trees in the mesh
Comments