Changes

Jump to: navigation, search

Hash Table

700 bytes added, 16:37, 9 August 2019
no edit summary
* [[John Tromp]] ('''2014'''). ''[https://github.com/tromp/cuckoo/blob/master/cuckoo.pdf Cuckoo Cycle: a memory-hard proof-of-work system]''. [http://www.informatik.uni-trier.de/~ley/db/journals/iacr/iacr2014.html#Tromp14 IACR Cryptology ePrint Archive] <ref>[https://bitcointalk.org/index.php?topic=405483.0 Cuckoo Cycle: a new memory-hard proof-of-work system] by [[John Tromp]], [https://bitcointalk.org/index.php Bitcoin Forum], January 08, 2014</ref> <ref>[https://en.wikipedia.org/wiki/Cuckoo_hashing Cuckoo hashing from Wikipedia]</ref>
* [[David Eppstein]], [[Mathematician#MTGoodrich|Michael T. Goodrich]], [[Mathematician#MMitzenmacher|Michael Mitzenmacher]], [https://dblp.uni-trier.de/pers/hd/p/Pszona:Pawel Paweł Pszona] ('''2014'''). ''Wear Minimization for Cuckoo Hashing: How Not to Throw a Lot of Eggs into One Basket''. [https://arxiv.org/abs/1404.0286 arXiv:1404.0286]
* [[Thomas Dybdahl Ahle]], [[Mathematician#MAumueller|Martin Aumüller]], [[Mathematician#RPagh|Rasmus Pagh]] ('''2016'''). ''Parameter-free Locality Sensitive Hashing for Spherical Range Reporting''. [https://arxiv.org/abs/1605.02673 arXiv:1605.02673] <ref>[https://en.wikipedia.org/wiki/Locality-sensitive_hashing Locality-sensitive hashing from Wikipedia]</ref>
* [[Thomas Dybdahl Ahle]] ('''2017'''). ''Optimal Set Similarity Data-structures Without False Negatives''. Master thesis, [https://en.wikipedia.org/wiki/University_of_Copenhagen University of Copenhagen], [http://www.itu.dk/people/thdy/papers/minhash.pdf pdf] <ref>[https://en.wikipedia.org/wiki/MinHash MinHash from Wikipedia]</ref>
=Forum Posts=

Navigation menu