The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for phrase Heap sort (changed automatically) with no syntactic query expansion in all metadata.

Publication years (Num. hits)
1988-2011 (12)
Publication types (Num. hits)
article(3) inproceedings(9)
Venues (Conferences, Journals, ...)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 8 occurrences of 8 keywords

Results
Found 12 publication records. Showing 12 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
2FuFang Li, Deyu Qi, Limin Zhang, Xianguang Zhang, Zhili Zhang Research on Novel Dynamic Resource Management and Job Scheduling in Grid Computing. Search on Bibsonomy IMSCCS The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Heap sort Tree (HST), Node State Monitoring Agent (NSMA), Autonomy Presentation Agent (ARA), Grid Computing
2Noboru Takagi An Agglomerative Hierarchical Clustering by Finding Adjacent Hyper-Rectangles. Search on Bibsonomy RSCTC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF heap sort, combinatorial optimization problem, agglomerative hierarchical clustering
2Josep-Lluis Larriba-Pey, Daniel Jiménez-González, Juan J. Navarro An Analysis of Superscalar Sorting Algorithms on an R8000 Processor. (PDF / PS) Search on Bibsonomy SCCC The full citation details ... 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
2Ingo Wegener The Worst Case Complexity of McDiarmid and Reed's Variant of Bottom-Up-Heap Sort is Less Than n log n + 1.1n. Search on Bibsonomy STACS The full citation details ... 1991 DBLP  DOI  BibTeX  RDF
2Ingo Wegener Bottom-Up-Heap Sort, a New Variant of Heap Sort Beating on Average Quick Sort (if n is not very small). Search on Bibsonomy MFCS The full citation details ... 1990 DBLP  DOI  BibTeX  RDF
1Kiran Kumar Sundararajan, Mita Pal, Soubhik Chakraborty, N. C. Mahanti K-sort: A new sorting algorithm that beats Heap sort for n <= 70 lakhs! Search on Bibsonomy CoRR The full citation details ... 2011 DBLP  BibTeX  RDF
1Maria Cristina Tugurlan, Blaise Bourdin Distributed fast marching methods. Search on Bibsonomy Mardi Gras Conference The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Huyin Zhang, Chanle Wu, Qing Xiong, Libing Wu, Gang Ye Research on an Effective Mechanism of Task-scheduling in Grid Environment. Search on Bibsonomy GCC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Wei Yu, Fangting Sun, Jason E. Fritts Efficient rate control for JPEG-2000. Search on Bibsonomy IEEE Trans. Circuits Syst. Video Techn. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Guangzheng Fei, Enhua Wu A real-time generation algorithm for progressive meshes in dynamic environments. Search on Bibsonomy VRST The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
1Ronald D. Dutton Weak-Heap Sort. Search on Bibsonomy BIT The full citation details ... 1993 DBLP  BibTeX  RDF
1S. O'Daniel, G. Clark, K. Cooper Determination of order of an algorithm. Search on Bibsonomy ACM Conference on Computer Science The full citation details ... 1988 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #12 of 12 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.