暂无分享,去创建一个
Thomas Erlebach | Nicole Megow | Christoph Dürr | Julie Meißner | T. Erlebach | C. Dürr | Nicole Megow | Julie Meißner
[1] Jennifer Widom,et al. Offering a Precision-Performance Tradeoff for Aggregation Queries over Replicated Data , 2000, VLDB.
[2] Jennifer Widom,et al. Computing the median with uncertainty , 2000, STOC '00.
[3] Thomas Erlebach,et al. Computing Minimum Spanning Trees with Uncertainty , 2008, STACS.
[4] Martin Skutella,et al. Randomization Helps Computing a Minimum Spanning Tree under Uncertainty , 2017, SIAM J. Comput..
[5] Anita Schöbel,et al. The robust knapsack problem with queries , 2015, Comput. Oper. Res..
[6] Yaron Shaposhnik,et al. Exploration vs. exploitation : reducing uncertainty in operational problems , 2016 .
[7] Andrew Chi-Chih Yao,et al. Probabilistic computations: Toward a unified measure of complexity , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).
[8] Allan Borodin,et al. Online computation and competitive analysis , 1998 .
[9] Sanjeev Khanna,et al. On computing functions with uncertainty , 2001, PODS '01.
[10] Rajeev Motwani,et al. Computing shortest paths with uncertainty , 2003, J. Algorithms.
[11] Simon Kahan,et al. A model for data in motion , 1991, STOC '91.
[12] Yogish Sabharwal,et al. The Update Complexity of Selection and Related Problems , 2015, Theory of Computing Systems.