Results 1  10
of
73
Catenable DoubleEnded Queues
 In Proceedings of the second ACM SIGPLAN international conference on Functional programming
, 1997
"... Catenable doubleended queues are doubleended queues (deques) that support catenation (i.e., append) efficiently without sacrificing the efficiency of other operations. We present a purely functional implementation of catenable deques for which every operation, including catenation, takes O(1) amor ..."
Abstract

Cited by 13 (0 self)
 Add to MetaCart
Catenable doubleended queues are doubleended queues (deques) that support catenation (i.e., append) efficiently without sacrificing the efficiency of other operations. We present a purely functional implementation of catenable deques for which every operation, including catenation, takes O(1
Obstructionfree synchronization: Doubleended queues as an example
 In preparation
, 2003
"... We introduce obstructionfreedom, a new nonblocking property for shared data structure implementations. This property is strong enough to avoid the problems associated with locks, but it is weaker than previous nonblocking properties—specifically lockfreedom and waitfreedom— allowing greater flexi ..."
Abstract

Cited by 211 (18 self)
 Add to MetaCart
based implementations of doubleended queues (deques); the first is implemented on a linear array, the second on a circular array. To our knowledge, all previous nonblocking deque implementations are based on unrealistic assumptions about hardware support for synchronization, have restricted functionality, or have
DIFFUSION MODELS FOR DOUBLEENDED QUEUES WITH RENEWAL ARRIVAL PROCESSES
"... We study a doubleended queue where buyers and sellers arrive to conduct trades. When there is a pair of buyer and seller in the system, they immediately transact a trade and leave. Thus there cannot be a nonzero number of buyers and sellers simultaneously in the system. We assume that sellers and ..."
Abstract
 Add to MetaCart
We study a doubleended queue where buyers and sellers arrive to conduct trades. When there is a pair of buyer and seller in the system, they immediately transact a trade and leave. Thus there cannot be a nonzero number of buyers and sellers simultaneously in the system. We assume that sellers
Data Structural Bootstrapping, Linear Path Compression, and Catenable Heap Ordered Double Ended Queues
 SIAM Journal on Computing
, 1992
"... A deque with heap order is a linear list of elements with realvalued keys which allows insertions and deletions of elements at both ends of the list. It also allows the findmin (equivalently findmax) operation, which returns the element of least (greatest) key, but it does not allow a general delet ..."
Abstract

Cited by 17 (7 self)
 Add to MetaCart
A deque with heap order is a linear list of elements with realvalued keys which allows insertions and deletions of elements at both ends of the list. It also allows the findmin (equivalently findmax) operation, which returns the element of least (greatest) key, but it does not allow a general
Simple and efficient purely functional queues and deques
 JOURNAL OF FUNCTIONAL PROGRAMMING
, 1995
"... We present purely functional implementations of queues and doubleended queues (deques) requiring only O(1) time per operation in the worst case. Our algorithms are considerably simpler than previous designs with the same bounds. The inspiration for our approach is the incremental behavior of certai ..."
Abstract

Cited by 25 (5 self)
 Add to MetaCart
We present purely functional implementations of queues and doubleended queues (deques) requiring only O(1) time per operation in the worst case. Our algorithms are considerably simpler than previous designs with the same bounds. The inspiration for our approach is the incremental behavior
Mergeable DoubleEnded Priority Queues
, 1999
"... We show that the leftist tree data structure may be adapted to obtain data structures that permit the doubleended priority queue operations Insert, DeleteMin, DeleteMax, and Merge to be done in O(logn) time where n is the size of the resulting queue. The operations FindMin and FindMax can be don ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We show that the leftist tree data structure may be adapted to obtain data structures that permit the doubleended priority queue operations Insert, DeleteMin, DeleteMax, and Merge to be done in O(logn) time where n is the size of the resulting queue. The operations FindMin and FindMax can
Two new methods for transforming priority queues into doubleended priority queues
 CPH STL Report
, 2006
"... Abstract. Two new ways of transforming a priority queue into a doubleended priority queue are introduced. These methods can be used to improve all known bounds for the comparison complexity of doubleended priorityqueue operations. Using an efficient priority queue, the first transformation can pr ..."
Abstract

Cited by 4 (4 self)
 Add to MetaCart
Abstract. Two new ways of transforming a priority queue into a doubleended priority queue are introduced. These methods can be used to improve all known bounds for the comparison complexity of doubleended priorityqueue operations. Using an efficient priority queue, the first transformation can
An Efficient Construction Algorithm for a Class of Implicit DoubleEnded Priority Queues
"... Priority queues and doubleended priority queues are fundamental data types in Computer Science, ..."
Abstract
 Add to MetaCart
Priority queues and doubleended priority queues are fundamental data types in Computer Science,
Purely Functional Representations of Catenable Sorted Lists.
 In Proceedings of the 28th Annual ACM Symposium on Theory of Computing
, 1996
"... The power of purely functional programming in the construction of data structures has received much attention, not only because functional languages have many desirable properties, but because structures built purely functionally are automatically fully persistent: any and all versions of a structur ..."
Abstract

Cited by 18 (5 self)
 Add to MetaCart
structure can coexist indefinitely. Recent results illustrate the surprising power of pure functionality. One such result was the development of a representation of doubleended queues with catenation that supports all operations, including catenation, in worstcase constant time [19].
Plane Drawings of Queue and Deque Graphs
"... In stack and queue layouts the vertices of a graph are linearly ordered from left to right, where each edge corresponds to an item and the left and right end vertex of each edge represents the addition and removal of the item to the used data structure. A graph admitting a stack or queue layout is ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
visualization technique for queue and deque (doubleended queue) graphs. It provides new insights into the characteristics of these fundamental data structures and extends to the visualization of mixed layouts with stacks and queues. Our main result states that a graph is a deque graph if and only if it has a
Results 1  10
of
73