Author | Title | Year | Journal/Proceedings | Reftype | DOI/URL |
---|---|---|---|---|---|
Cormen, T.H. | Introduction to algorithms [BibTeX] |
2009 | book | URL | |
BibTeX:
@book{Cormen2009, author = {Cormen, Thomas H.}, title = {Introduction to algorithms}, publisher = {The MIT Press}, year = {2009}, url = {http://www.amazon.de/Introduction-Algorithms-Thomas-H-Cormen/dp/0262033844} } |
|||||
Bron, C. | Merge Sort Algorithm (Remark on Algorithm 426). [BibTeX] |
1974 | Commun. ACM Vol. 17(12), pp. 706 |
article | URL |
BibTeX:
@article{Bron1974, author = {Bron, Coenraad}, title = {Merge Sort Algorithm (Remark on Algorithm 426).}, journal = {Commun. ACM}, year = {1974}, volume = {17}, number = {12}, pages = {706}, url = {http://dblp.uni-trier.de/db/journals/cacm/cacm17.html#Bron74} } |
|||||
Hoare, C.A.R. | Quicksort | 1962 | The Computer Journal Vol. 5(1), pp. 10-16 |
article | DOI URL |
Abstract: A description is given of a new method of sorting in the random-access store of a computer. The method compares very favourably with other known methods in speed, in economy of storage, and in ease of programming. Certain refinements of the method, which may be useful in the optimization of inner loops, are described in the second part of the paper. | |||||
BibTeX:
@article{Hoare01011962, author = {Hoare, C. A. R.}, title = {Quicksort}, journal = {The Computer Journal}, year = {1962}, volume = {5}, number = {1}, pages = {10-16}, url = {http://comjnl.oxfordjournals.org/content/5/1/10.abstract}, doi = {http://dx.doi.org/10.1093/comjnl/5.1.10} } |
|||||
Hoare, C.A.R. | Algorithm 64: Quicksort. [BibTeX] |
1961 | Commun. ACM Vol. 4(7), pp. 321 |
article | URL |
BibTeX:
@article{Hoare1961, author = {Hoare, C. A. R.}, title = {Algorithm 64: Quicksort.}, journal = {Commun. ACM}, year = {1961}, volume = {4}, number = {7}, pages = {321}, url = {http://dblp.uni-trier.de/db/journals/cacm/cacm4.html#Hoare61b} } |
Created by JabRef on 27/04/2024.