Real-Time Deques, Multihead Turing Machines, and Purely Functional Programming (1993)

Cached

Download Links

by Tyng-Ruey Chuang , Benjamin Goldberg
Venue:In Conference on Functional Programming Languages and Computer Architecture
Citations:12 - 1 self

Documents Related by Co-Citation

25 Persistent lists with catenation via recursive slow-down – H Kaplan, R E Tarjan - 1995
23 Real-time queue operations – Robert Hood, Robert Melville - 1981
250 Making Data Structures Persistent – James R. Driscoll, Neil Sarnak, Daniel D. Sleator, Robert E. Tarjan - 1989
25 Simple and efficient purely functional queues and deques – Chris Okasaki - 1995
469 The Science of Programming – D Gries - 1981
12 A symmetric set of efficient list operations – R R Hoogerwoord - 1992
6 The Efficient Implementation of Very-High-Level Programming Language Constructs – Robert Hood - 1982
11 Functional Binomial Queues – David King - 1994
226 Functional Data Structures – Chris Okasaki - 1996
22 Fully persistent lists with catenation – James R Driscoll, Daniel D K Sleator, Robert E Tarjan - 1994
86 A data structure for manipulating priority queues – J Vuillemin - 1978
138 Amortized computational complexity – R E Tarjan - 1985
16 Efficient functional implementation of FIFO queues – F Warren Burton - 1982
15 Data Structural Bootstrapping, Linear Path Compression, and Catenable Heap Ordered Double Ended Queues – Adam L. Buchsbaum, Rajamani Sundar, Robert E. Tarjan - 1992
35 Efficient Applicative Data Types – E W Myers - 1984
22 Deques with heap order – H Gajewska, R E Tarjan - 1986
174 Tarjan, Planar point location using persistent search trees – N Sarnak, R E - 1986
11 Data Structures and Amortized Complexity in a Functional Setting – Berry Schoenmakers - 1992
15 Confluently Persistent Deques via Data-Structural Bootstrapping – Adam L. Buchsbaum, Robert E. Tarjan - 1993