MIT Libraries logoDSpace@MIT

MIT
View Item 
  • DSpace@MIT Home
  • Computer Science and Artificial Intelligence Lab (CSAIL)
  • LCS Publications
  • LCS Technical Reports (1974 - 2003)
  • View Item
  • DSpace@MIT Home
  • Computer Science and Artificial Intelligence Lab (CSAIL)
  • LCS Publications
  • LCS Technical Reports (1974 - 2003)
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

On Lower Bounds for Selection Problems

Author(s)
Yao, Foong Frances
Thumbnail
DownloadMIT-LCS-TR-121.pdf (1.407Mb)
Metadata
Show full item record
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.
Date issued
1974-03
URI
https://hdl.handle.net/1721.1/149426
Series/Report no.
MIT-LCS-TR-121MAC-TR-121

Collections
  • LCS Technical Reports (1974 - 2003)
  • MAC Technical Reports (1963 - 1974)

Browse

All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

My Account

Login

Statistics

OA StatisticsStatistics by CountryStatistics by Department
MIT Libraries
PrivacyPermissionsAccessibilityContact us
MIT
Content created by the MIT Libraries, CC BY-NC unless otherwise noted. Notify us about copyright concerns.