Skip to search formSkip to main contentSkip to account menu

Persistent data structure

Known as: Ephemeral data structure, Data structure persistance, Destructive update 
In computing, a persistent data structure is a data structure that always preserves the previous version of itself when it is modified. Such data… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
In this paper we present a new approach to computing homology (with field coefficients) and persistent homology. We use concepts… 
2011
2011
We present a first attempt at the compilation of the Game Description Language (GDL) using a bottom-up strategy. GDL is… 
2009
2009
Intertidal rocky shores in south-eastern Australia are dominated by a diverse assem- blage of grazing invertebrates that feed on… 
2003
2003
The elastic properties of dendritic (hyperbranched) molecules with dimensions below 3 nm have been probed with atomic force… 
2003
2003
There are several efforts to map clinical guidelines to a form, which can be further processed by special programs. All these… 
1995
1995
Scanning tunneling microscopy (STM) images of l-docosanol, 1-docosanethiol, didocosyl disulfide, and 1-chlorooctadecane on… 
1995
1995
Abstract Persistentdatacontinueto existaftertheprogramsthat createormanipulate themterminate.Files and database records are… 
1994
1994
The need for active database rules to be able to interact with running application programs has been recognized for some time. In… 
1988
1988
  • James J. Cherry
  • 1988
  • Corpus ID: 10104128
Pearl is a timing analyzer that has been used to verify both full-custom VLSI and gate array designs. Rather than verify that a… 
1986
1986
: In adrenalectomized and orchidectomized rats, the removal of the steroidogenic endocrine glands is associated with a near…