Homepage

Alexander Kobel

Saarland Informatics Campus
Max-Planck-Institut für Informatik
Department 1: Algorithms and Complexity
Building E1.4, Room 327
66123 Saarbrücken
Germany

Email: Get my email address via email
Phone: +49 681 9325 1027
Fax: +49 681 9325 1099
I speak German, English and Saarlandian (mother tongue).

Research Interests

Computer Algebra
Algebraic Geometry
Numerical Computation
Computational Geometry and Visualization

Publications

Alexander Kobel, Fabrice Rouillier and Michael Sagraloff.
ABND real root solver, via RootFinding[Isolate].
In: Maple 2019, Waterloo Maple Inc., 2017 – 2018. (Introduction on the What's New in Maple 2019 page)
Alexander Kobel, Fabrice Rouillier and Michael Sagraloff.
Computing Real Roots of Real Polynomials … and now For Real!
In: Proceedings of the 41st International Symposium on Symbolic and Algebraic Computation (ISSAC), 2016, Waterloo, Ontario, Canada. ACM, 2016. (free-as-in-beer download through ACM Author-izer • DOI: 10.1145/2930889.2930937 • preprint on arXiv.org)
Additional resources: website with benchmarks and implementation • presentation in format 4:3, 16:9 & 16:10
Alexander Kobel and Michael Sagraloff.
On the complexity of computing with planar algebraic curves.
In: Journal of Complexity, 31 (2), pp. 206–236 (2015). (DOI: 10.1016/j.jco.2014.08.002 • preprint on arXiv.org)
Alexander Kobel and Michael Sagraloff.
Fast Approximate Polynomial Multipoint Evaluation and Applications.
2013. (on arXiv.org)
Eric Berberich, Pavel Emeliyanenko, Alexander Kobel and Michael Sagraloff.
Exact Symbolic-Numeric Computation of Planar Algebraic Curves.
In: Theoretical Computer Science, 491 (2013), pp. 1–32. (DOI: 10.1016/j.tcs.2013.04.014 • preprint on arXiv.org)
Eric Berberich, Pavel Emeliyanenko, Alexander Kobel and Michael Sagraloff.
Arrangement Computation for Planar Algebraic Curves.
In: Proceedings of the 4th International Workshop on Symbolic-Numeric Computation, San Jose, USA. ACM, 2011. (free-as-in-beer download through ACM Author-izer • DOI: 10.1145/2331684.2331698 • preprint on arXiv.org)
Alexander Kobel.
Certified Numerical Root Finding.
Master's thesis, University of Saarland, Saarbrücken, Germany. 2011. (Download as PDF)
Alexander Kobel.
Automated Generation of Kempe Linkages for Algebraic Curves in a Dynamic Geometry System.
Bachelor's thesis, University of Saarland, Saarbrücken, Germany. 2008. (Download as PDF)

Teaching

Teaching assistant:
- Lecture Computer Algebra
  winter term 2014/15, University of Saarland (Michael Sagraloff)
- Lecture Grundzüge Algorithmen und Datenstrukturen (Introduction to algorithms and data structures)
  winter term 2011/12, University of Saarland (Benjamin Doerr and Reto Spöhel)
- Lecture Computer Algebra
  summer term 2011, University of Saarland (Michael Sagraloff)
Tutoring:
- Lecture Grundbegriffe der Analysis aus historisch-genetischer Sicht (Foundations and history of calculus)
  winter term 2008/09 (Anselm Lambert)
- Lecture Kegelschnitte (Conic sections)
  summer term 2008 (Anselm Lambert)
- Lecture Mathematik für Informatiker I (Mathematics for computer scientists 1)
  winter term 2005/06 (Frank-Olaf Schreyer)

Education

July 2011 – present:
PhD student, Max-Planck-Institut für Informatik, Saarbrücken, Germany
October 2008 – February 2011:
Master of Science in informatics, University of Saarland, Saarbrücken, Germany
Topic of the Master’s thesis: Certified Numerical Root Finding
Supervisors: Kurt Mehlhorn, Michael Sagraloff
October 2003 – September 2008:
Bachelor of Science in informatics, University of Saarland, Saarbrücken, Germany
Topic of the Bachelor’s thesis: Automated Generation of Kempe Linkages for Algebraic Curves in a Dynamic Geometry System
Supervisors: Frank-Olaf Schreyer, Oliver Labs
October 2003 – October 2007:
Vordiplom (intermediate diploma) in mathematics, University of Saarland, Saarbrücken, Germany
June 2003:
Abitur (academic high school diploma), Gymnasium Johanneum, Homburg/Saar, Germany