Results 1  10
of
46
A Generalization of Binomial Queues
 Information Processing Letters
, 1996
"... We give a generalization of binomial queues involving an arbitrary sequence (mk )k=0;1;2;::: of integers greater than one. Different sequences lead to different worst case bounds for the priority queue operations, allowing the user to adapt the data structure to the needs of a specific application. ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
We give a generalization of binomial queues involving an arbitrary sequence (mk )k=0;1;2;::: of integers greater than one. Different sequences lead to different worst case bounds for the priority queue operations, allowing the user to adapt the data structure to the needs of a specific application
Functional Binomial Queues
 In Glasgow Workshop on Functional Programming
, 1994
"... Efficient implementations of priority queues can often be clumsy beasts. We express a functional implementation of binomial queues which is both elegant and efficient. We also quantify some of the differences with other functional implementations. The operations decreaseKey and delete always pose a ..."
Abstract

Cited by 12 (0 self)
 Add to MetaCart
Efficient implementations of priority queues can often be clumsy beasts. We express a functional implementation of binomial queues which is both elegant and efficient. We also quantify some of the differences with other functional implementations. The operations decreaseKey and delete always pose
Dependently Typed Binomial Queues
, 1996
"... Introduction When implementing (in a conventional imperative or functional language) an abstract datatype using some concrete representation it is often the case that not all values of the representation type correspond to an abstract value. Part of the implementor's obligations is then to exp ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Introduction When implementing (in a conventional imperative or functional language) an abstract datatype using some concrete representation it is often the case that not all values of the representation type correspond to an abstract value. Part of the implementor's obligations is then to express a representation invariant that captures the relevant restrictions on concrete values and to prove that all operations on the abstract type maintain this invariant. This note describes by means of an example how a programmer using a type system with dependent types can treat this problem already at the level of types: the representation type is refined so as to exclude unwanted values. A wellknown (but not particularly good) example of this phenomenon is provided by matrices. The Haskell/Gofer/ML programmer that represents the abstract type Matrix A by a list of lists has to maintain the invariant that a list of lists represents a matrix only if all elem
Fibonacci Heaps and Their Uses in Improved Network optimization algorithms
, 1987
"... In this paper we develop a new data structure for implementing heaps (priority queues). Our structure, Fibonacci heaps (abbreviated Fheaps), extends the binomial queues proposed by Vuillemin and studied further by Brown. Fheaps support arbitrary deletion from an nitem heap in qlogn) amortized tim ..."
Abstract

Cited by 739 (18 self)
 Add to MetaCart
In this paper we develop a new data structure for implementing heaps (priority queues). Our structure, Fibonacci heaps (abbreviated Fheaps), extends the binomial queues proposed by Vuillemin and studied further by Brown. Fheaps support arbitrary deletion from an nitem heap in qlogn) amortized
BinomialPoisson entropic inequalities and the M/M/∞ queue
 ESAIM Probab. Stat
"... This article provides entropic inequalities for binomialPoisson distributions, derived from the two point space. They appear as local inequalities of the M/M/ ∞ queue. They describe in particular the exponential dissipation of Φentropies along this process. This simple queueing process appears as ..."
Abstract

Cited by 21 (6 self)
 Add to MetaCart
This article provides entropic inequalities for binomialPoisson distributions, derived from the two point space. They appear as local inequalities of the M/M/ ∞ queue. They describe in particular the exponential dissipation of Φentropies along this process. This simple queueing process appears
Binomial Heaps and Skew Binomial Heaps
, 2013
"... We implement and prove correct binomial heaps and skew binomial heaps. Both are datastructures for priority queues. While binomial heaps have logarithmic findMin, deleteMin, insert, and meld operations, skew binomial heaps have constant time findMin, insert, and meld operations, and only the delete ..."
Abstract
 Add to MetaCart
We implement and prove correct binomial heaps and skew binomial heaps. Both are datastructures for priority queues. While binomial heaps have logarithmic findMin, deleteMin, insert, and meld operations, skew binomial heaps have constant time findMin, insert, and meld operations, and only
Optimal Purely Functional Priority Queues
 JOURNAL OF FUNCTIONAL PROGRAMMING
, 1996
"... Brodal recently introduced the first implementation of imperative priority queues to support findMin, insert, and meld in O(1) worstcase time, and deleteMin in O(log n) worstcase time. These bounds are asymptotically optimal among all comparisonbased priority queues. In this paper, we adapt B ..."
Abstract

Cited by 16 (1 self)
 Add to MetaCart
Brodal's data structure to a purely functional setting. In doing so, we both simplify the data structure and clarify its relationship to the binomial queues of Vuillemin, which support all four operations in O(log n) time. Specifically, we derive our implementation from binomial queues in three
Functional Pearls: Explaining Binomial Heaps
, 1999
"... This paper explains binomial heaps, a beautiful data structure for priority queues, using the functional programming language Haskell (Peterson & Hammond, 1997). We largely follow a deductive approach: using the metaphor of a tennis tournament we show that binomial heaps arise naturally through ..."
Abstract

Cited by 5 (4 self)
 Add to MetaCart
This paper explains binomial heaps, a beautiful data structure for priority queues, using the functional programming language Haskell (Peterson & Hammond, 1997). We largely follow a deductive approach: using the metaphor of a tennis tournament we show that binomial heaps arise naturally through
QBD Markov Chains on BinomialLike Trees and its Application to Multilevel Feedback Queues
"... A matrix analytic paradigm, termed QuasiBirthDeath Markov chains on binomiallike trees, is introduced and a quadratically converging algorithm to assess its steady state is presented. In a bivariate Markov chain {(Xt, Nt), t ≥ 0}, the values of the variable Xt are nodes of a binomiallike tree of ..."
Abstract
 Add to MetaCart
A matrix analytic paradigm, termed QuasiBirthDeath Markov chains on binomiallike trees, is introduced and a quadratically converging algorithm to assess its steady state is presented. In a bivariate Markov chain {(Xt, Nt), t ≥ 0}, the values of the variable Xt are nodes of a binomiallike tree
Analysis of an InfiniteServer Queue with
 Batch Markovian Arrival Streams”, Queueing Systems
, 2002
"... Abstract. This paper considers an infiniteserver queue with multiple batch Markovian arrival streams. The service time distribution of customers may be different for different arrival streams, and simultaneous batch arrivals from more than one stream are allowed. For this queue, we first derive a s ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract. This paper considers an infiniteserver queue with multiple batch Markovian arrival streams. The service time distribution of customers may be different for different arrival streams, and simultaneous batch arrivals from more than one stream are allowed. For this queue, we first derive a
Results 1  10
of
46