1. Derandomization, witnesses for Boolean matrix multiplication and construction of perfect hash functions;Alon;Algorithmica,1996
2. Sorting in linear time?;Andersson;J. Comput. System Sci.,1998
3. Static dictionaries on AC0 RAMs: Query time Θ(logn/loglogn) is necessary and sufficient;Andersson,1996
4. Tight(er) worst-case bounds on dynamic searching and priority queues;Andersson,2000
5. Optimal bounds for the predecessor problem;Beame,1999