Takashi's Notes

Home

❯

courses

❯

algorithms for big data

❯

amnesic dynamic programming (approximate distance to monotonicity)

amnesic dynamic programming (approximate distance to monotonicity)

May 02, 20261 min read

amnesic dynamic programming (approximate distance to monotonicity)

Prev: 07-countsketch-ℓ0-sampling-graph-sketching Next: 09-communication-complexity-indexing-gap-hamming—application-to-median-and-f0-lower-bounds


Graph View

Backlinks

  • CountSketch, ℓ0 sampling, graph sketching
  • communication complexity (indexing, gap hamming) + application to median and F0 lower bounds

Created with Quartz v4.5.2 © 2026

  • GitHub
  • Discord Community