Florin Silviu ManeaView profile
Professor
Florin Silviu Manea is a Professor for Theoretical Computer Science at the Institute of Computer Science, University of Göttingen, Germany. He has held this W3-Professor position since 2022, funded by the Heisenberg programme of the DFG. Prior to this, he was a W2-Professor for Fundamentals of Computer Science at the same university (2019-2022). His academic career includes research positions at Kiel University (2011-2019) and an Alexander von Humboldt fellowship at the University of Magdeburg (2009-2011). Dr. Manea received his PhD in December 2007 from the University of Bucharest with the distinction Summa cum Laude. His PhD thesis was titled "Networks of bio-processors" and was supervised by Victor Mitrana. He also earned a Master of Science (2005) and Bachelor of Science in Computer Science (2003) from the University of Bucharest, both with perfect GPA scores of 10/10. Professor Manea's research focuses on the theoretical foundations of computer science, with particular emphasis on string algorithms and combinatorics. His work explores the intricate relationships between formal language theory, automata theory, and practical applications in string solving. He has made significant contributions to understanding pattern matching with variables, combinatorial properties of strings, and the computational aspects of word equations. His research bridges theoretical concepts with practical applications in areas like bioinformatics and programming language theory. Analysis of Professor Manea's recent publications reveals a strong focus on string algorithms, particularly in the areas of pattern matching, word equations, and combinatorics on words. His work often explores the computational complexity of string problems while developing efficient algorithms to solve them. A recurring theme is the investigation of repetitions, palindromes, and gapped structures in strings, with applications ranging from DNA sequence analysis to programming language design. His research demonstrates a consistent pattern of advancing both the theoretical understanding and practical applications of string algorithms. Professor Manea has received several prestigious awards for his contributions to computer science: Lehrpreis 2020 (Teaching Award) by CS-students from Göttingen The "Tudor Tanasescu" Prize of the Romanian Academy (2009) Honorable Mention at ACM International Collegiate Programming Contest World Finals (2004, 2007) As an advisor, Professor Manea has successfully supervised multiple PhD students to completion with highest honors, including Maria Kosche (2023), Stefan Siemer (2024), and Tore Koß (2024), all achieving Summa cum Laude distinctions. He currently leads a research group focused on theoretical computer science at the University of Göttingen. His research is supported by significant funding, including a DFG grant for "String Constraint Solving: Combinatorial, Algorithmic, and Language-Theoretic Approaches" and continued Heisenberg-programme funding until 2027 for his project "Combinatorial String Solving." Professor Manea leads the Theoretical Computer Science research group at the University of Göttingen, which focuses on string algorithms, combinatorics, and computational models. His group actively collaborates with researchers worldwide and has organized several major conferences including DLT 2024, NCMA 2024, and CSL 2022. The group offers supervision for BSc and MSc theses on both theoretical and applied topics related to their research areas.