25,161
edits
Changes
no edit summary
'''Pablo San Segundo Carrillo''',<br/>
a Spanish [https://en.wikipedia.org/wiki/Grandmaster_%28chess%29 chess grandmaster], [https://en.wikipedia.org/wiki/Spanish_Chess_Championship Spanish chess champion] in 1997 and member of the Olympic team since 1994, computer scientist and associate professor at the [[Technical University of Madrid|Universidad Politécnica de Madrid]] (UPM).
His research interests include [https://en.wikipedia.org/wiki/Heuristic heuristics], [https://en.wikipedia.org/wiki/Combinatorics combinatorics], [https://en.wikipedia.org/wiki/Game_theory game theory], [https://en.wikipedia.org/wiki/Graph_theory graph theory], such as [https://en.wikipedia.org/wiki/Clique_problem Clique problems] and [https://en.wikipedia.org/wiki/Graph_coloring#Vertex_coloring vertex coloring], as well as [[Artificial Intelligence|AI]] search- and [https://en.wikipedia.org/wiki/Optimization_problem optimization problems] in general, specially applying [[Bitboards|bitboards]].
In their 2005 paper, ''Bitboards: A New Approach'' <ref>[[Pablo San Segundo]], [[Ramón Galán]] ('''2005'''). ''[http://www.actapress.com/Abstract.aspx?paperId=18953 Bitboards: A New Approach]''. [https://dblp.uni-trier.de/db/conf/aia/aia2005.html AIA 2005]</ref> , Pablo San Segundo and [[Ramón Galán]] mention [[BitScan#BitscanByModulo|Bitscan by Modulo]] for finding 1-bits in a very efficient and practically no space consuming way, at that time not aware of [[BitScan#DeBruijnMultiplation|De Bruijn multiplication]] as proposed by [[Charles Leiserson]] et al. in 1998 <ref>[[Charles Leiserson|Charles E. Leiserson]], [[Harald Prokop]], [[Keith H. Randall]] ('''1998'''). ''Using de Bruijn Sequences to Index a 1 in a Computer Word''. [http://supertech.csail.mit.edu/papers/debruijn.pdf pdf]</ref>, which is however mentioned in Segundo et al. 2011 on [[#BBMC|BBMC]] <ref>[[Pablo San Segundo]], [[Diego Rodríguez-Losada]], [[Agustín Jiménez]] ('''2011'''). ''[https://www.sciencedirect.com/science/article/pii/S0305054810001504 An exact bit-parallel algorithm for the maximum clique problem]''. [https://dblp.uni-trier.de/db/journals/cor/cor38.html Computers & Operations Research, Vol. 38, No. 2], 2 Preliminaries 2.2 Bit-parallel computation</ref>.
