arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1112.0993cs.DS
收藏

基于扩展正则计数器的最坏情况最优优先级排序

Worst-Case Optimal Priority Queues via Extended Regular Counters

Amr Elmasry, Jyrki Katajainen

摘要:

我们考虑的经典问题,表示下的操作\Findmin{},\Insert{},\Decrease{},\Meld{},\Delete{},和\Deletemin{}的优先级队列的集合。在基于比较的模型中,如果要在恒定时间内支持前四个操作,则最后两个操作必须至少花费对数时间。Brodal证明了他的最坏情况有效优先级队列达到了这些最坏情况的界限。不幸的是,这个数据结构被涉及并且时间界限隐藏了大的常数。我们描述了一个新的变种的最坏情况下的有效的优先级队列,依赖于扩展的定期计数器,并提供了相同的渐近时间和空间界限的原始。由于常规计数器上的操作和所有其他操作在概念上是分离的,因此我们的数据结构更简单,更易于描述和理解。此外,时间和空间边界中的常数较小。此外,我们给出了我们的结构上的指针机器上的实现。对于我们的指针机器实现,\Decrease{}和\Meld{}是渐进较慢的,需要$O(\lg\lg{n})$最坏情况的时间,其中$n$表示存储在结果优先级队列中的元素的数量。

英文摘要:

We consider the classical problem of representing a collection of priority queues under the operations \Findmin{}, \Insert{}, \Decrease{}, \Meld{}, \Delete{}, and \Deletemin{}. In the comparison-based model, if the first four operations are to be supported in constant time, the last two operations must take at least logarithmic time. Brodal showed that his worst-case efficient priority queues achieve these worst-case bounds. Unfortunately, this data structure is involved and the time bounds hide large constants. We describe a new variant of the worst-case efficient priority queues that relies on extended regular counters and provides the same asymptotic time and space bounds as the original. Due to the conceptual separation of the operations on regular counters and all other operations, our data structure is simpler and easier to describe and understand. Also, the constants in the time and space bounds are smaller. In addition, we give an implementation of our structure on a pointer machine. For our pointer-machine implementation, \Decrease{} and \Meld{} are asymptotically slower and require $O(\lg\lg{n})$ worst-case time, where $n$ denotes the number of elements stored in the resulting priority queue.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