A New Data Structure for Heapsort with Improved Number of Comparisons (Extended Abstract)

Cached

Download Links

by Md. Shahjalal , M. Kaykobad
Citations:1 - 0 self

Active Bibliography

6 On the Performance of WEAK-HEAPSORT – Stefan Edelkamp, Ingo Wegener - 2000
2 Pushing the Limits in Sequential Sorting – Stefan Edelkamp, Patrick Stiegeler - 2000
2 Implementing HEAPSORT with n log n - 0.9n and QUICKSORT with n log n + 0.2n Comparisons – Stefan Edelkamp, Patrick Stiegeler - 2002
1 Comparative Performance Study of Improved Heap Sort Algorithm on Different Hardware 1 – Vandana Sharma, Satwinder Singh, K. S. Kahlon
6 On the Number of Heaps and the Cost of Heap Construction – Hsien-Kuei Hwang, Jean-marc Steyaert, École Polytechnique - 2001
Analysis of Modified Heap Sort Algorithm on Different Environment – Ana Sharma, Parvinder S. S, Satwinder Singh, Baljit Saini
4 The Ultimate Heapsort – Jyrki Katajainen - 1998
9 Enumerating Solutions to P(a) + Q(b) = R(c) + S(d) – Daniel J. Bernstein - 1999
Project Title: A New Heap Data Structure S.S.Bansal (98357) Supervisor: Dr. Phalguni Gupta – Ni Gup Ta, S. S. Bansal, Supervisor Dr. Phalguni Gupta - 2002
Potentials and Limitations of Visual Methods for the Exploration of Complex Data Structures – Tobias Lauer - 2007
A Heapify Based Parallel Sorting Algorithm 1 – Mwaffaq A. Abu Al Hija, Arwa Zabian, Sami Qawasmeh, Omer H. Abu Al Haija
Divide-and-Conquer Recurrences Associated with Generalized Heaps, Optimal Merge, and Related Structures – Wei-mei Chen, Gen-Huey Chen - 2001
Elementary average case analysis of Floyd's algorithms to construct heaps – Tomi Pasanen
22 Derivation of Randomized Sorting and Selection Algorithms, in Parallel Algorithm Derivation And Program Transformation, edited by – Sanguthevar Rajasekaran, John H. Reif - 1993
10 Practical In-Place Mergesort – Jyrki Katajainen, Tomi Pasanen, Jukka Teuhola - 1996
8 Sorting in-place with a worst case complexity of n log n --- 1:3n + O(log n) comparisons and ffln log n +O(1) transports – Klaus Reinhardt - 1992
Latin America – Facultad De, Ciencias Físicas, Y Matemáticas, Departamento De, Ciencias De, La Computación, Rodrigo Andrés, Paredes Moraleda, Profesor Gu Ía, Gonzalo Navarro Badino, Miembros De, La Comisi Ón, Nancy Hitschfeld Kahler, Patricio Poblete Olivares, Peter Sanders, Santiago De Chile, Facultad De, Ciencias Físicas, Y Matemáticas, Departamento De, Ciencias De, La Computación, Gonzalo Navarro Badino, Nancy Hitschfeld Kahler, Patricio Poblete Olivares, Peter Sanders, Para Optar, Al Grado De, Fecha De, Julio De
1 On sorting, heaps, and minimum spanning trees – Gonzalo Navarro, Rodrigo Paredes
STRONGER QUICKHEAPS – Gonzalo Navarro, Rodrigo Paredes, Patricio V. Poblete, Peter Sanders