A Linear Time Algorithm for Binary Tree Sequences Transformation Using Left-arm and Right-arm Rotations
Ro-Yu Wu, Jou-Ming Chang, and Yue-Li Wang
Theoretical Computer Science, Vol. 355, No. 3, (2006) pp. 303-314.

The above article has been cited by the articles listed below.
  1. Sean Cleary, Fabrizio Luccio, Linda Pagli, Refined upper bounds for right-arm rotation distances, Theoretical Computer Science 377 (2007) 277-281. (*)

  2. Joan M. Lucas, Effective splaying with restricted rotations, International Journal of Computer Mathematics 85 (2008) 717-726. (*)

  3. Jean Marcel Pallo, Weak associativity and restricted rotation, Information Processing Letters 109 (2009) 514-517. (*)

  4. Deqiang Wang, Xian Wang, Shaoxi Li, Shaofang Zhang, Diagonal-flip distance algorithms of three type triangulations, Proceedings of 2008 International Conference on Computer Science and Software Engineering (CSSE2008), Wuhan, China, 12-14 Dec. 2008, pp. 980-983.

  5. Ro-Yu Wu, Jou-Ming chang, Chir-Ho Chang, A developed restricted rotation for binary trees transformation, Proceedings of the Ninth International Conference on Hybrid Intelligent Systems (HIS-2009), Vol. 1, Shenyang, China, 2009, pp. 78-83. (*)

  6. Chan-Shuo Wu, Guan-Shieng Huang, A metric for rooted trees with unlabeled vertices based on nested parentheses, Theoretical Computer Science 411 (2010) 3923-3931. (*)

  7. Jean Marcel Pallo, Root-restricted Kleenean rotations, Information Processing Letters 111 (2010) 46-50. (*)

  8. Amin Ahmadi-Adl, Abbas Nowzari-Dalini, Hayedeh Ahrabian, Ranking and unranking algorithms for loopless generation of t-ary trees, Logic Journal of IGPL 19 (2011) 33-43. (*)

  9. Yen-Ju Chen, Jia-Jie Liu, Yue-Li Wang, An optimal rotation distance set, The Computer Journal 54 (2011) 824-830. (*)

  10. Sun Yuqiang, Yao Yingle, Xie Jinfeng, Yang Changchun, The research on parallel rotation transformation algorithm of binary tree based on PRAM model, Proceedings of the 2nd International Conference on Computer Engineering and Technology (ICCET), Vol. 3, Chengdu, China, 16-18 April 2010, pp. 560-563.

  11. Jia-Jie Liu, William Chung-Kung Yen, Yen-Ju Chen, An optimal algorithm for untangling binary trees via rotations, The Computer Journal 54 (2011) 1838-1844. (*)

  12. Fateme Ashari-Ghomi, Najme Khorasani, and Abbas Nowzari-Dalini, Ranking and unranking algorithms for k-ary trees in Gray code order, International Journal of Computational and Mathematical Sciences 6 (2012) 83-88.

  13. Ro-Yu Wu, Jou-Ming Chang, Hung-Chang Chan, Kung-Jui Pai, A loopless algorithm for generating multiple binary tree sequences simultaneously, Theoretical Computer Science 556 (2014) 25-33. (*)

  14. M. Amani, A. Nowzari-Dalini, H. Ahrabian, Generation of neuronal trees by a new three letters encoding, Computing and Informatics 33 (2014) 1428-1450. (*)

  15. Ro-Yu Wu, Jou-Ming Chang, Sheng-Lung Peng, Shun-Chieh Chang, Ranking left-weight sequences of binary trees in gray-code order, 2015 International Computer Science and Engineering Conference (ICSEC), Chiang Mai, 23-26 Nov. 2015, pp. 100-105. (*)

  16. Mahdi Amani, Abbas Nowzari-Dalini, Ranking and Unranking Algorithm for Neuronal Trees in B-order, Journal of Physical Sciences 20 (2015) 19-34.

  17. Ro-Yu Wu, Jou-Ming Chang, Sheng-Lung Peng, Chun-Liang Liu, Gray-Code ranking and unranking on left-weight sequences of binary trees, IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences E99-A (2016) 1067-1074. (*)

  18. Mahdi Amani, Abbas Nowzari-Dalini, Generation, ranking and unranking of ordered trees with degree bounds, Electronic Proceedings in Theoretical Computer Science, EPTCS 204 (2016) 31-45. (*)

  19. Kung-Jui Pai, Ro-Yu Wu, Jou-Ming Chang, Shun-Chieh Chang, Amortized efficiency of ranking and unranking left-child sequences in lexicographic order, The 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA 2016), Hong Kang, 16-18 Dec. 2016, pp. 505-518.

  20. Kung-Jui Pai, Jou-Ming Chang, Ro-Yu Wu, A constant amortized time algorithm for generating left-child sequences in lexicographic order, The 11th International Workshop on Frontiers in Algorithmics (FAW 2017), Chengdu, 23-25 June. 2017, pp. 221-232. (*)

  21. Mahdi Amani, Abbas Nowzari-Dalini, Efficient generation, ranking, and unranking of (k,m)-ary trees in B-order, Bulletin of the Iranian Mathematical Society 45 (2019) 1145-1158. (*)

  22. Mahdi Amani, Gap terminology and related combinatorial properties for AVL trees and Fibonacci-isomorphic trees, AKCE International Journal of Graphs and Combinatorics 15 (2018) 14-21. (*)

  23. Kung-Jui Pai, Jou-Ming Chang, Ro-Yu Wu, Shun-Chieh Chang, Amortized efficiency of generation, ranking and unranking left-child sequences in lexicographic order, Discrete Applied Mathematics 268 (2019) 223-236. (*)

  24. Yu-Hsuan Chang, Ro-Yu Wu, Ruay-Shiung Chang, Jou-Ming Chang, Improved algorithms for ranking and unranking (k,m)-ary trees, 13th International Conference on Algorithmic Aspects in Information and Management (AAIM 2019), Beijing, China, Aug. 6-8, 2019, Lecture Notes in Computer Science, vol. 10640, pp. 16-28. (*)

  25. Yu-Hsuan Chang, Ro-Yu Wu, Ruay-Shiung Chang, Jou-Ming Chang, Improved algorithms for ranking and unranking (k,m)-ary trees in B-order, Journal of Combinatorial Optimization. (*)

Times cited: 20 (from Web of Science)