1302 search results - page 131 / 261 » Free-Style Theorem Proving |
184
click to vote
NETWORKS
2011
14 years 7 months ago
2011
A graph is terminal ∆ − Y -reducible if, it can be reduced to a distinguished set of terminal vertices by a sequence of series-parallel reductions and ∆−Y -transformations...
167
click to vote
ASIACRYPT
2011
Springer
14 years 4 months ago
2011
Springer
The assumption of the availability of tamper-proof hardware tokens has been used extensively in the design of cryptographic primitives. For example, Katz (Eurocrypt 2007) suggests ...
161
click to vote
POPL
2012
ACM
14 years 1 days ago
2012
ACM
Formal models serve in many roles in the programming language community. In its primary role, a model communicates the idea of a language design; the architecture of a language to...
147
click to vote
COCO
2004
Springer
15 years 10 months ago
2004
Springer
We prove a very general lower bound technique for quantum and randomized query complexity, that is easy to prove as well as to apply. To achieve this, we introduce the use of Kolm...
130
click to vote
CHARME
2003
Springer
15 years 9 months ago
2003
Springer
Intrusion-tolerance is the technique of using fault-tolerance to achieve security properties. Assuming that faults, both benign and Byzantine, are unavoidable, the main goal of Int...