Sciweavers

1552 search results - page 8 / 311
» On the Complexity of Constant Propagation
Sort
View
CRYPTO
2005
Springer
135views Cryptology» more  CRYPTO 2005»
15 years 3 months ago
Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator
We present a constant-round protocol for general secure multiparty computation which makes a black-box use of a pseudorandom generator. In particular, the protocol does not requir...
Ivan Damgård, Yuval Ishai
TCSV
2002
107views more  TCSV 2002»
14 years 9 months ago
Subband-adaptive turbo-coded OFDM-based interactive video telephony
A range of adaptive orthogonal frequency division multiplex (AOFDM) video systems are proposed for interactive communications over wireless channels. The proposed constant target b...
Peter J. Cherriman, Thomas Keller 0002, Lajos Hanz...
78
Voted
TOOLS
2010
IEEE
15 years 2 months ago
Read-Only Execution for Dynamic Languages
Supporting read-only and side effect free execution has been the focus of a large body of work in the area of statically typed programming languages. Read-onlyness in dynamically t...
Jean-Baptiste Arnaud, Marcus Denker, Stépha...
PODC
2010
ACM
15 years 1 months ago
Constant RMR solutions to reader writer synchronization
We study Reader-Writer Exclusion [1], a well-known variant of the Mutual Exclusion problem [2] where processes are divided into two classes–readers and writers–and multiple re...
Vibhor Bhatt, Prasad Jayanti
JUCS
2002
110views more  JUCS 2002»
14 years 9 months ago
Generation of Constants and Synchronization of Finite Automata
: The problem about the synchronization of a finite deterministic automaton is not yet properly understood. The present paper investigates this and related problems within the gene...
Arto Salomaa