Latest revision as of 17:25, 17 September 2020

Home * People * Thomas Dybdahl Ahle

Thomas Dybdahl Ahle ^[1]

Thomas Dybdahl Ahle,
a Danish computer scientist, software developer, and currently post doctoral researcher at Basic Algorithms Research group (BARC) ^[2] at University of Copenhagen ^[3]. He holds a Master of Arts in computer science in 2013 from University of Oxford, and a M.Sc. and Ph.D. in algorithms and theoretical computer science from University of Copenhagen in 2017 and 2019 respectively.

Computer Chess

Thomas Dybdahl Ahle is owner and primary developer of PyChess, a chess client and engine for the Linux desktop. He is further author of the didactic Python open source chess engines Sunfish ^[4] and FastChess, the latter a one-layer neural network softmax model, combined with a Monte-Carlo Tree Search.

Thomas Dybdahl Ahle, Rasmus Pagh, Ilya Razenshteyn, Francesco Silvestri (2015). On the Complexity of Inner Product Similarity Join. arXiv:1510.02824
Thomas Dybdahl Ahle, Martin Aumüller, Rasmus Pagh (2016). Parameter-free Locality Sensitive Hashing for Spherical Range Reporting. arXiv:1605.02673 ^[8]
Thomas Dybdahl Ahle (2017). Optimal Las Vegas Locality Sensitive Data Structures. arXiv:1704.02054
Thomas Dybdahl Ahle (2017). Optimal Set Similarity Data-structures Without False Negatives. Master thesis, University of Copenhagen, pdf ^[9]
Thomas Dybdahl Ahle (2019). Subsets and Supermajorities: Unifying Hashing-based Set Similarity Search. arXiv:1904.04045
Thomas Dybdahl Ahle (2019). Algorithms for Sets. Ph.D. thesis, University of Copenhagen
Thomas Dybdahl Ahle, Michael Kapralov, Jakob Tejs Bæk Knudsen, Rasmus Pagh, Ameya Velingker, David P. Woodruff, Amir Zandieh (2019). Oblivious Sketching of High-Degree Polynomial Kernels. pdf

@@ Line 22: / Line 22: @@
 * [[Thomas Dybdahl Ahle]], [https://dblp.uni-trier.de/pers/hd/k/Kapralov:Michael Michael Kapralov], [https://dblp.uni-trier.de/pid/236/4491.html Jakob Tejs Bæk Knudsen], [[Mathematician#RPagh|Rasmus Pagh]], [[Mathematician#AVelingker|Ameya Velingker]], [[Mathematician#DPWoodruff|David P. Woodruff]], [https://dblp.uni-trier.de/pers/hd/z/Zandieh:Amir Amir Zandieh] ('''2019'''). ''Oblivious Sketching of High-Degree Polynomial Kernels''. [https://itu.dk/~thdy/papers/tensorsketch-joint.pdf pdf]
 ==2020 ...==
-* [[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]
+* [[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>
 =Postings=