The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for phrase min-max heaps (changed automatically) with no syntactic query expansion in all metadata.

Publication years (Num. hits)
1986-2003 (12)
Publication types (Num. hits)
article(7) inproceedings(5)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 5 occurrences of 5 keywords

Results
Found 12 publication records. Showing 12 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
2Stephan Olariu, Zhaofang Wen Optimal Parallel Initialization Algorithms for a Class of Priority Queues. Search on Bibsonomy IEEE Trans. Parallel Distrib. Syst. The full citation details ... 1991 DBLP  DOI  BibTeX  RDF parallel initialization algorithms, adaptive parallel algorithm, priority queue structure, n-element array, parallel construction algorithms, heap-like structures, double-endedpriority queues, min-max heaps, deeps, min-max-pair heaps, exclusive-read-exclusive-write parallel random-access machine, parallel algorithms, data structures, queueing theory, processors, computationalcomplexity
2Giorgio Gambosi, Enrico Nardelli, Maurizio Talamo A Pointer-Free Data Structure for Merging Heaps and Min-Max Heaps. Search on Bibsonomy ICALP The full citation details ... 1989 DBLP  DOI  BibTeX  RDF
2Lars Draws, Patrik Eriksson, Erik Forslund, Leif Höglund, Sören Vallner, Thomas Strothotte Two New Algorithms for Constructing Min-Max Heaps. Search on Bibsonomy SWAT The full citation details ... 1988 DBLP  DOI  BibTeX  RDF
1Christos Makris, Athanasios K. Tsakalidis, Kostas Tsichlas Reflected min-max heaps. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Jingsen Chen A Framework for Constructing Heap-Like Structures In-Place. Search on Bibsonomy ISAAC The full citation details ... 1993 DBLP  DOI  BibTeX  RDF
1Svante Carlsson, Jingsen Chen Parallel Constructions of Heaps and Min-Max Heaps. Search on Bibsonomy Parallel Processing Letters The full citation details ... 1992 DBLP  BibTeX  RDF
1Svante Carlsson, Jingsen Chen Parallel Complexity of Heaps and Min-Max Heaps. Search on Bibsonomy LATIN The full citation details ... 1992 DBLP  DOI  BibTeX  RDF
1Jingsen Chen Merging and Splitting Priority Queues and Deques in Parallel. Search on Bibsonomy ISTCS The full citation details ... 1992 DBLP  DOI  BibTeX  RDF
1Giorgio Gambosi, Enrico Nardelli, Maurizio Talamo A Pointer-Free Data Structure for Merging Heaps and Min-Max Heaps. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 1991 DBLP  DOI  BibTeX  RDF
1Thomas Strothotte, Patrik Eriksson, Sören Vallner A Note on Constructing Min-Max Heaps. Search on Bibsonomy BIT The full citation details ... 1989 DBLP  BibTeX  RDF
1A. Hasham, Jörg-Rüdiger Sack Bounds for Min-Max Heaps. Search on Bibsonomy BIT The full citation details ... 1987 DBLP  BibTeX  RDF
1M. D. Atkinson, Jörg-Rüdiger Sack, Nicola Santoro, Thomas Strothotte Min-Max Heaps and Generalized Priority Queues. Search on Bibsonomy Commun. ACM The full citation details ... 1986 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.