%0 Journal Article %1 journals/njc/SchellekensAPM06 %A Schellekens, Michel P. %A Agarwal, Rachit %A Popovici, Emanuel M. %A Man, Ka Lok %D 2006 %J Nord. J. Comput. %K dblp %N 4 %P 340-346 %T A Simplified Derivation of Timing Complexity Lower Bounds for Sorting by Comparisons. %U http://dblp.uni-trier.de/db/journals/njc/njc13.html#SchellekensAPM06 %V 13

@article{journals/njc/SchellekensAPM06, added-at = {2012-06-12T00:00:00.000+0200}, author = {Schellekens, Michel P. and Agarwal, Rachit and Popovici, Emanuel M. and Man, Ka Lok}, biburl = {https://puma.ub.uni-stuttgart.de/bibtex/29b4c0b7b058eaf40328813941609fcdf/dblp}, interhash = {f77efb63330d7b1bb66a0ce5748e0dc0}, intrahash = {9b4c0b7b058eaf40328813941609fcdf}, journal = {Nord. J. Comput.}, keywords = {dblp}, number = 4, pages = {340-346}, timestamp = {2016-02-02T09:50:30.000+0100}, title = {A Simplified Derivation of Timing Complexity Lower Bounds for Sorting by Comparisons.}, url = {http://dblp.uni-trier.de/db/journals/njc/njc13.html#SchellekensAPM06}, volume = 13, year = 2006 }