Christos Kaklamanis
- 1.Sandeep Bhatt and Jin-Yi Cat, Take a Walk, Grow a Tree, in Proceedings of the 29th Annual IEEE Symposium on Foundations of Computer Science, pp. 469-458. Google Scholar
Digital Library
- 2.Sandeep Bhatt, David Greenberg, Tom Leighton, and Pangfeng Liu, Tight Bounds for On-Lzne Tree Embeddings, in the Proceedings of the 2nd SIAM Symposium on Discrete Algorithms, pp. 344-350, 1991. Google ScholarDigital Library
- 3.Richard Karp and Yanjun Zhang, A randomzzed parallel branch-and-bound procedure, in Proceedings of the ACM Annual Symposium on Theory of Computing, pages 290-300, 1988. Google ScholarDigital Library
- 4.Tom Leighton, Mark Newman, Abhiram Ranade, Eric Schwabe, Dynamic Tree Embedding in Butlerflies and Hypercubes, in Proceedings of the 1st Annual ACM Symposium on Parallel Algorithms and Architectures, pp. 224-234, 1989. Google ScholarDigital Library
- 5.ibhiram Ranade, Optimal Speedup for Backtrack Search on a Bulterfly Network. In Proceedings of the 3rd Annual ACM Symposium on Parallel Algorithms and Architectures, pages 40-48, 1991. Google ScholarDigital Library
- 6.C. P. Schnorr and Adi Shamir, An optimal sorting algorithm for mesh-connected computers, in Proceedings of the ACM Annual Symposium on Theory of Computing, pages 255-263, 1986. Google ScholarDigital Library
- 7.C. T. Thompson and H. T. Kung, Sorting on a mesh-connected parallel compuler, in Communications of the ACM, 20, pages 263-270, 1977. Google Scholar
Index Terms
- Branch-and-bound and backtrack search on mesh-connected arrays of processors
Recommendations
A search-free DOA estimation algorithm for coprime arrays
Recently, coprime arrays have been in the focus of research because of their potential in exploiting redundancy in spanning large apertures with fewer elements than suggested by theory. A coprime array consists of two uniform linear subarrays with inter-...
Branch-and-bound and backtrack search on mesh-connected arrays of processors
Special issue: ACM symposium on parallel algorithms and architecturesBranch-and-bound and backtrack search on mesh-connected arrays of processors
Proceedings of the 4th ACM symposium on Parallel algorithms and architectures
Comments