25,161
edits
Changes
no edit summary
* [[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 ...==
* [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=
* [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=
