Improved Lower Bounds for Pointer Chasing: Gadgetless Lifting Outperforms Round Elimination

This research paper presents a novel technique called "gadgetless lifting" to establish an improved lower bound for the communication complexity of the k-step pointer chasing problem.