@article{henglein2009sorting,
  abstract = {What is a sorting function—not a sorting function for a given ordering relation, but a sorting function with nothing given? Formulating four basic properties of sorting algorithms as defining requirements, we arrive at intrinsic notions of sorting and stable sorting: A function is a sorting function if and only it is an intrinsically parametric permutation function. It is a stable sorting function if and only if it is an intrinsically stable permutation function. We show that ordering relations can be represented isomorphically as inequality tests, comparators and stable sorting functions, each with their own intrinsic characterizations, which in turn provide a basis for run-time monitoring of their expected I/O behaviors. The isomorphisms are parametrically polymorphically definable, which shows that it is sufficient to provide any one of the representations since the others are derivable without compromising data abstraction. Finally we point out that stable sorting functions as default representations of ordering relations have the advantage of permitting linear-time sorting algorithms; inequality tests forfeit this possibility.},
  author = {Henglein, Fritz},
  interhash = {6d54b43dd143a9da6bbb2b98dc1d17be},
  intrahash = {0ecd29a882b7917c1633bc4f817428f6},
  journal = {Journal of Logic and Algebraic Programming},
  month = {1},
  number = 7,
  title = {What is a Sorting Function?},
  uniqueid = {S1567832608001094|edselp},
  volume = 78,
  year = 2009
}

@misc{khamitka2009folklore,
  abstract = {The objective of this paper is to review the folklore knowledge seen in research work devoted on synthesis, optimization, and effectiveness of various sorting algorithms. We will examine sorting algorithms in the folklore lines and try to discover the tradeoffs between folklore and theorems. Finally, the folklore knowledge on complexity values of the sorting algorithms will be considered, verified and subsequently converged in to theorems.},
  author = {Khamitka, Santosh and Bhalchandra, Parag and Lokhande, Sakharam and Deshmukh, Nilesh},
  interhash = {18d6db8831aaa6a361f6ea471bb44954},
  intrahash = {fd29675b0e34296757bca824fa92d6e5},
  month = {9},
  title = {The Folklore of Sorting Algorithms},
  uniqueid = {cog.6714|edscog},
  year = 2009
}

@article{franceschini2005inplace,
  abstract = {We present the first in-place algorithm for sorting an array of size n that performs, in the worst case, at most O(n log n) element comparisons and O(n) element transports. This solves a long-standing open problem, stated explicitly, for example, in Munro and Raman [1992], of whether there exists a sorting algorithm that matches the asymptotic lower bounds on all computational resources simultaneously. [ABSTRACT FROM AUTHOR]},
  author = {Franceschini, Gianni and Geffert, Viliam},
  interhash = {6811ae48c9759f7a67eb6cbf48e06296},
  intrahash = {85343dde3d3317cc952a4b70ffee58c7},
  journal = {Journal of the ACM},
  month = {7},
  number = 4,
  title = {An In-Place Sorting with O(n log n) Comparisons and O(n) Moves.},
  uniqueid = {18067174|buh},
  volume = 52,
  year = 2005
}

@misc{mn1987sorting,
  abstract = {Computers and the tasks they perform are becoming increasingly important in medicine. It behooves medical personnel to become familiar with some computer functions so that they may be in a better position to demand and evaluate a given implementation. One very basic computer task is sorting information. Some general principles of computing efficiency are discussed, as well as the standard "O" notation. A simple sort, bubblesort, is discussed and analyzed. A second elementary sort, insertionsort, is considered in relation to its more sophisticated descendant, shellsort. The most efficient in-memory sort, quicksort (and its various descendants), is likewise examined, and the advantages and disadvantages of each variant are discussed in some detail, as well as methods that may enhance speed and resource utilization. Finally, mergesort, which is used in sorting large files resident in mass-storage devices, is discussed, along with its particular advantages.},
  author = {MN, Skaredoff},
  interhash = {b801a748477ac40e51cc3cda657e55e1},
  intrahash = {7407e011027586d60c6d21f99926ff74},
  journal = {Journal Of Clinical Monitoring},
  month = {7},
  number = 3,
  title = {Sorting efficiency.},
  uniqueid = {3612218|cmedm},
  volume = 3,
  year = 1987
}

@article{dobosiewicz1980efficient,
  author = {Dobosiewicz, Wlodzimierz},
  interhash = {871521972819cf2a12a253a835242437},
  intrahash = {7e6ae30aca4066bc7da59f71ab013f66},
  journal = {Information Processing Letters},
  month = {1},
  number = 1,
  title = {An efficient variation of bubble sort},
  uniqueid = {0020019080900228|edselp},
  volume = 11,
  year = 1980
}

