Sciweavers

224 search results - page 10 / 45
» A parallel repetition theorem
Sort
View
APPROX
2010
Springer
138views Algorithms» more  APPROX 2010»
13 years 9 months ago
Improved Rounding for Parallel Repeated Unique Games
We show a tight relation between the behavior of unique games under parallel repetition and their semidefinite value. Let G be a unique game with alphabet size k. Suppose the semid...
David Steurer
TCC
2010
Springer
188views Cryptology» more  TCC 2010»
14 years 4 months ago
Almost Optimal Bounds for Direct Product Threshold Theorem
Abstract. We consider weakly-verifiable puzzles which are challengeresponse puzzles such that the responder may not be able to verify for itself whether it answered the challenge ...
Charanjit S. Jutla
ACSAC
2000
IEEE
14 years 2 days ago
The Chinese Remainder Theorem and its Application in a High-Speed RSA Crypto Chip
The performance of RSA hardware is primarily determined by an efficient implementation of the long integer modular arithmetic and the ability to utilize the Chinese Remainder The...
Johann Großschädl
PDP
2005
IEEE
14 years 1 months ago
Distributed Data Collection through Remote Probing in Windows Environments
Distributed Data Collector (DDC) is a framework to ease and automate repetitive executions of console applications (probes) over a set of LAN networked Windows personal computers....
Patrício Domingues, Paulo Marques, Lu&iacut...
ARTS
1999
Springer
13 years 12 months ago
Proof Assistance for Real-Time Systems Using an Interactive Theorem Prover
This paper discusses the adaptation of the PVS theorem prover for performing analysis of real-time systems written in the ASTRAL formal specification language. A number of issues w...
Paul Z. Kolano