Gaither, J., Homma, Y., Sellke, M., & Ward, M. D. (2012). On the Number of 2-Protected Nodes in Tries and Suffix Trees. Discrete mathematics and theoretical computer science, DMTCS Proceedings vol. AQ,...(Proceedings), 381-398. https://doi.org/10.46298/dmtcs.3008
Chicago Style (17th ed.) CitationGaither, Jeffrey, Yushi Homma, Mark Sellke, and Mark Daniel Ward. "On the Number of 2-Protected Nodes in Tries and Suffix Trees." Discrete Mathematics and Theoretical Computer Science DMTCS Proceedings vol. AQ,..., no. Proceedings (2012): 381-398. https://doi.org/10.46298/dmtcs.3008.
MLA (9th ed.) CitationGaither, Jeffrey, et al. "On the Number of 2-Protected Nodes in Tries and Suffix Trees." Discrete Mathematics and Theoretical Computer Science, vol. DMTCS Proceedings vol. AQ,..., no. Proceedings, 2012, pp. 381-398, https://doi.org/10.46298/dmtcs.3008.