Search results for "Quick sort"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
3	Feng Hu, Guoyin Wang, Lin Feng	Fast Knowledge Reduction Algorithms Based on Quick Sort.	RSKT	2008	DBLP DOI BibTeX RDF	Huge data, Quick sort, Rough set, Divide and conquer, Knowledge reduction
2	Jinhua Zheng, Charles X. Ling, Zhongzhi Shi, Juan Xue, Xuyong Li	A Multi-objective Genetic Algorithm Based on Quick Sort.	Canadian Conference on AI	2004	DBLP DOI BibTeX RDF
2	Josep-Lluis Larriba-Pey, Daniel Jiménez-González, Juan J. Navarro	An Analysis of Superscalar Sorting Algorithms on an R8000 Processor. (PDF / PS)	SCCC	1997	DBLP DOI BibTeX RDF	superscalar sorting algorithms, R8000 processor, in-memory sorting algorithms, Quick sort, Heap sort, Multiway merge, parallel algorithms, locality, superscalar architectures, Radix sort, Bucket sort
2	Ingo Wegener	Bottom-Up-Heap Sort, a New Variant of Heap Sort Beating on Average Quick Sort (if n is not very small).	MFCS	1990	DBLP DOI BibTeX RDF
1	Shiman Xie, Xinzhi Shang	Multi-Objective Optimization Method Based on PSO and Quick Sort.	ICICA	2011	DBLP DOI BibTeX RDF
1	Amjad M. Daoud, Hussein Abdel-jaber, Jafar Ababneh	Efficient Non-Quadratic Quick Sort (NQQuickSort).	DEIS	2011	DBLP DOI BibTeX RDF
1	Fuguo Dong, Hui Fan, Da Yuan	A Novel Image Median Filtering Algorithm based on Incomplete Quick Sort Algorithm.	JDCTA	2010	DBLP BibTeX RDF
1	Masato Edahiro	Parallelizing fundamental algorithms such as sorting on multi-core processors for EDA acceleration.	ASP-DAC	2009	DBLP DOI BibTeX RDF
1	Guigang Zheng, Shaohua Teng, Wei Zhang 0005, Xiufen Fu	A cooperative sort algorithm based on indexing.	CSCWD	2009	DBLP DOI BibTeX RDF
1	Shibdas Bandyopadhyay, Sartaj Sahni	Sorting on a Cell Broadband Engine SPU.	ISCC	2009	DBLP DOI BibTeX RDF
1	ShiQing Xin, GuoJin Wang	New method in information processing for maintaining an efficient dynamic ordered set.	Science in China Series F: Information Sciences	2009	DBLP DOI BibTeX RDF	dynamic ordered set, rich binary tree, information processing, algorithms and data structures
1	Feng Hu, Guoyin Wang	Huge Data Mining Based on Rough Set Theory and Granular Computing.	Web Intelligence/IAT Workshops	2008	DBLP DOI BibTeX RDF
1	Hongbin Sun, Yongsheng Ding	An Adaptable Method of E-Workflow Composition Based on Distributed Awareness.	APNOMS	2008	DBLP DOI BibTeX RDF	E-workflow composition, distributed awareness, adaptable, mobile agent
1	Guoyin Wang, Feng Hu	Quick Knowledge Reduction Based on Divide and Conquer Method in Huge Data Sets.	PReMI	2007	DBLP DOI BibTeX RDF	Huge data sets processing, quick sort, attribute order, rough set, divide and conquer, attribute reduction
1	James R. Edmondson	M Pivot Sort - Replacing Quick Sort.	AMCS	2005	DBLP BibTeX RDF
1	Shuang Liang, Ranjit Noronha, Dhabaleswar K. Panda	Swapping to Remote Memory over InfiniBand: An Approach using a High Performance Network Block Device.	CLUSTER	2005	DBLP DOI BibTeX RDF
1	M. R. K. Krishna Rao	A Class of Prolog Programs with Non-linear Outputs Inferable from Positive Data.	ALT	2005	DBLP DOI BibTeX RDF
1	Suraiya Khan, Issa Traoré	A Prevention Model for Algorithmic Complexity Attacks.	DIMVA	2005	DBLP DOI BibTeX RDF
1	Jean-Pierre David, Etienne Bergeron	A Step towards Intelligent Translation from High-Level Design to RTL.	IWSOC	2004	DBLP DOI BibTeX RDF
1	M. R. K. Krishna Rao	Learnability of Simply-Moded Logic Programs from Entailment.	ASIAN	2004	DBLP DOI BibTeX RDF
1	M. R. K. Krishna Rao	Input-Termination of Logic Programs.	LOPSTR	2004	DBLP DOI BibTeX RDF
1	Sonny Tham, John Morris	Cilk vs MPI: Comparing two very different parallel programming styles.	ICPP	2003	DBLP DOI BibTeX RDF	MPI, networks of workstations, Cilk
1	Daniel Jiménez-González, Juan J. Navarro, Josep-Lluis Larriba-Pey	The Effect of Local Sort on Parallel Sorting Algorithms.	PDP	2002	DBLP DOI BibTeX RDF	Sample sort, Partially sorted data sets, Split, Parallel Sorting, Radix sort
1	Cary Laxer	Treating computer science as science as: An experiment with sorting.	ITiCSE	2001	DBLP DOI BibTeX RDF
1	Thomas L. Naps, Eric Bressler	A multi-windowed environment for simultaneous visualization of related algorithms on the World Wide Web.	SIGCSE	1998	DBLP DOI BibTeX RDF
1	M. R. K. Krishna Rao, Abdul Sattar	Learning Linearly-Moded Programs from Entailment.	PRICAI	1998	DBLP DOI BibTeX RDF
1	Hosam M. Mahmoud, Robert T. Smythe	Probabilistic Analysis of MULTIPLE QUICK SELECT.	Algorithmica	1998	DBLP DOI BibTeX RDF	Sorting, Limit distribution
1	Robert S. Boyer, Yuan Yu	Automated Correctness Proofs of Machine Code Programs for a Commercial Microprocessor.	CADE	1992	DBLP DOI BibTeX RDF	Nqthm, Boyer-Moore Theorem Prover, Gnu, Ada, C, Automated reasoning, object code, formal program verification
1	Ingo Wegener	The Worst Case Complexity of McDiarmid and Reed's Variant of Bottom-Up-Heap Sort is Less Than n log n + 1.1n.	STACS	1991	DBLP DOI BibTeX RDF