Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Brodal_queue> ?p ?o. }
Showing items 1 to 12 of
12
with 100 items per page.
- Brodal_queue abstract "In computer science, the Brodal queue is a heap/priority queue structure with very low worst case time bounds: for insertion, find-minimum, meld (merge two queues) and decrease-key and for delete-minimum and general deletion; they are the first heap variant with these bounds. Brodal queues are named after their inventor Gerth Stølting Brodal.While having better asymptotic bounds than other priority queue structures, they are, in the words of Brodal himself, "quite complicated" and "[not] applicable in practice." Brodal and Okasaki describe a persistent (functional) version of Brodal queues.".
- Brodal_queue wikiPageID "33238984".
- Brodal_queue wikiPageRevisionID "575676381".
- Brodal_queue hasPhotoCollection Brodal_queue.
- Brodal_queue subject Category:Heaps_(data_structures).
- Brodal_queue comment "In computer science, the Brodal queue is a heap/priority queue structure with very low worst case time bounds: for insertion, find-minimum, meld (merge two queues) and decrease-key and for delete-minimum and general deletion; they are the first heap variant with these bounds.".
- Brodal_queue label "Brodal queue".
- Brodal_queue sameAs m.0h7pwl_.
- Brodal_queue sameAs Q4972931.
- Brodal_queue sameAs Q4972931.
- Brodal_queue wasDerivedFrom Brodal_queue?oldid=575676381.
- Brodal_queue isPrimaryTopicOf Brodal_queue.