Matches in DBpedia 2015-10 for { <http://dbpedia.org/resource/Shadow_heap> ?p ?o }
Showing triples 1 to 33 of
33
with 100 triples per page.
- Shadow_heap abstract "In computer science, a shadow heap is a mergeable heap data structure which supports efficient heap merging in the amortized sense. More specifically, shadow heaps make use of the shadow merge algorithm to achieve insertion in O(f(n)) amortized time and deletion in O((log n log log n)/f(n)) amortized time, for any choice of 1 ≤ f(n) ≤ log log n.Throughout this article, it is assumed that A and B are binary heaps with |A| ≤ |B|.".
- Shadow_heap wikiPageID "42442221".
- Shadow_heap wikiPageLength "8316".
- Shadow_heap wikiPageOutDegree "19".
- Shadow_heap wikiPageRevisionID "603562486".
- Shadow_heap wikiPageWikiLink Algorithm.
- Shadow_heap wikiPageWikiLink Amortized_analysis.
- Shadow_heap wikiPageWikiLink Array_data_structure.
- Shadow_heap wikiPageWikiLink Big_O_notation.
- Shadow_heap wikiPageWikiLink Binary_heap.
- Shadow_heap wikiPageWikiLink Category:Heaps_(data_structures).
- Shadow_heap wikiPageWikiLink Computer_science.
- Shadow_heap wikiPageWikiLink Data_structure.
- Shadow_heap wikiPageWikiLink Fibonacci_heap.
- Shadow_heap wikiPageWikiLink Heapsort.
- Shadow_heap wikiPageWikiLink Jörg-Rüdiger_Sack.
- Shadow_heap wikiPageWikiLink Mergeable_heap.
- Shadow_heap wikiPageWikiLink Potential_method.
- Shadow_heap wikiPageWikiLink Thomas_Strothotte.
- Shadow_heap wikiPageWikiLinkText "shadow heap".
- Shadow_heap hasPhotoCollection Shadow_heap.
- Shadow_heap wikiPageUsesTemplate Template:Data_structures.
- Shadow_heap wikiPageUsesTemplate Template:Reflist.
- Shadow_heap subject Category:Heaps_(data_structures).
- Shadow_heap hypernym Structure.
- Shadow_heap type Building.
- Shadow_heap comment "In computer science, a shadow heap is a mergeable heap data structure which supports efficient heap merging in the amortized sense. More specifically, shadow heaps make use of the shadow merge algorithm to achieve insertion in O(f(n)) amortized time and deletion in O((log n log log n)/f(n)) amortized time, for any choice of 1 ≤ f(n) ≤ log log n.Throughout this article, it is assumed that A and B are binary heaps with |A| ≤ |B|.".
- Shadow_heap label "Shadow heap".
- Shadow_heap sameAs m.0107yryk.
- Shadow_heap sameAs Q17150834.
- Shadow_heap sameAs Q17150834.
- Shadow_heap wasDerivedFrom Shadow_heap?oldid=603562486.
- Shadow_heap isPrimaryTopicOf Shadow_heap.