The above article has been cited by the articles listed below.
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.
(*)
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.
(*)
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.
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.
Kentaro Sumigawa, Hirosuke Yamamoto,
Coding of binary AIFV code trees ,
2017 IEEE International Symposium on Information Theory (ISIT 2017), Aachen, Germany, 25-30 June 2017, pp. 1152-1156.
(*)
Shahin Mohammadi, Abbas Nowzari-Dalini,
A parallel algorithm for generation of RNA secondary structures with length n and k base-pairs ,
Iran Journal of Computer Science 1 (2018) 11-17.
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.
(*)
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.
(*)
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 .
(*)
Jackson Abascal, Lane A. Hemaspaandra, Shir Maimon, Daniel Rubery,
Closure and nonclosure properties of the classes of compressible and rankable sets ,
Journal of Computerand System Sciences 120 (2021) 162-176.
(*)
Times cited: 7 (from Web of Science)