A time-space tradeoff for sorting on non-oblivious machines (original) (raw)
Related papers
A Time-Space Tradeoff for Sorting on a General Sequential Model of Computation
SIAM Journal on Computing
A Comprehensive Note on Complexity Issues in Sorting Algorithms
2009
Linear complexity assertions for sorting
IEEE Transactions on Software Engineering, 1994
Journal of Computer and System Sciences, 1998
Towards a Realistic Analysis of Some Popular Sorting Algorithms
Combinatorics, Probability and Computing, 2014
A UNIQUE SORTING ALGORITHM WITH LINEAR TIME & SPACE COMPLEXITY
Efficient oblivious parallel sorting on the MasPar MP-1
Proceedings of the Thirtieth Hawaii International Conference on System Sciences
An Unique Sorting Algorithm With Linear Time Complexity
2014
Performance Comparison of Sorting Algorithms On The Basis Of Complexity
Constant time parallel sorting: an empirical view
Journal of Computer and System Sciences, 2003
Cache-Oblivious and Data-Oblivious Sorting and Applications
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018
The Folklore of Sorting Algorithms
2009
A Simplified Derivation of Timing Complexity Lower Bounds for Sorting by Comparisons
Nordic Journal of Computing, 2006
Tight complexity bounds for parallel comparison sorting
1986
Beyond 0-1: The 1-N Principle and Fast Validation of N-Sorter Sorting Networks
IEEE Access
Hash sort: A linear time complexity multiple-dimensional sort algorithm
A COMPARISON-FREE SORTING ALGORITHM ON CPUs
2016
Sorting by generating the sorting permutation, and the effect of caching on sorting
A Survey of Constant Time Parallel Sorting (Preliminary Version)
Subword sorting with versatile permutation instructions
Computer Design: VLSI in Computers and …, 2002
Analysis of Non-Comparison Based Sorting algorithms: A review
An experimental study of word-level parallelism in some sorting algorithms
1998
A Comparative Study of Sorting Algorithm Based on Their Time Complexity
Striving for Efficiency in Algorithms: Sorting
Resource Oblivious Sorting on Multicores
Lecture Notes in Computer Science, 2010
On the Cache Performance of Time-Efficient Sorting Algorithms
orhandagdeviren.com
2008
Investigation of sorting algorithms on a variety of computers
Computers in Physics, 1990
Algorithms for the generalized sorting problem
IEEE Symposium on Foundations of Computer Science (FOCS), 2011
Breaking the O(n^2) Barrier: Novel Approaches to Time Complexity Analysis in Quick Sort
International Journal of Computer Science and Mobile Computing (IJCSMC), 2020
Adaptive sorting: an information theoretic perspective
Acta Informatica, 2008
Analysis and Performance Measurement of Sorting Algorithms
Proceedings of National Conference on Convergent Innovative Technologies & Management (CITAM-2011) on 2 nd & 3 rd December 2011 at Cambridge Institute of Technology,Bangalore India, 2011