Bringmann, K., Grandoni, F., Saha, B., Williams, V. V., & Laboratory, M. I. o. T. C. S. a. A. I. (2021). Truly Subcubic Algorithms for Language Edit Distance and RNA Folding via Fast Bounded-Difference Min-Plus Product. Society for Industrial & Applied Mathematics (SIAM).
Chicago-viite (17. p.)Bringmann, Karl, Fabrizio Grandoni, Barna Saha, Virginia Vassilevska Williams, ja Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory. Truly Subcubic Algorithms for Language Edit Distance and RNA Folding via Fast Bounded-Difference Min-Plus Product. Society for Industrial & Applied Mathematics (SIAM), 2021.
MLA-viite (9. p.)Bringmann, Karl, et al. Truly Subcubic Algorithms for Language Edit Distance and RNA Folding via Fast Bounded-Difference Min-Plus Product. Society for Industrial & Applied Mathematics (SIAM), 2021.