@misc{arora2012novel,
  abstract = {Copyright of International Journal of Computer Applications is the property of Foundation of Computer Science and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)},
  author = {Arora, Nitin and Tamta, Vivek Kumar and Kumar, Suresh},
  interhash = {000949439d57bffb2d32e998b00a5eeb},
  intrahash = {945538270191f07cd4ed4314bab8538a},
  journal = {International Journal of Computer Applications},
  month = {5},
  title = {A Novel Sorting Algorithm and Comparison with Bubble sort and Insertion sort.},
  uniqueid = {77617347|edo},
  volume = 45,
  year = 2012
}

@misc{sedgewick1977analysis,
  abstract = {Copyright of Acta Informatica is the property of Springer Science & Business Media B.V. and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)},
  author = {Sedgewick, Robert},
  interhash = {7fa2e2b14721ef7d5a8ff10d591bb5c7},
  intrahash = {5477ae882d6022e7fa935e143c381195},
  journal = {Acta Informatica},
  month = {12},
  number = 4,
  title = {The analysis of Quicksort programs.},
  uniqueid = {73361029|edb},
  volume = 7,
  year = 1977
}

@misc{hoare1961algorithm,
  author = {Hoare, C. A. R.},
  interhash = {bd42d51836f956e2deebeb10b8e5f93a},
  intrahash = {1b8a512e0042a453e6ceaf5a46aaaa2b},
  journal = {Communications of the ACM},
  month = {7},
  number = 7,
  title = {Algorithm 64: Quicksort.},
  uniqueid = {73457700|edb},
  volume = 4,
  year = 1961
}

@misc{ferrari2014bubblesort,
  abstract = {Let B and S be, respectively, the base steps of bubblesort and stacksort, and call BI and SI their dual versions via the reverse-complement map. We find some unexpected commutation properties between the classical operators and their duals, and we also prove that the set of permutations sortable by a prescribed number of iterations of B and BI is a pattern class.},
  author = {Ferrari, Luca S.},
  interhash = {ec9548e2348d1642294504ee977b8e16},
  intrahash = {5da9040b63dcd040123d3bbdc6644948},
  journal = {Discrete Applied Mathematics},
  month = {6},
  title = {Bubblesort, stacksort and their duals},
  uniqueid = {edsgcl.362314556|edsgao},
  volume = 170,
  year = 2014
}

@article{bentley1984programming,
  abstract = {This paper is a first-aid kit for sorting that describes a few algorithms that are simple to understand and to implement. It covers insertion sort, and quick sort, outlining principles and programming problems.},
  author = {Bentley, J.L.},
  interhash = {24fd9c662dde3c0337a23ac020fcdf58},
  intrahash = {519b16817d47d104869bcd4b0f5e0d98},
  journal = {Communications of the ACM},
  month = {1},
  number = 4,
  title = {Programming pearls (sorting)},
  uniqueid = {EDSTEM.TEMAI85010974927|edstem},
  volume = 27,
  year = 1984
}

@misc{foster1968sorting,
  abstract = {Copyright of Computer Journal is the property of Oxford University Press / USA and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)},
  author = {Foster, Caxton C.},
  interhash = {436ecec789baf4ad6754916b2b5213d0},
  intrahash = {02d280e702e881b0d89a7c1837f639e8},
  journal = {Computer Journal},
  month = {10},
  number = 2,
  title = {Sorting Almost Ordered Arrays.},
  uniqueid = {80073660|edb},
  volume = 11,
  year = 1968
}

@misc{gotlieb1963sorting,
  author = {Gotlieb, C. C.},
  interhash = {b83868fcd099ac3306eafd0961f1fe4c},
  intrahash = {87dc49d25eceab073ce51d06caf743e5},
  journal = {Communications of the ACM},
  month = {5},
  number = 5,
  title = {Sorting on computers.},
  uniqueid = {73458075|edb},
  volume = 6,
  year = 1963
}

