Peca-Medlin, J., & Zhong, C. (2024). On the longest increasing subsequence and number of cycles of butterfly permutations.
Style de citation Chicago (17e éd.)Peca-Medlin, John, et Chenyang Zhong. On the Longest Increasing Subsequence and Number of Cycles of Butterfly Permutations. 2024.
Style de citation MLA (9e éd.)Peca-Medlin, John, et Chenyang Zhong. On the Longest Increasing Subsequence and Number of Cycles of Butterfly Permutations. 2024.
Attention : ces citations peuvent ne pas être correctes à 100%.