58 search results - page 8 / 12 » How to Round Any CSP |
FOCS
2003
IEEE
14 years 3 months ago
2003
IEEE
A directed multigraph is said to be d-regular if the indegree and outdegree of every vertex is exactly d. By Hall’s theorem one can represent such a multigraph as a combination ...
IPL
2006
13 years 9 months ago
2006
We study the problem of Perfectly Reliable Message Transmission (PRMT) and Perfectly Secure Message Transmission (PSMT) between two nodes S and R in an undirected synchronous netw...
JUCS
2006
13 years 9 months ago
2006
Abstract: As enterprises worldwide race to improve real-time management to improve productivity, customer services and flexibility, huge resources have been invested into enterpris...
DC
1999
13 years 9 months ago
1999
or fault-tolerant asynchronous systems. It abstracts a family of problems known as Agreement (or Coordination) problems. Any solution to consensus can serve as a basic building blo...
IACR
2011
12 years 9 months ago
2011
Fully homomorphic encryption (FHE) provides a simple template for secure computation between two parties (Alice and Bob) where: (I) Alice encrypts her input under her key, (II) Bo...