QuickSearch:   Number of matching entries: 0.

AuthorTitleYearJournal/ProceedingsReftypeDOI/URL
Saake, G. & Sattler, K.-U. Algorithmen und Datenstrukturen: Eine Einführung mit Java 2010   book  
BibTeX:
@book{SaakeCode2006,
  author = {Saake, Gunter and Sattler, Kai-Uwe},
  title = {Algorithmen und Datenstrukturen: Eine Einführung mit Java},
  publisher = {dpunkt.verlag Heidelberg},
  year = {2010},
  volume = {4}
}
Gruber, H., Holzer, M. & Ruepp, O. Sorting the slow way: an analysis of perversely awful randomized sorting algorithms 2007 Proceedings of the 4th international conference on Fun with algorithms   inproceedings URL  
Abstract: This paper is devoted to the "Discovery of Slowness." The archetypical perversely awful algorithm bogo-sort, which is sometimes referred to as Monkey-sort, is analyzed with elementary methods. Moreover, practical experiments are performed.
BibTeX:
@inproceedings{Gruber:2007:SSW:1760607.1760624,
  author = {Gruber, Hermann and Holzer, Markus and Ruepp, Oliver},
  title = {Sorting the slow way: an analysis of perversely awful randomized sorting algorithms},
  booktitle = {Proceedings of the 4th international conference on Fun with algorithms},
  publisher = {Springer-Verlag},
  year = {2007},
  pages = {183--197},
  url = {http://portal.acm.org/citation.cfm?id=1760607.1760624}
}
Knuth, D. E. Sorting and searching. 1973 Sorting and searching   book  
BibTeX:
@book{{knuth}1973computer,
  author = {{Knuth}, D. E.},
  title = {Sorting and searching.},
  booktitle = {Sorting and searching},
  year = {1973},
  volume = {3}
}
Knuth, D. E. The art of computer programming. Vol.3: Sorting and searching 1973 Atmospheric Chemistry & Physics   book  
BibTeX:
@book{1973acp..book.....K,
  author = {{Knuth}, D. E.},
  title = {{The art of computer programming. Vol.3: Sorting and searching}},
  booktitle = {Atmospheric Chemistry \& Physics},
  year = {1973}
}
Martin, W. A. Sorting 1971 ACM Comput. Surv.   article DOIURL  
BibTeX:
@article{Martin:1971:SOR:356593.356594,
  author = {Martin, W. A.},
  title = {Sorting},
  journal = {ACM Comput. Surv.},
  publisher = {ACM},
  year = {1971},
  volume = {3},
  pages = {147--174},
  url = {http://doi.acm.org/10.1145/356593.356594},
  doi = {http://doi.acm.org/10.1145/356593.356594}
}
Hoare, C. A. R. Quicksort 1962 The Computer Journal   article DOIURL  
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{Quicksort,
  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/cgi/content/abstract/5/1/10},
  doi = {http://dx.doi.org/10.1093/comjnl/5.1.10}
}

Created by JabRef export filters on 26/04/2024 by the social publication management platform PUMA