254 search results - page 1 / 51 » On randomized one-round communication complexity |
CRYPTO
2003
Springer
13 years 10 months ago
2003
Springer
On August 2002, Agrawal, Kayal and Saxena announced the first deterministic and polynomial time primality testing algorithm. For an input n, the AKS algorithm runs in heuristic t...
ACNS
2004
Springer
13 years 10 months ago
2004
Springer
Cryptographic protocol design in a two-party setting has often ignored the possibility of simultaneous message transmission by each of the two parties (i.e., using a duplex channe...
CORR
2010
Springer
13 years 3 months ago
2010
Springer
Abstract—In this paper we ask which properties of a distributed network can be computed from a few amount of local information provided by its nodes. The distributed model we con...
CORR
2010
Springer
13 years 5 days ago
2010
Springer
In STOC 1999, Raz presented a (partial) function for which there is a quantum protocol communicating only O(log n) qubits, but for which any classical (randomized, bounded-error) ...
IM
2008
13 years 5 months ago
2008
Let G = G(n, r) be a random geometric graph resulting from placing n nodes uniformly at random in the unit square (disk) and connecting every two nodes if and only if their Euclide...