Recursive hyperstructures

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

E. A. Varvarigos and D. P. Bertsekas, “Transposition of banded matrices in hypercubes: a nearly isotropic task,” Parallel Computing,21, 243–264 (1995).
Article MATH MathSciNet Google Scholar
V. Lakamsani, L. N. Bhuyan, and D. S. Linthicum, “Mapping molecular dynamics computations onto hypercubes,” Parallel Computing,21, No. 6 993–1014 (1995).
Article MATH Google Scholar
M. Atallah and D. Chen, “Optimal parallel hypercube algorithms for polygon problems,” IEEE Trans. Comput.,44, No. 7, 914–922 (1995).
Article MATH Google Scholar
Y. Chang and L. N. Bhygu, “Reliability of combinatorial analysis of subcube hypercubes,” IEEE Trans. Comput.,44, No. 7, 952–956 (1995).
Article MATH Google Scholar
F. T. Hady and B. L. Memzes, “The performance of crossbar-based binary hypercubes,” IEEE Trans. Comput.,44, No. 10, 1208–1215 (1995).
Article MATH Google Scholar
P. Cull and S. M. Larson, “The Mobius cubes,” IEEE Trans. Comput.,44, No. 5, 647–659 (1995).
Article MATH MathSciNet Google Scholar
V. Heun and E. W. Mayer, “A new efficient algorithm for embedding an arbitrary binary tree into its optimal hypercube,” J. Algorithms,20, 375–399 (1996).
Article MATH MathSciNet Google Scholar

Authors

A. V. Anisimov
View author publications
You can also search for this author in PubMed Google Scholar

Translated from Kibernetika i Sistemnyi Analiz, No. 3, pp. 148–157, May–June, 1997.

Anisimov, A.V. Recursive hyperstructures. Cybern Syst Anal 33, 426–432 (1997). https://doi.org/10.1007/BF02733077

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.