74 search results - page 12 / 15 » Property Testing Lower Bounds via Communication Complexity |
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Abstract. We present the discrete beeping communication model, which assumes nodes have minimal knowledge about their environment and severely limited communication capabilities. S...
SIGECOM
2010
ACM
14 years 8 days ago
2010
ACM
It is widely believed that computing payments needed to induce truthful bidding is somehow harder than simply computing the allocation. We show that the opposite is true for singl...
MST
2002
13 years 7 months ago
2002
Abstract. Blockwise access to data is a central theme in the design of efficient external memory (EM) algorithms. A second important issue, when more than one disk is present, is f...
ICALP
2009
Springer
14 years 7 months ago
2009
Springer
We present an AC1 (logDCFL) algorithm for checking LTL formulas over finite paths, thus establishing that the problem can be efficiently parallelized. Our construction provides a f...
GLOBECOM
2010
IEEE
13 years 5 months ago
2010
IEEE
1 Shannon's channel capacity specifies the upper bound on the amount of bits per channel use. In this paper, we explicitly demonstrate that twin-component turbo codes suffer f...