On the Complexity of Approximate Sum of Sorted List

Bin Fu. On the Complexity of Approximate Sum of Sorted List. In Michael R. Fellows, Xuehou Tan, Binhai Zhu, editors, and Algorithmic Aspects in Information and Management, Third Joint International Conference, FAW-AAIM 2013, Dalian, China, June 26-28, 2013. Proceedings. Volume 7924 of Lecture Notes in Computer Science, pages 284-293, Springer, 2013. [doi]

Authors

Bin Fu

This author has not been identified. Look up 'Bin Fu' in Google