12453 search results - page 124 / 2491 » Concurrent Data Structures |
137
Voted
FCT
1999
Springer
15 years 6 months ago
1999
Springer
The aim of this paper is to investigate the relation between two models of concurrent systems: tile rewrite systems and coalgebras. Tiles are rewrite rules with side e ects which a...
135
click to vote
ESOP
2008
Springer
15 years 4 months ago
2008
Springer
A data structure is said to be persistent when any update operation returns a new structure without altering the old version. This paper introduces a new notion of persistence, cal...
145
Voted
FOCS
1996
IEEE
15 years 6 months ago
1996
IEEE
We study the tolerance of data structures to memory faults. We observe that many pointerbased data structures (e.g., linked lists, trees, etc.) are highly nonresilient to faults. ...
127
click to vote
DBPL
1999
Springer
15 years 6 months ago
1999
Springer
Applications have an increasing need to manage semistructured data such as data encoded in XML along with conventional structured data. We extend the structured object database ...
117
Voted
ENTCS
2007
15 years 2 months ago
2007
Abstract Machine Describing Event Structure Composition Claudia Faggian and Mauro Piccolo 1 ,2 ,3 Dipartimento di Matematica Pura e Applicata – PPS Universit´a di Padova – Par...