Worst case constant time priority queue

Andrej Brodnik, Svante Carlsson, Johan Karlsson et al. · 2001

We present a new data structure of size O(M) for solving the vEB problem. When this data structure is used in combination with a new memory topology it provides an O(1) worst case time solution. 1

Cited by 15 works. doi:10.5555/365411.365524

Authors

References