|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 4 occurrences of 4 keywords
|
|
|
Results
Found 3 publication records. Showing 3 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
137 | Matthias Majuntke, Dan Dobre, Marco Serafini, Neeraj Suri |
Abortable Fork-Linearizable Storage. ![Search on Bibsonomy](Pics/bibsonomy.png) |
OPODIS ![In: Principles of Distributed Systems, 13th International Conference, OPODIS 2009, Nîmes, France, December 15-18, 2009. Proceedings, pp. 255-269, 2009, Springer, 978-3-642-10876-1. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Fork-linearizability, abortable objects, lock-freedom, shared memory, online collaboration |
81 | Christian Cachin, Abhi Shelat, Alexander Shraer |
Efficient fork-linearizable access to untrusted shared memory. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODC ![In: Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, PODC 2007, Portland, Oregon, USA, August 12-15, 2007, pp. 129-138, 2007, ACM, 978-1-59593-616-5. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
arbitrary failures, fork-consistency, storage emulations |
68 | Christian Cachin, Martin Geisler 0001 |
Integrity Protection for Revision Control. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACNS ![In: Applied Cryptography and Network Security, 7th International Conference, ACNS 2009, Paris-Rocquencourt, France, June 2-5, 2009. Proceedings, pp. 382-399, 2009, 978-3-642-01956-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Hash trees, memory checking, fork linearizability, storage security, applied cryptography |
Displaying result #1 - #3 of 3 (100 per page; Change: )
|
|