199 search results - page 1 / 40 » Randomised Individual Communication Complexity |
COCO
2008
Springer
13 years 8 months ago
2008
Springer
FOCS
2004
IEEE
13 years 10 months ago
2004
IEEE
We consider the approximate nearest neighbour search problem on the Hamming cube {0, 1}d. We show that a randomised cell probe algorithm that uses polynomial storage and word size...
JCSS
2007
13 years 6 months ago
2007
ICALP
2003
Springer
13 years 11 months ago
2003
Springer
We prove lower bounds for the direct sum problem for two-party bounded error randomised multipleround communication protocols. Our proofs use the notion of information cost of a p...
GROUP
2005
ACM
13 years 12 months ago
2005
ACM
Although pair programming is becoming more prevalent in software development, and a number of reports have been written about it [4] [6], few have addressed the manner in which pa...