Search results for "quicksort"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
20	Conrado Martínez, Markus E. Nebel, Sebastian Wild	Analysis of Branch Misses in Quicksort.	CoRR	2014	DBLP BibTeX RDF
20	Vasileios Iliopoulos	A note on multipivot Quicksort.	CoRR	2014	DBLP BibTeX RDF
20	Sebastian Wild, Markus E. Nebel, Conrado Martínez	Analysis of Pivot Sampling in Dual-Pivot Quicksort.	CoRR	2014	DBLP BibTeX RDF
20	Markus E. Nebel, Sebastian Wild	Pivot Sampling in Java 7's Dual-Pivot Quicksort.	CoRR	2014	DBLP BibTeX RDF
20	Shrinu Kushagra, Alejandro López-Ortiz, Aurick Qiao, J. Ian Munro	Multi-Pivot Quicksort: Theory and Experiments.	ALENEX	2014	DBLP DOI BibTeX RDF
20	Ugur Erkin Kocamaz	Increasing the efficiency of quicksort using a neural network based algorithm selection model.	Inf. Sci.	2013	DBLP DOI BibTeX RDF
20	Basel A. Mahafzah	Performance assessment of multithreaded quicksort algorithm on simultaneous multithreaded architecture.	J. Supercomput.	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	CoRR	2013	DBLP BibTeX RDF
20	Martin Aumüller 0001, Martin Dietzfelbinger	Optimal Partitioning for Dual Pivot Quicksort	CoRR	2013	DBLP BibTeX RDF
20	Sebastian Wild, Markus E. Nebel	Average Case Analysis of Java 7's Dual Pivot Quicksort.	CoRR	2013	DBLP BibTeX RDF
20	Martin Aumüller 0001, Martin Dietzfelbinger	Optimal Partitioning for Dual Pivot Quicksort - (Extended Abstract).	ICALP (1)	2013	DBLP DOI BibTeX RDF
20	Ulrich Berger 0001, Monika Seisenberger, Gregory J. M. Woods	Extracting Imperative Programs from Proofs: In-place Quicksort.	TYPES	2013	DBLP DOI BibTeX RDF
20	Hari Sundar, Dhairya Malhotra, George Biros	HykSort: a new variant of hypercube quicksort on distributed memory architectures.	ICS	2013	DBLP DOI BibTeX RDF
20	Sebastian Wild, Markus E. Nebel, Raphael Reitzig, Ulrich Laube	Engineering Java 7's Dual Pivot Quicksort Using MaLiJan.	ALENEX	2013	DBLP DOI BibTeX RDF
20	Mahmoud Fouz, Manfred Kufleitner, Bodo Manthey, Nima Zeini Jahromi	On Smoothed Analysis of Quicksort and Hoare's Find.	Algorithmica	2012	DBLP DOI BibTeX RDF
20	Ralph Neininger	A refined Quicksort asymptotic	CoRR	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)	CoRR	2012	DBLP BibTeX RDF
20	Patrick Bindjeme, James Allen Fill	Exact L^2-distance from the limit for QuickSort key comparisons (extended abstract)	CoRR	2012	DBLP BibTeX RDF
20	James Allen Fill, Svante Janson	The number of bit comparisons used by Quicksort: an average-case analysis	CoRR	2012	DBLP BibTeX RDF
20	James Allen Fill	Distributional convergence for the number of symbol comparisons used by QuickSort	CoRR	2012	DBLP BibTeX RDF
20	Vasileios Iliopoulos, David B. Penman	Dual Pivot Quicksort.	Discret. Math. Algorithms Appl.	2012	DBLP DOI BibTeX RDF
20	Diarmuid Early, Ang Gao, Michel P. Schellekens	Frugal Encoding in Reversible MOQA: A Case Study for Quicksort.	RC	2012	DBLP DOI BibTeX RDF
20	Sebastian Wild, Markus E. Nebel	Average Case Analysis of Java 7's Dual Pivot Quicksort.	ESA	2012	DBLP DOI BibTeX RDF
20	Colin McDiarmid	Quicksort and Large Deviations.	MEMICS	2012	DBLP DOI BibTeX RDF
20	Maxim A. Babenko, Ivan Pouzyrevsky	Resilient Quicksort and Selection.	CSR	2012	DBLP DOI BibTeX RDF
20		Quicksort.	Encyclopedia of Parallel Computing	2011	DBLP DOI BibTeX RDF
20	Mahmoud Ragab	Partial quicksort and weighted branching processes.		2011	RDF
20	Rami Mansi	Enhanced Quicksort Algorithm.	Int. Arab J. Inf. Technol.	2010	DBLP BibTeX RDF
20	David Kitchin, Adrian Quark, Jayadev Misra	Quicksort: Combining Concurrency, Recursion, and Mutable Data Structures.	Reflections on the Work of C. A. R. Hoare	2010	DBLP DOI BibTeX RDF
20	Stefan Hallerstede	Proving Quicksort Correct in Event-B.	REFINE@FMWeek	2009	DBLP DOI BibTeX RDF
20	Eunsang Kim, Kunsoo Park	Improving multikey Quicksort for sorting strings with many equal elements.	Inf. Process. Lett.	2009	DBLP DOI BibTeX RDF
20	Conrado Martínez, Helmut Prodinger	Moves and displacements of particular elements in Quicksort.	Theor. Comput. Sci.	2009	DBLP DOI BibTeX RDF
20	Mahmoud Fouz, Manfred Kufleitner, Bodo Manthey, Nima Zeini Jahromi	On Smoothed Analysis of Quicksort and Hoare's Find	CoRR	2009	DBLP BibTeX RDF
20	Leonor Frias, Jordi Petit	Combining digital access and parallel partition for quicksort and quickselect.	IWMSE@ICSE	2009	DBLP DOI BibTeX RDF
20	Suman Kumar Sourabh, Soubhik Chakraborty	How robust is quicksort average complexity?	CoRR	2008	DBLP BibTeX RDF
20	Eunsang Kim, Kunsoo Park	Improving Multikey Quicksort for Sorting Strings.	IWOCA	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.	Inf. Process. Lett.	2007	DBLP DOI BibTeX RDF
20	Bodo Manthey, Till Tantau	Smoothed Analysis of Binary Search Trees and Quicksort Under Additive Noise.	Electron. Colloquium Comput. Complex.	2007	DBLP BibTeX RDF
20	H. M. Okasha, U. Rösler	Asymptotic distributions for Random Median Quicksort.	J. Discrete Algorithms	2007	DBLP DOI BibTeX RDF
20	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
20	Salvador Romaguera, Pedro Tirado	Contraction Maps on Ifqm-spaces with Application to Recurrence Equations of Quicksort.	MFCSIT	2006	DBLP DOI BibTeX RDF
20	David Podgorelec, Gregor Klajnsek	Acceleration of sweep-line technique by employing smart quicksort.	Inf. Sci.	2005	DBLP DOI BibTeX RDF
20	Gerth Stølting Brodal, Rolf Fagerberg, Gabriel Moruz	On the Adaptiveness of Quicksort.	ALENEX/ANALCO	2005	DBLP BibTeX RDF
20	Fouad El-Aker	Improving Genetic Quicksort Run Time.	IC-AI	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.	Comb. Probab. Comput.	2004	DBLP DOI BibTeX RDF
20	Michael Fothe	Zeit und Raum bei Quicksort.	LOG IN	2004	DBLP BibTeX RDF
20	Beatrice List, Markus Maucher, Uwe Schöning, Rainer Schuler	Randomized Quicksort and the Entropy of the Random Number Generator	Electron. Colloquium Comput. Complex.	2004	DBLP BibTeX RDF
20	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
20	Conrado Martínez	Patial Quicksort.	ALENEX/ANALC	2004	DBLP BibTeX RDF
20	Marianne Durand	Asymptotic analysis of an optimized quicksort algorithm.	Inf. Process. Lett.	2003	DBLP DOI BibTeX RDF
20	Krzysztof C. Kiwiel	Partitioning schemes for quicksort and quickselect	CoRR	2003	DBLP BibTeX RDF
20	Jie Liu 0026, Jackson He	A Cost Optimal Parallel Quicksort on CREW PRAM.	CATA	2003	DBLP BibTeX RDF
20	Stefan Edelkamp, Patrick Stiegeler	Implementing HEAPSORT with (n logn - 0.9n) and QUICKSORT with (n logn + 0.2n) Comparisons.	ACM J. Exp. Algorithmics	2002	DBLP DOI BibTeX RDF
20	James Allen Fill, Svante Janson	Quicksort asymptotics.	J. Algorithms	2002	DBLP DOI BibTeX RDF
20	Ralph Neininger, Ludger Rüschendorf	Rates of convergence for Quicksort.	J. Algorithms	2002	DBLP DOI BibTeX RDF
20	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
20	Hua-Huai Chern, Hsien-Kuei Hwang	Transitional Behaviors of the Average Cost of Quicksort with Median-of-(2t+1).	Algorithmica	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.	Random Struct. Algorithms	2001	DBLP DOI BibTeX RDF
20	James Allen Fill, Svante Janson	Approximating the limiting Quicksort distribution.	Random Struct. Algorithms	2001	DBLP DOI BibTeX RDF
20	Ralph Neininger	On a multivariate contraction method for random recursive structures with applications to Quicksort.	Random Struct. Algorithms	2001	DBLP DOI BibTeX RDF
20	Conrado Martínez, Salvador Roura	Optimal Sampling Strategies in Quicksort and Quickselect.	SIAM J. Comput.	2001	DBLP DOI BibTeX RDF
20	Joseph F. JáJá	A perspective on Quicksort.	Comput. Sci. Eng.	2000	DBLP DOI BibTeX RDF
20	James Allen Fill, Svante Janson	Smoothness and decay properties of the limiting Quicksort density function	CoRR	2000	DBLP BibTeX RDF
20	James Allen Fill, Svante Janson	A characterization of the set of fixed points of the Quicksort transformation	CoRR	2000	DBLP BibTeX RDF
20	Luc Devroye, James Allen Fill, Ralph Neininger	Perfect simulation from the Quicksort limit distribution	CoRR	2000	DBLP BibTeX RDF
20	Charles Knessl, Wojciech Szpankowski	Quicksort Algorithm Again Revisited.	Discret. Math. Theor. Comput. Sci.	1999	DBLP DOI BibTeX RDF
20	M. Douglas McIlroy	A Killer Adversary for Quicksort.	Softw. Pract. Exp.	1999	DBLP DOI BibTeX RDF
20	Uwe Stephan	Zur Behandlung von Quicksort im Unterricht.	LOG IN	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.	Future Gener. Comput. Syst.	1998	DBLP DOI BibTeX RDF
20	Peter Sanders 0001, Thomas Hansch	Efficient Massively Parallel Quicksort.	IRREGULAR	1997	DBLP DOI BibTeX RDF
20	S. Mansoor Sarwar, Syed Aqeel Sarwar, Mansour H. A. Jaragh, Jesse Brandeburg	Engineering Quicksort.	Comput. Lang.	1996	DBLP DOI BibTeX RDF
20	Michael Cramer	A Note Concerning the Limit Distribution of the Quicksort Algorithm.	RAIRO Theor. Informatics Appl.	1996	DBLP DOI BibTeX RDF
20	Colin McDiarmid, Ryan Hayward	Large Deviations for Quicksort.	J. Algorithms	1996	DBLP DOI BibTeX RDF
20	Catherine C. McGeoch, J. D. Tygar	Optimal Sampling Strategies for Quicksort.	Random Struct. Algorithms	1995	DBLP DOI BibTeX RDF
20	William F. Eddy, Mark J. Schervish	How Many Comparisons Does Quicksort Use?	J. Algorithms	1995	DBLP DOI BibTeX RDF
20	Henry G. Baker	A "Linear Logic" Quicksort.	ACM SIGPLAN Notices	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.	Comput. Lang.	1994	DBLP DOI BibTeX RDF
20	R. Chaudhuri, Andrew C. Dempster	A note on generating a worst case sequence for Quicksort in linear time.	SAC	1994	DBLP DOI BibTeX RDF	Quicksor, worst case
20	David S. L. Wei	Quicksort and permutation routing on the hypercube and de Bruijn networks.	ISPAN	1994	DBLP DOI BibTeX RDF
20	R. Chaudhuri, Andrew C. Dempster	A note on slowing Quicksort.	ACM SIGCSE Bull.	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).	Theor. Comput. Sci.	1993	DBLP DOI BibTeX RDF
20	Theodore Brown, Renbing Xiong	A Parallel Quicksort Algorithm.	J. Parallel Distributed Comput.	1993	DBLP DOI BibTeX RDF
20	Rhys S. Francis, L. J. H. Pannan	A parallel partition for enhanced parallel QuickSort.	Parallel Comput.	1992	DBLP DOI BibTeX RDF
20	Yannis Manolopoulos	Variations of Quicksort Combined with Insertion Sort.	Wirtschaftsinf.	1992	DBLP BibTeX RDF
20	Youran Lan, Magdi A. Mohamed	Parallel Quicksort in hypercubes.	SAC	1992	DBLP DOI BibTeX RDF
20	Weixiong Zhang, Nageswara S. V. Rao	Optimal Parallel Quicksort on Erew Pram.	BIT	1991	DBLP DOI BibTeX RDF
20	Bogdan S. Chlebus, Imrich Vrto	Parallel Quicksort.	J. Parallel Distributed Comput.	1991	DBLP DOI BibTeX RDF
20	U. Rösler	A limit theorem for "Quicksort".	RAIRO Theor. Informatics Appl.	1991	DBLP DOI BibTeX RDF
20	Philip Heidelberger, V. Alan Norton, John T. Robinson	Parallel Quicksort Using Fetch-and-Add.	IEEE Trans. Computers	1990	DBLP DOI BibTeX RDF
20	Stewart A. Levin	A fully vectorized quicksort.	Parallel Comput.	1990	DBLP DOI BibTeX RDF
20	Ingo Wegener	Bekannte Sortierverfahren und eine HEAPSORT-Variante die QUICKSORT schlägt.	Inform. Spektrum	1990	DBLP BibTeX RDF
20	Charles U. Martel, Dan Gusfield	A Fast Parallel Quicksort Algorithm.	Inf. Process. Lett.	1989	DBLP DOI BibTeX RDF
20	Knut Hildebrand	Implementierung des Quicksort in COBOL.	Angew. Inform.	1989	DBLP BibTeX RDF
20	Mireille Régnier	A Limiting Distribution for Quicksort.	RAIRO Theor. Informatics Appl.	1989	DBLP DOI BibTeX RDF
20	P. Hennequin	Combinatorial Analysis of Quicksort Algorithm.	RAIRO Theor. Informatics Appl.	1989	DBLP DOI BibTeX RDF
20	A. Inkeri Verkamo	External Quicksort.	Perform. Evaluation	1988	DBLP DOI BibTeX RDF
20	Lutz M. Wegner	A Generalized, One-Way, Stackless Quicksort.	BIT	1987	DBLP DOI BibTeX RDF
20	A. Inkeri Verkamo	Performance of Quicksort Adapted for Virtual Memory Use.	Comput. J.	1987	DBLP DOI BibTeX RDF
20	Guy T. Almes	Distributing Quicksort in a Local Area Network.	COMPCON	1987	DBLP BibTeX RDF
20	David J. Evans 0001, Nadia Y. Yousif	Analysis of the Performance of the Parallel Quicksort Method.	BIT	1985	DBLP DOI BibTeX RDF