Matches in DBpedia 2015-10 for { <http://dbpedia.org/resource/Beap> ?p ?o }
Showing triples 1 to 32 of
32
with 100 triples per page.
- Beap abstract "Beap, or bi-parental heap, is a data structure where a node usually has two parents (unless it is the first or last on a level) and two children (unless it is on the last level). Unlike a heap, a beap allows sublinear search. The beap was introduced by Ian Munro and Hendra Suwanda. A related data structure is the Young tableau.".
- Beap thumbnail Beap.jpg?width=300.
- Beap wikiPageExternalLink 0022000080900379.
- Beap wikiPageID "3335635".
- Beap wikiPageLength "2085".
- Beap wikiPageOutDegree "10".
- Beap wikiPageRevisionID "679438549".
- Beap wikiPageWikiLink Category:Heaps_(data_structures).
- Beap wikiPageWikiLink Communications_of_the_ACM.
- Beap wikiPageWikiLink Data_structure.
- Beap wikiPageWikiLink File:Beap.jpg.
- Beap wikiPageWikiLink Heap_(data_structure).
- Beap wikiPageWikiLink Hendra_Suwanda.
- Beap wikiPageWikiLink Ian_Munro_(computer_scientist).
- Beap wikiPageWikiLink Journal_of_Computer_and_System_Sciences.
- Beap wikiPageWikiLink Sublinear.
- Beap wikiPageWikiLink Sublinear_function.
- Beap wikiPageWikiLink Young_tableau.
- Beap wikiPageWikiLinkText "Beap".
- Beap hasPhotoCollection Beap.
- Beap wikiPageUsesTemplate Template:Cite_journal.
- Beap subject Category:Heaps_(data_structures).
- Beap hypernym Structure.
- Beap type Building.
- Beap comment "Beap, or bi-parental heap, is a data structure where a node usually has two parents (unless it is the first or last on a level) and two children (unless it is on the last level). Unlike a heap, a beap allows sublinear search. The beap was introduced by Ian Munro and Hendra Suwanda. A related data structure is the Young tableau.".
- Beap label "Beap".
- Beap sameAs m.096fkz.
- Beap sameAs Q4876324.
- Beap sameAs Q4876324.
- Beap wasDerivedFrom Beap?oldid=679438549.
- Beap depiction Beap.jpg.
- Beap isPrimaryTopicOf Beap.