4 search results - page 1 / 1 » A tight bound on the worst-case number of comparisons for Fl... |
CORR
2010
Springer
13 years 1 months ago
2010
Springer
Abstract. In this paper a tight bound on the worst-case number of comparisons for Floyd's well known heap construction algorithm, is derived. It is shown that at most 2n - 2
CASC
2007
Springer
13 years 10 months ago
2007
Springer
A common way of implementing multivariate polynomial multiplication and division is to represent polynomials as linked lists of terms sorted in a term ordering and to use repeated ...
STOC
1996
ACM
13 years 8 months ago
1996
ACM
A linear array network consists of k + 1 processors P0; P1; : : : ; Pk with links only between Pi and Pi+1 0 i k. It is required to compute some boolean function f x; y in this n...
INFOCOM
2008
IEEE
13 years 11 months ago
2008
IEEE
—Recently proposed beaconless georouting algorithms are fully reactive, with nodes forwarding packets without prior knowledge of their neighbors. However, existing approaches for...