2924 search results - page 54 / 585 » Lower Bounds in Distributed Computing |
146
click to vote
SODA
2010
ACM
15 years 24 days ago
2010
ACM
We present an exact algorithm that decides, for every fixed r ≥ 2 in time O(m) + 2O(k2 ) whether a given multiset of m clauses of size r admits a truth assignment that satisfi...
125
Voted
FOCS
2003
IEEE
15 years 7 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...
113
click to vote
CORR
2006
Springer
15 years 2 months ago
2006
Springer
We derive new upper and lower bounds on the fading number of multiple-input single-output (MISO) fading channels of general (not necessarily Gaussian) regular law with spatial and ...
117
click to vote
PODS
2003
ACM
16 years 2 months ago
2003
ACM
Computing frequent itemsets and maximally frequent itemsets in a database are classic problems in data mining. The resource requirements of all extant algorithms for both problems...
108
click to vote
PODC
2010
ACM
15 years 6 months ago
2010
ACM
We present an algorithm to solve the GROUP MUTUAL EXCLUSION problem in the cache-coherent (CC) model. For the same problem in the distributed shared memory (DSM) model, Danek and ...