Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
174 | Stefan Edelkamp, Patrick Stiegeler |
Pushing the Limits in Sequential Sorting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WAE ![In: Algorithm Engineering, 4th International Workshop, WAE 2000, Saarbrücken, Germany, September 5-8, 2000, Proceedings, pp. 39-50, 2000, Springer, 3-540-42512-8. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
135 | Stefan Edelkamp, Ingo Wegener |
On the Performance of WEAK-HEAPSORT. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 2000, 17th Annual Symposium on Theoretical Aspects of Computer Science, Lille, France, February 2000, Proceedings, pp. 254-266, 2000, Springer, 3-540-67141-2. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
121 | Lutz M. Wegner, Jukka Teuhola |
The External Heapsort. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Software Eng. ![In: IEEE Trans. Software Eng. 15(7), pp. 917-925, 1989. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comput. Sci. Technol. ![In: J. Comput. Sci. Technol. 22(6), pp. 898-903, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
HEAPSORT, data structures, analysis of algorithms, heaps |
92 | Seiichi Okoma |
Generalized Heapsort. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 1980 (MFCS'80), Proceedings of the 9th Symposium, Rydzyna, Poland, September 1-5, 1980, pp. 439-451, 1980, Springer, 3-540-10027-X. The full citation details ...](Pics/full.jpeg) |
1980 |
DBLP DOI BibTeX RDF |
|
87 | Svante Carlsson, Jingsen Chen, Christer Mattsson |
Heaps with Bits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 5th International Symposium, ISAAC '94, Beijing, P. R. China, August 25-27, 1994, Proceedings, pp. 288-296, 1994, Springer, 3-540-58325-4. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
73 | Domenico Cantone, Gianluca Cincotti |
QuickHeapsort, an Efficient Mix of Classical Sorting Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIAC ![In: Algorithms and Complexity, 4th Italian Conference, CIAC 2000, Rome, Italy, March 2000, Proceedings, pp. 150-162, 2000, Springer, 3-540-67159-5. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Conference on Computer Science ![In: Proceedings of the ACM 20th Annual Conference on Computer Science, CSC '92, Kansas City, MO, USA, March 3-5, 1992, pp. 41-48, 1992, ACM, 0-89791-472-4. The full citation details ...](Pics/full.jpeg) |
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). ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 118(1), pp. 81-98, 1993. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
44 | Paul Biggar, Nicholas Nash, Kevin Williams 0001, David Gregg |
An experimental study of sorting and branch prediction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM J. Exp. Algorithmics ![In: ACM J. Exp. Algorithmics 12, pp. 1.8:1-1.8:39, 2008. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGCSE ![In: Proceedings of the 35th SIGCSE Technical Symposium on Computer Science Education, SIGCSE 2004, Norfolk, Virginia, USA, March 3-7, 2004, pp. 382-386, 2004, ACM, 1-58113-798-2. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
heapsort, courseware, algorithm visualization |
26 | Marek A. Suchenek |
Worst-Case Analysis of Heapsort, Exactly. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. J. ![In: Comput. J. 67(3), pp. 812-824, 2024. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2204.03401, 2022. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FPT ![In: International Conference on Field-Programmable Technology, (IC)FPT 2021, Auckland, New Zealand, December 6-10, 2021, pp. 1-9, 2021, IEEE, 978-1-6654-2010-5. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
26 | Hiroaki Hirata, Atsushi Nunome |
A Modified Parallel Heapsort Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Softw. Innov. ![In: Int. J. Softw. Innov. 8(3), pp. 1-18, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
26 | Shanshan Meng, Qiang Zhu, Fei Xia |
Improvement of the Dynamic Priority Scheduling Algorithm Based on a Heapsort. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Access ![In: IEEE Access 7, pp. 68503-68510, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
26 | Feiyang Chen, Nan Chen, Hanyang Mao, Hanlin Hu |
An efficient sorting algorithm - Ultimate Heapsort(UHS). ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1902.00257, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
26 | Hikaru Kitano, Atsushi Nunome, Hiroaki Hirata |
Performance Evaluation of Parallel Heapsort Programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SNPD ![In: 20th IEEE/ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing, SNPD 2019, Toyama, Japan, July 8-11, 2019, pp. 435-442, 2019, IEEE, 978-1-7281-1651-8. The full citation details ...](Pics/full.jpeg) |
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). ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1504.01459, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP BibTeX RDF |
|
26 | Igor Stassiy |
Analysis of String Sorting using Heapsort. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1408.5422, 2014. The full citation details ...](Pics/full.jpeg) |
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). ![Search on Bibsonomy](Pics/bibsonomy.png) |
FPGA ![In: The 2014 ACM/SIGDA International Symposium on Field-Programmable Gate Arrays, FPGA '14, Monterey, CA, USA - February 26 - 28, 2014, pp. 247, 2014, ACM, 978-1-4503-2671-1. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
26 | Yuhui Bai, Syed Zahid Ahmed, Bertrand Granado |
Fast and Power Efficient Heapsort IP for Image Compression Application. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FCCM ![In: 22nd IEEE Annual International Symposium on Field-Programmable Custom Computing Machines, FCCM 2014, Boston, MA, USA, May 11-13, 2014, pp. 237, 2014, IEEE Computer Society, 978-1-4799-5110-9. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
26 | Shmuel T. Klein |
On the connection between Hamming codes, Heapsort and other methods. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Process. Lett. ![In: Inf. Process. Lett. 113(17), pp. 617-620, 2013. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Comput. Math. ![In: Int. J. Comput. Math. 88(16), pp. 3350-3360, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
26 | Stefan Edelkamp, Amr Elmasry, Jyrki Katajainen |
Two Constant-Factor-Optimal Realizations of Adaptive Heapsort. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IWOCA ![In: Combinatorial Algorithms - 22nd International Workshop, IWOCA 2011, Victoria, BC, Canada, July 20-22, 2011, Revised Selected Papers, pp. 195-208, 2011, Springer, 978-3-642-25010-1. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
26 | Ulrich Laube, Markus E. Nebel |
Maximum Likelihood Analysis of Heapsort. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ANALCO ![In: Proceedings of the Sixth Workshop on Analytic Algorithmics and Combinatorics, ANALCO 2009, New York, New York, USA, January 03, 2009, pp. 41-50, 2009, SIAM, 978-0-89871-932-1. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
26 | Greg Sepesi |
Dualheap Sort Algorithm: An Inherently Parallel Generalization of Heapsort ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/0706.2893, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP BibTeX RDF |
|
26 | Md. Shahjalal, Mohammad Kaykobad |
A New Data Structure for Heapsort with Improved Number of Comparisons. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WALCOM ![In: Workshop on Algorithms and Computation 2007 - Proceedings of First WALCOM, 12 February 2007, Dhaka, Bangladesh, pp. 88-96, 2007, Bangladesh Academy of Sciences (BAS). The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP BibTeX RDF |
|
26 | Tarique Mesbaul Islam, M. Kaykobad |
Worst-case analysis of generalized heapsort algorithm revisited. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Comput. Math. ![In: Int. J. Comput. Math. 83(1), pp. 59-67, 2006. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM J. Exp. Algorithmics ![In: ACM J. Exp. Algorithmics 7, pp. 5, 2002. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Comput. Math. ![In: Int. J. Comput. Math. 73(3), pp. 293-297, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
26 | R. Fadel, K. V. Jakobsen, Jyrki Katajainen, Jukka Teuhola |
Heaps and Heapsort on Secondary Storage. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 220(2), pp. 345-362, 1999. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
26 | Stefan Edelkamp, Ingo Wegener |
On the performance of WEAK-HEAPSORT ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR99, 1999. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP BibTeX RDF |
|
26 | Jyrki Katajainen |
The Ultimate Heapsort. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CATS ![In: Proceedings of Computing: The Fourth Australasian Theory Symposium (CATS'98), Perth, WA, Australia, February 2-3, 1998, pp. 87-96, 1998, Springer-Verlag Singapore Pte. Ltd.. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP BibTeX RDF |
|
26 | Gu Xunrang, Zhu Yuzhang |
Optimal Heapsort Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 163(1&2), pp. 239-243, 1996. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
26 | Béla Bollobás, Trevor I. Fenner, Alan M. Frieze |
On the Best Case of Heapsort. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Algorithms ![In: J. Algorithms 20(2), pp. 205-217, 1996. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
26 | Jigang Wu, Hong Zhu 0004 |
The least basic operations on heap and improved heapsort. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comput. Sci. Technol. ![In: J. Comput. Sci. Technol. 9(3), pp. 261-266, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
26 | Rudolf Fleischer |
A Tight Lower Bound for the Worst Case of Bottom-Up-Heapsort. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 11(2), pp. 104-115, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
26 | Gu Xunrang, Zhu Yuzhang |
Asymptotic Optimal HEAPSORT Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 134(2), pp. 559-565, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
26 | Rudolf Fleischer, Bhabani P. Sinha, Christian Uhrig |
A Lower Bound for the Worst Case of Bottom-Up-Heapsort ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Comput. ![In: Inf. Comput. 102(2), pp. 263-279, February 1993. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
26 | Ingo Wegener |
A Simple Modification of Xunrang and Yuzhang's HEAPSORT Variant Improving its Complexity Significantly. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. J. ![In: Comput. J. 36(3), pp. 286-288, 1993. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
26 | Russel Schaffer, Robert Sedgewick |
The Analysis of Heapsort. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Algorithms ![In: J. Algorithms 15(1), pp. 76-100, 1993. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
26 | Christos Levcopoulos, Ola Petersson |
Adaptive Heapsort. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Algorithms ![In: J. Algorithms 14(3), pp. 395-413, 1993. The full citation details ...](Pics/full.jpeg) |
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 ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Comput. ![In: Inf. Comput. 97(1), pp. 86-96, March 1992. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
26 | S. Carlsson |
A Note on Heapsort (Short Note). ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. J. ![In: Comput. J. 35(4), pp. 410-411, 1992. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
26 | Yuzheng Ding, Mark Allen Weiss |
Best case lower bounds for Heapsort. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Computing ![In: Computing 49(1), pp. 1-9, 1992. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
26 | Rudolf Fleischer |
A Tight Lower Bound for the Worst Case of Bottom-Up Heapsort. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISA ![In: ISA '91 Algorithms, 2nd International Symposium on Algorithms, Taipei, Republic of China, December 16-18, 1991, Proceedings, pp. 251-262, 1991, Springer, 3-540-54945-5. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
|
26 | A. Paulik |
Worst-Case Analysis of a Generalized Heapsort Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Process. Lett. ![In: Inf. Process. Lett. 36(3), pp. 159-165, 1990. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
26 | Ingo Wegener |
Bekannte Sortierverfahren und eine HEAPSORT-Variante die QUICKSORT schlägt. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inform. Spektrum ![In: Inform. Spektrum 13(6), pp. 321-330, 1990. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP BibTeX RDF |
|
26 | Gu Xunrang, Zhu Yuzhang |
A New HEAPSORT Algorithm and the Analysis of Its Complexity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. J. ![In: Comput. J. 33(3), pp. 281-282, 1990. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
26 | Christos Levcopoulos, Ola Petersson |
Heapsort - Adapted for Presorted Files. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WADS ![In: Algorithms and Data Structures, Workshop WADS '89, Ottawa, Canada, August 17-19, 1989, Proceedings, pp. 499-509, 1989, Springer, 3-540-51542-9. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
|
26 | Svante Carlsson |
A Variant of Heapsort with Almost Optimal Number of Comparisons. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Process. Lett. ![In: Inf. Process. Lett. 24(4), pp. 247-250, 1987. The full citation details ...](Pics/full.jpeg) |
1987 |
DBLP DOI BibTeX RDF |
|
26 | Svante Carlsson |
Average-Case Results on Heapsort. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BIT ![In: BIT 27(1), pp. 2-17, 1987. The full citation details ...](Pics/full.jpeg) |
1987 |
DBLP DOI BibTeX RDF |
|
26 | Kelly D. Crawford, Roger L. Wainwright |
Parallel sorting algorithms for insertion shell and heapsort on the HEP (abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Conference on Computer Science ![In: Proceedings of the 14th ACM Annual Conference on Computer Science, Cincinnati, Ohio, USA, 1986, pp. 481, 1986, ACM, 0-89791-177-6. The full citation details ...](Pics/full.jpeg) |
1986 |
DBLP DOI BibTeX RDF |
|
26 | Clyde P. Kruskal, Elia Weixelbaum |
A note on the worst case of heapsort. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGACT News ![In: SIGACT News 13(1), pp. 35-38, 1981. The full citation details ...](Pics/full.jpeg) |
1981 |
DBLP DOI BibTeX RDF |
|
26 | Ernst-Erich Doberkat |
Some Observations on the Average Behavior of Heapsort (Preliminary Report) ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 21st Annual Symposium on Foundations of Computer Science, Syracuse, New York, USA, 13-15 October 1980, pp. 229-237, 1980, IEEE Computer Society. The full citation details ...](Pics/full.jpeg) |
1980 |
DBLP DOI BibTeX RDF |
|
22 | Gerth Stølting Brodal, Rolf Fagerberg, Gabriel Moruz |
On the adaptiveness of Quicksort. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM J. Exp. Algorithmics ![In: ACM J. Exp. Algorithmics 12, pp. 3.2:1-3.2:20, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Adaptive sorting, Quicksort, branch mispredictions |
22 | Kamal Aboul-Hosn |
An Axiomatization of Arrays for Kleene Algebra with Tests. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RelMiCS ![In: Relations and Kleene Algebra in Computer Science, 9th International Conference on Relational Methods in Computer Science and 4th International Workshop on Applications of Kleene Algebra, RelMiCS/AKA 2006, Manchester, UK, August 29-September 2, 2006, Proceedings, pp. 63-77, 2006, Springer, 3-540-37873-1. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
22 | Ernst-Erich Doberkat |
Continuous models that are equivalent to randomness for the analysis of many sorting algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Computing ![In: Computing 31(1), pp. 11-31, 1983. The full citation details ...](Pics/full.jpeg) |
1983 |
DBLP DOI BibTeX RDF |
sorting, Analysis of algorithms |