APA (7th ed.) Citation

Paolini, L., Piccolo, M., & Roversi, L. (2020). A class of Recursive Permutations which is Primitive Recursive complete. Theoretical Computer Science, 813, 218. https://doi.org/10.1016/j.tcs.2019.11.029

Chicago Style (17th ed.) Citation

Paolini, Luca, Mauro Piccolo, and Luca Roversi. "A Class of Recursive Permutations Which Is Primitive Recursive Complete." Theoretical Computer Science 813 (2020): 218. https://doi.org/10.1016/j.tcs.2019.11.029.

MLA (9th ed.) Citation

Paolini, Luca, et al. "A Class of Recursive Permutations Which Is Primitive Recursive Complete." Theoretical Computer Science, vol. 813, 2020, p. 218, https://doi.org/10.1016/j.tcs.2019.11.029.