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:19 - 5 self

Documents Related by Co-Citation

267 Functional Data Structures – Chris Okasaki - 1996
271 Making data structures persistent – James R. Driscoll, Neil Sarnak, Daniel D. Sleator, Robert E. Tarjan - 1989
26 Persistent lists with catenation via recursive slow-down – Haim Kaplan, Robert E Tarjan - 1995
2708 The Design and Analysis of Computer Algorithms – A Aho, J Hopcroft, J Ullman - 1974
409 Self-adjusting binary search trees – Daniel Dominic Sleator, Robert Endre Tarjan - 1985
22 Fully persistent lists WITH CATENATION – James R. Driscoll, Daniel D. K. Sleator, Robert E. Tarjan - 1994
247 A dichromatic framework for balanced trees – L J GUIBAS, R SEDGEWICK - 1978
645 Data Structures and Network Algorithms – R E Tarjan - 1983
2531 The Art of Computer Programming – D E Knuth - 1986