Sublinear algorithms for testing monotone and unimodal distributions
暂无分享,去创建一个
[1] Dana Ron,et al. Testing Monotonicity , 2000, Comb..
[2] Narendra Karmarkar,et al. A new polynomial-time algorithm for linear programming , 1984, Comb..
[3] Dana Ron,et al. Improved Testing Algorithms for Monotonicity , 1999, Electron. Colloquium Comput. Complex..
[4] Ronitt Rubinfeld,et al. Testing that distributions are close , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.
[5] Ronitt Rubinfeld,et al. Fast Approximate PCPs for Multidimensional Bin-Packing Problems , 1999, RANDOM-APPROX.
[6] Ronitt Rubinfeld,et al. The complexity of approximating the entropy , 2002, Proceedings 17th IEEE Annual Conference on Computational Complexity.
[7] Ronitt Rubinfeld,et al. Spot-checkers , 1998, STOC '98.
[8] Ronitt Rubinfeld,et al. Monotonicity testing over general poset domains , 2002, STOC '02.
[9] Ronitt Rubinfeld,et al. The complexity of approximating entropy , 2002, STOC '02.
[10] Luc Devroye,et al. Algorithms for Generating Discrete Random Variables with a Given Generating Function or a Given Moment Sequence , 1991, SIAM J. Sci. Comput..
[11] Ronitt Rubinfeld,et al. Spot-Checkers , 2000, J. Comput. Syst. Sci..
[12] Ronitt Rubinfeld,et al. Testing random variables for independence and identity , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.