Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
20 | Conrado Martínez, Markus E. Nebel, Sebastian Wild |
Analysis of Branch Misses in Quicksort. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1411.2059, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP BibTeX RDF |
|
20 | Vasileios Iliopoulos |
A note on multipivot Quicksort. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1407.7459, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP BibTeX RDF |
|
20 | Sebastian Wild, Markus E. Nebel, Conrado Martínez |
Analysis of Pivot Sampling in Dual-Pivot Quicksort. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1412.0193, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP BibTeX RDF |
|
20 | Markus E. Nebel, Sebastian Wild |
Pivot Sampling in Java 7's Dual-Pivot Quicksort. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1403.6602, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP BibTeX RDF |
|
20 | Shrinu Kushagra, Alejandro López-Ortiz, Aurick Qiao, J. Ian Munro |
Multi-Pivot Quicksort: Theory and Experiments. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALENEX ![In: 2014 Proceedings of the Sixteenth Workshop on Algorithm Engineering and Experiments, ALENEX 2014, Portland, Oregon, USA, January 5, 2014, pp. 47-60, 2014, SIAM, 978-1-61197-319-8. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
20 | Ugur Erkin Kocamaz |
Increasing the efficiency of quicksort using a neural network based algorithm selection model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Sci. ![In: Inf. Sci. 229, pp. 94-105, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
20 | Basel A. Mahafzah |
Performance assessment of multithreaded quicksort algorithm on simultaneous multithreaded architecture. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Supercomput. ![In: J. Supercomput. 66(1), pp. 339-363, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
20 | Sebastian Wild, Markus E. Nebel, Ralph Neininger |
Average Case and Distributional Analysis of Java 7's Dual Pivot Quicksort ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1304.0988, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP BibTeX RDF |
|
20 | Martin Aumüller 0001, Martin Dietzfelbinger |
Optimal Partitioning for Dual Pivot Quicksort ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1303.5217, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP BibTeX RDF |
|
20 | Sebastian Wild, Markus E. Nebel |
Average Case Analysis of Java 7's Dual Pivot Quicksort. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1310.7409, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP BibTeX RDF |
|
20 | Martin Aumüller 0001, Martin Dietzfelbinger |
Optimal Partitioning for Dual Pivot Quicksort - (Extended Abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP (1) ![In: Automata, Languages, and Programming - 40th International Colloquium, ICALP 2013, Riga, Latvia, July 8-12, 2013, Proceedings, Part I, pp. 33-44, 2013, Springer, 978-3-642-39205-4. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
20 | Ulrich Berger 0001, Monika Seisenberger, Gregory J. M. Woods |
Extracting Imperative Programs from Proofs: In-place Quicksort. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TYPES ![In: 19th International Conference on Types for Proofs and Programs, TYPES 2013, April 22-26, 2013, Toulouse, France, pp. 84-106, 2013, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-72-9. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
20 | Hari Sundar, Dhairya Malhotra, George Biros |
HykSort: a new variant of hypercube quicksort on distributed memory architectures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICS ![In: International Conference on Supercomputing, ICS'13, Eugene, OR, USA - June 10 - 14, 2013, pp. 293-302, 2013, ACM, 978-1-4503-2130-3. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
20 | Sebastian Wild, Markus E. Nebel, Raphael Reitzig, Ulrich Laube |
Engineering Java 7's Dual Pivot Quicksort Using MaLiJan. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALENEX ![In: Proceedings of the 15th Meeting on Algorithm Engineering and Experiments, ALENEX 2013, New Orleans, Louisiana, USA, January 7, 2013, pp. 55-69, 2013, SIAM, 978-1-61197-253-5. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
20 | Mahmoud Fouz, Manfred Kufleitner, Bodo Manthey, Nima Zeini Jahromi |
On Smoothed Analysis of Quicksort and Hoare's Find. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 62(3-4), pp. 879-905, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
20 | Ralph Neininger |
A refined Quicksort asymptotic ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1207.4556, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP BibTeX RDF |
|
20 | Patrick Bindjeme, James Allen Fill |
The limiting distribution for the number of symbol comparisons used by QuickSort is nondegenerate (extended abstract) ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1201.6444, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP BibTeX RDF |
|
20 | Patrick Bindjeme, James Allen Fill |
Exact L^2-distance from the limit for QuickSort key comparisons (extended abstract) ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1201.6445, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP BibTeX RDF |
|
20 | James Allen Fill, Svante Janson |
The number of bit comparisons used by Quicksort: an average-case analysis ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1202.2595, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP BibTeX RDF |
|
20 | James Allen Fill |
Distributional convergence for the number of symbol comparisons used by QuickSort ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1202.2601, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP BibTeX RDF |
|
20 | Vasileios Iliopoulos, David B. Penman |
Dual Pivot Quicksort. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. Algorithms Appl. ![In: Discret. Math. Algorithms Appl. 4(3), 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
20 | Diarmuid Early, Ang Gao, Michel P. Schellekens |
Frugal Encoding in Reversible MOQA: A Case Study for Quicksort. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RC ![In: Reversible Computation, 4th International Workshop, RC 2012, Copenhagen, Denmark, July 2-3, 2012. Revised Papers, pp. 85-96, 2012, Springer, 978-3-642-36314-6. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
20 | Sebastian Wild, Markus E. Nebel |
Average Case Analysis of Java 7's Dual Pivot Quicksort. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2012 - 20th Annual European Symposium, Ljubljana, Slovenia, September 10-12, 2012. Proceedings, pp. 825-836, 2012, Springer, 978-3-642-33089-6. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
20 | Colin McDiarmid |
Quicksort and Large Deviations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MEMICS ![In: Mathematical and Engineering Methods in Computer Science, 8th International Doctoral Workshop, MEMICS 2012, Znojmo, Czech Republic, October 25-28, 2012, Revised Selected Papers, pp. 43-52, 2012, Springer, 978-3-642-36044-2. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
20 | Maxim A. Babenko, Ivan Pouzyrevsky |
Resilient Quicksort and Selection. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSR ![In: Computer Science - Theory and Applications - 7th International Computer Science Symposium in Russia, CSR 2012, Nizhny Novgorod, Russia, July 3-7, 2012. Proceedings, pp. 6-17, 2012, Springer, 978-3-642-30641-9. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
20 | |
Quicksort. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Encyclopedia of Parallel Computing ![In: Encyclopedia of Parallel Computing, pp. 1689, 2011, Springer, 978-0-387-09765-7. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
20 | Mahmoud Ragab |
Partial quicksort and weighted branching processes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
|
2011 |
RDF |
|
20 | Rami Mansi |
Enhanced Quicksort Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. Arab J. Inf. Technol. ![In: Int. Arab J. Inf. Technol. 7(2), pp. 161-166, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP BibTeX RDF |
|
20 | David Kitchin, Adrian Quark, Jayadev Misra |
Quicksort: Combining Concurrency, Recursion, and Mutable Data Structures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Reflections on the Work of C. A. R. Hoare ![In: Reflections on the Work of C. A. R. Hoare., pp. 229-254, 2010, Springer, 978-1-84882-911-4. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
20 | Stefan Hallerstede |
Proving Quicksort Correct in Event-B. ![Search on Bibsonomy](Pics/bibsonomy.png) |
REFINE@FMWeek ![In: Proceedings of the 14th BCS-FACS Refinement Workshop, REFINE@FMWeek 2009, Eindhoven, The Netherlands, November 2009, pp. 47-65, 2009, Elsevier. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
20 | Eunsang Kim, Kunsoo Park |
Improving multikey Quicksort for sorting strings with many equal elements. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Process. Lett. ![In: Inf. Process. Lett. 109(9), pp. 454-459, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
20 | Conrado Martínez, Helmut Prodinger |
Moves and displacements of particular elements in Quicksort. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 410(21-23), pp. 2279-2284, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
20 | Mahmoud Fouz, Manfred Kufleitner, Bodo Manthey, Nima Zeini Jahromi |
On Smoothed Analysis of Quicksort and Hoare's Find ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/0904.3898, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP BibTeX RDF |
|
20 | Leonor Frias, Jordi Petit |
Combining digital access and parallel partition for quicksort and quickselect. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IWMSE@ICSE ![In: Proceedings of the 2009 ICSE Workshop on Multicore Software Engineering, IWMSE '09, Vancouver, BC, Canada, May 18, 2009., pp. 33-40, 2009, IEEE Computer Society, 978-1-4244-3718-4. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
20 | Suman Kumar Sourabh, Soubhik Chakraborty |
How robust is quicksort average complexity? ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/0811.4376, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP BibTeX RDF |
|
20 | Eunsang Kim, Kunsoo Park |
Improving Multikey Quicksort for Sorting Strings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IWOCA ![In: Proceedings of the 19th International Workshop on Combinatorial Algorithms, IWOCA 2008, September 13-15, 2008, Nagoya, Japan, pp. 89-99, 2008, College Publications, 978-1-904987-74-1. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP BibTeX RDF |
|
20 | Brendan Lucier, Tao Jiang 0001, Ming Li 0001 |
Average-case analysis of QuickSort and Binary Insertion Tree height using incompressibility. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Process. Lett. ![In: Inf. Process. Lett. 103(2), pp. 45-51, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
20 | Bodo Manthey, Till Tantau |
Smoothed Analysis of Binary Search Trees and Quicksort Under Additive Noise. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR07, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP BibTeX RDF |
|
20 | H. M. Okasha, U. Rösler |
Asymptotic distributions for Random Median Quicksort. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Discrete Algorithms ![In: J. Discrete Algorithms 5(3), pp. 592-608, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
20 | Bodo Manthey, Till Tantau |
Smoothed Analysis of Binary Search Trees and Quicksort Under Additive Noise. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Probabilistic Methods in the Design and Analysis of Algorithms ![In: Probabilistic Methods in the Design and Analysis of Algorithms, 23.09. - 28.09.2007, 2007, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP BibTeX RDF |
|
20 | Salvador Romaguera, Pedro Tirado |
Contraction Maps on Ifqm-spaces with Application to Recurrence Equations of Quicksort. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCSIT ![In: Proceedings of the Irish Conference on the Mathematical Foundations of Computer Science and Information Technology, MFCSIT 2006, Cork, Ireland, August 1-5, 2006, pp. 269-279, 2006, Elsevier. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
20 | David Podgorelec, Gregor Klajnsek |
Acceleration of sweep-line technique by employing smart quicksort. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Sci. ![In: Inf. Sci. 169(3-4), pp. 383-408, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
20 | Gerth Stølting Brodal, Rolf Fagerberg, Gabriel Moruz |
On the Adaptiveness of Quicksort. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALENEX/ANALCO ![In: Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments and the Second Workshop on Analytic Algorithmics and Combinatorics, ALENEX /ANALCO 2005, Vancouver, BC, Canada, 22 January 2005, pp. 130-140, 2005, SIAM, 0-89871-596-2. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP BibTeX RDF |
|
20 | Fouad El-Aker |
Improving Genetic Quicksort Run Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IC-AI ![In: Proceedings of the 2005 International Conference on Artificial Intelligence, ICAI 2005, Las Vegas, Nevada, USA, June 27-30, 2005, Volume 2, pp. 933-937, 2005, CSREA Press, 1-932415-67-X. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP BibTeX RDF |
|
20 | Laurent Alonso, Philippe Chassaing, Florent Gillet, Svante Janson, Edward M. Reingold, René Schott |
Quicksort with Unreliable Comparisons: A Probabilistic Analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. Probab. Comput. ![In: Comb. Probab. Comput. 13(4-5), pp. 419-449, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
20 | Michael Fothe |
Zeit und Raum bei Quicksort. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LOG IN ![In: LOG IN 24(130), pp. 49-50, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP BibTeX RDF |
|
20 | Beatrice List, Markus Maucher, Uwe Schöning, Rainer Schuler |
Randomized Quicksort and the Entropy of the Random Number Generator ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR04, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP BibTeX RDF |
|
20 | Beatrice List, Markus Maucher, Uwe Schöning, Rainer Schuler |
Randomized QuickSort and the Entropy of the Random Source. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algebraic Methods in Computational Complexity ![In: Algebraic Methods in Computational Complexity, 10.-15. October 2004, 2004, IBFI, Schloss Dagstuhl, Germany. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP BibTeX RDF |
|
20 | Conrado Martínez |
Patial Quicksort. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALENEX/ANALC ![In: Proceedings of the Sixth Workshop on Algorithm Engineering and Experiments and the First Workshop on Analytic Algorithmics and Combinatorics, New Orleans, LA, USA, January 10, 2004, pp. 224-228, 2004, SIAM, 0-89871-564-4. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP BibTeX RDF |
|
20 | Marianne Durand |
Asymptotic analysis of an optimized quicksort algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Process. Lett. ![In: Inf. Process. Lett. 85(2), pp. 73-77, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
20 | Krzysztof C. Kiwiel |
Partitioning schemes for quicksort and quickselect ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR cs.DS/0312054, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP BibTeX RDF |
|
20 | Jie Liu 0026, Jackson He |
A Cost Optimal Parallel Quicksort on CREW PRAM. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CATA ![In: Proceedings of the ISCA 18th International Conference Computers and Their Applications, Honolulu, Hawaii, USA, March 26-28, 2003, pp. 13-16, 2003, ISCA, 1-880843-46-3. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP BibTeX RDF |
|
20 | 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 |
|
20 | James Allen Fill, Svante Janson |
Quicksort asymptotics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Algorithms ![In: J. Algorithms 44(1), pp. 4-28, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
20 | Ralph Neininger, Ludger Rüschendorf |
Rates of convergence for Quicksort. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Algorithms ![In: J. Algorithms 44(1), pp. 52-62, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
20 | Hsien-Kuei Hwang, Ralph Neininger |
Phase Change of Limit Laws in the Quicksort Recurrence under Varying Toll Functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Comput. ![In: SIAM J. Comput. 31(6), pp. 1687-1722, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
20 | Hua-Huai Chern, Hsien-Kuei Hwang |
Transitional Behaviors of the Average Cost of Quicksort with Median-of-(2t+1). ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 29(1), pp. 44-69, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
Four-color theorem, Graph coloring, Quadtree |
20 | Hua-Huai Chern, Hsien-Kuei Hwang |
Phase changes in random m-ary search trees and generalized quicksort. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Random Struct. Algorithms ![In: Random Struct. Algorithms 19(3-4), pp. 316-358, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
20 | James Allen Fill, Svante Janson |
Approximating the limiting Quicksort distribution. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Random Struct. Algorithms ![In: Random Struct. Algorithms 19(3-4), pp. 376-406, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
20 | Ralph Neininger |
On a multivariate contraction method for random recursive structures with applications to Quicksort. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Random Struct. Algorithms ![In: Random Struct. Algorithms 19(3-4), pp. 498-524, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
20 | Conrado Martínez, Salvador Roura |
Optimal Sampling Strategies in Quicksort and Quickselect. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Comput. ![In: SIAM J. Comput. 31(3), pp. 683-705, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
20 | Joseph F. JáJá |
A perspective on Quicksort. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Sci. Eng. ![In: Comput. Sci. Eng. 2(1), pp. 43-49, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
20 | James Allen Fill, Svante Janson |
Smoothness and decay properties of the limiting Quicksort density function ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR math.PR/0005235, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP BibTeX RDF |
|
20 | James Allen Fill, Svante Janson |
A characterization of the set of fixed points of the Quicksort transformation ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR math.PR/0005236, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP BibTeX RDF |
|
20 | Luc Devroye, James Allen Fill, Ralph Neininger |
Perfect simulation from the Quicksort limit distribution ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR math.PR/0005237, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP BibTeX RDF |
|
20 | Charles Knessl, Wojciech Szpankowski |
Quicksort Algorithm Again Revisited. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. Theor. Comput. Sci. ![In: Discret. Math. Theor. Comput. Sci. 3(2), pp. 43-64, 1999. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
20 | M. Douglas McIlroy |
A Killer Adversary for Quicksort. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Softw. Pract. Exp. ![In: Softw. Pract. Exp. 29(4), pp. 341-344, 1999. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
20 | Uwe Stephan |
Zur Behandlung von Quicksort im Unterricht. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LOG IN ![In: LOG IN 18(1), pp. 47-, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP BibTeX RDF |
|
20 | Yi Pan 0001, Mounir Hamdi, Keqin Li 0001 |
Efficient and scalable quicksort on a linear array with a reconfigurable pipelined bus system. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Future Gener. Comput. Syst. ![In: Future Gener. Comput. Syst. 13(6), pp. 501-513, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
20 | Peter Sanders 0001, Thomas Hansch |
Efficient Massively Parallel Quicksort. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IRREGULAR ![In: Solving Irregularly Structured Problems in Parallel, 4th International Symposium, IRREGULAR '97, Paderborn, Germany, June 12-13, 1997, Proceedings, pp. 13-24, 1997, Springer, 3-540-63138-0. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
20 | S. Mansoor Sarwar, Syed Aqeel Sarwar, Mansour H. A. Jaragh, Jesse Brandeburg |
Engineering Quicksort. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Lang. ![In: Comput. Lang. 22(1), pp. 39-47, 1996. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
20 | Michael Cramer |
A Note Concerning the Limit Distribution of the Quicksort Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RAIRO Theor. Informatics Appl. ![In: RAIRO Theor. Informatics Appl. 30(3), pp. 195-207, 1996. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
20 | Colin McDiarmid, Ryan Hayward |
Large Deviations for Quicksort. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Algorithms ![In: J. Algorithms 21(3), pp. 476-507, 1996. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
20 | Catherine C. McGeoch, J. D. Tygar |
Optimal Sampling Strategies for Quicksort. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Random Struct. Algorithms ![In: Random Struct. Algorithms 7(4), pp. 287-300, 1995. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
20 | William F. Eddy, Mark J. Schervish |
How Many Comparisons Does Quicksort Use? ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Algorithms ![In: J. Algorithms 19(3), pp. 402-431, 1995. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
20 | Henry G. Baker |
A "Linear Logic" Quicksort. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM SIGPLAN Notices ![In: ACM SIGPLAN Notices 29(2), pp. 13-18, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
LISP |
20 | S. Mansoor Sarwar, Mansour H. A. Jaragh, Mike Wind |
An Empirical Study of the Run-Time Behavior of Quicksort, Shellsort and Mergesort for Medium to Large Size Data. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Lang. ![In: Comput. Lang. 20(2), pp. 127-134, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
20 | R. Chaudhuri, Andrew C. Dempster |
A note on generating a worst case sequence for Quicksort in linear time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAC ![In: Proceedings of the 1994 ACM Symposium on Applied Computing, SAC'94, Phoenix, AZ, USA, March 6-8, 1994, pp. 566-567, 1994, ACM, 0-89791-647-6. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
Quicksor, worst case |
20 | David S. L. Wei |
Quicksort and permutation routing on the hypercube and de Bruijn networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISPAN ![In: International Symposium on Parallel Architectures, Algorithms and Networks, ISPAN 1994, Kanazawa, Japan, December 14-16, 1994, pp. 238-245, 1994, IEEE Computer Society, 0-8186-6507-6. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
20 | R. Chaudhuri, Andrew C. Dempster |
A note on slowing Quicksort. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM SIGCSE Bull. ![In: ACM SIGCSE Bull. 25(2), pp. 57-58, 1993. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
20 | 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 |
|
20 | Theodore Brown, Renbing Xiong |
A Parallel Quicksort Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Parallel Distributed Comput. ![In: J. Parallel Distributed Comput. 19(2), pp. 83-89, 1993. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
20 | Rhys S. Francis, L. J. H. Pannan |
A parallel partition for enhanced parallel QuickSort. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Parallel Comput. ![In: Parallel Comput. 18(5), pp. 543-550, 1992. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
20 | Yannis Manolopoulos |
Variations of Quicksort Combined with Insertion Sort. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Wirtschaftsinf. ![In: Wirtschaftsinf. 34(3), pp. 327-333, 1992. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP BibTeX RDF |
|
20 | Youran Lan, Magdi A. Mohamed |
Parallel Quicksort in hypercubes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAC ![In: Proceedings of the 1992 ACM/SIGAPP Symposium on Applied Computing: Technological Challenges of the 1990's, Kansas City, MO, USA, March 1-3, 1992, pp. 740-746, 1992, ACM, 0-89791-502-X. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
20 | Weixiong Zhang, Nageswara S. V. Rao |
Optimal Parallel Quicksort on Erew Pram. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BIT ![In: BIT 31(1), pp. 69-74, 1991. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
|
20 | Bogdan S. Chlebus, Imrich Vrto |
Parallel Quicksort. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Parallel Distributed Comput. ![In: J. Parallel Distributed Comput. 11(4), pp. 332-337, 1991. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
|
20 | U. Rösler |
A limit theorem for "Quicksort". ![Search on Bibsonomy](Pics/bibsonomy.png) |
RAIRO Theor. Informatics Appl. ![In: RAIRO Theor. Informatics Appl. 25, pp. 85-100, 1991. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
|
20 | Philip Heidelberger, V. Alan Norton, John T. Robinson |
Parallel Quicksort Using Fetch-and-Add. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 39(1), pp. 133-138, 1990. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
20 | Stewart A. Levin |
A fully vectorized quicksort. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Parallel Comput. ![In: Parallel Comput. 16(2-3), pp. 369-373, 1990. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
20 | 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 |
|
20 | Charles U. Martel, Dan Gusfield |
A Fast Parallel Quicksort Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Process. Lett. ![In: Inf. Process. Lett. 30(2), pp. 97-102, 1989. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
|
20 | Knut Hildebrand |
Implementierung des Quicksort in COBOL. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Angew. Inform. ![In: Angew. Inform. 31(1), pp. 14-18, 1989. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP BibTeX RDF |
|
20 | Mireille Régnier |
A Limiting Distribution for Quicksort. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RAIRO Theor. Informatics Appl. ![In: RAIRO Theor. Informatics Appl. 23(3), pp. 335-343, 1989. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
|
20 | P. Hennequin |
Combinatorial Analysis of Quicksort Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RAIRO Theor. Informatics Appl. ![In: RAIRO Theor. Informatics Appl. 23(3), pp. 317-333, 1989. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
|
20 | A. Inkeri Verkamo |
External Quicksort. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Perform. Evaluation ![In: Perform. Evaluation 8(4), pp. 271-288, 1988. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
|
20 | Lutz M. Wegner |
A Generalized, One-Way, Stackless Quicksort. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BIT ![In: BIT 27(1), pp. 44-48, 1987. The full citation details ...](Pics/full.jpeg) |
1987 |
DBLP DOI BibTeX RDF |
|
20 | A. Inkeri Verkamo |
Performance of Quicksort Adapted for Virtual Memory Use. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. J. ![In: Comput. J. 30(4), pp. 362-371, 1987. The full citation details ...](Pics/full.jpeg) |
1987 |
DBLP DOI BibTeX RDF |
|
20 | Guy T. Almes |
Distributing Quicksort in a Local Area Network. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COMPCON ![In: COMPCON'87, Digest of Papers, Thirty-Second IEEE Computer Society International Conference, San Francisco, California, USA, February 23-27, 1987, pp. 18-25, 1987, IEEE Computer Society, 0-8186-0764-5. The full citation details ...](Pics/full.jpeg) |
1987 |
DBLP BibTeX RDF |
|
20 | David J. Evans 0001, Nadia Y. Yousif |
Analysis of the Performance of the Parallel Quicksort Method. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BIT ![In: BIT 25(1), pp. 106-112, 1985. The full citation details ...](Pics/full.jpeg) |
1985 |
DBLP DOI BibTeX RDF |
|