2143 search results - page 133 / 429 » corr 2010 |
CORR
2010
Springer
14 years 9 months ago
2010
Springer
Suppose Alice and Bob receive strings of unbiased independent but noisy bits from some random source. They wish to use their respective strings to extract a common sequence of ran...
110
click to vote
CORR
2010
Springer
14 years 7 months ago
2010
Springer
What does a typical road network look like? Existing generative models tend to focus on one aspect to the exclusion of others. We introduce the general-purpose quadtree model and ...
118
Voted
CORR
2010
Springer
14 years 7 months ago
2010
Springer
We show a direct product result for two-way public coin communication complexity of all relations in terms of a new complexity measure that we define. Our new measure is a general...
106
Voted
CORR
2010
Springer
14 years 7 months ago
2010
Springer
For p 1, we prove that every forest with p trees whose sizes are a1, . . . , ap can be embedded in any graph containing at least p i=1(ai + 1) vertices and having minimum degree ...
106
Voted
CORR
2010
Springer
14 years 7 months ago
2010
Springer
We investigate enumerability properties for classes of random reals which permit recursive approximations from below, or left-r.e. reals. In addition to pinpointing the complexity...