Sciweavers

430 search results - page 37 / 86
» Efficient Proving for Practical Distributed Access-Control S...
Sort
View
CONEXT
2008
ACM
15 years 1 months ago
Peer-assisted content distribution with prices
Peer-assisted content distribution matches user demand for content with available supply at other peers in the network. Inspired by this supply-and-demand interpretation of the na...
Christina Aperjis, Michael J. Freedman, Ramesh Joh...
CONCUR
2006
Springer
15 years 3 months ago
A Livelock Freedom Analysis for Infinite State Asynchronous Reactive Systems
We describe an incomplete but sound and efficient livelock freedom test for infinite state asynchronous reactive systems. The method s a system into a set of simple control flow cy...
Stefan Leue, Alin Stefanescu, Wei Wei
STOC
2003
ACM
95views Algorithms» more  STOC 2003»
16 years 2 days ago
Random knapsack in expected polynomial time
In this paper, we present the first average-case analysis proving an expected polynomial running time for an exact algorithm for the 0/1 knapsack problem. In particular, we prove,...
René Beier, Berthold Vöcking
PODC
2005
ACM
15 years 5 months ago
Building scalable and robust peer-to-peer overlay networks for broadcasting using network coding
We propose a scheme for building peer-to-peer overlay networks for broadcasting using network coding. The scheme addresses many practical issues such as scalability, robustness, c...
Kamal Jain, László Lovász, Ph...
CCS
2010
ACM
15 years 6 months ago
Attribute-based signature and its applications
In an attribute-based signature (ABS), users sign messages with any predicate of their attributes issued from an attribute authority. Under this notion, a signature attests not to...
Jin Li, Man Ho Au, Willy Susilo, Dongqing Xie, Kui...