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

Documents Related by Co-Citation

25 Persistent lists with catenation via recursive slow-down – H Kaplan, R E Tarjan - 1995
226 Functional Data Structures – Chris Okasaki - 1996
250 Making Data Structures Persistent – James R. Driscoll, Neil Sarnak, Daniel D. Sleator, Robert E. Tarjan - 1989
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
51 TARJAN, Design and analysis of a data structure for representing sorted lists – M R BROWN, R E
15 Confluently Persistent Deques via Data-Structural Bootstrapping – Adam L. Buchsbaum, Robert E. Tarjan - 1993
13 lazy evaluation, and persistence: Lists with catenation via lazy linking – Amortization - 1995
25 Simple and efficient purely functional queues and deques – Chris Okasaki - 1995
15 Data Structural Bootstrapping, Linear Path Compression, and Catenable Heap Ordered Double Ended Queues – Adam L. Buchsbaum, Rajamani Sundar, Robert E. Tarjan - 1992
2452 The Design and Analysis of Computer Algorithms – A V Aho, J E Hopcroft, J D Ullman - 1974
174 Tarjan, Planar point location using persistent search trees – N Sarnak, R E - 1986
13 Purely Functional, Real-Time Deques with Catenation – Haim Kaplan, Robert E. Tarjan - 1999
377 Self-adjusting binary search trees – D D Sleator, R E Tarjan - 1985
7 Leeuwen, "Worst case analysis of set union algorithms – R E Tarjan, J van - 1984
11 Simple Confluently Persistent Catenable Lists – Haim Kaplan, Chris Okasaki, Robert E. Tarjan - 1998
22 Deques with heap order – H Gajewska, R E Tarjan - 1986
17 A programming and problem-solving seminar – C Van Wyk, D Knuth - 1979
14 Partially Persistent Data Structures of Bounded Degree with Constant Update Time – Gerth Stølting Brodal, Gerth Stlting Brodal - 1996