Abstract
There have been many instances in the literature where an algorithm with running time of the form O(na) is improved to an algorithm with running time O(n a/ log b n) for some constants a and b. The “four Russians” algorithm for Boolean matrix multiplication is perhaps one of the most well known examples.
In this talk, we will look at a few selected recent examples of this phenomenon, including the 3-SUM problem, the problem of detecting affine degeneracy in a point set, Klee’s measure problem, and the all-pairs shortest paths problem. (The selection is not comprehensive but is biased towards the speaker’s own expertise.) Bit tricks, table lookups, and constructions of small decision trees are used to achieve many of these polylogarithmic-factor speedups, but often the applications of these techniques require interesting ideas.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chan, T.M. (2013). The Art of Shaving Logs. In: Dehne, F., Solis-Oba, R., Sack, JR. (eds) Algorithms and Data Structures. WADS 2013. Lecture Notes in Computer Science, vol 8037. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-40104-6_20
Download citation
DOI: https://doi.org/10.1007/978-3-642-40104-6_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-40103-9
Online ISBN: 978-3-642-40104-6
eBook Packages: Computer ScienceComputer Science (R0)