3318 search results - page 60 / 664 » The Weak Instance Model |
138
Voted
CORR
2010
Springer
15 years 1 months ago
2010
Springer
A strong direct product theorem (SDPT) states that solving n instances of a problem requires ˝.n/ times the resources for a single instance, even to achieve success probability 2 ...
109
Voted
ICWE
2010
Springer
15 years 1 months ago
2010
Springer
In this paper, we present a DSL to specify business and web transactions in a systematic way, addressing both informational and behavioral perspectives. Our meta-model is based on ...
121
Voted
STOC
2002
ACM
16 years 3 months ago
2002
ACM
A randomized algorithm is given that solves the wait-free consensus problem for a shared-memory model with infinitely many processes. The algorithm is based on a weak shared coin ...
139
Voted
ISAAC
2007
Springer
15 years 9 months ago
2007
Springer
Valiant introduced some 25 years ago an algebraic model of computation along with the complexity classes VP and VNP, which can be viewed as analogues of the classical classes P and...
124
Voted
PKC
2009
Springer
16 years 3 months ago
2009
Springer
At Crypto'07, Goyal introduced the concept of Accountable Authority Identity-Based Encryption as a convenient tool to reduce the amount of trust in authorities in Identity-Bas...