Bringmann, Karl Algorithms and Complexity, MPI for Informatics, Max Planck Society;
Bringmann, K. (2017). A Near-Linear Pseudopolynomial Time Algorithm for Subset Sum. In P. N. Klein (Ed.), Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 1073-1084). Philadelphia, PA: SIAM. doi:10.1137/1.9781611974782.69.