A sample of samplers: A computational perspective on sampling

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6650 LNCS, Issue , 2011, Pages 302-332

  Goldreich, Oded ^a  

^a NONE

Author keywords

Expander graphs; information theoretic lower bounds; pairwise independent random variables; random walks on graphs; randomness complexity; Sampling; saving randomness

Indexed keywords

EXPANDER GRAPHS; LOWER BOUNDS; RANDOM WALK; RANDOMNESS COMPLEXITY; SAVING RANDOMNESS;

ALGORITHMS; INFORMATION THEORY; SAMPLING;

RANDOM PROCESSES;

EID: 84857521681     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-22670-0_24     Document Type: Article

References (30)

1. Ajtai, M., Komlos, J., Szemerédi, E.: Deterministic Simulation in LogSpace. In: Proc. 19th STOC, pp. 132-140 (1987)
2. Alon, N.: Eigenvalues, Geometric Expanders, Sorting in Rounds and Ramsey Theory. Combinatorica 6, 231-243 (1986)
3. Alon, N., Bruck, J., Naor, J., Naor, M., Roth, R.: Construction of Asymptotically Good, Low-Rate Error-Correcting Codes through Pseudo-Random Graphs. IEEE Transactions on Information Theory 38, 509-516 (1992)
4. 1, Isoperimetric Inequalities for Graphs and Superconcentrators. J. Combinatorial Theory, Ser. B 38, 73-88 (1985)
5. Alon, N., Spencer, J.H.: The Probabilistic Method. JohnWiley & Sons, Inc., Chichester (1992)
6. Bar-Yossef, Z., Kumar, R., Sivakumar, D.: Sampling Algorithms: Lower Bounds and Applications. In: 33rd STOC, pp. 266-275 (2001)
7. Bellare, M., Goldreich, O., Goldwasser, S.: Randomness in Interactive Proofs. Computational Complexity 4(4), 319-354 (1993); Extended abstract in 31st FOCS, pp. 318-326 (1990)
8. Bellare, M., Goldreich, O., Goldwasser, S.: Addendum to [7]. (May 1997), http://theory.lcs.mit.edu/oded/papers.html
9. Bellare, M., Rompel, J.: Randomness-efficient oblivious sampling. In: 35th FOCS (1994)
10. Canetti, R., Even, G., Goldreich, O.: Lower Bounds for Sampling Algorithms for Estimating the Average. In: IPL, vol. 53, pp. 17-25 (1995)
11. Carter, L., Wegman, M.: Universal Classes of Hash Functions. J. Computer and System Sciences 18, 143-154 (1979)
12. Chor, B., Goldreich, O.: On the Power of Two-Point Based Sampling. Jour. of Complexity 5, 96-106 (1989)
13. Cohen, A.,Wigderson, A.: Dispensers, Deterministic Amplification, andWeak Random Sources. In: 30th FOCS, pp. 14-19 (1989)
14. Gaber, O., Galil, Z.: Explicit Constructions of Linear Size Superconcentrators. JCSS 22, 407-420 (1981)
15. Goldreich, O., Impagliazzo, R., Levin, L.A., Venkatesan, R., Zuckerman, D.: Security Preserving Amplification of Hardness. In: 31st FOCS, pp. 318-326 (1990)
16. Goldreich, O., Wigderson, A.: Tiny Families of Functions with Random Properties: A Quality-Size Trade-off for Hashing. Journal of Random structures and Algorithms 11(4), 315-343 (1997)
17. Golomb, S.W.: Shift Register Sequences. Aegean Park Press, (1982) (revised edition)
18. Guruswami, V., Umans, C., Vadhan, S.: Unbalanced Expanders and Randomness Extractors from Parvaresh-Vardy Codes. JACM 56(4) (2009); Preliminary version in 22nd CCC 2007
19. Hoory, S., Linial, N., Wigderson, A.: Expander Graphs and their Applications. Bull. AMS 43(4), 439-561 (2006)
20. Impagliazzo, R., Zuckerman, D.: How to Recycle Random Bits. In: 30th FOCS, pp. 248-253 (1989)
21. Kahale, N.: Eigenvalues and Expansion of Regular Graphs. Journal of the ACM 42(5), 1091-1106 (1995)
22. Karp, R.M., Pippinger, N., Sipser, M.: A Time-Randomness Tradeoff. In: AMS Conference on Probabilistic Computational Complexity, Durham, New Hampshire (1985)
23. Lubotzky, A., Phillips, R., Sarnak, P.: Explicit Expanders and the Ramanujan Conjectures. In: Proc. 18th STOC, pp. 240-246 (1986)
24. Margulis, G.A.: Explicit Construction of Concentrators. Prob. Per. Infor. 9(4), 71-80 (1973); In Russian, English translation in Problems of Infor. Trans., 325-332 (1975)
25. Radhakrishnan, J., Ta-Shma, A.: Bounds for Dispersers, Extractors, and Depth-Two Superconcentrators. SIAM J. Discrete Math. 13(1), 2-24 (2000)
26. Reingold, O., Vadhan, S.,Wigderson, A.: EntropyWaves, the Zig-Zag Graph Product, and New Constant-Degree Expanders and Extractors. ECCC, TR01-018, 2001; Preliminary version in 41st FOCS, pp. 3-13 (2000)
27. Sipser, M.: Expanders, Randomness or Time vs Space, Proceedings of the Structure in Complexity Theory (1986)
28. Shaltiel, R.: Recent Developments in Explicit Constructions of Extractors. In: Paun, G., Rozenberg, G., Salomaa, A. (eds.) Current Trends in Theoretical Computer Science: The Challenge of the New Century. Algorithms and Complexity, vol. 1, pp. 67-95. World scietific (2004); Preliminary version in Bulletin of the EATCS 77, pages 67-95, 2002
29. Trevisan, L.: When Hamming meets Euclid: The Approximability of Geometric TSP and MST. In: 29th STOC, pp. 21-29 (1997)
30. Zuckerman, D.: Randomness-Optimal Oblivious Sampling. In: Journal of Random Structures and Algorithms, vol. 11(4), pp. 345-367 (1997); Preliminary version in 28th STOC, pages 286-295, 1996