Kiyomi, M., Ono, H., Otachi, Y., Schweitzer, P., & Tarui, J. (2020). Space-Efficient Algorithms for Longest Increasing Subsequence. Theory of computing systems, 64(3), 522-541. https://doi.org/10.1007/s00224-018-09908-6
Citácia podle Chicago (17th ed.)Kiyomi, Masashi, Hirotaka Ono, Yota Otachi, Pascal Schweitzer, a Jun Tarui. "Space-Efficient Algorithms for Longest Increasing Subsequence." Theory of Computing Systems 64, no. 3 (2020): 522-541. https://doi.org/10.1007/s00224-018-09908-6.
Citácia podľa MLA (8th ed.)Kiyomi, Masashi, et al. "Space-Efficient Algorithms for Longest Increasing Subsequence." Theory of Computing Systems, vol. 64, no. 3, 2020, pp. 522-541, https://doi.org/10.1007/s00224-018-09908-6.
Upozornenie: Tieto citáce sú generované automaticky. Nemusia byť úplne správne podľa citačných pravidiel..