Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies
if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the
same subfield and year (this is the minimum needed to enter the top 1%, not the average
within it), or reaches the top citation threshold in at least one of its specific research
topics.
A Survey of Monte Carlo Tree Search Methods
20121.6k citationsSimon M. Lucas, Diego Pérez-Liébana et al.profile →
Peers — A (Enhanced Table)
Peers by citation overlap · career bar shows stage (early→late)
cites ·
hero ref
Countries citing papers authored by Simon M. Lucas
Since
Specialization
Citations
This map shows the geographic impact of Simon M. Lucas's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Simon M. Lucas with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Simon M. Lucas more than expected).
This network shows the impact of papers produced by Simon M. Lucas. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Simon M. Lucas. The network helps show where Simon M. Lucas may publish in the future.
Co-authorship network of co-authors of Simon M. Lucas
This figure shows the co-authorship network connecting the top 25 collaborators of Simon M. Lucas.
A scholar is included among the top collaborators of Simon M. Lucas based on the total number of
citations received by their joint publications. Widths of edges
represent the number of papers authors have co-authored together.
Node borders
signify the number of papers an author published with Simon M. Lucas. Simon M. Lucas is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Estévez, P. A., Bernadette Bouchon‐Meunier, Gary B. Fogel, et al.. (2021). IEEE Computational Intelligence Society. IEEE Transactions on Emerging Topics in Computational Intelligence. 5(4). C3–C3.
Lucas, Simon M., et al.. (2012). A web tool for monitoring HTTP asynchronous method invocations. International Conference for Internet Technology and Secured Transactions. 127–132.3 indexed citations
10.
Jansen, Thomas, et al.. (2008). Parallel problem solving from nature - PPSN X : 10th international conference, Dortmund, Germany, September 13-17, 2008 : proceedings. CERN Document Server (European Organization for Nuclear Research).9 indexed citations
Lucas, Simon M.. (2005). Evolving a Neural Network Location Evaluator to Play Ms. Pac-Man..79 indexed citations
13.
Togelius, Julian & Simon M. Lucas. (2005). Forcing neurocontrollers to exploit sensory symmetry through hard-wired modularity in the game of Cellz. CogPrints (University of Southampton). 37–43.5 indexed citations
14.
Keijzer, Maarten, Una-May O’Reilly, Simon M. Lucas, Ernesto Costa, & Terence Soule. (2004). Genetic Programming: 7th European Conference, Eurogp2004, Coimbra, Portugal, April 5-7, 2004, Proceedings (LECTURE NOTES IN COMPUTER SCIENCE). Springer eBooks.2 indexed citations
Lucas, Simon M.. (1997). Face recognition with the continuous n-tuple classifier.. British Machine Vision Conference.29 indexed citations
17.
Lucas, Simon M.. (1996). Evolving neural network learning behaviours with set-based chromosomes.. The European Symposium on Artificial Neural Networks.7 indexed citations
18.
Lucas, Simon M. & R.I. Damper. (1992). Syntactic neural networks for bidirectional text-phonetics translation. ePrints Soton (University of Southampton).3 indexed citations
19.
Lucas, Simon M.. (1991). Algebraic learning in syntactic neural networks. 185–189.1 indexed citations
20.
Lucas, Simon M. & R.I. Damper. (1989). A new learning paradigm for neural networks. ePrints Soton (University of Southampton). 346–350.2 indexed citations
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive
bibliographic database. While OpenAlex provides broad and valuable coverage of the global
research landscape, it—like all bibliographic datasets—has inherent limitations. These include
incomplete records, variations in author disambiguation, differences in journal indexing, and
delays in data updates. As a result, some metrics and network relationships displayed in
Rankless may not fully capture the entirety of a scholar's output or impact.