Searching for "Making Data Structures Persistent" – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

19 documents found, showing 1 through 10. Next 10 →

Making Data Structures Persistent
by James R. Driscoll, Neil Sarnak, Daniel D. Sleator, Robert E. Tarjan — 1989
… and London Making Data Structures Persistent* JAMES R. DRISCOLL~ Computer Science Department, Carnegie…
Cited by 210 (6 self) – Add To MetaCart

Simple Confluently Persistent Catenable Lists
by Haim Kaplan, Chris Okasaki, Robert, Robert E. Tarjan — 1998 — SIAM Journal on Computing
… it applies. Although general techniques exist for making data structures persistent, these techniques fail…
Cited by 10 (2 self) – Add To MetaCart

Persistent Authenticated Dictionaries and Their Applications
by Aris Anagnostopoulos, Michael T. Goodrich, Roberto Tamassia — 2001 — In Proc. Information Security Conference (ISC 2001), volume 2200 of LNCS
… for making linked data structures persistent. Nevertheless, none of these previous schemes for making data…
Cited by 34 (14 self) – Add To MetaCart

Persistent data structures
by Haim Kaplan — 1995 — IN HANDBOOK ON DATA STRUCTURES AND APPLICATIONS, CRC PRESS 2001, DINESH MEHTA AND SARTAJ SAHNI (EDITORS) BOROUJERDI, A., AND MORET, B.M.E., &QUOT;PERSISTENCY IN COMPUTATIONAL GEOMETRY,&QUOT; PROC. 7TH CANADIAN CONF. COMP. GEOMETRY, QUEBEC
… : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 1-4 1.3 General techniques for making data structures persistent…
Cited by 1 (0 self) – Add To MetaCart

This document in subdirectory DS/97/1 / Worst Case Efficient Data Structures
by Gerth Stølting Brodal, Gerth Stølting Brodal
… to make bounded in-degree and out-degree data structures partially persistent, i.e., how to remember old…
Add To MetaCart

Exchange Format Bibliography
by Holger M. Kienle, Jörg Czeranski, Thomas Eisenbarth — 2000 — In Workshop on Standard Exchange Format (WoSEF
…). Persistent intermediate representations in compiler construction (section 4). Making data structures…
Cited by 5 (0 self) – Add To MetaCart

Time and space efficient multi-method dispatching
by Stephen Alstrup, Gerth Stølting Brodal, Inge Li Gørtz, Theis Rauhe — 2002 — IN SWAT: SCANDINAVIAN WORKSHOP ON ALGORITHM THEORY
… solve the persistent unaryproblem combining the technique by Dietz [5] to make a data structure fully…
Cited by 2 (0 self) – Add To MetaCart

New Techniques for the Analysis and Implementation of Functional Programs
by Tyng-Ruey Chuang, Robert M. Keller, Chris Hankin, Abstract Interpretation — 1993
…, and Robert E. Tarjan. Making data structures persistent. Journal of Computer and System Sciences, 38…
Cited by 1 (1 self) – Add To MetaCart

Retroactive data structures
by Erik D. Demaine, John Iacono — 2004 — In SODA ’04: Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
… methods for making data structures persistent [4, 5]. As described in the introduction, retroactivity…
Cited by 5 (1 self) – Add To MetaCart

Polytechnic University
by Erik D. Demaine, John Iacono, Stefan Langerman, Université Libre De Bruxelles
… data structures by formally defining the model and its variants. We prove that, unlike persistence…
Add To MetaCart

Showing 1 through 10. Next 10 →

Try your query at: Scholar | Yahoo! | Ask | MS Live | CSB