25,161
edits
Changes
no edit summary
a Danish computer scientist, software developer, and currently post doctoral researcher at Basic Algorithms Research group (BARC) <ref>[https://barc.ku.dk/ BARC – University of Copenhagen]</ref> at [https://en.wikipedia.org/wiki/University_of_Copenhagen University of Copenhagen] <ref>[https://dk.linkedin.com/in/thomasahle Thomas Dybdahl Ahle | LinkedIn]</ref>.
He holds a [https://en.wikipedia.org/wiki/Master_of_Arts#Oxford.2C_Cambridge.2C_Dublin_.28conferred.2C_not_earned.29 Master of Arts] in computer science in 2013 from [https://en.wikipedia.org/wiki/University_of_Oxford University of Oxford],
and a M.Sc. and Ph.D. in [[Algorithms|algorithms]] and [https://en.wikipedia.org/wiki/Theoretical_computer_science theoretical computer science] from [https://en.wikipedia.org/wiki/University_of_Copenhagen University of Copenhagen]in 2017 and 2019 respectively.
=Computer Chess=
<ref>[https://dblp.uni-trier.de/pers/hd/a/Ahle:Thomas_D= dblp: Thomas D. Ahle]</ref> <ref>[https://scholar.google.dk/citations?user=aRiVoYgAAAAJ Thomas D. Ahle - Google Scholar Citations]</ref> <ref>[http://www.itu.dk/people/thdy/ Thomas Dybdahl Ahle]</ref>
* [[Thomas Dybdahl Ahle]], [[Mathematician#RPagh|Rasmus Pagh]], [[Mathematician#IRazenshteyn|Ilya Razenshteyn]], [https://dblp.uni-trier.de/pers/hd/s/Silvestri_0001:Francesco Francesco Silvestri] ('''2015'''). ''On the Complexity of Inner Product Similarity Join''. [https://arxiv.org/abs/1510.02824 arXiv:1510.02824]
* [[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 Las Vegas Locality Sensitive Data Structures''. [https://arxiv.org/abs/1704.02054 arXiv:1704.02054]
* [[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>
* [[Thomas Dybdahl Ahle]] ('''2019'''). ''Subsets and Supermajorities: Unifying Hashing-based Set Similarity Search''. [https://arxiv.org/abs/1904.04045 arXiv:1904.04045]
* [[Thomas Dybdahl Ahle]] ('''2019'''). ''Algorithms for Sets''. Ph.D. thesis, [https://en.wikipedia.org/wiki/University_of_Copenhagen University of Copenhagen]
* [http://www.talkchess.com/forum/viewtopic.php?t=64972 Approximating Stockfish's Evaluation by PSQTs] by [[Thomas Dybdahl Ahle]], [[CCC]], August 23, 2017 » [[Automated Tuning#Regression|Regression]], [[Piece-Square Tables]], [[Stockfish]]
* [http://www.talkchess.com/forum3/viewtopic.php?f=7&t=71301&start=8 Re: A question to MCTS + NN experts] by [[Thomas Dybdahl Ahle]], [[CCC]], August 04, 2019
* [http://www.talkchess.com/forum3/viewtopic.php?f=7&t=71650 New Tool for Tuning with Skopt] by [[Thomas Dybdahl Ahle]], [[CCC]], August 25, 2019 » [[Automated Tuning]] <ref>[https://scikit-optimize.github.io/ skopt API documentation]</ref>
=External Links=
