We present a new data structure of size 3M +o(M) bits for solving the "discrete priority queue " problem. When this data structure is used in combination with a new memory topology it provides an O(1) worst case time solution.
Godkänd; 2001; 20080411 (ysko)