Worst case constant time priority queue

@article{Brodnik2001WorstCC,
  title={Worst case constant time priority queue},
  author={Andrej Brodnik and Svante Carlsson and Johan Karlsson and J. Ian Munro},
  journal={Journal of Systems and Software},
  year={2001},
  volume={78},
  pages={249-256}
}
We present a new data structure of size 3M + &Ogr;(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. In doing so we demonstrate how an unconventional, but practically implementable, memory architecture can be employed to sidestep a lower bound (of lg lg M) and achieve constant time performance. 

Figures and Topics from this paper.

Citations

Publications citing this paper.

References

Publications referenced by this paper.
SHOWING 1-2 OF 2 REFERENCES