Takashi's Notes

Home

❯

courses

❯

algorithms for big data

❯

distinct elements, k wise independence, geometric subsampling of streams

distinct elements, k-wise independence, geometric subsampling of streams

May 22, 20231 min read

distinct elements, k-wise independence, geometric subsampling of streams

Prev: logistics-course-topics-basic-tail-bounds-markov-chebyshev-chernoff-bernstein-morris-algorithm Next: necessity-of-randomizedapproximate-guarantees-linear-sketching-ams-sketch-p-stable-sketch-0p2

Prev: logistics-course-topics-basic-tail-bounds-markov-chebyshev-chernoff-bernstein-morris-algorithm Next: necessity-of-randomizedapproximate-guarantees-linear-sketching-ams-sketch-p-stable-sketch-0p2


Graph View

Backlinks

  • logistics, course topics, basic tail bounds (Markov, Chebyshev, Chernoff, Bernstein), Morris' algorithm
  • necessity of randomized/approximate guarantees, linear sketching, AMS sketch, p-stable sketch 0<p<2

Created with Quartz v4.5.1 © 2025

  • Homepage
  • GitHub
  • RSS
  • Sitemap