References
- Acharya, T., Mukherjee, A. (1995). A tree based binary encoding of text using LZW algorithm. Data Compression Conference (DCC’95). Los Alamitos, CA: IEEE Computer Society Press. pp. 463–470.
- Bein, W.W., Larmore, L.L., Shields, J.C., Hal, I. (2002). Fixed layer embeddings of binary trees. International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN’02). Manila, Philippines: IEEE Computer Society. pp. 281–289.
- Bettayeb, S., Kulasinghe, P. (1995). Embedding binary trees into crossed cubes. IEEE Trans. Comput. 44:923–929.
- Chai, B.B., Zhuang, X., Zhao, Y., Sliansky, J. (1996), Binary linear decision tree with genetic algorithm. 13th International Conference on Pattern Recognition (ICPR’96), Vol. 4, pp. 530–538.
- Cochran, W.G. (2005). Sampling Techniques (5th edn.). New York, NY: Wiley.
- Deo, N. (2001). Graph Theory with Application to Engineering and Computer Science (Eastern Economy Edition). New Delhi: Prentice-Hall.
- Ebcioglu, K., Fritts, J., Kosonocky, S., Gschwind, M., Altman, E., Kailas, K., Bright, T. (1998). An eight issue tree-VLIW processor for dynamic binary translation. IEEE International Conference on Computer Design (ICCD’98), pp. 488–496.
- Fu, T.C., Chung, F.L., Luk, R., Ng, C.M. (2005). SBT-Forest, an indexing approach for specialized binary tree. 3rd International Conference on Information Technology and Application (ICITA’05), Vol. 1, pp. 149–154.
- Huang, C.H., Hsiao, J.Y., Lee, R.C. T., Fang, J.F. (1999). An optimal embedding of incomplete binary trees onto incomplete hypercube. International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN’99), pp. 509–516.
- Jia-Wei, H., Rosenberg, A.L. (1981). Graphs that are almost binary trees (Preliminary Version). Proceedings of the 13th Annual ACM Symposium on Theory of Computing STOC’81, pp. 210–218.
- Manul, P., Rajsingh, I., Rajan, B., Prabha, R. (2007). Rapture degree of binary trees. Proceedings of International Conference on Mathematics and Computer Science, ICMCS. Winnipeg, Manitoba, Canada: The Charles Babbage Research Centre. pp. 11–13.
- Masum, S.M., Ali, A.A. (2006). Maintaining a binary tree structure for mobile ad hoc computing. 11th IEEE Symposium on Computers and Communications (ISCC’06), pp. 201–206.
- Shukla, D. (2002). F-T estimator under two-phase sampling. Metron 60:97–106.
- Singh, D., Choudhary, F.S. (1986). Theory and Analysis of Sample Survey Design. New Delhi: Wiley Eastern.
- Singh, V.K., Shukla, D. (1987). One parameter family of factor-type ratio estimator. Metron 45(1–2):273–283
- Sukhatme, P.V., Sukhatme, B.V., Sukhatme, S., Ashok, C. (1984). Sampling Theory of Surveys with Applications. New Delhi: Iowa State University Press, I.S.A.S. Publication.
- Vaishnavi, V.K. (1989). Multidimensional balanced binary trees. IEEE Trans. Comput. 38:968–985.
- Xiang, L., Cheng, K., Ushijiam, K. (2005). Encoding a binary search tree in constant time on BSR. 6th International Conference on Parallel and Distributed Computing Applications and Technologies (PDCAT’05), pp. 740–744.