Angelopoulos, S., & Borodin, A. (2010). Randomized priority algorithms. Theoretical computer science, 411(26), 2542-2558. https://doi.org/10.1016/j.tcs.2010.03.014
Citace podle Chicago (17th ed.)Angelopoulos, Spyros, a Allan Borodin. "Randomized Priority Algorithms." Theoretical Computer Science 411, no. 26 (2010): 2542-2558. https://doi.org/10.1016/j.tcs.2010.03.014.
Citace podle MLA (9th ed.)Angelopoulos, Spyros, a Allan Borodin. "Randomized Priority Algorithms." Theoretical Computer Science, vol. 411, no. 26, 2010, pp. 2542-2558, https://doi.org/10.1016/j.tcs.2010.03.014.
Upozornění: Tyto citace jsou generovány automaticky. Nemusí být zcela správně podle citačních pravidel..