Viewing profile — saiajc

Longest common subsequence can be solved in at most quadratic time via dynamic programming.

Kleinberg's HITS algorithm actually came first. PageRank simplified HITS and made it more practical, by performing the ranking mechanism in batch mode for the entire web graph. If …

Thanks - this comment nicely summarizes the math involved here!

How can we defend Blockchains and peer-to-peer systems, when no central authority provides admission control? Resource-burning (proof-of-work, proof-of-state, CAPTCHAs) is one of t…