A Simplified Derivation of Timing Complexity Lower Bounds for Sorting by Comparisons

Typeset version

 

TY  - JOUR
  - Michel Schellekens, Rachit Agarwal, Emanuel Popovici, Ka Lok Man
  - 2006
  - January
  - Nordic Journal of Computing
  - A Simplified Derivation of Timing Complexity Lower Bounds for Sorting by Comparisons
  - Published
  - ()
  - 13
  - 4
  - 316
  - 323
DA  - 2006/01
ER  - 
@article{V1194759,
   = {Michel Schellekens,  Rachit Agarwal and  Emanuel Popovici,  Ka Lok Man },
   = {2006},
   = {January},
   = {Nordic Journal of Computing},
   = {A Simplified Derivation of Timing Complexity Lower Bounds for Sorting by Comparisons},
   = {Published},
   = {()},
   = {13},
   = {4},
  pages = {316--323},
  source = {IRIS}
}
AUTHORSMichel Schellekens, Rachit Agarwal, Emanuel Popovici, Ka Lok Man
YEAR2006
MONTHJanuary
JOURNAL_CODENordic Journal of Computing
TITLEA Simplified Derivation of Timing Complexity Lower Bounds for Sorting by Comparisons
STATUSPublished
TIMES_CITED()
SEARCH_KEYWORD
VOLUME13
ISSUE4
START_PAGE316
END_PAGE323
ABSTRACT
PUBLISHER_LOCATION
ISBN_ISSN
EDITION
URL
DOI_LINK
FUNDING_BODY
GRANT_DETAILS