Sciweavers

119 search results - page 10 / 24
» stoc 2010
Sort
View
ENTCS
2006
100views more  ENTCS 2006»
14 years 10 months ago
Towards a Logic for Performance and Mobility
Klaim is an experimental language designed for modeling and programming distributed systems composed of mobile components where distribution awareness and dynamic system architect...
Rocco De Nicola, Joost-Pieter Katoen, Diego Latell...
FOCS
2010
IEEE
14 years 8 months ago
Distance Oracles beyond the Thorup-Zwick Bound
We give the first improvement to the space/approximation trade-off of distance oracles since the seminal result of Thorup and Zwick [STOC'01]. For unweighted graphs, our dista...
Mihai Patrascu, Liam Roditty
STOC
2010
ACM
227views Algorithms» more  STOC 2010»
15 years 2 months ago
On the Round Complexity of Covert Computation
In STOC’05, von Ahn, Hopper and Langford introduced the notion of covert computation. In covert computation, a party runs a secure computation protocol over a covert (or stegano...
Vipul Goyal and Abhishek Jain
CORR
2010
Springer
117views Education» more  CORR 2010»
14 years 10 months ago
Reductions Between Expansion Problems
The Small-Set Expansion Hypothesis (Raghavendra, Steurer, STOC 2010) is a natural hardness assumption concerning the problem of approximating the edge expansion of small sets in g...
Prasad Raghavendra, David Steurer, Madhur Tulsiani
PODC
2010
ACM
15 years 1 months ago
Hybrid-secure MPC: trading information-theoretic robustness for computational privacy
Most protocols for distributed, fault-tolerant computation, or multi-party computation (MPC), provide security guarantees in an all-or-nothing fashion: If the number of corrupted p...
Christoph Lucas, Dominik Raub, Ueli M. Maurer