All public logs

Combined display of all available logs of Algorithm Wiki. You can narrow down the view by selecting a log type, the username (case-sensitive), or the affected page (also case-sensitive).

• 10:37, 15 February 2023 Admin talk contribs created page Fortune and Hopcroft (k-dimensional space, l m (or l infty) norm Closest Pair Problem) (Created page with "== Time Complexity == $O(kn loglogn+n*{3}^k)$ == Space Complexity == $O(n)$ words (can be easily derived? (can re-use space from recursive calls)) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Real RAM == Year == 1979 == Reference == https://www.sciencedirect.com/science/article/pii/0020019079900851")