Speeding up the Four Russians Algorithm by About One More Logarithmic Factor

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]

Abstract

Abstract is missing.