A priority queue in which initialization and queue operations takeO(loglogD) time

  title={A priority queue in which initialization and queue operations takeO(loglogD) time},
  author={Donald B. Johnson},
  journal={Mathematical systems theory},
  • Donald B. Johnson
  • Published 1 December 1981
  • Computer Science
  • Mathematical systems theory
Many computer algorithms have embedded in them a subalgorithm called a priority queue which produces on demand an element of extreme priority among elements in the queue. Queues on unrestricted priority domains have a running time of Θ(nlogn) for sequences ofn queue operations. We describe a simple priority queue over the priority domain {1,⋯,N} in which initialization, insertion, and deletion takeO(loglogD) time, whereD is the difference between the next lowest and next highest priority… 

FlexQueue: Simple and Efficient Priority Queue for System Software

This thesis presents a new priority queue design called FlexQueue, that answers the question of whether it is possible to achieve similar performance while retaining a simple design with a definitive “yes” answer.

An In-Depth Analysis of Data Structures Derived from van-Emde-Boas-Trees

This thesis gives an overview of several different data structures for the w-bit word RAM on bounded integer universes, i.e. U = {0, . . . , 2 − 1}.

Thirty nine years of stratified trees ( Invited Paper )

The historical backgrounds against which the stratified trees were discovered and implemented are described, including a Wikipedia to appear in Proc.

Thirty nine years of stratified trees

The historical backgrounds against which the stratified trees were discovered and implemented are described; they can be found in the various textbooks and papers mentioned, including a Wikipedia page.

Efficient IP table lookup via adaptive stratified trees with selective reconstructions

The proposed solution is based on casting the problem in geometric terms and on repeated application of efficient local geometric optimization routines, which shows that in terms of storage, query time, and update time the AST is at a par with state of the art algorithms based on data compression or string manipulations.

More detailed description of the data structures and the chaining algorithm

  • Computer Science
  • 2010
Johnson priority queues support one-dimensional range queries with a worst-time complexity of O(log( log(n))+z) where z elements are within the given range.

Fast evaluation of Bounded Slice-line Grid

A simple algorithm independent of the BSG size is proposed to evaluate theBSG representation inO (n log logn) time, wheren is the number of blocks, and is much faster than the previous graph-basedO ( n2) algorithm.

On Parallel Hashing and Integer Sorting ed I

A result of independent interest is a parallel hashing technique that enables drastic reduction of space requirements for the price of using randomness in the parallel sorting algorithm, and for some parallel string matching algorithms.

Fast local searches and updates in bounded universes

Fully Dynamic Evaluation of Sequence Pair

  • A. Kozik
  • Computer Science
    IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
  • 2013
This paper develops a fully dynamic algorithm of SP evaluation, that efficiently updates a criterion value after insertions and deletions of SP elements and after modifications of element weights.



Implementation and Analysis of Binomial Queue Algorithms

The binomial queue, a new data structure for implementing priority queues that can be efficiently merged, was recently discovered by Jean Vuillemin and new methods of representing binomial queues are given which reduce the storage overhead of the structure and increase the efficiency of operations on it.

Analysis of an algorithm for priority queue administration

The main part of the paper is devoted to a mathematical analysis of the algorithm showing that the expected number of key comparisons to insert a “random” element into a ‘random’p-tree withn nodes isO((logn)2).

Design and implementation of an efficient priority queue

AbstractWe present a data structure, based upon a hierarchically decomposed tree, which enables us to manipulate on-line a priority queue whose priorities are selected from the interval 1,⋯,n with a

Preserving order in a forest in less than logarithmic time

  • P. Boas
  • Computer Science
    16th Annual Symposium on Foundations of Computer Science (sfcs 1975)
  • 1975

Efficient Algorithms for Shortest Paths in Sparse Networks

Algorithms for finding shortest paths are presented which are faster than algorithms previously known on networks which are relatively sparse in arcs, and a class of “arc set partition” algorithms is introduced.

The Design and Analysis of Computer Algorithms

This text introduces the basic data structures and programming techniques often used in efficient algorithms, and covers use of lists, push-down stacks, queues, trees, and graphs.

Notes on the van Erode Boas construction of priority deques: An instructive use of recursion (unpublished notes

  • 1977

Priority Queues with Update and Finding Minimum Spanning Trees

Linear Lists and Prorty Queues as Balanced Binary Trees

  • Clark A. Crane
  • Mathematics
    Outstanding Dissertations in the Computer Sciences
  • 1972