APA (7th ed.) Citation

Lago, U. D., Zuppiroli, S., & Gabbrielli, M. (2014). Probabilistic Recursion Theory and Implicit Computational Complexity. Scientific annals of computer science, 24(2), 177. https://doi.org/10.7561/SACS.2014.2.177

Chicago Style (17th ed.) Citation

Lago, Ugo Dal, Sara Zuppiroli, and Maurizio Gabbrielli. "Probabilistic Recursion Theory and Implicit Computational Complexity." Scientific Annals of Computer Science 24, no. 2 (2014): 177. https://doi.org/10.7561/SACS.2014.2.177.

MLA (9th ed.) Citation

Lago, Ugo Dal, et al. "Probabilistic Recursion Theory and Implicit Computational Complexity." Scientific Annals of Computer Science, vol. 24, no. 2, 2014, p. 177, https://doi.org/10.7561/SACS.2014.2.177.