Balliu, A., Brandt, S., Chang, Y., Olivetti, D., Studený, J., Suomela, J., & Tereshchenko, A. (2023). Locally checkable problems in rooted trees. Distributed computing, 36(3), 277-311. https://doi.org/10.1007/s00446-022-00435-9
Citace podle Chicago (17th ed.)Balliu, Alkida, Sebastian Brandt, Yi-Jun Chang, Dennis Olivetti, Jan Studený, Jukka Suomela, a Aleksandr Tereshchenko. "Locally Checkable Problems in Rooted Trees." Distributed Computing 36, no. 3 (2023): 277-311. https://doi.org/10.1007/s00446-022-00435-9.
Citace podle MLA (9th ed.)Balliu, Alkida, et al. "Locally Checkable Problems in Rooted Trees." Distributed Computing, vol. 36, no. 3, 2023, pp. 277-311, https://doi.org/10.1007/s00446-022-00435-9.
Upozornění: Tyto citace jsou generovány automaticky. Nemusí být zcela správně podle citačních pravidel..