1040 search results - page 55 / 208 » A New Periodicity Lemma |
FOCS
2007
IEEE
14 years 1 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...
JSYML
1998
13 years 9 months ago
1998
Abstract. After small forcing, any <κ-closed forcing will destroy the supercompactness and even the strong compactness of κ. In a delightful argument, Laver [L78] proved that ...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
Random linear network codes can be designed and implemented in a distributed manner, with low computational complexity. However, these codes are classically implemented [1] over fi...
JCT
2011
13 years 4 months ago
2011
The Baxter number Bn can be written as Bn = n k=0 Θk,n−k−1 with Θk,ℓ = 2 (k + 1)2 (k + 2) k + ℓ k k + ℓ + 1 k k + ℓ + 2 k . These numbers have first appeared in the...
TMC
2012
12 years 2 days ago
2012
—We present the boomerang protocol to efficiently retain information at a particular geographic location in a sparse network of highly mobile nodes without using infrastructure ...