Métivier, Y., Robson, J. M., Saheb-Djahromi, N., & Zemmari, A. (2011). An optimal bit complexity randomized distributed MIS algorithm. Distributed computing, 23(5-6), 331-340. https://doi.org/10.1007/s00446-010-0121-5
Citace podle Chicago (17th ed.)Métivier, Y., J. M. Robson, N. Saheb-Djahromi, a A. Zemmari. "An Optimal Bit Complexity Randomized Distributed MIS Algorithm." Distributed Computing 23, no. 5-6 (2011): 331-340. https://doi.org/10.1007/s00446-010-0121-5.
Citace podle MLA (9th ed.)Métivier, Y., et al. "An Optimal Bit Complexity Randomized Distributed MIS Algorithm." Distributed Computing, vol. 23, no. 5-6, 2011, pp. 331-340, https://doi.org/10.1007/s00446-010-0121-5.
Upozornění: Tyto citace jsou generovány automaticky. Nemusí být zcela správně podle citačních pravidel..