Search results for "HEAPSORT"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
174	Stefan Edelkamp, Patrick Stiegeler	Pushing the Limits in Sequential Sorting.	WAE	2000	DBLP DOI BibTeX RDF
135	Stefan Edelkamp, Ingo Wegener	On the Performance of WEAK-HEAPSORT.	STACS	2000	DBLP DOI BibTeX RDF
121	Lutz M. Wegner, Jukka Teuhola	The External Heapsort.	IEEE Trans. Software Eng.	1989	DBLP DOI BibTeX RDF	external Heapsort, sorting method, random-access sorting, Hillsort, buffer management concept, merge operations, page references, worst-case upper bound, database management systems, sorting, storage management, performance characteristics, page table
99	Xiao-Dong Wang, Ying-Jie Wu	An Improved HEAPSORT Algorithm with n log n - 0.788928 n Comparisons in the Worst Case.	J. Comput. Sci. Technol.	2007	DBLP DOI BibTeX RDF	HEAPSORT, data structures, analysis of algorithms, heaps
92	Seiichi Okoma	Generalized Heapsort.	MFCS	1980	DBLP DOI BibTeX RDF
87	Svante Carlsson, Jingsen Chen, Christer Mattsson	Heaps with Bits.	ISAAC	1994	DBLP DOI BibTeX RDF
73	Domenico Cantone, Gianluca Cincotti	QuickHeapsort, an Efficient Mix of Classical Sorting Algorithms.	CIAC	2000	DBLP DOI BibTeX RDF	In-place sorting, heapsort, analysis of algorithms, quicksort
65	Fred L. Heller, Alan L. Tharp	The M-ary Tree and Ternary Hillsort.	ACM Conference on Computer Science	1992	DBLP DOI BibTeX RDF
52	Ingo Wegener	BOTTOM-UP-HEAPSORT, a New Variant of HEAPSORT, Beating, on an Average, QUICKSORT (if n is not Very Small).	Theor. Comput. Sci.	1993	DBLP DOI BibTeX RDF
44	Paul Biggar, Nicholas Nash, Kevin Williams 0001, David Gregg	An experimental study of sorting and branch prediction.	ACM J. Exp. Algorithmics	2008	DBLP DOI BibTeX RDF	caching, Sorting, branch prediction, pipeline architectures
29	Purvi Saraiya, Clifford A. Shaffer, D. Scott McCrickard, Chris North 0001	Effective features of algorithm visualizations.	SIGCSE	2004	DBLP DOI BibTeX RDF	heapsort, courseware, algorithm visualization
26	Marek A. Suchenek	Worst-Case Analysis of Heapsort, Exactly.	Comput. J.	2024	DBLP DOI BibTeX RDF
26	Maja H. Kirkeby, Thomas Krabben, Mathias Marquar Arhipenko Larsen, Maria Bendix Mikkelsen, Tjark Petersen, Mads Rosendahl, Martin Schoeberl, Martin Sundman	Energy Consumption and Performance of Heapsort in Hardware and Software.	CoRR	2022	DBLP DOI BibTeX RDF
26	Cheng Wang, Yingkun Liu, Kedai Zuo, Jianming Tong, Yan Ding, Pengju Ren	ac2SLAM: FPGA Accelerated High-Accuracy SLAM with Heapsort and Parallel Keypoint Extractor.	FPT	2021	DBLP DOI BibTeX RDF
26	Hiroaki Hirata, Atsushi Nunome	A Modified Parallel Heapsort Algorithm.	Int. J. Softw. Innov.	2020	DBLP DOI BibTeX RDF
26	Shanshan Meng, Qiang Zhu, Fei Xia	Improvement of the Dynamic Priority Scheduling Algorithm Based on a Heapsort.	IEEE Access	2019	DBLP DOI BibTeX RDF
26	Feiyang Chen, Nan Chen, Hanyang Mao, Hanlin Hu	An efficient sorting algorithm - Ultimate Heapsort(UHS).	CoRR	2019	DBLP BibTeX RDF
26	Hikaru Kitano, Atsushi Nunome, Hiroaki Hirata	Performance Evaluation of Parallel Heapsort Programs.	SNPD	2019	DBLP DOI BibTeX RDF
26	Marek A. Suchenek	A Complete Worst-Case Analysis of Heapsort with Experimental Verification of Its Results, A manuscript (MS).	CoRR	2015	DBLP BibTeX RDF
26	Igor Stassiy	Analysis of String Sorting using Heapsort.	CoRR	2014	DBLP BibTeX RDF
26	Yuhui Bai, Syed Zahid Ahmed, Bertrand Granado	A power-efficient adaptive heapsort for fpga-based image coding application (abstract only).	FPGA	2014	DBLP DOI BibTeX RDF
26	Yuhui Bai, Syed Zahid Ahmed, Bertrand Granado	Fast and Power Efficient Heapsort IP for Image Compression Application.	FCCM	2014	DBLP DOI BibTeX RDF
26	Shmuel T. Klein	On the connection between Hamming codes, Heapsort and other methods.	Inf. Process. Lett.	2013	DBLP DOI BibTeX RDF
26	Md. Mahbubul Hasan, Md. Shahjalal, M. Kaykobad	An in-place heapsort algorithm requiring nlogn+nlog*n-0.546871n comparisons.	Int. J. Comput. Math.	2011	DBLP DOI BibTeX RDF
26	Stefan Edelkamp, Amr Elmasry, Jyrki Katajainen	Two Constant-Factor-Optimal Realizations of Adaptive Heapsort.	IWOCA	2011	DBLP DOI BibTeX RDF
26	Ulrich Laube, Markus E. Nebel	Maximum Likelihood Analysis of Heapsort.	ANALCO	2009	DBLP DOI BibTeX RDF
26	Greg Sepesi	Dualheap Sort Algorithm: An Inherently Parallel Generalization of Heapsort	CoRR	2007	DBLP BibTeX RDF
26	Md. Shahjalal, Mohammad Kaykobad	A New Data Structure for Heapsort with Improved Number of Comparisons.	WALCOM	2007	DBLP BibTeX RDF
26	Tarique Mesbaul Islam, M. Kaykobad	Worst-case analysis of generalized heapsort algorithm revisited.	Int. J. Comput. Math.	2006	DBLP DOI BibTeX RDF
26	Stefan Edelkamp, Patrick Stiegeler	Implementing HEAPSORT with (n logn - 0.9n) and QUICKSORT with (n logn + 0.2n) Comparisons.	ACM J. Exp. Algorithmics	2002	DBLP DOI BibTeX RDF
26	Rezaul Alam Chowdhury, M. Kaykobad, Suman Kumar Nath	A simplified complexity analysis of mcdiarmid and reed's variant of bottom-up-heapsort.	Int. J. Comput. Math.	2000	DBLP DOI BibTeX RDF
26	R. Fadel, K. V. Jakobsen, Jyrki Katajainen, Jukka Teuhola	Heaps and Heapsort on Secondary Storage.	Theor. Comput. Sci.	1999	DBLP DOI BibTeX RDF
26	Stefan Edelkamp, Ingo Wegener	On the performance of WEAK-HEAPSORT	Electron. Colloquium Comput. Complex.	1999	DBLP BibTeX RDF
26	Jyrki Katajainen	The Ultimate Heapsort.	CATS	1998	DBLP BibTeX RDF
26	Gu Xunrang, Zhu Yuzhang	Optimal Heapsort Algorithm.	Theor. Comput. Sci.	1996	DBLP DOI BibTeX RDF
26	Béla Bollobás, Trevor I. Fenner, Alan M. Frieze	On the Best Case of Heapsort.	J. Algorithms	1996	DBLP DOI BibTeX RDF
26	Jigang Wu, Hong Zhu 0004	The least basic operations on heap and improved heapsort.	J. Comput. Sci. Technol.	1994	DBLP DOI BibTeX RDF
26	Rudolf Fleischer	A Tight Lower Bound for the Worst Case of Bottom-Up-Heapsort.	Algorithmica	1994	DBLP DOI BibTeX RDF
26	Gu Xunrang, Zhu Yuzhang	Asymptotic Optimal HEAPSORT Algorithm.	Theor. Comput. Sci.	1994	DBLP DOI BibTeX RDF
26	Rudolf Fleischer, Bhabani P. Sinha, Christian Uhrig	A Lower Bound for the Worst Case of Bottom-Up-Heapsort	Inf. Comput.	1993	DBLP DOI BibTeX RDF
26	Ingo Wegener	A Simple Modification of Xunrang and Yuzhang's HEAPSORT Variant Improving its Complexity Significantly.	Comput. J.	1993	DBLP DOI BibTeX RDF
26	Russel Schaffer, Robert Sedgewick	The Analysis of Heapsort.	J. Algorithms	1993	DBLP DOI BibTeX RDF
26	Christos Levcopoulos, Ola Petersson	Adaptive Heapsort.	J. Algorithms	1993	DBLP DOI BibTeX RDF
26	Ingo Wegener	The Worst Case Complexity of McDiarmid and Reed's Variant of BOTTOM-UP HEAPSORT is less than nlog n + 1.1n	Inf. Comput.	1992	DBLP DOI BibTeX RDF
26	S. Carlsson	A Note on Heapsort (Short Note).	Comput. J.	1992	DBLP DOI BibTeX RDF
26	Yuzheng Ding, Mark Allen Weiss	Best case lower bounds for Heapsort.	Computing	1992	DBLP DOI BibTeX RDF
26	Rudolf Fleischer	A Tight Lower Bound for the Worst Case of Bottom-Up Heapsort.	ISA	1991	DBLP DOI BibTeX RDF
26	A. Paulik	Worst-Case Analysis of a Generalized Heapsort Algorithm.	Inf. Process. Lett.	1990	DBLP DOI BibTeX RDF
26	Ingo Wegener	Bekannte Sortierverfahren und eine HEAPSORT-Variante die QUICKSORT schlägt.	Inform. Spektrum	1990	DBLP BibTeX RDF
26	Gu Xunrang, Zhu Yuzhang	A New HEAPSORT Algorithm and the Analysis of Its Complexity.	Comput. J.	1990	DBLP DOI BibTeX RDF
26	Christos Levcopoulos, Ola Petersson	Heapsort - Adapted for Presorted Files.	WADS	1989	DBLP DOI BibTeX RDF
26	Svante Carlsson	A Variant of Heapsort with Almost Optimal Number of Comparisons.	Inf. Process. Lett.	1987	DBLP DOI BibTeX RDF
26	Svante Carlsson	Average-Case Results on Heapsort.	BIT	1987	DBLP DOI BibTeX RDF
26	Kelly D. Crawford, Roger L. Wainwright	Parallel sorting algorithms for insertion shell and heapsort on the HEP (abstract).	ACM Conference on Computer Science	1986	DBLP DOI BibTeX RDF
26	Clyde P. Kruskal, Elia Weixelbaum	A note on the worst case of heapsort.	SIGACT News	1981	DBLP DOI BibTeX RDF
26	Ernst-Erich Doberkat	Some Observations on the Average Behavior of Heapsort (Preliminary Report)	FOCS	1980	DBLP DOI BibTeX RDF
22	Gerth Stølting Brodal, Rolf Fagerberg, Gabriel Moruz	On the adaptiveness of Quicksort.	ACM J. Exp. Algorithmics	2008	DBLP DOI BibTeX RDF	Adaptive sorting, Quicksort, branch mispredictions
22	Kamal Aboul-Hosn	An Axiomatization of Arrays for Kleene Algebra with Tests.	RelMiCS	2006	DBLP DOI BibTeX RDF
22	Ernst-Erich Doberkat	Continuous models that are equivalent to randomness for the analysis of many sorting algorithms.	Computing	1983	DBLP DOI BibTeX RDF	sorting, Analysis of algorithms