This is a temporary, read-only recovery of the chessprogrammingwiki while a longer-term plan is worked out. Editing is not possible right now, but will be again soon.
Chess Programming Wiki All pages Other namespaces

Ramón Galán

Home * People * Ramón Galán

Ramón Galán 1Ramón Galán 1


  1. Ramón Galán | UPM↩︎

Ramón Galán,
a Spanish computer scientist and full professor in the area of systems engineering at Universidad Politécnica de Madrid (UPM). His main research areas have been in the area of process control, artificial intelligence, expert systems, and interactive Robots. In their 2005 paper, Bitboards: A New Approach 1, Ramón Galán and Pablo San Segundo mention Bitscan by Modulo for finding 1-bits in a practically no space consuming way, not yet aware of De Bruijn multiplication 2.

Contents
  1. Selected Publications
    1. 2000 ...
    2. 2010 ...
  2. External Links
  3. References

Selected Publications

3

2000 ...

2010 ...

References

Up one Level


  1. Pablo San Segundo, Ramón Galán (2005). Bitboards: A New Approach. AIA 2005↩︎

  2. Charles E. Leiserson, Harald Prokop and Keith H. Randall (1998). Using de Bruijn Sequences to Index a 1 in a Computer Word, pdf↩︎

  3. dblp: Ramón Galán↩︎

  4. Clique problem from Wikipedia↩︎

Categories: Researcher

What links here

Contributors: GerdIsenberg.