APA (7th ed.) Citation

Currie, J. D., Mol, L., & Rampersad, N. (2020). The repetition threshold for binary rich words. Discrete Mathematics and Theoretical Computer Science, 22 no. 1(Analysis of Algorithms), 1-16. https://doi.org/10.23638/DMTCS-22-1-6

Chicago Style (17th ed.) Citation

Currie, James D., Lucas Mol, and Narad Rampersad. "The Repetition Threshold for Binary Rich Words." Discrete Mathematics and Theoretical Computer Science 22 no. 1, no. Analysis of Algorithms (2020): 1-16. https://doi.org/10.23638/DMTCS-22-1-6.

MLA (9th ed.) Citation

Currie, James D., et al. "The Repetition Threshold for Binary Rich Words." Discrete Mathematics and Theoretical Computer Science, vol. 22 no. 1, no. Analysis of Algorithms, 2020, pp. 1-16, https://doi.org/10.23638/DMTCS-22-1-6.