Add to ORKGWe introduce in this paper a data structure named (L, U)- bounded priority queue, which particularizes priority queues in two aspects: the priorities associated to the elements must be integer numbers constrained to a predefined interval and, in a sequence of operations, no more than one Insert can immediatly follow a DeleteMin. This data structure is used in the development of efficient algorithms for coding and decoding Rényi k-trees
We show the O(log n) time extract minimum function of efficient priority queues can be generalized t...
A priority queue $Q$ is a data structure that maintains a collection of elements, each element havin...
A priority queue $Q$ is a data structure that maintains a collection of elements, each element havin...
Submitted by Elaine Almeida (elaine.almeida@nce.ufrj.br) on 2017-05-09T14:22:59Z No. of bitstreams:...
AbstractA k-bounded priority queue transforms an input sequence σ into an output sequence τ which is...
AbstractWe present a priority queue that supports insert in worst-case constant time, and delete-min...
We present priority queues that support the operations MakeQueue,FindMin, Insert and Meld in worst c...
This paper presents three new results on data structures which lead to improvement in two classical ...
AbstractA sequence of priority queue operations can transform a permutation π of n elements to some,...
AbstractA k-bounded priority queue transforms an input sequence σ into an output sequence τ which is...
A kinetic priority queue is a kinetic data structure which determines the largest element in a colle...
The starting point of this paper is a new, purely functional, simple and efficient data structure co...
A k-bounded priority queue transforms an input sequence sigma into an output sequence tau which is a...
A priority queue Q is a data structure that maintains a collection of elements, each element having ...
A priority queue $Q$ is a data structure that maintains a collection of elements, each element havin...
We show the O(log n) time extract minimum function of efficient priority queues can be generalized t...
A priority queue $Q$ is a data structure that maintains a collection of elements, each element havin...
A priority queue $Q$ is a data structure that maintains a collection of elements, each element havin...
Submitted by Elaine Almeida (elaine.almeida@nce.ufrj.br) on 2017-05-09T14:22:59Z No. of bitstreams:...
AbstractA k-bounded priority queue transforms an input sequence σ into an output sequence τ which is...
AbstractWe present a priority queue that supports insert in worst-case constant time, and delete-min...
We present priority queues that support the operations MakeQueue,FindMin, Insert and Meld in worst c...
This paper presents three new results on data structures which lead to improvement in two classical ...
AbstractA sequence of priority queue operations can transform a permutation π of n elements to some,...
AbstractA k-bounded priority queue transforms an input sequence σ into an output sequence τ which is...
A kinetic priority queue is a kinetic data structure which determines the largest element in a colle...
The starting point of this paper is a new, purely functional, simple and efficient data structure co...
A k-bounded priority queue transforms an input sequence sigma into an output sequence tau which is a...
A priority queue Q is a data structure that maintains a collection of elements, each element having ...
A priority queue $Q$ is a data structure that maintains a collection of elements, each element havin...
We show the O(log n) time extract minimum function of efficient priority queues can be generalized t...
A priority queue $Q$ is a data structure that maintains a collection of elements, each element havin...
A priority queue $Q$ is a data structure that maintains a collection of elements, each element havin...