Information bounds are good for search problems on ordered data structures | IEEE Conference Publication | IEEE Xplore