Simple Confluently Persistent Catenable Lists (1998)

Cached

Download Links

by Haim Kaplan , Chris Okasaki , Robert E. Tarjan
Venue:SIAM JOURNAL ON COMPUTING
Citations:11 - 2 self

Documents Related by Co-Citation

13 Purely Functional, Real-Time Deques with Catenation – Haim Kaplan, Robert E. Tarjan - 1999
226 Functional Data Structures – Chris Okasaki - 1996
25 Persistent lists with catenation via recursive slow-down – H Kaplan, R E Tarjan - 1995
13 lazy evaluation, and persistence: Lists with catenation via lazy linking – Amortization - 1995
15 Confluently Persistent Deques via Data-Structural Bootstrapping – Adam L. Buchsbaum, Robert E. Tarjan - 1993
22 Fully persistent lists with catenation – James R Driscoll, Daniel D K Sleator, Robert E Tarjan - 1994
33 Fully persistent arrays – P F Dietz - 1989
16 Purely Functional Representations of Catenable Sorted Lists. – Haim Kaplan, Robert E. Tarjan - 1996
250 Making Data Structures Persistent – James R. Driscoll, Neil Sarnak, Daniel D. Sleator, Robert E. Tarjan - 1989
4 Purely functional lists – H Kaplan - 854
13 Persistent data structures – Neil Ivor Sarnak - 1986
49 Searching and storing similar lists – R Cole - 1986
58 Abstract continuations: A mathematical semantics for handling full functional jumps – M Felleisen, M Wand, D P Friedman, B F Duba - 1988
24 Stores and partial continuations as first-class objects in a language and its environment – Gregory F Johnson, Dominic Duggan - 1988
174 Tarjan, Planar point location using persistent search trees – N Sarnak, R E - 1986
39 Control delimiters and their hierarchies – Dorai Sitaram, Matthias Felleisen - 1990
150 The theory and practice of first-class prompts – M Felleisen - 1988
5 Saxon: Anatomy of an XSLT processor – M H Kay - 2001
17 Compiling regular patterns – M Y Levin - 2003