Home
Hasso-Plattner-Institut
Hasso-Plattner-Institut
Prof. Dr. Tobias Friedrich
 

schließen

schließen

schließen

schließen

schließen

schließen

schließen

schließen
  1. People

Janosch Ruff

Chair for Algorithm Engineering
Hasso Plattner Institute

Office K-2.19/20

E-Mail: Janosch.Ruff(at)hpi.de

Research Interest

I am interested in Theoretical Computer Science and algortihms. My current focus lies on the structures that are emerging in real world networks.
Thus, I am drawn towards analyzing patterns that occur in seemingly random (graph) structures in order to explain why simple heuristics perform well to solve computationally hard problems.
On the flip side, I am guided by models such as Hyperbolic Random Graphs to exploit its properties for an efficient algorithm design on realistic graph theory models.

I particular like to work with techniques involving probability theory and the power of randomness:

  • Randomized Algorithms
  • Probabilistic Method
  • Incompressibility Method
  • Information Theory
  • Combinatorics

Education

Since 2021Ph.D. student at the chair for Algorithm Engineering, HPI Potsdam 
2017 - 2021Master of Science in Computer Science (minor studies in Neuroscience)
University of Göttingen, Göttingen
Thesis: “Kolmogorov Complexity, Recursive Enumerations and Universal Probability”
2012 - 2017Bachelor of Science in Business Information Systems
University of Göttingen, Göttingen
Thesis: “Development of a Gateway for Protocol Translation in IoT with ICN”
Spring 2015Exchange Semester at UPAEP, Puebla, Mexico

 

 

Teaching

As a Lecturer

As a Teaching Assistant

As a Tutor

Other Activities

During my studies I made extensive use of academic freedom and offers made by my university to study one semester abroad in Mexico and to travel for half a year in South America. During my Masters I did two internships in Iran and Brasil each two months. 

Besides Computer Science and Mathematics, I am very much interested in foreign languages. Next to English & German I speak fluently Spanish & Portuguese. I also have basic knowledge in French & Italian what I am interested to improve within the near future.

I very much enjoy classical music and to play the piano particularly Chopin. 

Algorithm Engineering

Our research focus is on theoretical computer science and algorithm engineering. We are equally interested in the mathematical foundations of algorithms and developing efficient algorithms in practice. A special focus is on random structures and methods.

News

23.01.2023 | PhD awarded to Maximilian Katzmann

Last week, Maximilian Katzmann successfully defended his dissertation titled About the Analysis of Algorithms on … > Zum Artikel

13.12.2022 | Three Papers accepted at AAAI

We are proud to announce that three papers of our group members were accepted at the Thirty-Seventh AAAI Conference on … > Zum Artikel

01.12.2022 | Two HPI student teams successfully participate in NWERC 2022

The Northwestern Europe Regional Contest 2022 (NWERC), an official regional contest in the ACM International Collegiate … > Zum Artikel

02.11.2022 | Four Papers accepted at SODA, ALENEX and HPEC

The Algorithm Engineering group is proud to contribute a paper to the Symposium on Discrete Algorithms (SODA) which will … > Zum Artikel

23.09.2022 | HPI team secures third spot at PACE challenge

In the international Parameterized Algorithms and Computational Experiments (PACE) challenge, teams are tasked to solve … > Zum Artikel

20.09.2022 | Best paper and poster award at PPSN

Researchers of the Algorithm Engineering group contributed to the paper Escaping Local Optima with Local Search that won … > Zum Artikel

Contact

Prof. Dr. Tobias Friedrich
Algorithm Engineering
Office: K-2.15
E-Mail: friedrich(at)hpi.de

 

Assistant: Katrin Heinrich
Raum: C-2.11/K-2.12
Tel.: +49 331 5509-180
Fax: +49 331 5509-189
E-Mail: office-friedrich(at)hpi.de

 

To visit us, please see these directions.

Apply

We are accepting applications for Ph.D. and post-doc positions from exceptional candidates.

 

More details on what we can offer