Homogeneous and Non-homogeneous Algorithms
-
Published:2012-09-19
Issue:
Volume:
Page:241-248
-
ISSN:2194-1009
-
Container-title:Optimization Theory, Decision Making, and Operations Research Applications
-
language:
-
Short-container-title:
Author:
Paparrizos Ioannis
Publisher
Springer New York
Reference22 articles.
1. Blum, M., Floyd, R., Pratt, V., Rivest, R., Tarjan, R.: Time bounds for selection. J. Comp. Syst. Sci. 7(4), 448–461 (1973)
2. Bollobas, B., Fenner, T.I., Frieze, A.M.: On best case of heapsort. J. Algorithms 20, 205–217 (1996)
3. Brassard, G.: Crusade for a better notation. ACM Sigact News 17(1), 60–64 (1985)
4. Ding, Y., Weiss, M.A.: Best case lower bounds for Heapsort. Computing 49, 1–9 (1992)
5. Dutton, R.: Weak-heapsort. BIT 33, 372–381 (1993)