194 search results - page 1 / 39 » Computing Roundness is Easy if the Set is Almost Round |
COMPGEOM
1999
ACM
13 years 8 months ago
1999
ACM
FOCS
2008
IEEE
13 years 10 months ago
2008
IEEE
What is the least surface area of a shape that tiles Rd under translations by Zd ? Any such shape must have volume 1 and hence surface area at least that of the volume-1 ball, nam...
STOC
2009
ACM
14 years 5 months ago
2009
ACM
We consider and analyze a new algorithm for balancing indivisible loads on a distributed network with n processors. The aim is minimizing the discrepancy between the maximum and m...
ASIACRYPT
2005
Springer
13 years 10 months ago
2005
Springer
We propose Gate Evaluation Secret Sharing (GESS) – a new kind of secret sharing, designed for use in secure function evaluation (SFE) with minimal interaction. The resulting simp...
EUROCRYPT
2007
Springer
13 years 8 months ago
2007
Springer
Essentially all work studying the round complexity of secure computation assumes broadcast as an atomic primitive. Protocols constructed under this assumption tend to have very poo...