Timothy M. Chan. Speeding up the Four Russians Algorithm by About One More Logarithmic Factor. In Piotr Indyk, editor, Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2015, San Diego, CA, USA, January 4-6, 2015. pages 212-217, SIAM, 2015. [doi]
@inproceedings{Chan15-1, title = {Speeding up the Four Russians Algorithm by About One More Logarithmic Factor}, author = {Timothy M. Chan}, year = {2015}, doi = {10.1137/1.9781611973730.16}, url = {http://dx.doi.org/10.1137/1.9781611973730.16}, researchr = {https://researchr.org/publication/Chan15-1}, cites = {0}, citedby = {0}, pages = {212-217}, booktitle = {Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2015, San Diego, CA, USA, January 4-6, 2015}, editor = {Piotr Indyk}, publisher = {SIAM}, isbn = {978-1-61197-373-0}, }