Difference between revisions of "Trevor Fenner"
GerdIsenberg (talk | contribs) |
GerdIsenberg (talk | contribs) |
||
| Line 7: | Line 7: | ||
His research interests include the general area of [[Algorithms|algorithms]] and [[Data|data structures]], particularly [https://en.wikipedia.org/wiki/Combinatorics combinatorics] and [https://en.wikipedia.org/wiki/Randomized_algorithm probabilistic algorithms]. | His research interests include the general area of [[Algorithms|algorithms]] and [[Data|data structures]], particularly [https://en.wikipedia.org/wiki/Combinatorics combinatorics] and [https://en.wikipedia.org/wiki/Randomized_algorithm probabilistic algorithms]. | ||
Along with [[Mark Levene]], he published various papers on the topic of computer chess. While their 2008 paper ''Move Generation with Perfect Hashing Functions'' introducing [[Congruent Modulo Bitboards]] <ref>[[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]</ref> | Along with [[Mark Levene]], he published various papers on the topic of computer chess. While their 2008 paper ''Move Generation with Perfect Hashing Functions'' introducing [[Congruent Modulo Bitboards]] <ref>[[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]</ref> | ||
| − | provides | + | provides insights in [https://en.wikipedia.org/wiki/Congruence_relation congruent] [https://en.wikipedia.org/wiki/Modular_arithmetic modular arithmetic], their final conclusion in comparison with [[Hashing Dictionaries]], [[Rotated Bitboards]] and [[Magic Bitboards]] was criticized due to the obvious comparison with [[Kindergarten Bitboards]] <ref>[http://www.talkchess.com/forum/viewtopic.php?t=20913 Nice Math - Strange Conclusions] by [[Gerd Isenberg]], [[CCC]], April 29, 2008</ref>. |
=Selected Publications= | =Selected Publications= | ||
Revision as of 22:07, 6 May 2019
Trevor Fenner [1]
Trevor I. Fenner,
a British mathematician and computer scientist at the School of Computer Science and Information Systems, Birkbeck College, University of London, where he already obtained his Ph.D. degree in 1978 under George Loizou [2].
His research interests include the general area of algorithms and data structures, particularly combinatorics and probabilistic algorithms.
Along with Mark Levene, he published various papers on the topic of computer chess. While their 2008 paper Move Generation with Perfect Hashing Functions introducing Congruent Modulo Bitboards [3]
provides insights in congruent modular arithmetic, their final conclusion in comparison with Hashing Dictionaries, Rotated Bitboards and Magic Bitboards was criticized due to the obvious comparison with Kindergarten Bitboards [4].
Contents
Selected Publications
1970 ...
- Trevor Fenner, George Loizou (1971). On Fully Indecomposable Matrices. Journal of Computer and System Sciences, Vol. 5, No. 6, pdf [8]
- Trevor Fenner, George Loizou (1974). Some New Bounds on the Condition Numbers of Optimally Scaled Matrices. Journal of the ACM, Vol. 21, No. 3
- Trevor Fenner, George Loizou (1977). Combinatorial aspects of rectangular non-negative matrices. Discrete Mathematics, Vol. 20
- Trevor Fenner (1978). Some Results on Condition Numbers and Matrix Scaling. Ph.D. thesis, Birkbeck, University of London, supervisor George Loizou
1980 ...
- Trevor Fenner, George Loizou (1980). A Binary Tree Representation and Related Algorithms for Generating Partitions. The Computer Journal, Vol. 23, No. 4 [9]
- Trevor Fenner, George Loizou (1981). An Analysis of two Related Loop-free Algorithms for Generating Integer Partitions. Acta Informatica, Vol. 16
- Trevor Fenner, George Loizou (1981). A Note on Traversal Algorithms for Triply Linked Binary Trees. BIT, Vol. 21, No. 2
- Trevor Fenner, George Loizou (1984). Loop-Free Algorithms for Traversing Binary Trees. BIT, Vol. 24, No. 1
1990 ...
- Mark Levene, Trevor Fenner (1995). A Partial Analysis of Minimaxing Game Trees with Random Leaf Values. ICCA Journal, Vol. 18, No. 1, zipped ps
- Béla Bollobás, Trevor Fenner, Alan M. Frieze (1996). On the Best Case of Heapsort. Journal of Algorithms, Vol. 20, No. 2, pdf [10]
2000 ...
- Mark Levene, Trevor Fenner (2001). The Effect of Mobility on Minimaxing of Game Trees with Random Leaf Values. Artificial Intelligence, Vol. 130, No. 1, Review in ICGA Journal, Vol. 24, No. 4, pdf
- Trevor Fenner, Mark Levene, George Loizou (2007). Modelling the Navigation Potential of a Web Page. arXiv:0711.3966
- Trevor Fenner, Mark Levene (2008). Move Generation with Perfect Hashing Functions. ICGA Journal, Vol. 31, No. 1, pdf
- Mark Levene, Trevor Fenner (2009). A Methodology for Learning Players' Styles from Game Records. arXiv:0904.2595v1
2010 ...
- Trevor Fenner, Mark Levene, George Loizou (2011). A Discrete Evolutionary Model for Chess Players' Ratings. arXiv:1103.1530
- Trevor Fenner, Mark Levene, George Loizou (2014). A stochastic evolutionary model for survival dynamics. arXiv:1401.5957
- Trevor Fenner, Mark Levene, George Loizou (2015). A stochastic evolutionary model for capturing human dynamics. arXiv:1502.07558
- Trevor Fenner, Mark Levene, George Loizou (2016). A multiplicative process for generating the rank-order distribution of UK election results. arXiv:1609.04282
- Trevor Fenner, Mark Levene, George Loizou (2017). A stochastic differential equation approach to the analysis of the UK 2016 EU referendum polls. arXiv:1710.03424
- Trevor Fenner, Martyn Harris, Mark Levene, Judit Bar-Ilan (2018). A novel bibliometric index with a simple geometric interpretation. PLOS One, Vol. 13, No. 7
External Links
References
- ↑ Trevor Fenner's Home Page
- ↑ Professor George Loizou's Home Page
- ↑ Trevor Fenner, Mark Levene (2008). Move Generation with Perfect Hashing Functions. ICGA Journal, Vol. 31, No. 1, pdf
- ↑ Nice Math - Strange Conclusions by Gerd Isenberg, CCC, April 29, 2008
- ↑ ICGA Reference Database (pdf)
- ↑ Mark Levene - Online papers
- ↑ dblp: Trevor I. Fenner
- ↑ Cartan matrix from Wikipedia
- ↑ Binary tree from Wikipedia
- ↑ Heapsort from Wikipedia
