25,161
edits
Changes
Created page with "'''Home * People * Pablo San Segundo''' FILE:San segundo carrillo pablo 20081119 olympiade dresden.jpg|border|right|thumb|220px| Pablo San Segundo <ref>Pa..."
'''[[Main Page|Home]] * [[People]] * Pablo San Segundo'''
[[FILE:San segundo carrillo pablo 20081119 olympiade dresden.jpg|border|right|thumb|220px| Pablo San Segundo <ref>Pablo San Segundo at the [https://en.wikipedia.org/wiki/38th_Chess_Olympiad 38th Chess Olympiad, Dresden 2008], Photo by [http://commons.wikimedia.org/wiki/User:Samson1964 Frank Hoppe], [http://es.wikipedia.org/wiki/Pablo_San_Segundo_Carrillo Pablo San Segundo Carrillo from Wikipedia.es] (Spanish)</ref> ]]
'''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], and [[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>.
=BITSCAN=
Pablo San Segundo has released BITSCAN, an efficient [[Cpp#Libraries|C++ library]] for bitstrings which is optimized for scanning bit vectors of any size, and which he used to implement <span id="BBMC"></span>BBMC (BB-MaxClique), a state of the art [https://en.wikipedia.org/wiki/Clique_problem maximum clique algorithm] <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]</ref>.
BBMC encodes the graph problem as bitstrings and uses bitmasks to implement the basic computations in the search. BITSCAN is publicly available a [https://en.wikipedia.org/wiki/GitHub GitHub] repository <ref>[https://github.com/psanse/bitscan GitHub - psanse/bitscan: C++ library for bit twiddling]</ref>.
=GRAPH=
GRAPH, a small [[Cpp#Libraries|C++ library]] with a number of data types for bit-encoded graphs using [[#BITSCAN|BITSCAN]] has been released <ref>[https://github.com/psanse/graph GitHub - psanse/graph: graph library for bit-encoded graphs with BITSCAN]</ref>.
=Selected Publications=
<ref>[https://dblp.uni-trier.de/pers/hd/s/Segundo:Pablo_San.html dblp: Pablo San Segundo]</ref>
==2005 ...==
* [[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]
* [[Pablo San Segundo]], [[Ramón Galán]], [[Fernando Matía]], [[Diego Rodríguez-Losada]], [[Agustín Jiménez]] ('''2006'''). ''[https://ieeexplore.ieee.org/document/4031890 Efficient Search Using Bitboard Models]''. [https://dblp.uni-trier.de/db/conf/ictai/ictai2006.html ICTAI 2006]
* [[Pablo San Segundo]], [[Diego Rodríguez-Losada]], [[Ramón Galán]] , [[Fernando Matía]], [[Agustín Jiménez]] ('''2007'''). ''[https://ieeexplore.ieee.org/document/4410262 Exploiting CPU Bit Parallel Operations to Improve Efficiency in Search]''. [https://dblp.uni-trier.de/db/conf/ictai/ictai2007-1.html ICTAI 2007]
* [[Pablo San Segundo]], [[Agustín Jiménez]] ('''2007'''). ''[https://ieeexplore.ieee.org/document/5366833 Using Graphs to Derive CSP Heuristics and its Application to Sudoku]''. [https://dblp.uni-trier.de/db/conf/ictai/ictai2009.html ICTAI 2009]
==2010 ...==
* [[Pablo San Segundo]], [[Diego Rodríguez-Losada]], [[Fernando Matía]], [[Ramón Galán]] ('''2010'''). ''[https://dl.acm.org/citation.cfm?id=1824946&dl Fast exact feature based data correspondence search with an efficient bit-parallel MCP solver]''. [https://dblp.uni-trier.de/db/journals/apin/apin32.html Applied Intelligence Vol. 32 No. 3] <ref>[https://en.wikipedia.org/wiki/Clique_problem Clique problem from Wikipedia]</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]
* [[Pablo San Segundo]] ('''2011'''). ''[https://link.springer.com/article/10.1007%2Fs10898-011-9653-x New decision rules for exact search in N-Queens]''. [https://dblp.uni-trier.de/db/journals/jgo/jgo51.html Journal of Global Optimization, Vol. 51, No. 3]
* [[Pablo San Segundo]] ('''2012'''). ''[https://www.sciencedirect.com/science/article/pii/S0305054811002966 A new DSATUR-based algorithm for exact vertex coloring[''. [https://dblp.uni-trier.de/db/journals/cor/cor39.html Computers & Operations Research, Vol. 39, No. 7]
* [[Pablo San Segundo]], [[Diego Rodríguez-Losada]] ('''2013'''). ''[https://ieeexplore.ieee.org/document/6527958 Robust Global Feature Based Data Association With a Sparse Bit Optimized Maximum Clique Algorithm]''. [[IEEE#Tor|IEEE Transactions on Robotics]], Vol. 29, No. 5
==2015 ...==
* [[Pablo San Segundo]], [https://dblp.org/pers/hd/n/Nikolaev:Alexey Alexey Nikolaev], [https://scholar.google.ru/citations?user=MUQcdkAAAAAJ&hl=ru Mikhail Batsyn] ('''2015'''). ''[https://www.sciencedirect.com/science/article/pii/S0305054815001549 Infra-chromatic bound for exact maximum clique search]''. [https://dblp.uni-trier.de/db/journals/cor/cor64.html Computers & Operations Research, Vol. 64, No. 4]
* [https://dblp.uni-trier.de/pers/hd/k/Komosko:Larisa Larisa Komosko], [https://scholar.google.ru/citations?user=MUQcdkAAAAAJ&hl=ru Mikhail Batsyn], [[Pablo San Segundo]], [https://en.wikipedia.org/wiki/Panos_M._Pardalos Panos M. Pardalos] ('''2016'''). ''[https://link.springer.com/article/10.1007/s10878-015-9862-1 A fast greedy sequential heuristic for the vertex colouring problem based on bitwise operations]''. [https://dblp.uni-trier.de/db/journals/jco/jco31.html Journal of Combinatorial Optimization, Vol. 31]
* [[Pablo San Segundo]], [https://dblp.uni-trier.de/pers/hd/a/Artieda:Jorge Jorge Artieda], [https://scholar.google.com/citations?user=BTW2e5AAAAAJ&hl=en Darren Strash] ('''2017'''). ''Efficiently Enumerating all Maximal Cliques with Bit-Parallelism''. [https://arxiv.org/abs/1801.00202 arXiv:1801.00202]
=External Links=
* [https://github.com/psanse psanse (Pablo San Segundo) · GitHub]
* [https://es.wikipedia.org/wiki/Pablo_San_Segundo_Carrillo Pablo San Segundo Carrillo from Wikipedia.es] (Spanish)
* [http://www.chessgames.com/perl/chessplayer?pid=89330 The chess games of Pablo San Segundo-Carrillo] from [http://www.chessgames.com/index.html chessgames.com]
* [https://en.chessbase.com/post/ponomariov-catches-nakamura-loses-tiebreak Donostia-San Sebastian Chess Festival] by [http://www.davidllada.com/ David Llada], [[ChessBase|ChessBase news]], June 17, 2009
=References=
<references />
'''[[People|Up one Level]]'''
[[Category:Chess Player|Segundo]]
[[Category:Researcher|Segundo]]
[[FILE:San segundo carrillo pablo 20081119 olympiade dresden.jpg|border|right|thumb|220px| Pablo San Segundo <ref>Pablo San Segundo at the [https://en.wikipedia.org/wiki/38th_Chess_Olympiad 38th Chess Olympiad, Dresden 2008], Photo by [http://commons.wikimedia.org/wiki/User:Samson1964 Frank Hoppe], [http://es.wikipedia.org/wiki/Pablo_San_Segundo_Carrillo Pablo San Segundo Carrillo from Wikipedia.es] (Spanish)</ref> ]]
'''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], and [[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>.
=BITSCAN=
Pablo San Segundo has released BITSCAN, an efficient [[Cpp#Libraries|C++ library]] for bitstrings which is optimized for scanning bit vectors of any size, and which he used to implement <span id="BBMC"></span>BBMC (BB-MaxClique), a state of the art [https://en.wikipedia.org/wiki/Clique_problem maximum clique algorithm] <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]</ref>.
BBMC encodes the graph problem as bitstrings and uses bitmasks to implement the basic computations in the search. BITSCAN is publicly available a [https://en.wikipedia.org/wiki/GitHub GitHub] repository <ref>[https://github.com/psanse/bitscan GitHub - psanse/bitscan: C++ library for bit twiddling]</ref>.
=GRAPH=
GRAPH, a small [[Cpp#Libraries|C++ library]] with a number of data types for bit-encoded graphs using [[#BITSCAN|BITSCAN]] has been released <ref>[https://github.com/psanse/graph GitHub - psanse/graph: graph library for bit-encoded graphs with BITSCAN]</ref>.
=Selected Publications=
<ref>[https://dblp.uni-trier.de/pers/hd/s/Segundo:Pablo_San.html dblp: Pablo San Segundo]</ref>
==2005 ...==
* [[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]
* [[Pablo San Segundo]], [[Ramón Galán]], [[Fernando Matía]], [[Diego Rodríguez-Losada]], [[Agustín Jiménez]] ('''2006'''). ''[https://ieeexplore.ieee.org/document/4031890 Efficient Search Using Bitboard Models]''. [https://dblp.uni-trier.de/db/conf/ictai/ictai2006.html ICTAI 2006]
* [[Pablo San Segundo]], [[Diego Rodríguez-Losada]], [[Ramón Galán]] , [[Fernando Matía]], [[Agustín Jiménez]] ('''2007'''). ''[https://ieeexplore.ieee.org/document/4410262 Exploiting CPU Bit Parallel Operations to Improve Efficiency in Search]''. [https://dblp.uni-trier.de/db/conf/ictai/ictai2007-1.html ICTAI 2007]
* [[Pablo San Segundo]], [[Agustín Jiménez]] ('''2007'''). ''[https://ieeexplore.ieee.org/document/5366833 Using Graphs to Derive CSP Heuristics and its Application to Sudoku]''. [https://dblp.uni-trier.de/db/conf/ictai/ictai2009.html ICTAI 2009]
==2010 ...==
* [[Pablo San Segundo]], [[Diego Rodríguez-Losada]], [[Fernando Matía]], [[Ramón Galán]] ('''2010'''). ''[https://dl.acm.org/citation.cfm?id=1824946&dl Fast exact feature based data correspondence search with an efficient bit-parallel MCP solver]''. [https://dblp.uni-trier.de/db/journals/apin/apin32.html Applied Intelligence Vol. 32 No. 3] <ref>[https://en.wikipedia.org/wiki/Clique_problem Clique problem from Wikipedia]</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]
* [[Pablo San Segundo]] ('''2011'''). ''[https://link.springer.com/article/10.1007%2Fs10898-011-9653-x New decision rules for exact search in N-Queens]''. [https://dblp.uni-trier.de/db/journals/jgo/jgo51.html Journal of Global Optimization, Vol. 51, No. 3]
* [[Pablo San Segundo]] ('''2012'''). ''[https://www.sciencedirect.com/science/article/pii/S0305054811002966 A new DSATUR-based algorithm for exact vertex coloring[''. [https://dblp.uni-trier.de/db/journals/cor/cor39.html Computers & Operations Research, Vol. 39, No. 7]
* [[Pablo San Segundo]], [[Diego Rodríguez-Losada]] ('''2013'''). ''[https://ieeexplore.ieee.org/document/6527958 Robust Global Feature Based Data Association With a Sparse Bit Optimized Maximum Clique Algorithm]''. [[IEEE#Tor|IEEE Transactions on Robotics]], Vol. 29, No. 5
==2015 ...==
* [[Pablo San Segundo]], [https://dblp.org/pers/hd/n/Nikolaev:Alexey Alexey Nikolaev], [https://scholar.google.ru/citations?user=MUQcdkAAAAAJ&hl=ru Mikhail Batsyn] ('''2015'''). ''[https://www.sciencedirect.com/science/article/pii/S0305054815001549 Infra-chromatic bound for exact maximum clique search]''. [https://dblp.uni-trier.de/db/journals/cor/cor64.html Computers & Operations Research, Vol. 64, No. 4]
* [https://dblp.uni-trier.de/pers/hd/k/Komosko:Larisa Larisa Komosko], [https://scholar.google.ru/citations?user=MUQcdkAAAAAJ&hl=ru Mikhail Batsyn], [[Pablo San Segundo]], [https://en.wikipedia.org/wiki/Panos_M._Pardalos Panos M. Pardalos] ('''2016'''). ''[https://link.springer.com/article/10.1007/s10878-015-9862-1 A fast greedy sequential heuristic for the vertex colouring problem based on bitwise operations]''. [https://dblp.uni-trier.de/db/journals/jco/jco31.html Journal of Combinatorial Optimization, Vol. 31]
* [[Pablo San Segundo]], [https://dblp.uni-trier.de/pers/hd/a/Artieda:Jorge Jorge Artieda], [https://scholar.google.com/citations?user=BTW2e5AAAAAJ&hl=en Darren Strash] ('''2017'''). ''Efficiently Enumerating all Maximal Cliques with Bit-Parallelism''. [https://arxiv.org/abs/1801.00202 arXiv:1801.00202]
=External Links=
* [https://github.com/psanse psanse (Pablo San Segundo) · GitHub]
* [https://es.wikipedia.org/wiki/Pablo_San_Segundo_Carrillo Pablo San Segundo Carrillo from Wikipedia.es] (Spanish)
* [http://www.chessgames.com/perl/chessplayer?pid=89330 The chess games of Pablo San Segundo-Carrillo] from [http://www.chessgames.com/index.html chessgames.com]
* [https://en.chessbase.com/post/ponomariov-catches-nakamura-loses-tiebreak Donostia-San Sebastian Chess Festival] by [http://www.davidllada.com/ David Llada], [[ChessBase|ChessBase news]], June 17, 2009
=References=
<references />
'''[[People|Up one Level]]'''
[[Category:Chess Player|Segundo]]
[[Category:Researcher|Segundo]]
