Beauquier, J., Blanchard, P., Burman, J., & Delaët, S. (2013). Tight complexity analysis of population protocols with cover times — The ZebraNet example. Theoretical Computer Science, 512, 15. https://doi.org/10.1016/j.tcs.2012.10.032
Chicago Style (17th ed.) CitationBeauquier, J., P. Blanchard, J. Burman, and S. Delaët. "Tight Complexity Analysis of Population Protocols with Cover Times — The ZebraNet Example." Theoretical Computer Science 512 (2013): 15. https://doi.org/10.1016/j.tcs.2012.10.032.
MLA (9th ed.) CitationBeauquier, J., et al. "Tight Complexity Analysis of Population Protocols with Cover Times — The ZebraNet Example." Theoretical Computer Science, vol. 512, 2013, p. 15, https://doi.org/10.1016/j.tcs.2012.10.032.
Warning: These citations may not always be 100% accurate.