%0 Journal Article %1 Cook:1980:BSA:359024.359026 %A Cook, Curtis R. %A Kim, Do Jin %C New York, NY, USA %D 1980 %I ACM %J Commun. ACM %K seminar sorting ss2011 %P 620--624 %R http://doi.acm.org/10.1145/359024.359026 %T Best sorting algorithm for nearly sorted lists %U http://doi.acm.org/10.1145/359024.359026 %V 23

@article{Cook:1980:BSA:359024.359026, acmid = {359026}, added-at = {2011-05-18T13:04:25.000+0200}, address = {New York, NY, USA}, author = {Cook, Curtis R. and Kim, Do Jin}, biburl = {https://www.bibsonomy.org/bibtex/295b83999ce0a55963e76c41f597cf669/qhmb}, doi = {http://doi.acm.org/10.1145/359024.359026}, interhash = {b0fb6f15d570822ed1dacd0b1b56c798}, intrahash = {95b83999ce0a55963e76c41f597cf669}, issn = {0001-0782}, issue = {11}, journal = {Commun. ACM}, keywords = {seminar sorting ss2011}, month = {November}, numpages = {5}, pages = {620--624}, publisher = {ACM}, timestamp = {2011-05-18T13:04:25.000+0200}, title = {Best sorting algorithm for nearly sorted lists}, url = {http://doi.acm.org/10.1145/359024.359026}, volume = 23, year = 1980 }