Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Beap> ?p ?o. }
Showing items 1 to 14 of
14
with 100 items 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 wikiPageID "3335635".
- Beap wikiPageRevisionID "471785310".
- Beap hasPhotoCollection Beap.
- Beap subject Category:Heaps_(data_structures).
- 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=471785310.
- Beap depiction Beap.jpg.
- Beap isPrimaryTopicOf Beap.
