Ranking and Unranking of Non-regular Trees in Gray-code Order
Ro-Yu Wu, Jou-Ming Chang An-Hang Chen and Ming-Tat Ko
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, Vol. E96-A, No. 6 (2013) pp. 1059-1065.

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

  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. Nader H. Bshouty, Nuha Diab, Shada R. Kawar, Robert J. Shahla, Enumerating all the irreducible polynomials over finite field, arXiv:1602.05032v3 [cs.DM], 11 Aug. 2016.

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

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

Times cited: 3 (from Web of Science)