Algorithms for Big Data
Table of Contents
Algorithms for Big Data
Algorithms for Big Data
logistics-course-topics-basic-tail-bounds-markov-chebyshev-chernoff-bernstein-morris-algorithm
distinct-elements-k-wise-independence-geometric-subsampling-of-streams
necessity-of-randomizedapproximate-guarantees-linear-sketching-ams-sketch-p-stable-sketch-0p2
p-stable-sketch-analysis-nisans-prg-high-ℓp-norms-p2-via-max-stability
analysis-of-ℓp-estimation-algorithm-via-max-stability-deterministic-point-query-via-incoherent-matrices
countmin-sketch-point-query-heavy-hitters-sparse-approximation
countsketch-ℓ0-sampling-graph-sketching
amnesic-dynamic-programming-approximate-distance-to-monotonicity
communication-complexity-indexing-gap-hamming–application-to-median-and-f0-lower-bounds
randomized-and-approximate-f0-lower-bounds-disjointness-fp-lower-bound-dimensionality-reduction-jl-lemma
khintchine-decoupling-hanson-wright-proof-of-distributional-jl-lemma
alons-jl-lower-bound-beyond-worst-case-analysis-suprema-of-gaussian-processes-gordons-theorem
ors-theorem-distributional-jl-implies-gordons-theorem-sparse-jl
sparse-jl-proof-wrap-up-fast-jl-transform-approximate-nearest-neighbor
approximate-matrix-multiplication-with-frobenius-error-via-sampling–jl-matrix-median-trick-subspace-embeddings
linear-least-squares-via-subspace-embeddings-leverage-score-sampling-non-commutative-khintchine-oblivious-subspace-embeddings
oblivious-subspace-embeddings-faster-iterative-regression-sketch-and-solve-regression
low-rank-approximation-column-based-matrix-reconstruction-k-means-compressed-sensing
rip-and-connection-to-incoherence-basis-pursuit-krahmer-ward-theorem
krahmer-ward-proof-iterative-hard-thresholding
l1–l1-recovery-rip1-unbalanced-expanders-sequential-sparse-matching-pursuit
matrix-completion
external-memory-model-linked-list-matrix-multiplication-b-tree-buffered-repository-tree-sorting
competitive-paging-cache-oblivious-algorithms-matrix-multiplication-self-organizing-linked-list-static-b-tree-lazy-funnelsort
mapreduce-terasort-minimum-spanning-tree-triangle-counting