We are experiencing minor difficulties with our submission forms, which we are working to resolve. If you have any issues while submitting items, please contact us at dspace-lib@mit.edu.

On Lower Bounds for Selection Problems

Thumbnail Image
Download
Name

MIT-LCS-TR-121.pdf

Size

1.41 MB

Format

Adobe PDF

Checksum (MD5)

22ca2402c1a4748e72530c4d65961a0b

Author(s)
Yao, Foong Frances
Date Issued
March 1974
Series/Report no.
MIT-LCS-TR-121
MAC-TR-121
Abstract
Let V i (n) be the minimum number of binary comparisons that are required to determine the i-th largest of n elements drawn from a totally ordered set. In this thesis we use adversary strategies to prove lower bounds on V i (n). For i = 3, our lower bounds determine V 3(n) precisely for infinitely many values of n,and determine V 3(n) to within 2 for all n.
Persistent DSpace Link
PrivacyPermissionsAccessibilityContact us
Notify us about copyright concerns.