19 search results - page 4 / 4 » A Parallel Repetition Theorem for Any Interactive Argument |
HPDC
1997
IEEE
13 years 10 months ago
1997
IEEE
This paper describes PARDIS, a system containing explicit support for interoperability of PARallel DIStributed applications. PARDIS is based on the Common Object Request Broker Ar...
CONCUR
2012
Springer
11 years 8 months ago
2012
Springer
Abstract. Linearizability is a commonly accepted notion of correctness for libraries of concurrent algorithms. Unfortunately, it assumes a complete isolation between a library and ...
STOC
1997
ACM
13 years 10 months ago
1997
ACM
Shor has showed how to perform fault tolerant quantum computation when the probability for an error in a qubit or a gate, η, decays with the size of the computation polylogarithmi...
ICS
2010
Tsinghua U.
14 years 3 months ago
2010
Tsinghua U.
We introduce the notion of "non-malleable codes" which relaxes the notion of error-correction and errordetection. Informally, a code is non-malleable if the message cont...