Search results for "quicksort"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
150	Roger L. Wainwright	Quicksort algorithms with an early exit for sorted subfiles.	ACM Conference on Computer Science	1987	DBLP DOI BibTeX RDF
146	Gerth Stølting Brodal, Rolf Fagerberg, Gabriel Moruz	On the adaptiveness of Quicksort.	ACM J. Exp. Algorithmics	2008	DBLP DOI BibTeX RDF	Adaptive sorting, Quicksort, branch mispredictions
103	Branislav Durian	Quicksort Without a Stack.	MFCS	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.	ESA	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.	PDP	2003	DBLP DOI BibTeX RDF
88	Beatrice List, Markus Maucher, Uwe Schöning, Rainer Schuler	Randomized Quicksort and the Entropy of the Random Source.	COCOON	2005	DBLP DOI BibTeX RDF	Entropy, Randomized Algorithms, QuickSort
74	Jean-Loup Baer, Yi-Bing Lin	Improving Quicksort Performance with a Codewort Data Structure.	IEEE Trans. Software Eng.	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.	ACM J. Exp. Algorithmics	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.	MFCS	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.	ICCSA (4)	2004	DBLP DOI BibTeX RDF
54	Domenico Cantone, Gianluca Cincotti	QuickHeapsort, an Efficient Mix of Classical Sorting Algorithms.	CIAC	2000	DBLP DOI BibTeX RDF	In-place sorting, heapsort, analysis of algorithms, quicksort
49	Brigitte Vallée, Julien Clément 0001, James Allen Fill, Philippe Flajolet	The Number of Symbol Comparisons in QuickSort and QuickSelect.	ICALP (1)	2009	DBLP DOI BibTeX RDF
49	James Allen Fill, Svante Janson	The number of bit comparisons used by Quicksort: an average-case analysis.	SODA	2004	DBLP BibTeX RDF
49	Conrado Martínez, Salvador Roura	Optimal Sampling Strategies in Quicksort.	ICALP	1998	DBLP DOI BibTeX RDF
49	Yi Pan 0001, Mounir Hamdi	Quicksort on a Linear Array with a Reconfigurable Pipelined Bus System.	ISPAN	1996	DBLP DOI BibTeX RDF
49	Colin McDiarmid, Ryan Hayward	Strong Concentration for Quicksort.	SODA	1992	DBLP BibTeX RDF
45	Bang Yang, Liliang Ren, Furong Chen, Xiaofan Liu	Identification of Flow-Routing Sequence from DEMs Based on Quicksort.	ESIAT (2)	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.	Commun. ACM	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.	DIALM-POMC	2005	DBLP DOI BibTeX RDF	randomness cost, switching cost, energy measurement
43	Per-Åke Larson	External Sorting: Run Formation Revisited.	IEEE Trans. Knowl. Data Eng.	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.	Concurr. Comput. Pract. Exp.	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.	Theory and Practice of Formal Methods	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.	Ausgezeichnete Informatikdissertationen	2016	DBLP BibTeX RDF
41	Daniel Cederman, Philippas Tsigas	GPU-Quicksort: A practical Quicksort algorithm for graphics processors.	ACM J. Exp. Algorithmics	2009	DBLP DOI BibTeX RDF
35	Mahmoud Fouz, Manfred Kufleitner, Bodo Manthey, Nima Zeini Jahromi	On Smoothed Analysis of Quicksort and Hoare's Find.	COCOON	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.	TYPES	2008	DBLP DOI BibTeX RDF
35	Kanela Kaligosi, Peter Sanders 0001	How Branch Mispredictions Affect Quicksort.	ESA	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.	EvoWorkshops	2002	DBLP DOI BibTeX RDF
35	Charles Knessl, Wojciech Szpankowski	Quicksort Again Revisited.	RANDOM	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.	SPAA	2009	DBLP DOI BibTeX RDF	scheduling, work stealing, futures, performance bounds
29	Amr Elmasry, Abdelrahman Hammad	Inversion-sensitive sorting algorithms in practice.	ACM J. Exp. Algorithmics	2008	DBLP DOI BibTeX RDF	Adaptive sorting, Inversions
29	Rebecca Wirfs-Brock	Connecting Design with Code.	IEEE Softw.	2008	DBLP DOI BibTeX RDF
29	Gilles Barthe, Benjamin Grégoire, Colin Riba	Type-Based Termination with Sized Products.	CSL	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.	PDP	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.	ISPA	2005	DBLP DOI BibTeX RDF
29	Peter Sanders 0001, Sebastian Winkel	Super Scalar Sample Sort.	ESA	2004	DBLP DOI BibTeX RDF
29	Stefan Edelkamp, Patrick Stiegeler	Pushing the Limits in Sequential Sorting.	WAE	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.	HPCA	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.	SIGCSE	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.	SPAA	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)	FOCS	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.	Comput. Stat.	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.	ICAT	2023	DBLP DOI BibTeX RDF
20	Daniel Langr, Klára Schovánková	CPP11sort: A parallel quicksort based on C++ threading.	Concurr. Comput. Pract. Exp.	2022	DBLP DOI BibTeX RDF
20	Mark Blacher, Joachim Giesen, Peter Sanders 0001, Jan Wassenberg	Vectorized and performance-portable Quicksort.	CoRR	2022	DBLP DOI BibTeX RDF
20	Jan Wassenberg, Mark Blacher, Joachim Giesen, Peter Sanders 0001	Vectorized and performance-portable quicksort.	Softw. Pract. Exp.	2022	DBLP DOI BibTeX RDF
20	Orson R. L. Peters	Pattern-defeating Quicksort.	CoRR	2021	DBLP BibTeX RDF
20	Shin-Cheng Mu, Tsung-Ju Chiang	Deriving monadic quicksort (Declarative Pearl).	CoRR	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.	J. Parallel Distributed Comput.	2020	DBLP DOI BibTeX RDF
20	Emanuele De Angelis, Fabio Fioravanti, Maurizio Proietti	Transformational Verification of Quicksort.	VPT/HCVS@ETAPS	2020	DBLP DOI BibTeX RDF
20	Shin-Cheng Mu, Tsung-Ju Chiang	Declarative Pearl: Deriving Monadic Quicksort.	FLOPS	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.	Comb. Probab. Comput.	2019	DBLP DOI BibTeX RDF
20	Stefan Edelkamp, Armin Weiß	BlockQuicksort: Avoiding Branch Mispredictions in Quicksort.	ACM J. Exp. Algorithmics	2019	DBLP DOI BibTeX RDF
20	Shoupu Wan	Loop Programming Practices that Simplify Quicksort Implementations.	CoRR	2019	DBLP BibTeX RDF
20	YuKun Yao	A Detailed Analysis of Quicksort Algorithms with Experimental Mathematics.	CoRR	2019	DBLP BibTeX RDF
20	James Allen Fill, Wei-Chun Hung	QuickSort: Improved right-tail asymptotics for the limiting distribution, and large deviations.	CoRR	2019	DBLP BibTeX RDF
20	Ami Marowka	Studying the Performance of Vector-Based Quicksort Algorithm.	PPAM (2)	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).	ANALCO	2019	DBLP DOI BibTeX RDF
20	Jesper Larsson Träff	Parallel Quicksort without Pairwise Element Exchange.	CoRR	2018	DBLP BibTeX RDF
20	James Allen Fill, Wei-Chun Hung	On the tails of the limiting QuickSort density.	CoRR	2018	DBLP BibTeX RDF
20	Sebastian Wild	Dual-pivot and beyond: The potential of multiway partitioning in quicksort.	it Inf. Technol.	2018	DBLP DOI BibTeX RDF
20	Michael Axtmann, Armin Wiebigke, Peter Sanders 0001	Lightweight MPI Communicators with Applications to Perfectly Balanced Quicksort.	IPDPS	2018	DBLP DOI BibTeX RDF
20	Siyuan Ren, Shizhen Xu, Guangwen Yang	A Parallel Quicksort Algorithm on Manycore Processors in Sunway TaihuLight.	ICCS (3)	2018	DBLP DOI BibTeX RDF
20	James Allen Fill, Wei-Chun Hung	On the Tails of the Limiting QuickSort Density.	AofA	2018	DBLP DOI BibTeX RDF
20	Ralph Neininger, Jasmin Straub	Probabilistic Analysis of the Dual-Pivot Quicksort "Count".	ANALCO	2018	DBLP DOI BibTeX RDF
20	Sebastian Wild	Quicksort Is Optimal For Many Equal Keys.	ANALCO	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.	Int. Conf. on Membrane Computing	2018	DBLP DOI BibTeX RDF
20	Michael Axtmann, Armin Wiebigke, Peter Sanders 0001	Lightweight MPI Communicators with Applications to Perfectly Balanced Schizophrenic Quicksort.	CoRR	2017	DBLP BibTeX RDF
20	Ralph Neininger, Jasmin Straub	Probabilistic Analysis of the Dual-Pivot Quicksort "Count".	CoRR	2017	DBLP BibTeX RDF
20	Manuel Eberl	The number of comparisons in QuickSort.	Arch. Formal Proofs	2017	DBLP BibTeX RDF
20	Bernhard Beckert, Jonas Schiffl, Peter H. Schmitt, Mattias Ulbrich	Proving JDK's Dual Pivot Quicksort Correct.	VSTTE	2017	DBLP DOI BibTeX RDF
20	Ratthaslip Ranokphanuwat, Surin Kittitornkun	Parallel Partition and Merge QuickSort (PPMQSort) on Multicore CPUs.	J. Supercomput.	2016	DBLP DOI BibTeX RDF
20	Martin Aumüller 0001, Martin Dietzfelbinger, Pascal Klaue	How Good Is Multi-Pivot Quicksort?	ACM Trans. Algorithms	2016	DBLP DOI BibTeX RDF
20	Martin Aumüller 0001, Martin Dietzfelbinger	Optimal Partitioning for Dual-Pivot Quicksort.	ACM Trans. Algorithms	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.	Algorithmica	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.	CoRR	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.	CoRR	2016	DBLP BibTeX RDF
20	Sebastian Wild	Sorting Discrete i.i.d. Inputs: Quicksort is Optimal.	CoRR	2016	DBLP BibTeX RDF
20	Noriyuki Kurosawa	Quicksort with median of medians is considered practical.	CoRR	2016	DBLP BibTeX RDF
20	Stefan Edelkamp, Armin Weiß	BlockQuicksort: How Branch Mispredictions don't affect Quicksort.	CoRR	2016	DBLP BibTeX RDF
20	Shay Gueron, Vlad Krasnov	Fast Quicksort Implementation Using AVX Instructions.	Comput. J.	2016	DBLP DOI BibTeX RDF
20	Stefan Edelkamp, Armin Weiß	BlockQuicksort: Avoiding Branch Mispredictions in Quicksort.	ESA	2016	DBLP DOI BibTeX RDF
20	Sebastian Wild	Dual-Pivot Quicksort and Beyond: Analysis of Multiway Partitioning and Its Practical Potential (PDF / PS)		2016	RDF
20	Sebastian Wild, Markus E. Nebel, Ralph Neininger	Average Case and Distributional Analysis of Dual-Pivot Quicksort.	ACM Trans. Algorithms	2015	DBLP DOI BibTeX RDF
20	Vasileios Iliopoulos, David B. Penman	Dual pivot Quicksort.	CoRR	2015	DBLP BibTeX RDF
20	Martin Aumüller 0001, Martin Dietzfelbinger, Pascal Klaue	How Good is Multi-Pivot Quicksort?	CoRR	2015	DBLP BibTeX RDF
20	Mathias Bæk Tejs Knudsen, Morten Stöckel	Quicksort, Largest Bucket, and Min-Wise Hashing with Limited Independence.	CoRR	2015	DBLP BibTeX RDF
20	Ammar Muqaddas	Triple State QuickSort, A replacement for the C/C++ library qsort.	CoRR	2015	DBLP BibTeX RDF
20	Guido Hartmann	A numerical analysis of Quicksort: How many cases are bad cases?	CoRR	2015	DBLP BibTeX RDF
20	Vasileios Iliopoulos	The Quicksort algorithm and related topics.	CoRR	2015	DBLP BibTeX RDF
20	Svante Janson	On the tails of the limiting Quicksort distribution.	CoRR	2015	DBLP BibTeX RDF
20	Sebastian Wild	Why Is Dual-Pivot Quicksort Fast?	CoRR	2015	DBLP BibTeX RDF
20	Michael Fuchs 0001	A note on the quicksort asymptotics.	Random Struct. Algorithms	2015	DBLP DOI BibTeX RDF
20	Ralph Neininger	Refined quicksort asymptotics.	Random Struct. Algorithms	2015	DBLP DOI BibTeX RDF
20	Arne Maus	A full parallel Quicksort algorithm for multicore processors.	NIK	2015	DBLP BibTeX RDF
20	Mathias Bæk Tejs Knudsen, Morten Stöckel	Quicksort, Largest Bucket, and Min-Wise Hashing with Limited Independence.	ESA	2015	DBLP DOI BibTeX RDF
20	Amit Maor	A Qualitative Analysis of Students' Difficulties with the Quicksort Algorithm Using Arrays (Abstract Only).	SIGCSE	2015	DBLP DOI BibTeX RDF
20	Conrado Martínez, Markus E. Nebel, Sebastian Wild	Analysis of Branch Misses in Quicksort.	ANALCO	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.		2015	RDF
20	Michael L. Fredman	An intuitive and simple bounding argument for Quicksort.	Inf. Process. Lett.	2014	DBLP DOI BibTeX RDF