Sciweavers

Share
ICS
2010
Tsinghua U.
9 years 6 months ago
On the Power of a Unique Quantum Witness
Rahul Jain, Iordanis Kerenidis, Greg Kuperberg, Mi...
ICS
2010
Tsinghua U.
9 years 6 months ago
Cache Replacement Policies for Multicore Processors
Almost all of the modern computers use multiple cores, and the number of cores is expected to increase as hardware prices go down, and Moore's law fails to hold. Most of the ...
Avinatan Hassidim
ICS
2010
Tsinghua U.
9 years 6 months ago
Non-Malleable Codes
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...
Stefan Dziembowski, Krzysztof Pietrzak, Daniel Wic...
ICS
2010
Tsinghua U.
9 years 6 months ago
Interactive Proofs For Quantum Computations
Dorit Aharonov, Michael Ben-Or, Elad Eban
ICS
2010
Tsinghua U.
9 years 6 months ago
Effectively Polynomial Simulations
Toniann Pitassi, Rahul Santhanam
ICS
2010
Tsinghua U.
9 years 6 months ago
Proof-Carrying Data and Hearsay Arguments from Signature Cards
: Design of secure systems can often be expressed as ensuring that some property is maintained at every step of a distributed computation among mutually-untrusting parties. Special...
Alessandro Chiesa, Eran Tromer
ICS
2010
Tsinghua U.
9 years 6 months ago
Are Stable Instances Easy?
We introduce the notion of a stable instance for a discrete optimization problem, and argue that in many practical situations only sufficiently stable instances are of interest. T...
Yonatan Bilu, Nathan Linial
books