Add to ORKGWe present a new data structure of size 3M +o(M) bits for solving the "discrete priority queue " problem. When this data structure is used in combination with a new memory topology it provides an O(1) worst case time solution.Godkänd; 2001; 20080411 (ysko
This paper presents a very general technique for the implementation of mergeable priority queues. Th...
A recursive and fast construction of an n elements priority queue from exponentially smaller hard-wa...
Abstract. A priority queue is presented that supports the operations insert and find-min in worst-ca...
A priority queue Q is a data structure that maintains a collection of elements, each element having ...
Abstract. We consider the classical problem of representing a collection of priority queues under th...
A priority queue Q is a data structure that maintains a collection of elements, each ele-ment having...
Abstract. A priority queue Q is a data structure that maintains a col-lection of elements, each elem...
We study the design of efficient data structures. In particular we focus on the design of data struc...
The complexity of priority queue operations is analyzed with respect to the cell probe computational...
AbstractWe present a priority queue that supports insert in worst-case constant time, and delete-min...
. We present time and work optimal priority queues for the CREW PRAM, supporting FindMin in constant...
We introduce the heap-on-top (hot) priority queue data structure that combines the multi-level bucke...
We present a priority queue that supports the operations: insert in worst-case constant time, and de...
We present a parallel priority queue that supports the following operations in constant time: parall...
This paper introduces the Parallel Priority Queue (PPQ) abstract data type. A PPQ stores a set of in...
This paper presents a very general technique for the implementation of mergeable priority queues. Th...
A recursive and fast construction of an n elements priority queue from exponentially smaller hard-wa...
Abstract. A priority queue is presented that supports the operations insert and find-min in worst-ca...
A priority queue Q is a data structure that maintains a collection of elements, each element having ...
Abstract. We consider the classical problem of representing a collection of priority queues under th...
A priority queue Q is a data structure that maintains a collection of elements, each ele-ment having...
Abstract. A priority queue Q is a data structure that maintains a col-lection of elements, each elem...
We study the design of efficient data structures. In particular we focus on the design of data struc...
The complexity of priority queue operations is analyzed with respect to the cell probe computational...
AbstractWe present a priority queue that supports insert in worst-case constant time, and delete-min...
. We present time and work optimal priority queues for the CREW PRAM, supporting FindMin in constant...
We introduce the heap-on-top (hot) priority queue data structure that combines the multi-level bucke...
We present a priority queue that supports the operations: insert in worst-case constant time, and de...
We present a parallel priority queue that supports the following operations in constant time: parall...
This paper introduces the Parallel Priority Queue (PPQ) abstract data type. A PPQ stores a set of in...
This paper presents a very general technique for the implementation of mergeable priority queues. Th...
A recursive and fast construction of an n elements priority queue from exponentially smaller hard-wa...
Abstract. A priority queue is presented that supports the operations insert and find-min in worst-ca...