308 search results - page 10 / 62 » Tight Lower Bounds for the Distinct Elements Problem |
132
click to vote
ESA
1999
Springer
15 years 8 months ago
1999
Springer
We revisit classical geometric search problems under the assumption of rational coordinates. Our main result is a tight bound for point separation, ie, to determine whether n given...
141
click to vote
STOC
2004
ACM
16 years 4 months ago
2004
ACM
We prove an (lg n) cell-probe lower bound on maintaining connectivity in dynamic graphs, as well as a more general trade-off between updates and queries. Our bound holds even if t...
143
click to vote
FOCS
2003
IEEE
15 years 9 months ago
2003
IEEE
The degree of a polynomial representing (or approximating) a function f is a lower bound for the quantum query complexity of f. This observation has been a source of many lower bo...
114
click to vote
TALG
2010
15 years 2 months ago
2010
We establish the first nontrivial lower bounds on timespace tradeoffs for the selection problem. We prove that any comparison-based randomized algorithm for finding the median ...
148
click to vote
FOCS
2007
IEEE
15 years 10 months ago
2007
IEEE
We show that any deterministic data-stream algorithm that makes a constant number of passes over the input and gives a constant factor approximation of the length of the longest i...