Tight(er) worst-case bounds on dynamic searching and priority queues (2000)

by A Andersson, M Thorup
Venue:In Proc. 32nd ACM Symposium on Theory of Computing (STOC