309 search results - page 34 / 62 » Communication Complexity Lower Bounds by Polynomials |
FSTTCS
2004
Springer
14 years 1 months ago
2004
Springer
We consider the problem of determining whether a given set S in Rn is approximately convex, i.e., if there is a convex set K ∈ Rn such that the volume of their symmetric differe...
MST
2011
13 years 2 months ago
2011
Hierarchical graph definitions allow a modular description of graphs using modules for the specification of repeated substructures. Beside this modularity, hierarchical graph de...
ISAAC
2004
Springer
14 years 1 months ago
2004
Springer
We propose a model of computation where a Turing machine is given random access to an advice string. With random access, an advice string of exponential length becomes meaningful ...
ESORICS
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. Many theoretical PIR (Private Information Retrieval) constructions have been proposed in the past years. Though information theoretically secure, most of them are impract...
PODC
2009
ACM
14 years 8 months ago
2009
ACM
We define and study the bandwidth determination problem in adhoc P2P environments. Using point-to-point bandwidth probes, the goal is to quickly determine each host's upload ...