This theory implements priority queues via Braun trees. Insertion and deletion take logarithmic time and preserve the balanced nature of Braun trees.

In this paper we identify a class of Quasi-Birth-and-Death (QBD) processes where the transitions to higher (resp. lower) levels are restricted to occur only from (resp. to) a subset of the phase space. These restrictions induce a specific structure in the R or G matrix of the QBD, which can be exploited to reduce the time required to compute these matrices. We show how this reduction can be ach...

The present work contains the design and analysis of a statistically self-similar data structure using linear space and supporting the operations, insert, search, remove, increase-key and decrease-key for a deterministic priority queue in expected O(1) time. Extract-max runs in O(logN) time. The depth of the data structure is at most log∗N . On the highest level, each element acts as the entran...

During the last decade, a number of new priorityqueue implementations have evolved, including pagodas [6, 261, skew heaps [21, 221, splay trees [21, 231, pairing heaps 1183, and binomial queues [4, 5, 241. In addition, a number of special priority-queue implementations for representing the pending event set in discrete event simulation Shave been developed, including the two-list implementation...

Two new ways of transforming a priority queue into a double-ended priority queue are introduced. These methods can be used to improve all known bounds for the comparison complexity of double-ended priority-queue operations. Using an efficient priority queue, the first transformation can produce a doubleended priority queue which guarantees the worst-case cost of O(1) for find -min , find-max , ...

Several data structures have been proposed to implement double-ended priority queue operations in O(log n) time, e.g., Min-Max heap [ 11, Deap [2], Diamond deque [3] and back-to-back heap [4]. In MinMax heaps, the even layers form a Min-heap and the odd layers form a Max-heap. Deap has separate Minheaps and Max-heaps that are built on the left and right subtrees, respectively. In Diamond deque,...

In the last lecture, we discussed algorithms for integer sorting. In this lecture we will discuss the relationship between integer sorting algorithms and priority queue data structures. It is obvious that fast priority queues imply fast sorting, since if a priority queue can do Insert and Deletemin in O(f(n)), then we can sort in O(nf(n)) by inserting all elements into the queue then calling De...

We show that certain twisting deformations of a family of supersolvable groups are simple as Hopf algebras. These groups are direct products of two generalized dihedral groups. Examples of this construction arise in dimensions 60 and pq, for prime numbers p, q with q|p − 1. We also show that certain twisting deformation of the symmetric group is simple as a Hopf algebra. On the other hand, we p...

Previous covering models for emergency service consider all the calls to be of the same importance and impose the same waiting time constraints independently of the service's priority. This type of constraint is clearly inappropriate in many contexts. For example, in urban medical emergency services, calls that involve danger to human life deserve higher priority over calls for more routine inc...

We suggest that satisfactory statistical performance guarantees for streaming flows can be fulfilled when their packets receive expedited forwarding in non-preemptive priority queues. This relies on the conjecture that jitter remains negligible in the network such that performance measures can be bounded by assuming flows constitute Poisson arrival processes of MTU sized packets. We provide ana...