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

Typeset version

 

TY  - JOUR
  - Schellekens, Michel P and Agarwal, Rachit and Popovici, Emanuel M and Man, Ka Lok
  - 2006
  - January
  - Nord. J. Comput.
  - A Simplified Derivation of Timing Complexity Lower Bounds for Sorting by Comparisons.
  - Validated
  - 13
  - 4
  - 340
  - 346
DA  - 2006/01
ER  - 
@article{V277991438,
   = {Schellekens, Michel P and Agarwal, Rachit and Popovici, Emanuel M and Man, Ka Lok},
   = {2006},
   = {January},
   = {Nord. J. Comput.},
   = {A Simplified Derivation of Timing Complexity Lower Bounds for Sorting by Comparisons.},
   = {Validated},
   = {13},
   = {4},
  pages = {340--346},
  source = {IRIS}
}
AUTHORSSchellekens, Michel P and Agarwal, Rachit and Popovici, Emanuel M and Man, Ka Lok
YEAR2006
MONTHJanuary
JOURNALNord. J. Comput.
TITLEA Simplified Derivation of Timing Complexity Lower Bounds for Sorting by Comparisons.
STATUSValidated
PEER_REVIEW
SEARCH_KEYWORD
VOLUME13
ISSUE4
START_PAGE340
END_PAGE346
ABSTRACT
PUBLISHER_LOCATION
EDITORS
PUBLISHER
ISBN_ISSN
EDITION
URL
DOI_LINK
FUNDING_BODY
GRANT_DETAILS