.png){kind=icon}
返回
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}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
data structure
discrete priority queue
split tagged tree
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4.1
论文数:
5.5K
被引数:
8.4K
机构
暂无机构信息
引用论文
.png){kind=icon}
没有更多内容
没有更多内容