APA (7th ed.) Citation

Chang, Z., Wang, Q., & Xue, J. (2025). An effective approach to enumerate universal cycles for k-permutations. Cryptography & Communications, 17(4), 977. https://doi.org/10.1007/s12095-025-00798-3

Chicago Style (17th ed.) Citation

Chang, Zuling, Qiang Wang, and Jie Xue. "An Effective Approach to Enumerate Universal Cycles for K-permutations." Cryptography & Communications 17, no. 4 (2025): 977. https://doi.org/10.1007/s12095-025-00798-3.

MLA (9th ed.) Citation

Chang, Zuling, et al. "An Effective Approach to Enumerate Universal Cycles for K-permutations." Cryptography & Communications, vol. 17, no. 4, 2025, p. 977, https://doi.org/10.1007/s12095-025-00798-3.