Homepage
Contact
Philip Wellnitz
Max Planck Institute for InformaticsDepartment 1: Algorithms and Complexity
| office: |
Campus E1 4,
Room 324 Saarland Informatics Campus 66123 Saarbrücken Germany |
| email: |
Get my email address via email |
Research Interests
- Fine-Grained Complexity Theory
- Parameterized Complexity Theory
- Strings and Grammar Formalisms
- ... and many more
Publications
| [2] |
"Few Matches or Almost Periodicity: Faster Pattern Matching with Mismatches in Compressed Texts" SODA'19: Proc. of the 30th Annual ACM-SIAM Symposium on Discrete Algorithms |
[1] |
"Clique-Based Lower Bounds for Parsing Tree-Adjoining Grammars" CPM'17: Proc. of the 28th Annual Symposium on Combinatorial Pattern Matching |
Code
- SOSML: An interpreter for SML running in your browser, try it at sosml.github.io
Written at Saarland University with Julian Baldus, Julian Dörfler, Jesko Dujmovic, Marvin Hofmann and Dominik Luche - Code of other projects is available on my GitHub profile
Teaching
- Winter 2017/18
Tutor/Assistant (Fine-Grained Complexity Theory)
- Winter 2016/17
Tutor (Algorithms and Data Structures)
Tutor (Grundzüge von Algorithmen und Datenstrukturen)
Education
- October 2018 - present:
Ph. D. student in Computer Science at Saarland University, Saarbrücken, Germany and the Max Planck Institute for Informatics
- April 2017 - present:
Member of the Saarbrücken Graduate School of Computer Science
- October 2015 - April 2017:
B.Sc. in Computer Science at Saarland University, Saarbrücken, Germany
- July 2015
Abitur at the Heinrich-Hertz-Gymnasium, Berlin, Germany