An applicative random-access stack (1983)

Cached

Download Links

by Eugene W. Myers
Venue:Information Processing Letters
Citations:13 - 0 self

Documents Related by Co-Citation

35 Efficient Applicative Data Types – E W Myers - 1984
23 Real-time queue operations – Robert Hood, Robert Melville - 1981
250 Making Data Structures Persistent – James R. Driscoll, Neil Sarnak, Daniel D. Sleator, Robert E. Tarjan - 1989
17 Purely Functional Random-Access Lists – Chris Okasaki - 1995
21 Efficient uses of the past – D P Dobkin, J I Munro - 1980
81 Incremental context-dependent analysis for language-based editors – Thomas Reps, Tim Teitelbaum, Alan Demers - 1983
49 Searching and storing similar lists – R Cole - 1986
607 Data Structures and Network Algorithms – R E Tarjan - 1983
226 Functional Data Structures – Chris Okasaki - 1996
25 Persistent lists with catenation via recursive slow-down – H Kaplan, R E Tarjan - 1995
8 Efficient algorithms for computing geometric intersections – G Swart - 1985
10 Meertens. Making B-trees work for B – T Krijnen, L G L T - 1983
26 How to Search in History – B Chazelle - 1985
12 Searching in the past ii: general transforms – M Overmars - 1981
10 AVL dags – E W Myers - 1982
13 Persistent data structures – Neil Ivor Sarnak - 1986
22 Localized search in sorted lists – S R Kosaraju - 1981
13 Searching in the past – M H Overmars - 1981
156 Two algorithms for maintaining order in a list – P Dietz, D Sleator - 1987