Karl Bringmann, Philip Wellnitz. On Near-Linear-Time Algorithms for Dense Subset Sum. In Dániel Marx, editor, Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, SODA 2021, Virtual Conference, January 10 - 13, 2021. pages 1777-1796, SIAM, 2021. [doi]
@inproceedings{BringmannW21, title = {On Near-Linear-Time Algorithms for Dense Subset Sum}, author = {Karl Bringmann and Philip Wellnitz}, year = {2021}, doi = {10.1137/1.9781611976465.107}, url = {https://doi.org/10.1137/1.9781611976465.107}, researchr = {https://researchr.org/publication/BringmannW21}, cites = {0}, citedby = {0}, pages = {1777-1796}, booktitle = {Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, SODA 2021, Virtual Conference, January 10 - 13, 2021}, editor = {Dániel Marx}, publisher = {SIAM}, isbn = {978-1-61197-646-5}, }