Author:
Rubinfeld Ronitt,Xie Ning
Publisher
Springer Berlin Heidelberg
Reference41 articles.
1. Alon, N., Andoni, A., Kaufman, T., Matulef, K., Rubinfeld, R., Xie, N.: Testing k-wise and almost k-wise independence. In: Proc. 39th Annual ACM Symposium on the Theory of Computing, pp. 496–505 (2007)
2. Alon, N., Babai, L., Itai, A.: A fast and simple randomized algorithm for the maximal independent set problem. Journal of Algorithms 7, 567–583 (1986)
3. Alon, N., Goldreich, O., Håstad, J., Peralta, R.: Simple constructions of almost k-wise independent random variables. Random Structures and Algorithms 3(3), 289–304 (1992); Earlier version in FOCS 1990
4. Alon, N., Goldreich, O., Mansour, Y.: Almost k-wise independence versus k-wise independence. Information Processing Letters 88, 107–110 (2003)
5. Austrin, P.: Conditional inapproximability and limited independence. PhD thesis, KTH - Royal Institute of Technology (2008), http://www.csc.kth.se/~austrin/papers/thesis.pdf
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献