Real – Time Deques , Multihead ! Ibring Machines , and Purely Ftmctional Programming

We answer the following question: Can a deque (doubleended queue) be implemented in a purely functional language such that each push or pop operation on either end of a queue is accomplished in 0(1) time in the worst case? The answer is yes, thus solving a problem posted by Gajewska and Tarjan [14] and by Ponder, McGeer, and Ng [25], and refining results of… (More)