*0011432297
*008070530s2006    xx#           000 0 eng
*019  $bk
*08230$a005.1
*100  $aSchellekens, Michel$uCenter for Efficiency-Oriented Languages (CEOL), Department of Computer Science, University College Cork, Ireland : m.schellekens@cs.ucc.ie$_160481800
*245  $aA simplified derivation of timing complexity lower bounds for sorting by comparisons
*300  $aS. [340]-346
*500  $aVitenskapelig artikkel
*5208 $aInneholder sammendrag
*650  $aAlgoritmer$2norart$_23241100
*650  $aDatastrukturer$2norart$_10005600
*650  $adifferensiering$2norart$_40088100
*653  $acomparison-based algorithms$9eng$_160481900
*653  $acomplexity$9eng$_130782000
*653  $alower bounds$9eng$_160482000
*653  $asorting$9eng$_151297200
*700  $aAgarwal, Rachit;$uCenter for Efficiency-Oriented Languages (CEOL), Department of Computer Science, University College Cork, Ireland ; Department of Microelectronic Engineering and Tyndall National Institute, University College Cork, Ireland : rachit.agarwal@ue.ucc.ie$_160482100
*700  $aMan, Ka Lok$uCenter for Efficiency-Oriented Languages (CEOL), Department of Computer Science, University College Cork, Ireland : k.man@cs.ucc.ie$_160482200
*700  $aPopovici, Emanuel;$uCenter for Efficiency-Oriented Languages (CEOL), Department of Computer Science, University College Cork, Ireland ; Department of Microelectronic Engineering and Tyndall National Institute, University College Cork, Ireland : e.popovici@ue.ucc.ie$_160482300
*773  $tNordic journal of computing$gVol. 13, nr 4 (2006)$x1236-6064$w(NO-LaBS)69800(tnr)
*999  $z700408819$anorart:700408819
^