Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
150 | Roger L. Wainwright |
Quicksort algorithms with an early exit for sorted subfiles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Conference on Computer Science ![In: Proceedings of the 15th ACM Annual Conference on Computer Science, St. Louis, Missouri, USA, February 16-19, 1987, pp. 183-190, 1987, ACM, 0-89791-218-7. The full citation details ...](Pics/full.jpeg) |
1987 |
DBLP DOI BibTeX RDF |
|
146 | 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 |
103 | Branislav Durian |
Quicksort Without a Stack. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 1986, Bratislava, Czechoslovakia, August 25-29, 1996, Proceedings, pp. 283-289, 1986, Springer, 3-540-16783-8. The full citation details ...](Pics/full.jpeg) |
1986 |
DBLP DOI BibTeX RDF |
O(1)-space, Algorithm, Searching, Sorting, Stack, Quicksort |
93 | Daniel Cederman, Philippas Tsigas |
A Practical Quicksort Algorithm for Graphics Processors. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2008, 16th Annual European Symposium, Karlsruhe, Germany, September 15-17, 2008. Proceedings, pp. 246-258, 2008, Springer, 978-3-540-87743-1. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
93 | Philippas Tsigas, Yi Zhang 0004 |
A Simple, Fast Parallel Implementation of Quicksort and its Performance Evaluation on SUN Enterprise 10000. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PDP ![In: 11th Euromicro Workshop on Parallel, Distributed and Network-Based Processing (PDP 2003), 5-7 February 2003, Genova, Italy, pp. 372-, 2003, IEEE Computer Society, 0-7695-1875-3. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
88 | Beatrice List, Markus Maucher, Uwe Schöning, Rainer Schuler |
Randomized Quicksort and the Entropy of the Random Source. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics, 11th Annual International Conference, COCOON 2005, Kunming, China, August 16-29, 2005, Proceedings, pp. 450-460, 2005, Springer, 3-540-28061-8. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Entropy, Randomized Algorithms, QuickSort |
74 | Jean-Loup Baer, Yi-Bing Lin |
Improving Quicksort Performance with a Codewort Data Structure. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Software Eng. ![In: IEEE Trans. Software Eng. 15(5), pp. 622-631, 1989. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
codeword data structure, long, alphanumeric sequences, bytes, codeword generator, character count, first nonequal byte, quicksort algorithm, architecture-dependent parameters, in-line expansion, data structures, caches, sorting, compiler optimizations, register allocation, performance improvement, ordering, pointer, records, keys, swaps, write policies |
68 | Gerth Stølting Brodal, Rolf Fagerberg, Kristoffer Vinther |
Engineering a cache-oblivious sorting algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM J. Exp. Algorithmics ![In: ACM J. Exp. Algorithmics 12, pp. 2.2:1-2.2:23, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
funnelsort, quicksort, Cache-oblivious algorithms |
64 | Bodo Manthey, Till Tantau |
Smoothed Analysis of Binary Search Trees and Quicksort under Additive Noise. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2008, 33rd International Symposium, MFCS 2008, Torun, Poland, August 25-29, 2008, Proceedings, pp. 467-478, 2008, Springer, 978-3-540-85237-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
64 | Sangman Moh, Chansu Yu, Dongsoo Han |
Design and Experiment of a Communication-Aware Parallel Quicksort with Weighted Partition of Processors. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCSA (4) ![In: Computational Science and Its Applications - ICCSA 2004, International Conference, Assisi, Italy, May 14-17, 2004, Proceedings, Part IV, pp. 97-105, 2004, Springer, 3-540-22060-7. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
54 | 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 |
49 | Brigitte Vallée, Julien Clément 0001, James Allen Fill, Philippe Flajolet |
The Number of Symbol Comparisons in QuickSort and QuickSelect. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP (1) ![In: Automata, Languages and Programming, 36th International Colloquium, ICALP 2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part I, pp. 750-763, 2009, Springer, 978-3-642-02926-4. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
49 | James Allen Fill, Svante Janson |
The number of bit comparisons used by Quicksort: an average-case analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2004, New Orleans, Louisiana, USA, January 11-14, 2004, pp. 300-307, 2004, SIAM, 0-89871-558-X. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP BibTeX RDF |
|
49 | Conrado Martínez, Salvador Roura |
Optimal Sampling Strategies in Quicksort. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 25th International Colloquium, ICALP'98, Aalborg, Denmark, July 13-17, 1998, Proceedings, pp. 327-338, 1998, Springer, 3-540-64781-3. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
49 | Yi Pan 0001, Mounir Hamdi |
Quicksort on a Linear Array with a Reconfigurable Pipelined Bus System. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISPAN ![In: 1996 International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN '96), June 12-14, 1996, Beijing, China, pp. 313-319, 1996, IEEE Computer Society, 0-8186-7460-1. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
49 | Colin McDiarmid, Ryan Hayward |
Strong Concentration for Quicksort. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Third Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 27-29 January 1992, Orlando, Florida, USA., pp. 414-421, 1992, ACM/SIAM, 0-89791-466-X. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP BibTeX RDF |
|
45 | Bang Yang, Liliang Ren, Furong Chen, Xiaofan Liu |
Identification of Flow-Routing Sequence from DEMs Based on Quicksort. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESIAT (2) ![In: 2009 International Conference on Environmental Science and Information Application Technology, ESIAT 2009, Wuhan, China, 4-5 July 2009, 3 Volumes, pp. 403-406, 2009, IEEE Computer Society, 978-0-7695-3682-8. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
drainage networks, codification, DEM, quicksort, flow routing, hydrological model |
45 | Maarten H. van Emden |
Algorithms 402: Increasing the efficiency of quicksort. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Commun. ACM ![In: Commun. ACM 13(11), pp. 693-694, 1970. The full citation details ...](Pics/full.jpeg) |
1970 |
DBLP DOI BibTeX RDF |
sorting, quicksort |
43 | Ravi Jain, David Molnar, Zulfikar Ramzan |
Towards understanding algorithmic factors affecting energy consumption: switching complexity, randomness, and preliminary experiments. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DIALM-POMC ![In: Proceedings of the DIALM-POMC Joint Workshop on Foundations of Mobile Computing, Cologne, Germany, September 2, 2005, pp. 70-79, 2005, ACM, 1-59593-092-2. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
randomness cost, switching cost, energy measurement |
43 | Per-Åke Larson |
External Sorting: Run Formation Revisited. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Knowl. Data Eng. ![In: IEEE Trans. Knowl. Data Eng. 15(4), pp. 961-972, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
replacement selection, run formation, External sorting, merge sort |
41 | Emanuele Manca, Andrea Manconi, Alessandro Orro, Giuliano Armano, Luciano Milanesi |
CUDA-quicksort: an improved GPU-based implementation of quicksort. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Concurr. Comput. Pract. Exp. ![In: Concurr. Comput. Pract. Exp. 28(1), pp. 21-43, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
41 | Razvan Certezeanu, Sophia Drossopoulou, Benjamin Egelund-Müller, K. Rustan M. Leino, Sinduran Sivarajan, Mark J. Wheelhouse |
Quicksort Revisited - Verifying Alternative Versions of Quicksort. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory and Practice of Formal Methods ![In: Theory and Practice of Formal Methods - Essays Dedicated to Frank de Boer on the Occasion of His 60th Birthday, pp. 407-426, 2016, Springer, 978-3-319-30733-6. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
41 | Sebastian Wild |
Quicksort mit zwei Pivots und mehr: Eine mathematische Analyse von Mehrwege-Partitionierungsverfahren und der Frage, wie Quicksort dadurch schneller wird. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ausgezeichnete Informatikdissertationen ![In: Ausgezeichnete Informatikdissertationen 2016, pp. 319-328, 2016, GI, 978-3-88579-976-4. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP BibTeX RDF |
|
41 | Daniel Cederman, Philippas Tsigas |
GPU-Quicksort: A practical Quicksort algorithm for graphics processors. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM J. Exp. Algorithmics ![In: ACM J. Exp. Algorithmics 14, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
35 | Mahmoud Fouz, Manfred Kufleitner, Bodo Manthey, Nima Zeini Jahromi |
On Smoothed Analysis of Quicksort and Hoare's Find. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics, 15th Annual International Conference, COCOON 2009, Niagara Falls, NY, USA, July 13-15, 2009, Proceedings, pp. 158-167, 2009, Springer, 978-3-642-02881-6. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
35 | Eelis van der Weegen, James McKinna |
A Machine-Checked Proof of the Average-Case Complexity of Quicksort in Coq. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TYPES ![In: Types for Proofs and Programs, International Conference, TYPES 2008, Torino, Italy, March 26-29, 2008, Revised Selected Papers, pp. 256-271, 2008, Springer, 978-3-642-02443-6. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
35 | Kanela Kaligosi, Peter Sanders 0001 |
How Branch Mispredictions Affect Quicksort. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2006, 14th Annual European Symposium, Zurich, Switzerland, September 11-13, 2006, Proceedings, pp. 780-791, 2006, Springer, 3-540-38875-3. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
35 | Rodolfo Torres-Velázquez, Vladimir Estivill-Castro |
A Memetic Algorithm Guided by Quicksort for the Error-Correcting Graph Isomorphism Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EvoWorkshops ![In: Applications of Evolutionary Computing, EvoWorkshops 2002: EvoCOP, EvoIASP, EvoSTIM/EvoPLAN, Kinsale, Ireland, April 3-4, 2002, Proceedings, pp. 173-182, 2002, Springer, 3-540-43432-1. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
35 | Charles Knessl, Wojciech Szpankowski |
Quicksort Again Revisited. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RANDOM ![In: Randomization and Approximation Techniques in Computer Science, Second International Workshop, RANDOM'98, Barcelona, Spain, October 8-10, 1998, Proceedings, pp. 345-356, 1998, Springer, 3-540-65142-X. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
29 | Daniel Spoonhower, Guy E. Blelloch, Phillip B. Gibbons, Robert Harper 0001 |
Beyond nested parallelism: tight bounds on work-stealing overheads for parallel futures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPAA ![In: SPAA 2009: Proceedings of the 21st Annual ACM Symposium on Parallelism in Algorithms and Architectures, Calgary, Alberta, Canada, August 11-13, 2009, pp. 91-100, 2009, ACM, 978-1-60558-606-9. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
scheduling, work stealing, futures, performance bounds |
29 | Amr Elmasry, Abdelrahman Hammad |
Inversion-sensitive sorting algorithms in practice. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM J. Exp. Algorithmics ![In: ACM J. Exp. Algorithmics 13, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Adaptive sorting, Inversions |
29 | Rebecca Wirfs-Brock |
Connecting Design with Code. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Softw. ![In: IEEE Softw. 25(2), pp. 20-21, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
29 | Gilles Barthe, Benjamin Grégoire, Colin Riba |
Type-Based Termination with Sized Products. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSL ![In: Computer Science Logic, 22nd International Workshop, CSL 2008, 17th Annual Conference of the EACSL, Bertinoro, Italy, September 16-19, 2008. Proceedings, pp. 493-507, 2008, Springer, 978-3-540-87530-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
29 | Ezequiel Herruzo, Guillermo Ruíz, José Ignacio Benavides, Oscar G. Plata |
A New Parallel Sorting Algorithm based on Odd-Even Mergesort. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PDP ![In: 15th Euromicro International Conference on Parallel, Distributed and Network-Based Processing (PDP 2007), 7-9 February 2007, Naples, Italy, pp. 18-22, 2007, IEEE Computer Society, 0-7695-2784-1. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
29 | Jie Liu 0026, Clinton Knowles, Adam Davis |
A Cost Optimal Parallel Quicksorting and Its Implementation on a Shared Memory Parallel Computer. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISPA ![In: Parallel and Distributed Processing and Applications, Third International Symposium, ISPA 2005, Nanjing, China, November 2-5, 2005, Proceedings, pp. 491-502, 2005, Springer, 3-540-29769-3. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
29 | Peter Sanders 0001, Sebastian Winkel |
Super Scalar Sample Sort. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2004, 12th Annual European Symposium, Bergen, Norway, September 14-17, 2004, Proceedings, pp. 784-796, 2004, Springer, 3-540-23025-4. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
29 | 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 |
|
29 | Sarita V. Adve, Alan L. Cox, Sandhya Dwarkadas, Ramakrishnan Rajamony, Willy Zwaenepoel |
A Comparison of Entry Consistency and Lazy Release Consistency Implementations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
HPCA ![In: Proceedings of the Second International Symposium on High-Performance Computer Architecture, San Jose, CA, USA, February 3-7, 1996, pp. 26-37, 1996, IEEE Computer Society, 0-8186-7237-4. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
parallel computation, shared memory, performance measurement, networks of workstations, consistency models |
25 | Darrah Chavey |
Double sorting: testing their sorting skills. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGCSE ![In: Proceedings of the 41st ACM technical symposium on Computer science education, SIGCSE 2010, Milwaukee, Wisconsin, USA, March 10-13, 2010, pp. 381-384, 2010, ACM, 978-1-4503-0006-3. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
cs1, sorting, selection, insertion, quicksort |
25 | Timothy Furtak, José Nelson Amaral, Robert Niewiadomski |
Using SIMD registers and instructions to enable instruction-level parallelism in sorting algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPAA ![In: SPAA 2007: Proceedings of the 19th Annual ACM Symposium on Parallelism in Algorithms and Architectures, San Diego, California, USA, June 9-11, 2007, pp. 348-357, 2007, ACM, 978-1-59593-667-7. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
sorting, instruction-level parallelism, SIMD, vectorization, sorting networks, quicksort |
25 | Ketan Mulmuley |
Randomized Geometric Algorithms and Pseudo-Random Generators (Extended Abstract) ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 33rd Annual Symposium on Foundations of Computer Science, Pittsburgh, Pennsylvania, USA, 24-27 October 1992, pp. 90-100, 1992, IEEE Computer Society, 0-8186-2900-2. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
expected running times, computational geometry, Voronoi diagram, pseudo-random generators, convex polytope, Quicksort, randomized incremental algorithms |
20 | Riikka Numminen, Ileana Montoya Perez, Ivan Jambor, Tapio Pahikkala, Antti Airola |
Quicksort leave-pair-out cross-validation for ROC curve analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Stat. ![In: Comput. Stat. 38(3), pp. 1579-1595, September 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
20 | Irvin Catic, Mehmed Mujic, Novica Nosovic, Tarik Hrnjic |
Enhancing Performance of CUDA Quicksort Through Pivot Selection and Branching Avoidance Methods. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICAT ![In: XXIX International Conference on Information, Communication and Automation Technologies, ICAT 2023, Sarajevo, Bosnia and Herzegovina, June 11-14, 2023, pp. 1-5, 2023, IEEE, 979-8-3503-9983-7. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
20 | Daniel Langr, Klára Schovánková |
CPP11sort: A parallel quicksort based on C++ threading. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Concurr. Comput. Pract. Exp. ![In: Concurr. Comput. Pract. Exp. 34(4), 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
20 | Mark Blacher, Joachim Giesen, Peter Sanders 0001, Jan Wassenberg |
Vectorized and performance-portable Quicksort. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2205.05982, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
20 | Jan Wassenberg, Mark Blacher, Joachim Giesen, Peter Sanders 0001 |
Vectorized and performance-portable quicksort. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Softw. Pract. Exp. ![In: Softw. Pract. Exp. 52(12), pp. 2684-2699, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
20 | Orson R. L. Peters |
Pattern-defeating Quicksort. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2106.05123, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
20 | Shin-Cheng Mu, Tsung-Ju Chiang |
Deriving monadic quicksort (Declarative Pearl). ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2101.11421, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
20 | Aryaf Al-Adwan, Rawan Zaghloul, Basel A. Mahafzah, Ahmad Abdel-Aziz Sharieh |
Parallel quicksort algorithm on OTIS hyper hexa-cell optoelectronic architecture. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Parallel Distributed Comput. ![In: J. Parallel Distributed Comput. 141, pp. 61-73, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
20 | Emanuele De Angelis, Fabio Fioravanti, Maurizio Proietti |
Transformational Verification of Quicksort. ![Search on Bibsonomy](Pics/bibsonomy.png) |
VPT/HCVS@ETAPS ![In: Proceedings 8th International Workshop on Verification and Program Transformation and 7th Workshop on Horn Clauses for Verification and Synthesis, VPT/HCVS@ETAPS 2020, Dublin, Ireland, 25-26th April 2020., pp. 95-109, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
20 | Shin-Cheng Mu, Tsung-Ju Chiang |
Declarative Pearl: Deriving Monadic Quicksort. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FLOPS ![In: Functional and Logic Programming - 15th International Symposium, FLOPS 2020, Akita, Japan, September 14-16, 2020, Proceedings, pp. 124-138, 2020, Springer, 978-3-030-59024-6. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
20 | Martin Aumüller 0001, Martin Dietzfelbinger, Clemens Heuberger, Daniel Krenn, Helmut Prodinger |
Dual-Pivot Quicksort: Optimality, Analysis and Zeros of Associated Lattice Paths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. Probab. Comput. ![In: Comb. Probab. Comput. 28(4), pp. 485-518, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
20 | Stefan Edelkamp, Armin Weiß |
BlockQuicksort: Avoiding Branch Mispredictions in Quicksort. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM J. Exp. Algorithmics ![In: ACM J. Exp. Algorithmics 24(1), pp. 1.4:1-1.4:22, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
20 | Shoupu Wan |
Loop Programming Practices that Simplify Quicksort Implementations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1906.05384, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
20 | YuKun Yao |
A Detailed Analysis of Quicksort Algorithms with Experimental Mathematics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1905.00118, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
20 | James Allen Fill, Wei-Chun Hung |
QuickSort: Improved right-tail asymptotics for the limiting distribution, and large deviations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1903.07775, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
20 | Ami Marowka |
Studying the Performance of Vector-Based Quicksort Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PPAM (2) ![In: Parallel Processing and Applied Mathematics - 13th International Conference, PPAM 2019, Bialystok, Poland, September 8-11, 2019, Revised Selected Papers, Part II, pp. 13-24, 2019, Springer, 978-3-030-43221-8. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
20 | James Allen Fill, Wei-Chun Hung |
QuickSort: Improved right-tail asymptotics for the limiting distribution, and large deviations (Extended Abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
ANALCO ![In: Proceedings of the Sixteenth Workshop on Analytic Algorithmics and Combinatorics, ANALCO 2019, San Diego, CA, USA, January 6, 2019., pp. 87-93, 2019, SIAM. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
20 | Jesper Larsson Träff |
Parallel Quicksort without Pairwise Element Exchange. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1804.07494, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
20 | James Allen Fill, Wei-Chun Hung |
On the tails of the limiting QuickSort density. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1808.00643, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
20 | Sebastian Wild |
Dual-pivot and beyond: The potential of multiway partitioning in quicksort. ![Search on Bibsonomy](Pics/bibsonomy.png) |
it Inf. Technol. ![In: it Inf. Technol. 60(3), pp. 173-177, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
20 | Michael Axtmann, Armin Wiebigke, Peter Sanders 0001 |
Lightweight MPI Communicators with Applications to Perfectly Balanced Quicksort. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPDPS ![In: 2018 IEEE International Parallel and Distributed Processing Symposium, IPDPS 2018, Vancouver, BC, Canada, May 21-25, 2018, pp. 254-265, 2018, IEEE Computer Society, 978-1-5386-4368-6. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
20 | Siyuan Ren, Shizhen Xu, Guangwen Yang |
A Parallel Quicksort Algorithm on Manycore Processors in Sunway TaihuLight. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCS (3) ![In: Computational Science - ICCS 2018 - 18th International Conference, Wuxi, China, June 11-13, 2018 Proceedings, Part III, pp. 647-653, 2018, Springer, 978-3-319-93712-0. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
20 | James Allen Fill, Wei-Chun Hung |
On the Tails of the Limiting QuickSort Density. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AofA ![In: 29th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms, AofA 2018, June 25-29, 2018, Uppsala, Sweden, pp. 21:1-21:10, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-078-1. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
20 | Ralph Neininger, Jasmin Straub |
Probabilistic Analysis of the Dual-Pivot Quicksort "Count". ![Search on Bibsonomy](Pics/bibsonomy.png) |
ANALCO ![In: Proceedings of the Fifteenth Workshop on Analytic Algorithmics and Combinatorics, ANALCO 2018, New Orleans, LA, USA, January 8-9, 2018., pp. 1-7, 2018, SIAM, 978-1-61197-506-2. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
20 | Sebastian Wild |
Quicksort Is Optimal For Many Equal Keys. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ANALCO ![In: Proceedings of the Fifteenth Workshop on Analytic Algorithmics and Combinatorics, ANALCO 2018, New Orleans, LA, USA, January 8-9, 2018., pp. 8-22, 2018, SIAM, 978-1-61197-506-2. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
20 | Shuo Yan, Jie Xue 0001, Xiyu Liu 0001 |
An Improved Quicksort Algorithm Based on Tissue-Like P Systems with Promoters. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. Conf. on Membrane Computing ![In: Membrane Computing - 19th International Conference, CMC 2018, Dresden, Germany, September 4-7, 2018, Revised Selected Papers, pp. 258-274, 2018, Springer, 978-3-030-12796-1. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
20 | Michael Axtmann, Armin Wiebigke, Peter Sanders 0001 |
Lightweight MPI Communicators with Applications to Perfectly Balanced Schizophrenic Quicksort. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1710.08027, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP BibTeX RDF |
|
20 | Ralph Neininger, Jasmin Straub |
Probabilistic Analysis of the Dual-Pivot Quicksort "Count". ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1710.07505, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP BibTeX RDF |
|
20 | Manuel Eberl |
The number of comparisons in QuickSort. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Arch. Formal Proofs ![In: Arch. Formal Proofs 2017, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP BibTeX RDF |
|
20 | Bernhard Beckert, Jonas Schiffl, Peter H. Schmitt, Mattias Ulbrich |
Proving JDK's Dual Pivot Quicksort Correct. ![Search on Bibsonomy](Pics/bibsonomy.png) |
VSTTE ![In: Verified Software. Theories, Tools, and Experiments - 9th International Conference, VSTTE 2017, Heidelberg, Germany, July 22-23, 2017, Revised Selected Papers, pp. 35-48, 2017, Springer, 978-3-319-72307-5. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
20 | Ratthaslip Ranokphanuwat, Surin Kittitornkun |
Parallel Partition and Merge QuickSort (PPMQSort) on Multicore CPUs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Supercomput. ![In: J. Supercomput. 72(3), pp. 1063-1091, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
20 | Martin Aumüller 0001, Martin Dietzfelbinger, Pascal Klaue |
How Good Is Multi-Pivot Quicksort? ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Algorithms ![In: ACM Trans. Algorithms 13(1), pp. 8:1-8:47, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
20 | Martin Aumüller 0001, Martin Dietzfelbinger |
Optimal Partitioning for Dual-Pivot Quicksort. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Algorithms ![In: ACM Trans. Algorithms 12(2), pp. 18:1-18:36, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
20 | Markus E. Nebel, Sebastian Wild, Conrado Martínez |
Analysis of Pivot Sampling in Dual-Pivot Quicksort: A Holistic Analysis of Yaroslavskiy's Partitioning Scheme. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 75(4), pp. 632-683, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
20 | Martin Aumüller 0001, Martin Dietzfelbinger, Clemens Heuberger, Daniel Krenn, Helmut Prodinger |
Dual-Pivot Quicksort: Optimality, Analysis and Zeros of Associated Lattice Paths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1611.00258, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP BibTeX RDF |
|
20 | Martin Aumüller 0001, Martin Dietzfelbinger, Clemens Heuberger, Daniel Krenn, Helmut Prodinger |
Counting Zeros in Random Walks on the Integers and Analysis of Optimal Dual-Pivot Quicksort. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1602.04031, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP BibTeX RDF |
|
20 | Sebastian Wild |
Sorting Discrete i.i.d. Inputs: Quicksort is Optimal. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1608.04906, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP BibTeX RDF |
|
20 | Noriyuki Kurosawa |
Quicksort with median of medians is considered practical. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1608.04852, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP BibTeX RDF |
|
20 | Stefan Edelkamp, Armin Weiß |
BlockQuicksort: How Branch Mispredictions don't affect Quicksort. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1604.06697, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP BibTeX RDF |
|
20 | Shay Gueron, Vlad Krasnov |
Fast Quicksort Implementation Using AVX Instructions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. J. ![In: Comput. J. 59(1), pp. 83-90, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
20 | Stefan Edelkamp, Armin Weiß |
BlockQuicksort: Avoiding Branch Mispredictions in Quicksort. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 24th Annual European Symposium on Algorithms, ESA 2016, August 22-24, 2016, Aarhus, Denmark, pp. 38:1-38:16, 2016, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-015-6. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
20 | Sebastian Wild |
Dual-Pivot Quicksort and Beyond: Analysis of Multiway Partitioning and Its Practical Potential (PDF / PS) ![Search on Bibsonomy](Pics/bibsonomy.png) |
|
2016 |
RDF |
|
20 | Sebastian Wild, Markus E. Nebel, Ralph Neininger |
Average Case and Distributional Analysis of Dual-Pivot Quicksort. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Algorithms ![In: ACM Trans. Algorithms 11(3), pp. 22:1-22:42, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
20 | Vasileios Iliopoulos, David B. Penman |
Dual pivot Quicksort. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1503.08498, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP BibTeX RDF |
|
20 | Martin Aumüller 0001, Martin Dietzfelbinger, Pascal Klaue |
How Good is Multi-Pivot Quicksort? ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1510.04676, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP BibTeX RDF |
|
20 | Mathias Bæk Tejs Knudsen, Morten Stöckel |
Quicksort, Largest Bucket, and Min-Wise Hashing with Limited Independence. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1502.05729, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP BibTeX RDF |
|
20 | Ammar Muqaddas |
Triple State QuickSort, A replacement for the C/C++ library qsort. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1505.00558, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP BibTeX RDF |
|
20 | Guido Hartmann |
A numerical analysis of Quicksort: How many cases are bad cases? ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1507.04220, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP BibTeX RDF |
|
20 | Vasileios Iliopoulos |
The Quicksort algorithm and related topics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1503.02504, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP BibTeX RDF |
|
20 | Svante Janson |
On the tails of the limiting Quicksort distribution. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1508.07230, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP BibTeX RDF |
|
20 | Sebastian Wild |
Why Is Dual-Pivot Quicksort Fast? ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1511.01138, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP BibTeX RDF |
|
20 | Michael Fuchs 0001 |
A note on the quicksort asymptotics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Random Struct. Algorithms ![In: Random Struct. Algorithms 46(4), pp. 677-687, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
20 | Ralph Neininger |
Refined quicksort asymptotics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Random Struct. Algorithms ![In: Random Struct. Algorithms 46(2), pp. 346-361, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
20 | Arne Maus |
A full parallel Quicksort algorithm for multicore processors. ![Search on Bibsonomy](Pics/bibsonomy.png) |
NIK ![In: 28th Norsk Informatikkonferanse, NIK 2015, Høgskolen i Ålesund, Ålesund, Norway, November 23-25, 2015, 2015, Bibsys Open Journal Systems, Norway. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP BibTeX RDF |
|
20 | Mathias Bæk Tejs Knudsen, Morten Stöckel |
Quicksort, Largest Bucket, and Min-Wise Hashing with Limited Independence. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2015 - 23rd Annual European Symposium, Patras, Greece, September 14-16, 2015, Proceedings, pp. 828-839, 2015, Springer, 978-3-662-48349-7. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
20 | Amit Maor |
A Qualitative Analysis of Students' Difficulties with the Quicksort Algorithm Using Arrays (Abstract Only). ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGCSE ![In: Proceedings of the 46th ACM Technical Symposium on Computer Science Education, SIGCSE 2015, Kansas City, MO, USA, March 4-7, 2015, pp. 680, 2015, ACM, 978-1-4503-2966-8. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
20 | Conrado Martínez, Markus E. Nebel, Sebastian Wild |
Analysis of Branch Misses in Quicksort. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ANALCO ![In: Proceedings of the Twelfth Workshop on Analytic Algorithmics and Combinatorics, ANALCO 2015, San Diego, CA, USA, January 4, 2015, pp. 114-128, 2015, SIAM, 978-1-61197-376-1. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
20 | Martin Aumüller 0001 |
On the Analysis of Two Fundamental Randomized Algorithms - Multi-Pivot Quicksort and Efficient Hash Functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
|
2015 |
RDF |
|
20 | Michael L. Fredman |
An intuitive and simple bounding argument for Quicksort. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Process. Lett. ![In: Inf. Process. Lett. 114(3), pp. 137-139, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|