Simple Confluently Persistent Catenable Lists (1998)

View PDF

Download Links

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

Active Bibliography

14 Purely Functional, Real-Time Deques with Catenation – Haim Kaplan, Robert E. Tarjan - 1999
Simple Confluently Persistent Catenable Lists. – Chris Okasakiy, Robert E. Tarjanz - 1999
10 Making Data Structures Confluently Persistent – Amos Fiat, Haim Kaplan, Albert Einstein - 2001
Sequence Implementations in Haskell – Pedro R. Borges, Pedro R. Borges - 1997
16 Purely Functional Representations of Catenable Sorted Lists. – Haim Kaplan, Robert E. Tarjan - 1996
Purely Functional Worst Case Constant Time Catenable Sorted Lists – Gerth Stølting Brodal, Christos Makris, Kostas Tsichlas
6 Amortization, Lazy Evaluation, and Persistence: Lists with Catenation via Lazy Linking – Chris Okasaki - 1995
Making Data Structures Confluently Persistent ( Extended Abstract) – unknown authors
2 Benchmarking Purely Functional Data Structures – Graeme E. Moss - 1999