On the Hardness Hierarchy for the O(n√log n) Complexity in the Word RAM.

Dominik Kempa, Tomasz Kociumaka

Browse the full STOC paper archive.