About me

My name is Christoph Lüders. I am a software developer and computer scientist.

I am working for over 23 years for cFos Software GmbH, which I co-founded in 1993. We are building telecommunications and networking software for Windows, including cFosSpeed, an Internet Traffic Shaping driver and cFos Personal Net, a web server.

I graduated from Universität Bonn with a diploma (equivalent to a master’s degree) in computer science under Michael Clausen in 2014.

I am a PhD student under Andreas Weber. I work in tropical geometry and chemical reaction networks. I plan to finish my dissertation 2019/20.

My research interests are:

  • tropical geometry, computational geometry, systems biology and (bio-)chemical reaction networks.
  • computer algebra and computer arithmetic, especially fast multiplication of extremely large integers (we’re talking billions of digits here) and fast Fourier transforms (since that’s what you use for fast multiplication).

I had a “Stiftungsfonds Johannes Kepler” scholarship in 2015/16.

Privately, I enjoy Salsa dancing (also teaching) and learning Aikido.

My page at the university: Dipl.-Inform. Christoph Lüders
My Twitter channel: @chrlueders.
Me on Google Scholar: Christoph Lüders.
Me on ResearchGate: (click) (you need to be registered).
Super old-skool email address: chris at cfos dot de.


Teaching

Sep 2014 — Prep-course for upcoming students in computer science: “Vorkurs Formale Methoden der Informatik”
Sep/Oct 2015 — Prep-course for upcoming students in computer science: “Vorkurs Formale Methoden der Informatik”
Sep/Oct 2016 — Prep-course for upcoming students in computer science: “Vorkurs Formale Methoden der Informatik”
Winter Term 2016/17 — Life Science Informatics, Lab Course: Programming Lab I (Python)


Publications

[1] Fast Multiplication of Large Integers: Implementation and Analysis of the DKSS Algorithm, Diploma thesis, Universität Bonn, 2014
[2] Implementation of the DKSS Algorithm for Multiplication of Large Numbers, ISSAC 2015 — Proceedings of the 2015 ACM on International Symposium on Symbolic and Algebraic Computation, 2015, 267-274

Leave a Reply