Lower bounds for accessing binary search trees with rotations | IEEE Conference Publication | IEEE Xplore