15 search results - page 3 / 3 » The Unbounded-Error Communication Complexity of Symmetric Fu... |
22
Voted
FOCS
2007
IEEE
13 years 10 months ago
2007
IEEE
We develop a new technique of proving lower bounds for the randomized communication complexity of boolean functions in the multiparty `Number on the Forehead' model. Our meth...
ISCC
2003
IEEE
13 years 12 months ago
2003
IEEE
Sensor networks have recently gained popularity for a wide spectrum of applications. When performing monitoring tasks in hostile environments, security requirements become critical...
IPPS
2000
IEEE
13 years 11 months ago
2000
IEEE
In this paper, we consider the problem of nding llpreserving ordering of a sparse symmetric and positive de nite matrix such that the reordered matrix is suitable for parallel fac...
CCR
2000
13 years 6 months ago
2000
We propose a zero-knowledge interactive proof based identification and signature scheme. The protocol is based on Euler's totient function and discrete logarithms over the ri...
STACS
1999
Springer
13 years 11 months ago
1999
Springer
Abstract. We consider dynamic evaluation of algebraic functions (matrix multiplication, determinant, convolution, Fourier transform, etc.) in the model of Reif and Tate; i.e., if f...