A Loopless Algorithm for Generating Multiple Binary Tree Sequences Simultaneously
Ro-Yu Wu, Jou-Ming Chang, Hung-Chang Chan, Kung-Jui Pai
Theoretical Computer Science, Vol. 556, (2014) pp. 25-33.

The above article has been cited by the articles listed below.
  1. 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. 1-6. (*)

  2. 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. (*)

  3. 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.

  4. 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. (*)

  5. 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. (*)

  6. 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. (*)

  7. Yu-Hsuan Chang, Ro-Yu Wu, Cheng-Kuan Lin, Jou-Ming Chang, A loopless algorithm for generating (k,m)-ary trees in Gray code order, Optimization Letters 15(4) (2021) 1133-1154. (*)

  8. James F. Korsh, Counting and randomly generating k-ary trees, Applied Mathematics 12(12) (2021) 1210-1215.

  9. 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: 7 (from Web of Science)