English Fusion tree Cited by user Citation bot on 06 Dec 2023 In computer science, a fusion tree is a type of tree data structure that implements an associative array on w-bit integers on a finite universe, where each of the input…
English Monotone priority queue Cited by user Citation bot on 25 Oct 2023 In computer science, a monotone priority queue is a variant of the priority queue abstract data type in which the priorities of extracted items are required to form a…
English Kinetic priority queue Cited by user Esconie on 17 May 2012 A Kinetic Priority Queue is an abstract kinetic data structure. It is a variant of a priority queue designed to maintain the maximum (or minimum) priority element (key-val…