The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for heapsort with no syntactic query expansion in all metadata.

Publication years (Num. hits)
1980-1992 (17) 1993-2000 (18) 2002-2014 (16) 2015-2024 (8)
Publication types (Num. hits)
article(39) inproceedings(20)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 20 occurrences of 15 keywords

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