Holger Hopp

From Chessprogramming wiki

Revision as of 20:59, 30 January 2020 by GerdIsenberg (talk | contribs)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to: navigation, search

Home * People * Holger Hopp

Holger Hopp,
a German computer scientist who defended his diploma thesis in 1995 under Peter Sanders on the topic of parallel search ^[1], and his Ph.D. thesis in 2001 on cache behaviour of optimizing compiler under Walter F. Tichy ^[2], both degrees from University of Karlsruhe.

Selected Publications

Holger Hopp (1995). Parallele Spielbaumsuche auf SIMD Rechnern. Diplomarbeit, University of Karlsruhe, advisor Peter Sanders (German)
Holger Hopp, Peter Sanders (1995). Parallel Game Tree Search on SIMD Machines. IRREGULAR 1995, pdf
Holger Hopp (2001). Vorhersage des Cache-Verhaltens für optimierende Übersetzer. Ph.D. thesis, University of Karlsruhe, advisor Walter F. Tichy (German)

External Links

References

Up one level

Retrieved from "https://www.chessprogramming.org/index.php?title=Holger_Hopp&oldid=17807"

Researcher