saiajc

5 ms·

1. 1.▲
   by saiajc 2y ago

   Longest common subsequence can be solved in at most quadratic time via dynamic programming.
2. 2.▲
   Bankrupting DoS Attackers Despite Uncertainty(arxiv.org)

   3 points by saiajc 4y ago|0 comments
3. 3.▲
   by saiajc 4y ago

   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 you read the original HITS paper, you'll see tha
4. 4.▲
   by saiajc 6y ago

   Thanks - this comment nicely summarizes the math involved here!
5. 5.▲
   Resource Burning for Permissionless Systems(youtu.be)

   1 points by saiajc 6y ago|1 comments
6. 6.▲
   by saiajc 6y ago

   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 the most used tools to defend such systems, but it is curren
7. 7.▲
   Resource Burning for Permissionless Systems(arxiv.org)

   2 points by saiajc 6y ago|0 comments