Search results for "quicksort"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
3	Gerth Stølting Brodal, Rolf Fagerberg, Gabriel Moruz	On the adaptiveness of Quicksort.	ACM Journal of Experimental Algorithmics	2008	DBLP DOI BibTeX RDF	Adaptive sorting, Quicksort, branch mispredictions
3	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
3	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
3	Branislav Durian	Quicksort Without a Stack.	MFCS	1986	DBLP DOI BibTeX RDF	O(1)-space, Algorithm, Searching, Sorting, Stack, Quicksort
2	Brigitte Vallée, Julien Clément, James Allen Fill, Philippe Flajolet	The Number of Symbol Comparisons in QuickSort and QuickSelect.	ICALP	2009	DBLP DOI BibTeX RDF
2	Bang Yang, Liliang Ren, Furong Chen, Xiaofan Liu	Identification of Flow-Routing Sequence from DEMs Based on Quicksort.	ESIAT	2009	DBLP DOI BibTeX RDF	drainage networks, codification, DEM, quicksort, flow routing, hydrological model
2	Mahmoud Fouz, Manfred Kufleitner, Bodo Manthey, Nima Zeini Jahromi	On Smoothed Analysis of Quicksort and Hoare's Find.	COCOON	2009	DBLP DOI BibTeX RDF
2	Daniel Cederman, Philippas Tsigas	A Practical Quicksort Algorithm for Graphics Processors.	ESA	2008	DBLP DOI BibTeX RDF
2	Bodo Manthey, Till Tantau	Smoothed Analysis of Binary Search Trees and Quicksort under Additive Noise.	MFCS	2008	DBLP DOI BibTeX RDF
2	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
2	Gerth Stølting Brodal, Rolf Fagerberg, Kristoffer Vinther	Engineering a cache-oblivious sorting algorithm.	ACM Journal of Experimental Algorithmics	2007	DBLP DOI BibTeX RDF	funnelsort, quicksort, Cache-oblivious algorithms
2	Kanela Kaligosi, Peter Sanders	How Branch Mispredictions Affect Quicksort.	ESA	2006	DBLP DOI BibTeX RDF
2	James Allen Fill, Svante Janson	The number of bit comparisons used by Quicksort: an average-case analysis.	SODA	2004	DBLP DOI BibTeX RDF
2	Sangman Moh, Chansu Yu, Dongsoo Han	Design and Experiment of a Communication-Aware Parallel Quicksort with Weighted Partition of Processors.	ICCSA	2004	DBLP DOI BibTeX RDF
2	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
2	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
2	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
2	Conrado Martínez, Salvador Roura	Optimal Sampling Strategies in Quicksort.	ICALP	1998	DBLP DOI BibTeX RDF
2	Charles Knessl, Wojciech Szpankowski	Quicksort Again Revisited.	RANDOM	1998	DBLP DOI BibTeX RDF
2	Yi Pan, Mounir Hamdi	Quicksort on a Linear Array with a Reconfigurable Pipelined Bus System.	ISPAN	1996	DBLP DOI BibTeX RDF
2	Colin McDiarmid, Ryan Hayward	Strong Concentration for Quicksort.	SODA	1992	DBLP DOI BibTeX RDF
2	Roger L. Wainwright	Quicksort algorithms with an early exit for sorted subfiles.	ACM Conference on Computer Science	1987	DBLP DOI BibTeX RDF
2	Maarten H. van Emden	Algorithms 402: Increasing the efficiency of quicksort.	Commun. ACM	1970	DBLP DOI BibTeX RDF	sorting, quicksort
1	Mahmoud Fouz, Manfred Kufleitner, Bodo Manthey, Nima Zeini Jahromi	On Smoothed Analysis of Quicksort and Hoare's Find.	Algorithmica	2012	DBLP DOI BibTeX RDF
1	James Allen Fill, Svante Janson	The number of bit comparisons used by Quicksort: an average-case analysis	CoRR	2012	DBLP BibTeX RDF
1	Patrick Bindjeme, James Allen Fill	The limiting distribution for the number of symbol comparisons used by QuickSort is nondegenerate (extended abstract)	CoRR	2012	DBLP BibTeX RDF
1	James Allen Fill	Distributional convergence for the number of symbol comparisons used by QuickSort	CoRR	2012	DBLP BibTeX RDF
1	Patrick Bindjeme, James Allen Fill	Exact L^2-distance from the limit for QuickSort key comparisons (extended abstract)	CoRR	2012	DBLP BibTeX RDF
1		Quicksort.	Encyclopedia of Parallel Computing	2011	DBLP DOI BibTeX RDF
1	Rami Mansi	Enhanced Quicksort Algorithm.	Int. Arab J. Inf. Technol.	2010	DBLP BibTeX RDF
1	Darrah Chavey	Double sorting: testing their sorting skills.	SIGCSE	2010	DBLP DOI BibTeX RDF	cs1, sorting, selection, insertion, quicksort
1	Eunsang Kim, Kunsoo Park	Improving multikey Quicksort for sorting strings with many equal elements.	Inf. Process. Lett.	2009	DBLP DOI BibTeX RDF
1	Conrado Martínez, Helmut Prodinger	Moves and displacements of particular elements in Quicksort.	Theor. Comput. Sci.	2009	DBLP DOI BibTeX RDF
1	Stefan Hallerstede	Proving Quicksort Correct in Event-B.	Electr. Notes Theor. Comput. Sci.	2009	DBLP DOI BibTeX RDF
1	Salvador Romaguera, Pedro Tirado	Contraction Maps on Ifqm-spaces with Application to Recurrence Equations of Quicksort.	Electr. Notes Theor. Comput. Sci.	2009	DBLP DOI BibTeX RDF
1	Mahmoud Fouz, Manfred Kufleitner, Bodo Manthey, Nima Zeini Jahromi	On Smoothed Analysis of Quicksort and Hoare's Find	CoRR	2009	DBLP BibTeX RDF
1	Daniel Cederman, Philippas Tsigas	GPU-Quicksort: A practical Quicksort algorithm for graphics processors.	ACM Journal of Experimental Algorithmics	2009	DBLP DOI BibTeX RDF
1	Daniel Spoonhower, Guy E. Blelloch, Phillip B. Gibbons, Robert Harper	Beyond nested parallelism: tight bounds on work-stealing overheads for parallel futures.	SPAA	2009	DBLP DOI BibTeX RDF	scheduling, work stealing, futures, performance bounds
1	Len Shustek	Interview - An interview with C.A.R. Hoare.	Commun. ACM	2009	DBLP DOI BibTeX RDF
1	Gianfranco Bilardi, Kattamuri Ekanadham, Pratap Pattnaik	On approximating the ideal random access machine by physical machines.	J. ACM	2009	DBLP DOI BibTeX RDF	Physical constraints on machines, pipelined hierarchical memory, speculative processors
1	Krzysztof R. Apt, Frank S. de Boer, Ernst-Rüdiger Olderog	Modular Verification of Recursive Programs.	Languages: From Formal to Natural	2009	DBLP DOI BibTeX RDF
1	Suman Kumar Sourabh, Soubhik Chakraborty	How robust is quicksort average complexity?	CoRR	2008	DBLP BibTeX RDF
1	Eunsang Kim, Kunsoo Park	Improving Multikey Quicksort for Sorting Strings.	IWOCA	2008	DBLP BibTeX RDF
1	Paul Biggar, Nicholas Nash, Kevin Williams, David Gregg	An experimental study of sorting and branch prediction.	ACM Journal of Experimental Algorithmics	2008	DBLP DOI BibTeX RDF	caching, Sorting, branch prediction, pipeline architectures
1	Amr Elmasry, Abdelrahman Hammad	Inversion-sensitive sorting algorithms in practice.	ACM Journal of Experimental Algorithmics	2008	DBLP DOI BibTeX RDF	Adaptive sorting, Inversions
1	Edwin H. Jacox, Hanan Samet	Metric space similarity joins.	ACM Trans. Database Syst.	2008	DBLP DOI BibTeX RDF	distance-based indexing, ranking, range queries, external memory algorithms, nearest neighbor queries, Similarity join
1	Alistair Kenneth Atkinson	Tupleware: A Distributed Tuple Space for Cluster Computing.	PDCAT	2008	DBLP DOI BibTeX RDF
1	Rebecca Wirfs-Brock	Connecting Design with Code.	IEEE Software	2008	DBLP DOI BibTeX RDF
1	Gilles Barthe, Benjamin Grégoire, Colin Riba	Type-Based Termination with Sized Products.	CSL	2008	DBLP DOI BibTeX RDF
1	Gilles Barthe, César Kunz	An Introduction to Certificate Translation.	FOSAD	2008	DBLP DOI BibTeX RDF
1	Rui Marcelino, Horácio C. Neto, João M. P. Cardoso	Sorting Units for FPGA-Based Embedded Systems.	DIPES	2008	DBLP DOI BibTeX RDF	FPGAs, embedded systems, sorting, special-purpose architecture
1	Brendan Lucier, Tao Jiang, Ming Li	Average-case analysis of QuickSort and Binary Insertion Tree height using incompressibility.	Inf. Process. Lett.	2007	DBLP DOI BibTeX RDF
1	Bodo Manthey, Till Tantau	Smoothed Analysis of Binary Search Trees and Quicksort Under Additive Noise.	Electronic Colloquium on Computational Complexity (ECCC)	2007	DBLP BibTeX RDF
1	H. M. Okasha, U. Rösler	Asymptotic distributions for Random Median Quicksort.	J. Discrete Algorithms	2007	DBLP DOI BibTeX RDF
1	Bodo Manthey, Till Tantau	Smoothed Analysis of Binary Search Trees and Quicksort Under Additive Noise.	Probabilistic Methods in the Design and Analysis of Algorithms	2007	DBLP BibTeX RDF
1	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
1	Shubhabrata Sengupta, Mark Harris, Yao Zhang, John D. Owens	Scan primitives for GPU computing.	Graphics Hardware	2007	DBLP DOI BibTeX RDF
1	Eli Mayfield, John Kyle Roth, Daniel Selifonov, Nathan Dahlberg, Elena Machkasova	Optimizing java programs using generic types.	OOPSLA Companion	2007	DBLP DOI BibTeX RDF	java, specialization, generic types
1	Arne Maus, Stein Gjessing	A Model for the Effect of Caching on Algorithmic Efficiency in Radix based Sorting.	ICSEA	2007	DBLP DOI BibTeX RDF	cache friendly algorithms, caches, sorting, cache models, radix
1	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
1	Xiao-Dong Wang, Ying-Jie Wu	An Improved HEAPSORT Algorithm with n log n - 0.788928 n Comparisons in the Worst Case.	J. Comput. Sci. Technol.	2007	DBLP DOI BibTeX RDF	HEAPSORT, data structures, analysis of algorithms, heaps
1	Ranjan Sinha, Justin Zobel, David Ring	Cache-efficient string sorting using copying.	ACM Journal of Experimental Algorithmics	2006	DBLP DOI BibTeX RDF	algorthims, string management, cache, Sorting, tries, experimental algorithms
1	Umut A. Acar, Guy E. Blelloch, Robert Harper	Adaptive functional programming.	ACM Trans. Program. Lang. Syst.	2006	DBLP DOI BibTeX RDF	Incremental computation, dynamic algorithms, adaptive computation
1	Michael Fuchs, Hsien-Kuei Hwang, Ralph Neininger	Profiles of Random Trees: Limit Theorems for Random Recursive Trees and Binary Search Trees.	Algorithmica	2006	DBLP DOI BibTeX RDF
1	Fouad El-Aker	Improving Genetic Quicksort Run Time.	IC-AI	2005	DBLP BibTeX RDF
1	Gerth Stølting Brodal, Rolf Fagerberg, Gabriel Moruz	On the Adaptiveness of Quicksort.	ALENEX/ANALCO	2005	DBLP BibTeX RDF
1	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
1	Martin Berger, Kohei Honda, Nobuko Yoshida	A logical analysis of aliasing in imperative higher-order functions.	ICFP	2005	DBLP DOI BibTeX RDF	functional programming, typing, aliasing, hoare-logics, ?-calculus, pointers, modalities
1	Manuel Barbosa, Alcino Cunha, Jorge Sousa Pinto	Recursion patterns and time-analysis.	SIGPLAN Notices	2005	DBLP DOI BibTeX RDF
1	Gianfranco Bilardi, Kattamuri Ekanadham, Pratap Pattnaik	An Address Dependence Model of Computation for Hierarchical Memories with Pipelined Transfer.	IPDPS	2005	DBLP DOI BibTeX RDF
1	Kanela Kaligosi, Kurt Mehlhorn, J. Ian Munro, Peter Sanders	Towards Optimal Multiple Selection.	ICALP	2005	DBLP DOI BibTeX RDF
1	Fouad El-Aker	Fast In-place Integer Radix Sorting.	International Conference on Computational Science	2005	DBLP DOI BibTeX RDF
1	Jie Liu, Clinton Knowles, Adam Davis	A Cost Optimal Parallel Quicksorting and Its Implementation on a Shared Memory Parallel Computer.	ISPA	2005	DBLP DOI BibTeX RDF
1	Noam Rinetzky, Mooly Sagiv, Eran Yahav	Interprocedural Shape Analysis for Cutpoint-Free Programs.	SAS	2005	DBLP DOI BibTeX RDF
1	Amr Elmasry, Abdelrahman Hammad	An Empirical Study for Inversions-Sensitive Sorting Algorithms.	WEA	2005	DBLP DOI BibTeX RDF
1	Michael Fothe	Zeit und Raum bei Quicksort.	LOG IN	2004	DBLP BibTeX RDF
1	Beatrice List, Markus Maucher, Uwe Schöning, Rainer Schuler	Randomized Quicksort and the Entropy of the Random Number Generator	Electronic Colloquium on Computational Complexity (ECCC)	2004	DBLP BibTeX RDF
1	Laurent Alonso, Philippe Chassaing, Florent Gillet, Svante Janson, Edward M. Reingold, René Schott	Quicksort with Unreliable Comparisons: A Probabilistic Analysis.	Combinatorics, Probability & Computing	2004	DBLP DOI BibTeX RDF
1	Conrado Martínez	Patial Quicksort.	ALENEX/ANALC	2004	DBLP BibTeX RDF
1	Beatrice List, Markus Maucher, Uwe Schöning, Rainer Schuler	Randomized QuickSort and the Entropy of the Random Source.	Algebraic Methods in Computational Complexity	2004	DBLP BibTeX RDF
1	Ralf Hoffmann, Matthias Korch, Thomas Rauber	Performance Evaluation of Task Pools Based on Hardware Synchronization.	SC	2004	DBLP DOI BibTeX RDF
1	Richard Cole, David C. Kandathil	The Average Case Analysis of Partition Sorts.	ESA	2004	DBLP DOI BibTeX RDF
1	Peter Sanders, Sebastian Winkel	Super Scalar Sample Sort.	ESA	2004	DBLP DOI BibTeX RDF
1	Fouad El-Aker, Amer Al-Badarneh	MSL: An Efficient Adaptive In-Place Radix Sort Algorithm.	International Conference on Computational Science	2004	DBLP DOI BibTeX RDF
1	Ranjan Sinha	Using Compact Tries for Cache-Efficient Sorting of Integers.	WEA	2004	DBLP DOI BibTeX RDF
1	Marianne Durand	Asymptotic analysis of an optimized quicksort algorithm.	Inf. Process. Lett.	2003	DBLP DOI BibTeX RDF
1	Krzysztof C. Kiwiel	Partitioning schemes for quicksort and quickselect	CoRR	2003	DBLP BibTeX RDF
1	Jie Liu, Jackson He	A Cost Optimal Parallel Quicksort on CREW PRAM.	Computers and Their Applications	2003	DBLP BibTeX RDF
1	Martin Hofmann, Steffen Jost	Static prediction of heap space usage for first-order functional programs.	POPL	2003	DBLP DOI BibTeX RDF	program analysis, functional programming, garbage collection, resources, heap
1	Daniel Jiménez-González, Juan J. Navarro, Josep-Lluis Larriba-Pey	CC-Radix: a Cache Conscious Sorting Based on Radix sort.	PDP	2003	DBLP DOI BibTeX RDF
1	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
1	Egon Börger, Tommaso Bolognesi	Remarks on Turbo ASMs for Functional Equations and Recursion Schemes.	Abstract State Machines	2003	DBLP DOI BibTeX RDF
1	Jon Louis Bentley	Experiments for Algorithm Engineering.	COCOON	2003	DBLP DOI BibTeX RDF
1	Cyril Banderier, René Beier, Kurt Mehlhorn	Smoothed Analysis of Three Combinatorial Problems.	MFCS	2003	DBLP DOI BibTeX RDF
1	Stephen Chong, Radu Rugina	Static Analysis of Accessed Regions in Recursive Data Structures.	SAS	2003	DBLP DOI BibTeX RDF
1	Ralph Neininger, Ludger Rüschendorf	Rates of convergence for Quicksort.	J. Algorithms	2002	DBLP DOI BibTeX RDF
1	James Allen Fill, Svante Janson	Quicksort asymptotics.	J. Algorithms	2002	DBLP DOI BibTeX RDF
1	Hsien-Kuei Hwang, Ralph Neininger	Phase Change of Limit Laws in the Quicksort Recurrence under Varying Toll Functions.	SIAM J. Comput.	2002	DBLP DOI BibTeX RDF
1	Stefan Edelkamp, Patrick Stiegeler	Implementing HEAPSORT with (n logn - 0.9n) and QUICKSORT with (n logn + 0.2n) Comparisons.	ACM Journal of Experimental Algorithmics	2002	DBLP DOI BibTeX RDF
1	René van Oostrum, Remco C. Veltkamp	Parametric search made practical.	Symposium on Computational Geometry	2002	DBLP DOI BibTeX RDF	framework for parametric search, implementation