308 search results - page 26 / 62 » Tight Lower Bounds for the Distinct Elements Problem |
FOCS
2005
IEEE
15 years 3 months ago
2005
IEEE
We consider the problem of storing a large file on a remote and unreliable server. To verify that the file has not been corrupted, a user could store a small private (randomized...
COMPGEOM
2010
ACM
15 years 2 months ago
2010
ACM
We present new bounds on the first selection lemma in R3 . This makes progress on the open problems of Bukh, Matoušek and Nivash [6] and Boros-Füredi [4] for the three-dimensio...
65
Voted
ATAL
2007
Springer
15 years 3 months ago
2007
Springer
This paper contributes to solve effectively stochastic resource allocation problems known to be NP-Complete. To address this complex resource management problem, a Qdecomposition...
73
Voted
TIT
2011
14 years 4 months ago
2011
— This paper presents new lower and upper bounds for the compression rate of binary prefix codes optimized over memoryless sources according to various nonlinear codeword length...
100
Voted
FSTTCS
2009
Springer
15 years 4 months ago
2009
Springer
We study the branching program complexity of the tree evaluation problem, introduced in [BCM+09a] as a candidate for separating NL from LogCFL. The input to the problem is a roote...