@inproceedings{schnorr1986optimal,
acmid = {12156},
address = {New York, NY, USA},
author = {Schnorr, C P and Shamir, A},
booktitle = {Proceedings of the Eighteenth Annual ACM Symposium on Theory of Computing},
doi = {10.1145/12130.12156},
interhash = {50b5a965bcc95aba44ed55d908f7624a},
intrahash = {e645f73921b98b1c6b0e17fe617b74b2},
isbn = {0-89791-193-8},
location = {Berkeley, California, USA},
numpages = {9},
pages = {255--263},
publisher = {ACM},
series = {STOC '86},
title = {An Optimal Sorting Algorithm for Mesh Connected Computers},
url = {http://doi.acm.org/10.1145/12130.12156},
year = 1986
}
@incollection{ganter2010basic,
abstract = {We describe two algorithms for closure systems. The purpose of the first is to produce all closed sets of a given closure operator. The second constructs a minimal family of implications for the ”logic” of a closure system. These algorithms then are applied to problems in concept analysis: Determining all concepts of a given context and describing the dependencies between attributes. The problem of finding all concepts is equivalent, e.g., to finding all maximal complete bipartite subgraphs of a bipartite graph.},
author = {Ganter, Bernhard},
booktitle = {Formal Concept Analysis},
doi = {10.1007/978-3-642-11928-6_22},
editor = {Kwuida, Léonard and Sertkaya, Barış},
interhash = {f44d214d7176b9183d2bf29b8efbdc00},
intrahash = {00d3cdaea05efaed9cb99c94f93ddacc},
isbn = {978-3-642-11927-9},
language = {English},
pages = {312-340},
publisher = {Springer Berlin Heidelberg},
series = {Lecture Notes in Computer Science},
title = {Two Basic Algorithms in Concept Analysis},
url = {http://dx.doi.org/10.1007/978-3-642-11928-6_22},
volume = 5986,
year = 2010
}
@article{Bron74,
author = {Bron, Coenraad},
ee = {http://doi.acm.org/10.1145/361604.361631},
interhash = {712b38217a78adb45a2797fb12a6c552},
intrahash = {25501f34498a5562c8c50ed70bea2199},
journal = {Commun. ACM},
number = 12,
pages = 706,
title = {Merge Sort Algorithm (Remark on Algorithm 426).},
url = {http://dblp.uni-trier.de/db/journals/cacm/cacm17.html#Bron74},
volume = 17,
year = 1974
}
@article{ChlebusV91,
author = {Chlebus, Bogdan S. and Vrto, Imrich},
ee = {http://dx.doi.org/10.1016/0743-7315(91)90040-G},
interhash = {c7968394083da3d42639a280317e365f},
intrahash = {b144e04820bca889124e7791d330aff6},
journal = {J. Parallel Distrib. Comput.},
number = 4,
pages = {332-337},
title = {Parallel Quicksort.},
url = {http://dblp.uni-trier.de/db/journals/jpdc/jpdc11.html#ChlebusV91},
volume = 11,
year = 1991
}
@article{LinLT12,
author = {Lin, Chun-Yuan and Lee, Wei Sheng and Tang, Chuan Yi},
ee = {http://dx.doi.org/10.4018/jghpc.2012040101},
interhash = {f997386bf7a538a5325828cbdb3c5074},
intrahash = {819d2f02cc699fd0f3ccfb172e60dce9},
journal = {IJGHPC},
number = 2,
pages = {1-16},
title = {Parallel Shellsort Algorithm for Many-Core GPUs with CUDA.},
url = {http://dblp.uni-trier.de/db/journals/ijghpc/ijghpc4.html#LinLT12},
volume = 4,
year = 2012
}
@article{MartinezR01,
author = {Martínez, Conrado and Roura, Salvador},
ee = {http://dx.doi.org/10.1137/S0097539700382108},
interhash = {156e27cf4b94f720addafeef69fbfef6},
intrahash = {0e9c2082f1b09156e42de7226786e1ba},
journal = {SIAM J. Comput.},
number = 3,
pages = {683-705},
title = {Optimal Sampling Strategies in Quicksort and Quickselect.},
url = {http://dblp.uni-trier.de/db/journals/siamcomp/siamcomp31.html#MartinezR01},
volume = 31,
year = 2001
}
@article{2798180720070501,
abstract = {Many algorithms are available for sorting the unordered elements. Most important of them are Bubble sort, Heap sort, Insertion sort and Shell sort. These algorithms have their own pros and cons. Shell Sort which is an enhanced version of insertion sort, reduces the number of swaps of the elements being sorted to minimize the complexity and time as compared to insertion sort. Shell sort improves the efficiency of insertion sort by quickly shifting values to their destination. Average sort time is O(n1.25), while worst-case time is O(n1.5). It performs certain iterations. In each iteration it swaps some elements of the array in such a way that in last iteration when the value of h is one, the number of swaps will be reduced. Donald L. Shell invented a formula to calculate the value of 'h'. this work focuses to identify some improvement in the conventional Shell sort algorithm. "Enhanced Shell Sort algorithm" is an improvement in the algorithm to calculate the value},
author = {Shahzad, Basit and Afzal, Muhammad Tanvir},
interhash = {0c52ec6c34dd1cff11e4e0358fc45626},
intrahash = {7825106029dc781e39c89517a06cef95},
issn = {13055313},
journal = {Enformatika},
pages = {66 - 70},
title = {Enhanced Shell Sorting Algorithm.},
url = {http://search.ebscohost.com/login.aspx?direct=true&db=iih&AN=27981807&site=ehost-live},
volume = 21,
year = 2007
}
@inproceedings{Sedgewick96,
author = {Sedgewick, Robert},
booktitle = {ESA},
editor = {Díaz, Josep and Serna, Maria J.},
ee = {http://dx.doi.org/10.1007/3-540-61680-2_42},
interhash = {0594c31c1838ff65f77a0dca32ca92b6},
intrahash = {a0f574d6dfc03e06162c839c8d46eb9f},
isbn = {3-540-61680-2},
pages = {1-11},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
title = {Analysis of Shellsort and Related Algorithms.},
url = {http://dblp.uni-trier.de/db/conf/esa/esa96.html#Sedgewick96},
volume = 1136,
year = 1996
}
@article{Hibbard63,
author = {Hibbard, Thomas N.},
ee = {http://doi.acm.org/10.1145/366552.366557},
interhash = {781140b255459ed8bfc2b4c083afde53},
intrahash = {37a9fbf89bcc3ac388141deca54f0205},
journal = {Commun. ACM},
number = 5,
pages = {206-213},
title = {An empirical study of minimal storage sorting.},
url = {http://dblp.uni-trier.de/db/journals/cacm/cacm6.html#Hibbard63},
volume = 6,
year = 1963
}
@article{NardelliP06,
author = {Nardelli, Enrico and Proietti, Guido},
ee = {http://dx.doi.org/10.1016/j.ins.2005.04.008},
interhash = {356336e0568bc17de745ef722615fd8d},
intrahash = {c6705389899c14860cdfca5fc1822a83},
journal = {Inf. Sci.},
number = 10,
pages = {1321-1337},
title = {Efficient unbalanced merge-sort.},
url = {http://dblp.uni-trier.de/db/journals/isci/isci176.html#NardelliP06},
volume = 176,
year = 2006
}
@inproceedings{Edmondson05,
author = {Edmondson, James R.},
booktitle = {AMCS},
editor = {Arabnia, Hamid R. and Ajwa, Iyad A.},
interhash = {ac3774a5c93e8388408c02b88cd87f3b},
intrahash = {6b23433b75923b34b951cfbd3c503283},
isbn = {1-932415-63-7},
pages = {47-53},
publisher = {CSREA Press},
title = {M Pivot Sort - Replacing Quick Sort.},
url = {http://dblp.uni-trier.de/db/conf/amcs/amcs2005.html#Edmondson05},
year = 2005
}
@article{Hoare1961,
author = {Hoare, C. A. R.},
ee = {http://doi.acm.org/10.1145/366622.366644},
interhash = {bd42d51836f956e2deebeb10b8e5f93a},
intrahash = {1b58ff39c1c545c2be8114935d3c757d},
journal = {Commun. ACM},
number = 7,
pages = 321,
title = {Algorithm 64: Quicksort.},
url = {http://dblp.uni-trier.de/db/journals/cacm/cacm4.html#Hoare61b},
volume = 4,
year = 1961
}
@article{wegener1993bottomupheapsort,
author = {Wegener, Ingo},
interhash = {1876a3b7aac290a08d7c855e50bcdfef},
intrahash = {99f1ffe7091a547a5b1b4dc6f12a6a0c},
journal = {Theoretical Computer Science},
month = sep,
number = 1,
pages = {81-98},
title = {BOTTOM-UP-HEAPSORT, a new variant of HEAPSORT beating, on an average, QUICKSORT (if n is not very small)},
volume = 118,
year = 1993
}
@article{Hoare1961,
author = {Hoare, C. A. R.},
ee = {http://doi.acm.org/10.1145/366622.366644},
interhash = {bd42d51836f956e2deebeb10b8e5f93a},
intrahash = {1b58ff39c1c545c2be8114935d3c757d},
journal = {Commun. ACM},
number = 7,
pages = 321,
title = {Algorithm 64: Quicksort.},
url = {http://dblp.uni-trier.de/db/journals/cacm/cacm4.html#Hoare61b},
volume = 4,
year = 1961
}
@article{hoare1961algorithm,
author = {Hoare, C. A. R.},
ee = {http://doi.acm.org/10.1145/366622.366644},
interhash = {bd42d51836f956e2deebeb10b8e5f93a},
intrahash = {1b58ff39c1c545c2be8114935d3c757d},
journal = {Commun. ACM},
number = 7,
pages = 321,
title = {Algorithm 64: Quicksort.},
url = {http://dblp.uni-trier.de/db/journals/cacm/cacm4.html#Hoare61b},
volume = 4,
year = 1961
}
@inproceedings{inoue2007aasort,
abstract = {Many sorting algorithms have been studied in the past, but there are only a few algorithms that can effectively exploit both SIMD instructions and thread-level parallelism. In this paper, we propose a new parallel sorting algorithm, called Aligned-Access sort (AA-sort), for shared-memory multi processors. The AA-sort algorithm takes advantage of SIMD instructions. The key to high performance is eliminating unaligned memory accesses that would reduce the effectiveness of SIMD instructions. We implemented and evaluated the AA-sort on PowerPC® 970MP and Cell Broadband EngineTM. In summary, a sequential version of the AA-sort using SIMD instructions outperformed IBM's optimized sequential sorting library by 1.8 times and GPUTeraSort using SIMD instructions by 3.3 times on PowerPC 970MP when sorting 32 M of random 32-bit integers. Furthermore, a parallel version of AA-sort demonstrated better scalability with increasing numbers of cores than a parallel version of GPUTeraSort on both platforms.},
acmid = {1299047},
address = {Washington, DC, USA},
author = {Inoue, Hiroshi and Moriyama, Takao and Komatsu, Hideaki and Nakatani, Toshio},
booktitle = {Proceedings of the 16th International Conference on Parallel Architecture and Compilation Techniques},
doi = {10.1109/PACT.2007.12},
interhash = {bc1e876542ce12b7385d44386ee04c67},
intrahash = {68fcf74640b03f0cc2f48b979f2a77c4},
isbn = {0-7695-2944-5},
numpages = {10},
pages = {189--198},
publisher = {IEEE Computer Society},
series = {PACT '07},
title = {AA-Sort: A New Parallel Sorting Algorithm for Multi-Core SIMD Processors},
url = {http://dx.doi.org/10.1109/PACT.2007.12},
year = 2007
}
@book{K73,
author = {Knuth, D.E.},
interhash = {132508fb11effd51eb89389b60bfeccc},
intrahash = {3d76ffb6705397e00ddfbc5e2be092de},
publisher = {Addison-Wesley},
title = {The art of computer programming. Vol.3: Sorting and searching},
year = 1973
}
@article{356594,
abstract = {The bibliography appearing at the end of this article lists 37 sorting algorithms and 100 books and papers on sorting published in the last 20 years. The basic ideas presented here have been abstracted from this body of work, and the best algorithms known are given as examples. As the algorithms are explained, references to related algorithms and mathematical or experimental analyses are given. Suggestions are then made for choosing the algorithm best suited to a given situation.},
address = {New York, NY, USA},
author = {Martin, W. A.},
doi = {10.1145/356593.356594},
interhash = {1bed8163f826eb4d7631c9135f9aaf8a},
intrahash = {935269dff6cce683c61c9086662e136d},
issn = {0360-0300},
journal = {ACM Comput. Surv.},
number = 4,
pages = {147--174},
publisher = {ACM},
title = {Sorting},
url = {http://portal.acm.org/citation.cfm?id=356593.356594&coll=Portal&dl=GUIDE&CFID=89172762&CFTOKEN=95662085},
volume = 3,
year = 1971
}
@article{williams1964algorithm,
author = {Williams, J. W. J.},
interhash = {88f7b4bad2300e0db2fab61c269e1f4e},
intrahash = {f485e4ea9a877871b59ab503151a7f10},
journal = {Communications of the ACM},
number = 6,
pages = {347–348},
title = {Algorithm 232: Heapsort},
volume = 7,
year = 1964
}
@article{min2010analysis,
abstract = {Based on the analysis of the traditional bubble sort algorithm, this paper proposes two bidirectional bubble sort algorithm design ideas. After giving C language description of the three algorithms, the paper tests the new algorithms, analyzes comparatively the time complexity and space complexity of the three algorithms, and summarizes such a conclusion that the first new algorithm has the same average time complexity and space complexity as the original algorithm, while the second is time efficient than the original one, and thus truly reaches the optimization purpose.},
author = {Min, Wang},
booktitle = {Information Technology and Applications (IFITA), 2010 International Forum on},
doi = {10.1109/IFITA.2010.9},
interhash = {eabf1eae152ff2a67a6ac0fec646ded7},
intrahash = {0dee4a4c1c0f5dc5aa5ceb2a8c478f62},
pages = {208-211},
title = {Analysis on Bubble Sort Algorithm Optimization},
volume = 1,
year = 2010
}