1. Kahan, S.: A model for data in motion. In: 23rd Annual ACM Symposium on Theory of Computing (STOC 1991), pp. 267–277 (1991)
2. Olston, C., Widom, J.: Offering a precision-performance tradeoff for aggregation queries over replicated data. In: 26th International Conference on Very Large Data Bases (VLDB 2000), pp. 144–155 (2000)
3. Bruce, R., Hoffmann, M., Krizanc, D., Raman, R.: Efficient update strategies for geometric computing with uncertainty. Theor. Comput. Syst. 38, 411–423 (2005)
4. Erlebach, T., Hoffmann, M., Krizanc, D., Mihalák, M., Raman, R.: Computing minimum spanning trees with uncertainty. In: 25th International Symposium on Theoretical Aspects of Computer Science (STACS 2008). LIPIcs, vol. 1, pp. 277–288 (2008)
5. Lecture Notes in Computer Science;N Megow,2015