@article{grabowski2006dynamic,
  abstract = {This paper deals with new analytical and experimental aspects of influence of data structure and algorithm on sort dynamics. Traditional analysis of data structure-algorithm interface which based on computational complexity is incomplete because do not considers of dynamical effects in area between extremely best and worst cases of computing time. The main aim of this paper are investigations of the impact of long-term dependencies in data structure on sort efficiency. This approach treats interface data structure-algorithm as the complex system in opposition to the classical computational analysis which treats this interface as simple deterministic system. This new approach makes possibilities to determine power spectral density of sorting process and test the existence of 1/f noise in this process which in fact is not noise but reflects the intrinsic dynamic (data flow disturbances inside system) of selforganized computer system. The idea presented in this paper shows how complex system behavior provide a good perspective to analysis of whole computer system as well.},
  author = {Grabowski, F and Strzalka, D},
  interhash = {d88b6f89c8cc14af0b8af60c69880c40},
  intrahash = {a709a3fcc8d060c4c59db7ad83e97ba0},
  journal = {FUNDAMENTA INFORMATICAE},
  month = {7},
  number = {1-3},
  title = {Dynamic behavior of simple insertion sort algorithm},
  uniqueid = {000240603000012|edswsc},
  volume = 72,
  year = 2006
}

@article{bender2006insertion,
  abstract = {Traditional Insertion Sort runs in O(n2) time because each insertion takes O(n) time. When people run Insertion Sort in the physical world, they leave gaps between items to accelerate insertions. Gaps help in computers as well. This paper shows that Gapped Insertion Sort has insertion times of O(log n) with high probability, yielding a total running time of O(n log n) with high probability. [ABSTRACT FROM AUTHOR]},
  author = {Bender, Michael A. and Farach-Colton, Martin and Mosteiro, Miguel A.},
  interhash = {b27269a00ac2b9c0f78375cb8f712c1b},
  intrahash = {b4c0397c8c87d6553c506bfb12f10cbb},
  journal = {Theory of Computing Systems},
  month = {5},
  number = 3,
  title = {Insertion Sort is O(n log n).},
  uniqueid = {20700425|buh},
  volume = 39,
  year = 2006
}

