25,161
edits
Changes
no edit summary
* [[Robert Hyatt]], [[Tim Mann]] ('''2002'''). ''[http://www.cis.uab.edu/hyatt/hashing.html A lock-less transposition table implementation for parallel search chess engines]''. [[ICGA Journal#25_1|ICGA Journal, Vol. 25, No. 1]] » [[Shared Hash Table#Lockless|Shared Hash Table - Lock-less]]
* [[Robert Hyatt]], [[Anthony Cozzie]] ('''2005'''). ''[http://www.cis.uab.edu/hyatt/collisions.html The Effect of Hash Signature Collisions in a Chess Program]''. [[ICGA Journal#28_3|ICGA Journal, Vol. 28, No. 3]]
* [[Mathematician#DFotakis|Dimitris Fotakis]], [[Mathematician#RPagh|Rasmus Pagh]], [[Peter Sanders]], [[Mathematician#PGSpirakis|Paul Spirakis]] ('''2005'''). ''[https://link.springer.com/article/10.1007/s00224-004-1195-x Space Efficient Hash Tables with Worst Case Constant Access Time]''. [https://en.wikipedia.org/wiki/Theory_of_Computing_Systems Theory of Computing Systems], Vol. 38, No. 2
* [[Sam Tannous]] ('''2007'''). ''Avoiding Rotated Bitboards with Direct Lookup''. [[ICGA Journal#30_2|ICGA Journal, Vol. 30, No. 2]], [http://arxiv.org/PS_cache/arxiv/pdf/0704/0704.3773v2.pdf pdf] » [[Hashing Dictionaries]]
* [[Kumar Chellapilla]], [http://videolectures.net/anton_mityagin/ [Mathematician#AMityagin|Anton Mityagin]], [[Mathematician#DXCharles|Denis Xavier Charles]] ('''2007'''). ''[http://www2007.org/poster1018.php GigaHash: scalable minimal perfect hashing for billions of urls]''. [http://www.informatik.uni-trier.de/%7Eley/db/conf/www/www2007.html#ChellapillaMC07 WWW 2007]
* [[Trevor Fenner]], [[Mark Levene]] ('''2008'''). ''Move Generation with Perfect Hashing Functions.'' [[ICGA Journal#31_1|ICGA Journal, Vol. 31, No. 1]], [http://www.dcs.bbk.ac.uk/~mark/download/bitboard_sliding_icga_final.pdf pdf] » [[Congruent Modulo Bitboards]]
==2010 ...==
* [[Maurizio Monge]] ('''2010'''). ''On perfect hashing of numbers with sparse digit representation via multiplication by a constant''. [https://arxiv.org/abs/1003.3196 arXiv:1003.3196] » [[Magic Bitboards]]
* [[Jiao Wang]], [[Si-Zhong Li]], [[Xinhe Xu|Xin-He Xu]] ('''2010'''). ''A Minors Hash Table in Chinese-Chess Programs''. [[ICGA Journal#33_1|ICGA Journal, Vol. 33, No. 1]]
* [[Mathematician#MPatrascu|Mihai Pătrașcu]], [[Mathematician#MThorup|Mikkel Thorup]] ('''2011'''). ''The Power of Simple Tabulation Hashing''. [http://arxiv.org/abs/1011.5200 arXiv:1011.5200v2]
* [[Dan Anthony Feliciano Alcantara]] ('''2011'''). ''Effcient Hash Tables on the GPU''. Ph.D. thesis, [https://en.wikipedia.org/wiki/University_of_California,_Davis University of California, Davis], [http://idav.ucdavis.edu/~dfalcant//downloads/dissertation.pdf pdf] » [[GPU]]
* [[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>
* [https://dblp.uni-trier.de/pers/hd/m/Maier:Tobias Tobias Maier], [[Peter Sanders]], [https://dblp.uni-trier.de/pers/hd/d/Dementiev:Roman Roman Dementiev] ('''2016'''). ''Concurrent Hash Tables: Fast and General?(!)''. [https://arxiv.org/abs/1601.04017 arXiv:1601.04017]
* [[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>
* [https://dblp.uni-trier.de/pers/hd/m/Maier:Tobias Tobias Maier], [[Peter Sanders]] ('''2017'''). ''Dynamic Space Efficient Hashing''. [https://arxiv.org/abs/1705.00997 arXiv:1705.00997]
* [[Peter Sanders]] ('''2018'''). ''Hashing with Linear Probing and Referential Integrity''. [https://arxiv.org/abs/1808.04602 arXiv:1808.04602]
==2020 ...==
* [[Niklas Fiekas]] ('''2020'''). ''[https://backscattering.de/chess/hashtable-packing/ The Hashtable Packing Problem]''. (Draft)
* [[Thomas Dybdahl Ahle]], [https://dblp.uni-trier.de/pid/236/4491.html Jakob Tejs Bæk Knudsen], [[Mathematician#MThorup|Mikkel Thorup]] ('''2020'''). ''The Power of Hashing with Mersenne Primes''. [https://arxiv.org/abs/2008.08654 arXiv:2008.08654] <ref>[https://en.wikipedia.org/wiki/Mersenne_prime Mersenne prime from Wikipedia]</ref>
=Forum Posts=
* [https://www.stmintz.com/ccc/index.php?id=214125 Non power of two hash table sizes] by [[Alvaro Cardoso|Alvaro Jose Povoa Cardoso]], [[CCC]], February 18, 2002
==2005 ...==
* [https://www.stmintz.com/ccc/index.php?id=484874 Hash table and O(1)] by [[Dann Corbit]], [[CCC]], February 06, 2006
* [http://www.hiarcs.net/forums/viewtopic.php?p=2921 What is the Difference between Mainhash, Evalhash, Pawnhash?] by Thomas Wallendik, [[Computer Chess Forums|Hiarcs Forum]], October 13, 2007
* [http://www.talkchess.com/forum/viewtopic.php?topic_view=threads&p=285407 Cache pollution when reading/writing hash table] by [[Marco Costalba]], [[CCC]], August 09, 2009
* [http://www.talkchess.com/forum/viewtopic.php?t=65870 Magic end-game material hash?] by [[Harm Geert Muller]], [[CCC]], November 30, 2017
* [http://www.talkchess.com/forum/viewtopic.php?t=66183 hashing in chess4j] by [[James Swafford]], [[CCC]], December 30, 2017 » [[chess4j]], [[Transposition Table]]
==2020 ...==
* [http://www.talkchess.com/forum3/viewtopic.php?f=7&t=72932 hash collisions] by [[Jon Dart]], [[CCC]], January 28, 2020 » [[Transposition Table#KeyCollisions|Key Collisions]]
* [http://www.talkchess.com/forum3/viewtopic.php?f=7&t=72964 Dense board representation as hash code] by koedem, [[CCC]], February 01, 2020
* [http://www.talkchess.com/forum3/viewtopic.php?f=7&t=73071 Hashtable packing (e.g. to optimize magic bitboards) is strongly NP-complete] by [[Niklas Fiekas]], [[CCC]], February 13, 2020 » [[Magic Bitboards]] <ref>[https://en.wikipedia.org/wiki/Strong_NP-completeness Strong NP-completeness from Wikipedia]</ref>
* [http://www.talkchess.com/forum3/viewtopic.php?f=7&t=73110 Zobrist key independence] by [[Harm Geert Muller]], [[CCC]], February 17, 2020 » [[Zobrist Hashing]]
=External Links=
* [https://en.wikipedia.org/wiki/Fowler%E2%80%93Noll%E2%80%93Vo_hash_function Fowler–Noll–Vo hash function from Wikipedia]
* [http://www.partow.net/programming/hashfunctions/index.html General Purpose Hash Function Algorithms] by [http://www.partow.net/about/index.html Arash Partow]
* [http://www.cse.yorku.ca/~oz/hash.html Hash Functions]
* [http://www.fantasy-coders.de/projects/gh/html/x435.html 7. Wahl einer geeigneten Hash-Funktion] from [http://www.fantasy-coders.de/projects/gh/html/index.html Guugelhupf - Design und Implementation] (German)
