Matches in DBpedia 2015-10 for { <http://dbpedia.org/resource/Y-fast_trie> ?p ?o }
Showing triples 1 to 43 of
43
with 100 triples per page.
- Y-fast_trie abstract "In computer science, a y-fast trie is a data structure for storing integers from a bounded domain. It supports exact and predecessor or successor queries in time O(log log M), using O(n) space, where n is the number of stored values and M is the maximum value in the domain. The structure was proposed by Dan Willard in 1982 to decrease the O(n log M) space used by an x-fast trie.".
- Y-fast_trie thumbnail Y-fast_trie.svg?width=300.
- Y-fast_trie wikiPageExternalLink 13_3_YFastTrie_Doubly_Logar.html.
- Y-fast_trie wikiPageID "31499648".
- Y-fast_trie wikiPageLength "10424".
- Y-fast_trie wikiPageOutDegree "17".
- Y-fast_trie wikiPageRevisionID "681519573".
- Y-fast_trie wikiPageWikiLink Amortized_analysis.
- Y-fast_trie wikiPageWikiLink Associative_array.
- Y-fast_trie wikiPageWikiLink Balanced_binary_tree.
- Y-fast_trie wikiPageWikiLink Big-O_notation.
- Y-fast_trie wikiPageWikiLink Big_O_notation.
- Y-fast_trie wikiPageWikiLink Category:Articles_created_via_the_Article_Wizard.
- Y-fast_trie wikiPageWikiLink Category:Trees_(data_structures).
- Y-fast_trie wikiPageWikiLink Computer_science.
- Y-fast_trie wikiPageWikiLink Dan_Willard.
- Y-fast_trie wikiPageWikiLink Data_structure.
- Y-fast_trie wikiPageWikiLink Integer.
- Y-fast_trie wikiPageWikiLink List_of_data_structures.
- Y-fast_trie wikiPageWikiLink Self-balancing_binary_search_tree.
- Y-fast_trie wikiPageWikiLink Trie.
- Y-fast_trie wikiPageWikiLink Van_Emde_Boas_tree.
- Y-fast_trie wikiPageWikiLink X-fast_trie.
- Y-fast_trie wikiPageWikiLink File:Y-fast_trie.svg.
- Y-fast_trie wikiPageWikiLinkText "Y-fast trie".
- Y-fast_trie wikiPageWikiLinkText "y-fast trie".
- Y-fast_trie hasPhotoCollection Y-fast_trie.
- Y-fast_trie wikiPageUsesTemplate Template:CS-Trees.
- Y-fast_trie wikiPageUsesTemplate Template:Reflist.
- Y-fast_trie subject Category:Articles_created_via_the_Article_Wizard.
- Y-fast_trie subject Category:Trees_(data_structures).
- Y-fast_trie hypernym Structure.
- Y-fast_trie type Building.
- Y-fast_trie type Structure.
- Y-fast_trie type Technique.
- Y-fast_trie comment "In computer science, a y-fast trie is a data structure for storing integers from a bounded domain. It supports exact and predecessor or successor queries in time O(log log M), using O(n) space, where n is the number of stored values and M is the maximum value in the domain. The structure was proposed by Dan Willard in 1982 to decrease the O(n log M) space used by an x-fast trie.".
- Y-fast_trie label "Y-fast trie".
- Y-fast_trie sameAs m.0h3p0d9.
- Y-fast_trie sameAs Q8045718.
- Y-fast_trie sameAs Q8045718.
- Y-fast_trie wasDerivedFrom Y-fast_trie?oldid=681519573.
- Y-fast_trie depiction Y-fast_trie.svg.
- Y-fast_trie isPrimaryTopicOf Y-fast_trie.
