On the arrangement complexity of uniform trees
This paper studies the arrangement problem of uniform trees and shows that the arrangement complexity of a uniform tree is either θ(1) or Ω((lg n)γ)(γ > 0). It also presents a recursive algorithm to compute the optimal complete arrangements for θ(1) arrangeable balanced uniform trees.
Unable to display preview. Download preview PDF.
- [BeHa90]B. Becker, and J. Hartmann. Optimal-Time Multipliers and C-Testability. Proceedings of the 2nd Annual Symposium on Parallel Algorithms and Architectures, pp.146–154, 1990.Google Scholar
- [BeSp91]B. Becker, and U. Sparmann. Computations over Finite Monoids and their Test Complexity. Theoretical Computer Science, pp.225–250, 1991.Google Scholar
- [FSTH90]R. Fritzemeier, J. Soden, R. K. Treece, and C. Hawkins. Increased CMOS IC stuck-at fault coverage with reduced IDDQ test sets. International Test Conference, pp.427–435, 1990Google Scholar
- [HoWu95]G. Hotz, H. Wu. “On the Arrangement Complexity of Uniform Trees”, Technical Report, SFB 124-B1, 05/1995, FB-14, Informatik, Universität des Saarlandes, Germany.Google Scholar
- [Wu92]H. Wu. On Tests of Uniform Tree Circuits. Proceeding of CONPAR VAPP V, pp.527–538, 1992.Google Scholar
- [WuSp92]H. Wu, U. Sparmann. On the Assignments Complexity of Tree VLSI Systems. Proceeding of 7th International Symposium on Computer and Information Sciences, pp.97–103, 1992.Google Scholar
- [Wu93]H. Wu. On the Assignments Complexity of Uniform Trees. Proceeding of International Symposium on Symbolic and Algebraic Computation, ISSAC' 93, pp.95–104.Google Scholar
- [Wu94]H. Wu. On the Test Complexity of VLSI Systems, Dissertation, University of Saarland, 1994Google Scholar