Information Bounds Are Good for Search Problems on Ordered Data Structures

Nathan Linial, Michael E. Saks

Browse the full FOCS paper archive.