Purely Functional Representations of Catenable Sorted Lists. (1996)

Cached

Download Links

by Haim Kaplan , Robert E. Tarjan
Venue:In Proceedings of the 28th Annual ACM Symposium on Theory of Computing
Citations:16 - 5 self

Active Bibliography

13 Purely Functional, Real-Time Deques with Catenation – Haim Kaplan, Robert E. Tarjan - 1999
10 Making Data Structures Confluently Persistent – Amos Fiat, Haim Kaplan, Albert Einstein - 2001
15 Confluently Persistent Deques via Data-Structural Bootstrapping – Adam L. Buchsbaum, Robert E. Tarjan - 1993
10 Persistent data structures – Haim Kaplan - 1995
250 Making Data Structures Persistent – James R. Driscoll, Neil Sarnak, Daniel D. Sleator, Robert E. Tarjan - 1989
11 Simple Confluently Persistent Catenable Lists – Haim Kaplan, Chris Okasaki, Robert E. Tarjan - 1998
1 Confluently Persistent Tries for Efficient Version Control – Erik D. Demaine, Stefan Langerman, Eric Price
7 Amortization, Lazy Evaluation, and Persistence: Lists with Catenation via Lazy Linking – Chris Okasaki - 1995
18 Optimal Purely Functional Priority Queues – Gerth Stølting Brodal, Chris Okasaki - 1996
8 Real-time Garbage Collection of a Functional Persistent Heap – Tekij"a Kenneth Oksanen - 1999
Finger Search on Balanced Search Trees – Maverick Woo - 2006
17 Purely Functional Random-Access Lists – Chris Okasaki - 1995
2 Benchmarking Purely Functional Data Structures – Graeme E. Moss - 1999
11 A Dynamic Continuation-Passing Style for Dynamic Delimited Continuations – Dariusz Biernacki, Olivier Danvy, Kevin Millikin - 2006
13 A Library of High Level Control Operators – Christian Queinnec - 1993
14 A Monadic Framework for Delimited Continuations – R. Kent Dybvig, Simon Peyton Jones, Amr Sabry
Persistence, Offline Algorithms, and Space Compaction – David Eppstein - 1991
46 Dynamic Trees and Dynamic Point Location – Michael T. Goodrich, Roberto Tamassia - 1991
5 Numerical Representations as Higher-Order Nested Datatypes – Ralf Hinze - 1998