Difference between revisions of "Trevor Fenner"

From Chessprogramming wiki
Jump to: navigation, search
Line 25: Line 25:
 
* [[Mathematician#Bollobas|Béla Bollobás]], [[Trevor Fenner]], [https://en.wikipedia.org/wiki/Alan_M._Frieze Alan M. Frieze] ('''1996'''). ''[https://dl.acm.org/citation.cfm?id=227502 On the Best Case of Heapsort]''. [https://en.wikipedia.org/wiki/Journal_of_Algorithms Journal of Algorithms], Vol. 20, No. 2, [https://www.math.cmu.edu/~af1p/Texfiles/Best.pdf pdf] <ref>[https://en.wikipedia.org/wiki/Heapsort Heapsort from Wikipedia]</ref>
 
* [[Mathematician#Bollobas|Béla Bollobás]], [[Trevor Fenner]], [https://en.wikipedia.org/wiki/Alan_M._Frieze Alan M. Frieze] ('''1996'''). ''[https://dl.acm.org/citation.cfm?id=227502 On the Best Case of Heapsort]''. [https://en.wikipedia.org/wiki/Journal_of_Algorithms Journal of Algorithms], Vol. 20, No. 2, [https://www.math.cmu.edu/~af1p/Texfiles/Best.pdf pdf] <ref>[https://en.wikipedia.org/wiki/Heapsort Heapsort from Wikipedia]</ref>
 
==2000 ...==
 
==2000 ...==
* [[Mark Levene]], [[Trevor Fenner]] ('''2001'''). ''The Effect of Mobility on Minimaxing of Game Trees with Random Leaf Values''. [https://en.wikipedia.org/wiki/Artificial_Intelligence_%28journal%29 Artificial Intelligence], Vol. 130, No. 1, Review in [[ICGA Journal#24_4|ICGA Journal, Vol. 24, No. 4]], [http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.21.6342&rep=rep1&type=pdf pdf]
+
* [[Mark Levene]], [[Trevor Fenner]] ('''2001'''). ''The Effect of Mobility on Minimaxing of Game Trees with Random Leaf Values''. [https://en.wikipedia.org/wiki/Artificial_Intelligence_%28journal%29 Artificial Intelligence], Vol. 130, No. 1, [http://www.dcs.bbk.ac.uk/~mark/download/ply.pdf pdf], Review in [[ICGA Journal#24_4|ICGA Journal, Vol. 24, No. 4]]
 
* [[Trevor Fenner]], [[Mark Levene]], [[Mathematician#GLoizou|George Loizou]] ('''2007'''). ''Modelling the Navigation Potential of a Web Page''. [https://arxiv.org/abs/0711.3966 arXiv:0711.3966]
 
* [[Trevor Fenner]], [[Mark Levene]], [[Mathematician#GLoizou|George Loizou]] ('''2007'''). ''Modelling the Navigation Potential of a Web Page''. [https://arxiv.org/abs/0711.3966 arXiv:0711.3966]
 
* [[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]
 
* [[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]

Revision as of 14:19, 7 May 2019

Home * People * Trevor Fenner

Trevor Fenner [1]

Trevor I. Fenner,
a British mathematician, and professor of computer science 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].

Selected Publications

[5] [6] [7]

1970 ...

1980 ...

1990 ...

2000 ...

2010 ...

External Links

References

Up one level