There are quite a lot papers describing near-linear algorithms. They are usually iterative, with linear complexity of one iteration. Others have $O(n\log^k n)$ time compexity.
I'm failed to find a decent source with the definition of "near-linear" time, which covers both types. Please, help me find one.