Sciweavers

121 search results - page 7 / 25
» random 1997
Sort
View
STACS
1997
Springer
13 years 11 months ago
Probabilistic Proof Systems - A Survey
Various types of probabilistic proof systems have played a central role in the development of computer science in the last decade. In this exposition, we concentrate on three such...
Oded Goldreich
ASYNC
1997
IEEE
66views Hardware» more  ASYNC 1997»
13 years 12 months ago
Speculative Completion for the Design of High-Performance Asynchronous Dynamic Adders
This paper presents an in-depth case study in highperformance asynchronous adder design. A recent method, called “speculative completion”, is used. This method uses single-rai...
Steven M. Nowick, Kenneth Y. Yun, Ayoob E. Dooply,...
CRYPTO
1997
Springer
169views Cryptology» more  CRYPTO 1997»
13 years 11 months ago
Deniable Encryption
Consider a situation in which the transmission of encrypted messages is intercepted by an adversary who can later ask the sender to reveal the random choices and also the secret ...
Ran Canetti, Cynthia Dwork, Moni Naor, Rafail Ostr...
ICCD
1997
IEEE
94views Hardware» more  ICCD 1997»
13 years 12 months ago
Pseudo-Random Pattern Testing of Bridging Faults
: This paper studies pseudo-random pattern testing of bridging faults. Although bridging faults are generally more random pattern testable than stuck-at faults, examples are shown ...
Nur A. Touba, Edward J. McCluskey
STOC
1997
ACM
91views Algorithms» more  STOC 1997»
13 years 12 months ago
Lower Bounds for Distributed Coin-Flipping and Randomized Consensus
We examine a class of collective coin- ipping games that arises from randomized distributed algorithms with halting failures. In these games, a sequence of local coin ips is gener...
James Aspnes