Atomic snapshots of shared memory, Journal of the ACM, vol.40, issue.4, pp.873-890, 1993. ,
DOI : 10.1145/153724.153741
Scalable Bloom Filters, Information Processing Letters, vol.101, issue.6, pp.255-261, 2007. ,
DOI : 10.1016/j.ipl.2006.10.007
Needed, ACM SIGACT News, vol.39, issue.1, pp.59-61, 2008. ,
DOI : 10.1145/1360443.1360457
Partial snapshot objects, Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures, SPAA '08, 2008. ,
DOI : 10.1145/1378533.1378591
URL : http://infoscience.epfl.ch/record/120525
) Operations, SIAM Journal on Computing, vol.27, issue.2, pp.319-340, 1998. ,
DOI : 10.1137/S0097539795279463
Maintaining Consistent Transactional States without a Global Clock, Proc. 15th Colloquium on Structural Information and Communication Complexity (SIROCCO'08), To appear, 2008. ,
DOI : 10.1007/978-3-540-69355-0_12
Space/time trade-offs in hash coding with allowable errors, Communications of the ACM, vol.13, issue.7, pp.422-426, 1970. ,
DOI : 10.1145/362686.362692
Versioned boxes as the basis for memory transactions, Science of Computer Programming, vol.63, issue.2, pp.172-175, 2006. ,
DOI : 10.1016/j.scico.2006.05.009
Transactions are coming Back, but Are They The Same?, pp.48-58, 2008. ,
Towards a Theory of Transactional Contention Managers, Proc. 24th ACM Symposium on Principles of Distributed Computing (PODC'05), pp.258-264, 2005. ,
On the correctness of transactional memory, Proceedings of the 13th ACM SIGPLAN Symposium on Principles and practice of parallel programming , PPoPP '08, pp.175-184, 2008. ,
DOI : 10.1145/1345206.1345233
Linearizability: a correctness condition for concurrent objects, ACM Transactions on Programming Languages and Systems, vol.12, issue.3, pp.463-492, 1990. ,
DOI : 10.1145/78969.78972
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.142.5315
Efficient and practical constructions of LL/SC variables, Proceedings of the twenty-second annual symposium on Principles of distributed computing , PODC '03, pp.285-294, 2003. ,
DOI : 10.1145/872035.872078
Compressed Bloom filters, IEEE/ACM Transactions on Networking, vol.10, issue.5, pp.604-612, 2002. ,
DOI : 10.1109/TNET.2002.803864
Practical implementations of non-blocking synchronization primitives, Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing , PODC '97, pp.219-228, 1997. ,
DOI : 10.1145/259380.259442
The Serializability of Concurrent Updates, Journal of the ACM, vol.26, issue.4, pp.631-653, 1979. ,
A Lazy Snapshot Algorithm with Eager Validation, Proc. 20th Int'l Symposium on Distributed Computing (DISC'06), pp.284-298, 2006. ,
DOI : 10.1007/11864219_20
Time-based transactional memory with scalable time bases, Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures , SPAA '07, pp.221-228, 2007. ,
DOI : 10.1145/1248377.1248415
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.141.7880
Sequential Specification of Transactional Memory Semantics, Proc. First ACM SIGPLAN Workshop on Languages, Compilers, and Hardware Support for Trans. Computing (TRANSACT'06), 2006. ,
Software Transactional Memory, Distributed Computing, pp.99-116, 1997. ,
DOI : 10.1007/s004460050028
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.41.4743
Advanced contention management for dynamic software transactional memory, Proceedings of the twenty-fourth annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing , PODC '05, pp.240-248, 2005. ,
DOI : 10.1145/1073814.1073861
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.509.1786