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

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

Active Bibliography

7 On the Performance of WEAK-HEAPSORT – Stefan Edelkamp, Ingo Wegener - 2000
605 A Transformation System for Developing Recursive Programs – R. M. Burstall, John Darlington - 1977
792 Introduction to Algorithms, Second Edition – T H Leiserson, C E Cormen, R L Rivest, C Stein - 2001
517 LogP: Towards a Realistic Model of Parallel Computation – David Culler , Richard Karp , David Patterson, Abhijit Sahay, Klaus Erik Schauser, Eunice Santos, Ramesh Subramonian, Thorsten von Eicken - 1993
481 FAST VOLUME RENDERING USING A SHEAR-WARP FACTORIZATION OF THE VIEWING TRANSFORMATION – Philippe G. Lacroute - 1995
478 An introduction to disk drive modeling – Chris Ruemmler, John Wilkes - 1994
436 Language Support for Lightweight Transactions – Tim Harris, Keir Fraser - 2003
433 Complexityeffective superscalar processors – Subbarao Palacharla, J. E. Smith - 1997
414 lmbench: Portable Tools for Performance Analysis – Carl Staelin, Hewlett-packard Laboratories - 1996