Sciweavers

Share
4 search results - page 1 / 1
» A tight bound on the worst-case number of comparisons for Fl...
Sort
View
CORR
2010
Springer
96views Education» more  CORR 2010»
11 years 9 months ago
A tight bound on the worst-case number of comparisons for Floyd's heap construction algorithm
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
Ioannis K. Paparrizos
CASC
2007
Springer
112views Mathematics» more  CASC 2007»
12 years 6 months ago
Polynomial Division Using Dynamic Arrays, Heaps, and Packed Exponent Vectors
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 ...
Michael B. Monagan, Roman Pearce
STOC
1996
ACM
100views Algorithms» more  STOC 1996»
12 years 4 months ago
The Linear-Array Conjecture in Communication Complexity is False
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...
Eyal Kushilevitz, Nathan Linial, Rafail Ostrovsky
INFOCOM
2008
IEEE
12 years 6 months ago
Select-and-Protest-Based Beaconless Georouting with Guaranteed Delivery in Wireless Sensor Networks
—Recently proposed beaconless georouting algorithms are fully reactive, with nodes forwarding packets without prior knowledge of their neighbors. However, existing approaches for...
Hanna Kalosha, Amiya Nayak, Stefan Rührup, Iv...
books