Home * People * Dietmar Lippold

Dietmar Lippold,
a German computer scientist with a Ph.D. from University of Stuttgart [1]. His research interests include data mining, machine learning, heuristic search, multi-agent systems, distributed and parallel computing and modeling of cognition. He was involved in various open source projects, the data mining system Lascer [2], the Java parallel framework Architeuthis [3], the multi-agent simulator Nereus [4] and the Java mathCollection [5] and the Java inSet package to represent and process sets of nonnegative integer numbers in an efficient way [6]. His Ph.D. thesis, defended in 2008 [7], broaches on Knowledge discovery from huge sample sets, which also includes simple chess endgames applied with the Lascer data mining system [8] [9].

Legitimacy of Positions

As undergraduate student at Kaiserslautern University of Technology in the 90s, Lippold researched on the topic of the legitimacy of positions in endgame databases, whether those positions can be reached from the initial position, proposals published in the ICCA Journal [10].

Selected Publications

[11]

External Links


References

  1. ^ Alumni - Former staff at VIS
  2. ^ Lascer (German)
  3. ^ Architeuthis (German)
  4. ^ Nereus (German)
  5. ^ An extension for the Java Collection Framework
  6. ^ An Efficient Representation of Sets by Using Tree Structures and its Implementation in Java
  7. ^ Johannes Fürnkranz, Curriculum Vitae | Lectures | Ph.D. Theses (pdf)
  8. ^ Dietmar Lippold (2009). Begriffserwerb aus großen Mengen von Beispielen. Cuvillier Verlag, ISBN-13: 978-3867278904 (German)
  9. ^ Projekt Lascer | ReadmeEndspiel.txt (German)
  10. ^ Dietmar Lippold (1997). The Legitimacy of Positions in Endgame Databases. ICCA Journal, Vol. 20, No. 1
  11. ^ DBLP: Dietmar Lippold
  12. ^ referred in Jesper Torp Kristensen (2005). Generation and compression of endgame tables in chess with fast random access using OBDDs. Master thesis

What links here?


Up one level