Sciweavers

9520 search results - page 1529 / 1904
» or 2011
Sort
View
PODC
2011
ACM
14 years 9 months ago
The complexity of robust atomic storage
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...
Dan Dobre, Rachid Guerraoui, Matthias Majuntke, Ne...
PODC
2011
ACM
14 years 9 months ago
Securing social networks
We present a cryptographic framework to achieve access control, privacy of social relations, secrecy of resources, and anonymity of users in social networks. The main idea is to u...
Michael Backes, Matteo Maffei, Kim Pecina
PODC
2011
ACM
14 years 9 months ago
MIS on trees
A maximal independent set on a graph is an inclusion-maximal set of mutually non-adjacent nodes. This basic symmetry breaking structure is vital for many distributed algorithms, w...
Christoph Lenzen, Roger Wattenhofer
PODC
2011
ACM
14 years 9 months ago
Scalability versus semantics of concurrent FIFO queues
Maintaining data structure semantics of concurrent queues such as first-in first-out (FIFO) ordering requires expensive synchronization mechanisms which limit scalability. Howev...
Hannes Payer, Harald Röck, Christoph M. Kirsc...
PODS
2011
ACM
229views Database» more  PODS 2011»
14 years 9 months ago
On the complexity of privacy-preserving complex event processing
Complex Event Processing (CEP) Systems are stream processing systems that monitor incoming event streams in search of userspecified event patterns. While CEP systems have been ad...
Yeye He, Siddharth Barman, Di Wang, Jeffrey F. Nau...
« Prev « First page 1529 / 1904 Last » Next »