Worst case constant time priority queue

Authors:
Andrej Brodnik;Svante Carlsson;Michael L. Fredman;Johan Karlsson;J. Ian Munro
Affiliations:
Department of Computer Science and Electrical Engineering, Luleå University of Technology, SE-97187 Luleå, Sweden and Department of Theoretical Computer Science, IMFM, Institute of Mathe ...;Blekinge Institute of Technology, SE-37179 Karlskrona, Sweden;Department of Computer Science, Rutgers University, New Brunswick, NJ;Department of Computer Science and Electrical Engineering, Luleå University of Technology, SE-97187 Luleå, Sweden;School of Computer Science, University of Waterloo, Waterloo, Ontario, Canada, N2L 3G1
Venue:
Journal of Systems and Software
Year:
2005

Citing 15
Cited 0

Storing a Sparse Table with 0(1) Worst Case Access Time

Journal of the ACM (JACM)
Hash functions for priority queues

Information and Control
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
Surpassing the information theoretic bound with fusion trees

Journal of Computer and System Sciences - Special issue: papers from the 22nd ACM symposium on the theory of computing, May 14–16, 1990
Dynamic Perfect Hashing: Upper and Lower Bounds

SIAM Journal on Computing
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
PATRICIA—Practical Algorithm To Retrieve Information Coded in Alphanumeric

Journal of the ACM (JACM)
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
Worst case constant time priority queue

SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Concrete Mathematics: A Foundation for Computer Science

Concrete Mathematics: A Foundation for Computer Science
Optimal bounds for the predecessor problem and related problems

Journal of Computer and System Sciences - STOC 1999
Neighbours on a Grid

SWAT '96 Proceedings of the 5th Scandinavian Workshop on Algorithm Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.