| http://sist.sysu.edu.cn/~isslxm/DSA/textbook/Skiena.-.TheAlgorithmDesignManual.pdf | |
| https://github.com/felipecruz/cdats | |
| http://www.amazon.com/Algorithms-Unlocked-Thomas-H-Cormen/dp/0262518805/ref=sr_1_2?ie=UTF8&qid=1372518782&sr=8-2&keywords=cormen | |
| http://www.amazon.com/Introduction-Algorithms-Thomas-H-Cormen/dp/0262033844/ref=sr_1_1?ie=UTF8&qid=1372518782&sr=8-1&keywords=cormen | |
| https://sites.google.com/site/stevenhalim/ | |
| http://uhunt.felix-halim.net/ | |
| https://github.com/echen/streaming-simulations/wiki/Cardinality-Estimation%3A-Bloom-Filter-vs.-HyperLogLog | |
| http://www.slideshare.net/juanplopes/dnarj20120630 | |
| https://github.com/juanplopes/sketches |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
This comment has been minimized.
Como não achei nas references (mas posso não ter olhado direito), segue o link de que o Juan falou, que deu um boost na popularidade do HyperLogLog ("Big Data Counting: How To Count A Billion Distinct Objects Using Only 1.5KB Of Memory"):
http://highscalability.com/blog/2012/4/5/big-data-counting-how-to-count-a-billion-distinct-objects-us.html