Analysis of Modified Heap Sort Algorithm on Different Environment
by
Ana Sharma
,
Parvinder S. S
,
Satwinder Singh
,
Baljit Saini
Active Bibliography
| 3 | On the Performance of WEAK-HEAPSORT – Stefan Edelkamp, Ingo Wegener - 2000 |
| 1 | A New Data Structure for Heapsort with Improved Number of Comparisons (Extended Abstract) – Md. Shahjalal, M. Kaykobad |
| 1 | Comparative Performance Study of Improved Heap Sort Algorithm on Different Hardware 1 – Vandana Sharma, Satwinder Singh, K. S. Kahlon |
| 5 | On the Number of Heaps and the Cost of Heap Construction – Hsien-Kuei Hwang, Jean-marc Steyaert, École Polytechnique - 2001 |
| Fast Exchange Sorts – Nachum Dershowitz, Hon-wai Leong | |
| Teaching the Analysis of Algorithms with Visual Proofs – Michael Goodrich Roberto, Roberto Tamassia - 1998 | |
| 1 | Comparator Networks for Binary Heap Construction – Gerth Stølting Brodal, M. Cristina Pinotti - 1998 |
| 5 | Optimal in-place planar convex hull algorithms – Hervé Brönnimann, John Iacono, Jyrki Katajainen, Pat Morin, Godfried Toussaint - 2002 |
| 1 | Computational Biology – Rune B. Lyngsø, Rune B. Lyngs, Rune Bang Lyngs - 2000 |
| 8 | Many-to-Many Routing on Trees via Matchings – Grammati E. Pantziou , Alan Roberts, Antonis Symvonis - 1996 |
| Potential-function-based Analysis of an off-line Heap Construction Algorithm – Alan Roberts, Antonios Symvonis - 2000 | |
| Implicit Heaps – unknown authors | |
| Web www.itu.dkOptimal Static Range Reporting in One Dimension – Stephen Alstrup, Gerth Stølting Brodal, Theis Rauhe, Stephen Alstrup, Gerth Stølting Brodal, Theis Rauhe, Stephen Alstrup, Gerth Stølting, Brodal Theis Rauhe - 2000 | |
| 19 | Finding maximal pairs with bounded gap – Gerth Stølting Brodal, Rune B. Lyngsø, Christian N. S. Pedersen, Jens Stoye - 1999 |
| 8 | The complexity of constructing evolutionary trees using experiments – Gerth Stølting Brodal, Rolf Fagerberg, Christian N. S. Pedersen, Anna Östlin - 2001 |
| 17 | Space-efficient planar convex hull algorithms – Herve Brönnimann, John Iacono, Jyrki Katajainen, Pat Morin, Jason Morrison, Godfried Toussaint - 2002 |
| 9 | Enumerating Solutions to P(a) + Q(b) = R(c) + S(d) – Daniel J. Bernstein - 1999 |
| 15 | Optimal static range reporting in one dimension – Stephen Alstrup, Gerth Stølting Brodal, Theis Rauhe - 2001 |
| 2 | Project proposal: A meldable, iterator-valid priority queue, CPH – Jyrki Katajainen - 2005 |
