Citace podle APA (7th ed.)

Atef, A., Hagras, T., Mahdy, Y. B., & Janeček, J. (2017). Lower-bound complexity algorithm for task scheduling on heterogeneous grid. Computing, 99(11), 1125-1145. https://doi.org/10.1007/s00607-017-0558-5

Citace podle Chicago (17th ed.)

Atef, Asmaa, Tarek Hagras, Yousef B. Mahdy, a Jan Janeček. "Lower-bound Complexity Algorithm for Task Scheduling on Heterogeneous Grid." Computing 99, no. 11 (2017): 1125-1145. https://doi.org/10.1007/s00607-017-0558-5.

Citace podle MLA (9th ed.)

Atef, Asmaa, et al. "Lower-bound Complexity Algorithm for Task Scheduling on Heterogeneous Grid." Computing, vol. 99, no. 11, 2017, pp. 1125-1145, https://doi.org/10.1007/s00607-017-0558-5.

Upozornění: Tyto citace jsou generovány automaticky. Nemusí být zcela správně podle citačních pravidel..