Difference between revisions of "Trevor Fenner"

From Chessprogramming wiki
Jump to: navigation, search
 
Line 10: Line 10:
  
 
=Selected Publications=
 
=Selected Publications=
<ref>[http://ilk.uvt.nl/icga/journal/docs/References.pdf ICGA Reference Database] (pdf)</ref> <ref>[http://www.dcs.bbk.ac.uk/~mark/papers.html Mark Levene - Online papers]</ref> <ref>[https://dblp.uni-trier.de/pers/hd/f/Fenner:Trevor_I= dblp: Trevor I. Fenner]</ref>
+
<ref>[[ICGA Journal#RefDB|ICGA Reference Database]]</ref> <ref>[http://www.dcs.bbk.ac.uk/~mark/papers.html Mark Levene - Online papers]</ref> <ref>[https://dblp.uni-trier.de/pers/hd/f/Fenner:Trevor_I= dblp: Trevor I. Fenner]</ref>
 
==1970 ...==
 
==1970 ...==
 
* [[Trevor Fenner]], [[Mathematician#GLoizou|George Loizou]] ('''1971'''). ''On Fully Indecomposable Matrices''. [https://en.wikipedia.org/wiki/Journal_of_Computer_and_System_Sciences Journal of Computer and System Sciences], Vol. 5, No. 6, [https://core.ac.uk/download/pdf/82397078.pdf pdf] <ref>[https://en.wikipedia.org/wiki/Cartan_matrix Cartan matrix from Wikipedia]</ref>
 
* [[Trevor Fenner]], [[Mathematician#GLoizou|George Loizou]] ('''1971'''). ''On Fully Indecomposable Matrices''. [https://en.wikipedia.org/wiki/Journal_of_Computer_and_System_Sciences Journal of Computer and System Sciences], Vol. 5, No. 6, [https://core.ac.uk/download/pdf/82397078.pdf pdf] <ref>[https://en.wikipedia.org/wiki/Cartan_matrix Cartan matrix from Wikipedia]</ref>

Latest revision as of 17:54, 16 November 2020

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