Amos Fiat, Haim Kaplan  Home/Search
Context Related
| math.tau.ac.il/~fiat/meld.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: math.tau.ac.il/~fiat/ (more) Homepages: A.Fiat |
Rate this article:      (best)Comment on this article |
Abstract: We address a longstanding open problem of [10, 9], and present a general transformation that transforms any pointer based data structure to be confluently persistent. Such transformations for fully persistent data structures are given in [10], greatly improving the performance compared to the naive scheme of simply copying the inputs. Unlike fully persistent data structures, where both the naive scheme and the fully persistent scheme of [10] are feasible, we show that the naive scheme for... (Update)
Cited by: More
Active Libraries and Universal Languages - Veldhuizen (2004) (Correct)
Active bibliography (related documents): More All
1.7: Persistent data structures Haim Kaplan - Tel Aviv University (Correct)
1.0: Simple Confluently Persistent Catenable Lists - Kaplan, Okasaki, Tarjan (1998) (Correct)
0.8: Purely Functional, Real-Time Deques with Catenation - Kaplan, Tarjan (1999) (Correct)
Similar documents based on text: More All
0.6: Fully Persistent Arrays for Efficient Incremental Updates and.. - Chuang (Correct)
0.5: Persistent Linked Structures at Constant Worst-Case Cost - Boroujerdi, Moret (Correct)
0.5: Simple Confluently Persistent Catenable Lists (Extended.. - Kaplan, Okasaki, Tarjan (2000) (Correct)
Related documents from co-citation: More All
2: ISSN 10406042 (context) - Veldhuizen, Report et al. - 1995
BibTeX entry: (Update)
Amos Fiat and Haim Kaplan. Making data structures confluently persistent. In Proceedings of the Twelfth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-01), pages 537--546, New York, January 7--9 2001. ACM Press. http://citeseer.ist.psu.edu/fiat01making.html More
@inproceedings{ fiat01making,
author = "Amos Fiat and Haim Kaplan",
title = "Making data structures confluently persistent",
booktitle = "Symposium on Discrete Algorithms",
pages = "537--546",
year = "2001",
url = "citeseer.ist.psu.edu/fiat01making.html" }
Citations (may not include all citations):258 Data Structures and Network Algorithms (context) - Tarjan - 1983
192 Self-adjusting binary search trees (context) - Sleator, Tarjan - 1985
129 Making data structures persistent (context) - Driscoll, Sarnak et al. - 1989
116 Planar point location using persistent search trees (context) - Sarnak, Tarjan - 1986
106 Purely functional data structures - Okasaki - 1996
102 Dynamic perfect hashing: upper and lower bounds - Dietzfelbinger, Karlin et al. - 1994
99 Two algorithms for maintaining order in a list (context) - Dietz, Sleator - 1987
36 Searching and storing similar lists (context) - Cole - 1986
35 Abstract continuations: a mathematical semantics for handlin.. (context) - Felleisen, Wand et al. - 1988
33 Biased search trees (context) - Bent, Sleator et al. - 1985
33 Fully persistent arrays (context) - Dietz - 1989
25 Fully persistent lists with catenation (context) - Driscoll, Sleator et al. - 1994
20 Persistent lists with catenation via recursive slow-down (context) - Kaplan, Tarjan - 1995
16 Information and control (context) - Chazelle, search - 1985
14 Purely functional representations of catenable sorted lists - Kaplan, Tarjan - 1996
13 and persistence: Lists with catenation via lazy linking (context) - Okasaki, lazy - 1995
12 A Diochromatic Framework for Balanced Trees (context) - Guibas, Sedgewick - 1978
10 The role of lazy evaluation in amortized data structures - Okasaki - 1996
6 Control delimiters and their hierarchies (context) - Sitaram, Felleisen - 1990
6 The theory and practice of rst-class prompts (context) - Felleisen - 1988
4 Simple con uently persistent catenable lists (context) - Kaplan, Okasaki et al. - 1998
4 Persistent Data Structures (context) - Sarnak - 1986
3 Con uently persistant deques via data structural bootstrappi.. (context) - Buchsbaum, Tarjan - 1995
3 real-time deques with catenation (context) - Kaplan, Tarjan
2 Ecient uses of the past (context) - Dobkin, Munro - 1985
1 Technical Reports RUU-CS-81-7 and RUU-CS (context) - Overmars, the et al. - 1981
1 Stores and partial continuations as rst-class objects in a l.. (context) - Johnson, Duggan - 1988
Documents on the same site (http://www.math.tau.ac.il/~fiat/): More
Randomized Robot Navigation Algorithms - Berman, Blum, Fiat, Karloff.. (1996) (Correct)
Packet Routing via Min-Cost Circuit Routing - Awerbuch, Azar, Fiat (1996) (Correct)
Experimental Studies of Access Graph Based Heuristics: Beating.. - Fiat, Rosen (1997) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC