.png){kind=icon}
Return
Worst case constant time priority queue
.png){kind=icon}
OA
AI
DOI：10.1016/j.jss.2004.09.002.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We present a new data structure of size 3M bits, where M is the size of the universe at hand, for realizing a discrete priority queue. When this data structure is used in combination with a new memory topology it executes all discrete priority queue operations in O(1) worst case time. In doing so we demonstrate how an unconventional, but practically implementable, memory architecture can be employed to sidestep known lower bounds and achieve constant time performance. (c) 2004 Elsevier Inc. All rights reserved.
Keywords:
data structure
discrete priority queue
split tagged tree
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
4.1
Papers:
5.5K
Citations:
8.4K
Organization
No organization information available
Cited Papers
.png){kind=icon}
ShareSaveShareSave no more
no more