@article{nicholas2005scholarly,
  address = {Bingley},
  author = {Nicholas, David and Huntington, Paul and Watkinson, Anthony},
  interhash = {10580bc4cff2d14ca913b1682e728c9a},
  intrahash = {8e733e3b55a1a648c6e5070d347c43dc},
  journal = {Journal of Documentation},
  number = 2,
  pages = {248--280},
  publisher = {Emerald Group Publishing Limited},
  title = {Scholarly journal usage: the results of deep log analysis},
  url = {http://www.emeraldinsight.com/journals.htm?articleid=1465024&show=abstract},
  volume = 61,
  year = 2005
}

@article{thelwall2012journal,
  abstract = {In theory, the web has the potential to provide information about the wider impact of academic research, beyond traditional scholarly impact. This is because the web can reflect non-scholarly uses of research, such as in online government documents, press coverage or public discussions. Nevertheless, there are practical problems with creating metrics for journals based on web data: principally that most such metrics should be easy for journal editors or publishers to manipulate. Nevertheless, two alternatives seem to have both promise and value: citations derived from digitised books and download counts for journals within specific delivery platforms.},
  author = {Thelwall, Mike},
  doi = {10.1007/s11192-012-0669-x},
  interhash = {834707cf0663109f7811a14ae746be72},
  intrahash = {284883bbaa636a0bab13fc54b903f363},
  issn = {0138-9130},
  journal = {Scientometrics},
  language = {English},
  number = 2,
  pages = {429--441},
  publisher = {Springer Netherlands},
  title = {Journal impact evaluation: a webometric perspective},
  url = {http://dx.doi.org/10.1007/s11192-012-0669-x},
  volume = 92,
  year = 2012
}

@article{thelwall2012journal,
  abstract = {In theory, the web has the potential to provide information about the wider impact of academic research, beyond traditional scholarly impact. This is because the web can reflect non-scholarly uses of research, such as in online government documents, press coverage or public discussions. Nevertheless, there are practical problems with creating metrics for journals based on web data: principally that most such metrics should be easy for journal editors or publishers to manipulate. Nevertheless, two alternatives seem to have both promise and value: citations derived from digitised books and download counts for journals within specific delivery platforms.},
  author = {Thelwall, Mike},
  doi = {10.1007/s11192-012-0669-x},
  interhash = {834707cf0663109f7811a14ae746be72},
  intrahash = {284883bbaa636a0bab13fc54b903f363},
  issn = {0138-9130},
  journal = {Scientometrics},
  language = {English},
  number = 2,
  pages = {429-441},
  publisher = {Springer Netherlands},
  title = {Journal impact evaluation: a webometric perspective},
  url = {http://dx.doi.org/10.1007/s11192-012-0669-x},
  volume = 92,
  year = 2012
}

@article{falagas2008topten,
  abstract = {A considerable part of the scientific community is, at least to some degree, involved in the “impact factor game” Editors strive to increase their journals — impact factor (IF) in order to gain influence in the fields of basic and applied research and scientists seek to profit from the “added value” of publishing in top IF journals. In this article we point out the most common “tricks” of engineering and manipulating the IF undertaken by a portion of professionals of the scientific publishing industry. They attempt to increase the nominator or decrease the denominator of the IF equation by taking advantage of certain design flaws and disadvantages of the IF that permit a degree of artificial and arbitrary inflation. Some of these practices, if not scientifically unethical, are at least questionable and should be abandoned. Editors and publishers should strive for quality through fair and thoughtful selection of papers forwarded for peer review and editorial comments that enhance the quality and scientific accuracy of a manuscript.},
  address = {Basel},
  affiliation = {Alfa Institute of Biomedical Sciences (AIBS) 9 Neapoleos Street 151 23 Marousi, Athens Greece},
  author = {Falagas, Matthew and Alexiou, Vangelis},
  doi = {10.1007/s00005-008-0024-5},
  interhash = {8350623ff88fab4e9405805d9f5663b9},
  intrahash = {4d4a3ba2b742aba8652b347542e39ed9},
  issn = {0004-069X},
  journal = {Archivum Immunologiae et Therapiae Experimentalis},
  keyword = {Biomedical and Life Sciences},
  number = 4,
  pages = {223--226},
  publisher = {Birkhäuser},
  title = {The top-ten in journal impact factor manipulation},
  url = {http://dx.doi.org/10.1007/s00005-008-0024-5},
  volume = 56,
  year = 2008
}

@article{glnzel2002journal,
  abstract = {The Impact Factor introduced by Eugene Garfield is a fundamental citation-based measure for significance and performance of scientific journals. It is perhaps the most popular bibliometric product used in bibliometrics itself, as well as outside the scientific community. First, a concise review of the background and history of the ISI impact factor and the basic ideas underlying it are given. A cross-citation matrix is used to visualise the construction of the Impact Factor and several related journal citation measures},
  author = {Glänzel, Wolfgang and Moed, HenkF.},
  doi = {10.1023/A:1014848323806},
  interhash = {930264a70cc641cb966c63d261133b01},
  intrahash = {b678d6d8afb32c212cf2a4c963ada75e},
  issn = {0138-9130},
  journal = {Scientometrics},
  language = {English},
  number = 2,
  pages = {171-193},
  publisher = {Kluwer Academic Publishers},
  title = {Journal impact measures in bibliometric research},
  url = {http://dx.doi.org/10.1023/A%3A1014848323806},
  volume = 53,
  year = 2002
}

@article{falagas2008topten,
  abstract = {A considerable part of the scientific community is, at least to some degree, involved in the “impact factor game” Editors strive to increase their journals — impact factor (IF) in order to gain influence in the fields of basic and applied research and scientists seek to profit from the “added value” of publishing in top IF journals. In this article we point out the most common “tricks” of engineering and manipulating the IF undertaken by a portion of professionals of the scientific publishing industry. They attempt to increase the nominator or decrease the denominator of the IF equation by taking advantage of certain design flaws and disadvantages of the IF that permit a degree of artificial and arbitrary inflation. Some of these practices, if not scientifically unethical, are at least questionable and should be abandoned. Editors and publishers should strive for quality through fair and thoughtful selection of papers forwarded for peer review and editorial comments that enhance the quality and scientific accuracy of a manuscript.},
  address = {Basel},
  affiliation = {Alfa Institute of Biomedical Sciences (AIBS) 9 Neapoleos Street 151 23 Marousi, Athens Greece},
  author = {Falagas, Matthew and Alexiou, Vangelis},
  doi = {10.1007/s00005-008-0024-5},
  interhash = {8350623ff88fab4e9405805d9f5663b9},
  intrahash = {46e10496e8530bb408702d2cc58f73e8},
  issn = {0004-069X},
  issue = {4},
  journal = {Archivum Immunologiae et Therapiae Experimentalis},
  keyword = {Biomedical and Life Sciences},
  pages = {223--226},
  publisher = {Birkhäuser},
  title = {The top-ten in journal impact factor manipulation},
  url = {http://dx.doi.org/10.1007/s00005-008-0024-5},
  volume = 56,
  year = 2008
}