Worst case constant time priority queue

Authors:
Andrej Brodnik;Svante Carlsson;Johan Karlsson;J. Ian Munro
Affiliations:
Department of Theoretical Computer Science, Institute of Mathematics, Physics, and Mechanics, Ljubljana, Slovenia and Department of Computer Science and Electrical Engineering, Luleå Universi ...;Department of Computer Science and Electrical Engineering, Luleå University of Technology, Luleå, Sweden;Department of Computer Science and Electrical Engineering, Luleå University of Technology, Luleå, Sweden;Department of Computer Science, University of Waterloo, Ontario, Canada
Venue:
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Year:
2001

Citing 9
Cited 7

A lower bound on the complexity of the union-split-find problem

SIAM Journal on Computing
The cell probe complexity of dynamic data structures

STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Machine models and simulations

Handbook of theoretical computer science (vol. A)
Lower bounds for union-split-find related problems on random access machines

STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Searching in constant time and minimum space

Searching in constant time and minimum space
Optimal bounds for the predecessor problem

STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Should Tables Be Sorted?

Journal of the ACM (JACM)
Tight(er) worst-case bounds on dynamic searching and priority queues

STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Some complexity questions related to distributive computing(Preliminary Report)

STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing

On AC0 implementations of fusion trees and atomic heaps

SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
A Simple Shortest Path Algorithm with Linear Average Time

ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Multiprocess Time Queue

ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
Tradeoffs between low complexity, low latency, and fairness with deficit round-robin schedulers

IEEE/ACM Transactions on Networking (TON)
Worst case constant time priority queue

Journal of Systems and Software
Image filtering using morphological amoebas

Image and Vision Computing
Predecessor queries in constant time?

ESA'05 Proceedings of the 13th annual European conference on Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.