@conference {preguicca2012brief,
	title = {Brief announcement: efficient causality tracking in distributed storage systems with dotted version vectors},
	booktitle = {Proceedings of the symposium on Principles of distributed computing - PODC},
	year = {2012},
	month = {July },
	pages = {335{\textendash}336},
	publisher = {ACM},
	organization = {ACM},
	address = {Funchal, Portugal},
	abstract = {<p>Version vectors (VV) are used pervasively to track dependencies between replica versions in multi-version distributed storage systems. In these systems, VV tend to have a dual functionality: identify a version and encode causal dependencies. In this paper, we show that by maintaining the identifier of the version separate from the causal past, it is possible to verify causality in constant time (instead of O(n) for VV) and to precisely track causality with information with size bounded by the degree of replication, and not by the number of concurrent writers.</p>
},
	url = {http://dl.acm.org/citation.cfm?id=2332497},
	attachments = {https://haslab.uminho.pt/sites/default/files/cbm/files/p335-preguica.pdf},
	author = {Carlos Baquero Moreno and Paulo S{\'e}rgio Almeida and Vitor Fonte and Nuno Pregui{\c c}a and Ricardo Gon{\c c}alves}
}