11 citations · 26 across the 18 of their papers we have counts for
Showing 2012 · cs.DSShow all
2 papers · 2 filters
cs.DS2012
Sublinear Time Approximate Sum via Uniform Random Sampling
Bin Fu, Wenfeng Li, Zhiyong Peng
We investigate the approximation for computing the sum with an input of a list of nonnegative elements . If all elements are in the range , there…
cs.DS2012
On the Complexity of Approximate Sum of Sorted List
Bin Fu
We consider the complexity for computing the approximate sum of a sorted list of numbers . We show an algorithm that computes an …