Apr 15, 2011 · Abstract:It is shown how to enhance any data structure in the pointer model to make it confluently persistent, with efficient query and ...

Dec 18, 2013 · Abstract. It is shown how to enhance any data structure in the pointer model to make it confluently persistent, with efficient query and update ...

Confluent Persistence To make a data structure conflu- ently persistent is to augment the data structure with the fol- lowing temporal operations: given any ...

It is shown how to enhance any data structure in the pointer model to make it confluently persistent, with efficient query and update times and limited ...

In this new paradigm, called retroactive data structures, the historical sequence of operations performed on the data structure is not fixed. The data structure ...

It is shown how to enhance any data structure in the pointer model to make it confluently persistent, with efficient query and update times and limited ...

It is shown how to enhance any data structure in the pointer model to make it confluently persistent, with efficient query and update times and limited ...

It is shown how to enhance any data structure in the pointer model to make it confluently persistent, with efficient query and update times and limited ...

BibTeX key: conf/soda/ColletteIL12; entry type: inproceedings; booktitle: SODA; year: 2012; pages: 593-601; publisher: SIAM; crossref: conf/soda/2012 ...

Dive into the research topics of 'Confluent persistence revisited'. Together they form a unique fingerprint. Sort by; Weight · Alphabetically. Computer Science.