1. Sublogarithmic searching without multiplications;Andersson,1995
2. Faster deterministic sorting and searching in linear space;Andersson,1996
3. Sorting in linear time?;Andersson,1995
4. Tight(er) worst-case bounds on dynamic searching and priority queues;Andersson,2000
5. Optimal bounds for the predecessor problem and related problems;Beame;J. Comput. System Sci.,2002