3 search results - page 1 / 1 » On the Time-Complexity of Robust and Amnesic Storage |
OPODIS
2008
13 years 6 months ago
2008
We consider wait-free implementations of a regular read/ write register for unauthenticated data using a collection of 3t + k base objects, t of which can be subject to Byzantine ...
PODC
2011
ACM
12 years 7 months ago
2011
ACM
We study the time-complexity of robust atomic read/write storage from fault-prone storage components in asynchronous message-passing systems. Robustness here means wait-free tolera...
WWW
2008
ACM
14 years 5 months ago
2008
ACM
We discover communities from social network data, and analyze the community evolution. These communities are inherent characteristics of human interaction in online social network...