معرفی
Mikołaj Bojańczyk is a Professor at the Institute of Informatics, Faculty of Mathematics, Informatics and Mechanics, University of Warsaw. He has been affiliated with the University of Warsaw since his undergraduate studies, with brief periods at institutions in Bordeaux and Paris (2004-2005). He received his PhD in 2004 under Igor Walukiewicz, completed his habilitation in 2008, and was promoted to full professor in 2014.
Professor Bojańczyk's research lies at the intersection of theoretical computer science and mathematical logic, with a strong emphasis on automata theory. His work spans several interconnected domains: formal language theory, algebraic approaches to language recognition, monadic second-order logic and its extensions, polyregular functions, and the theory of atoms for handling infinite alphabets. He has made significant contributions to understanding the connections between logic and automata for various structures including words, trees, graphs, and data words. His research has particularly focused on characterizing logical definability through algebraic means, developing new automata models for complex structures, and exploring the boundaries of decidability for various logical formalisms.
Analysis of his recent publications reveals a continued focus on polyregular functions, MSO transductions, and the theory of atoms. His work demonstrates a consistent pattern of connecting category-theoretic approaches with concrete automata models, often bridging abstract mathematical concepts with practical computational frameworks. A notable trend is his exploration of rank-based approaches in logic and graph theory, as well as deepening connections between algebraic structures and logical definability.
- Salomaa Prize (2024)
- PODS Test of Time Award (2016)
- PODS Best Paper (2013)
- Presburger Award (2010)
- Kuratowski Award (2007)
- Lipski Prize (2006)
- PODS Best Paper (2006)
- Ackermann Award (2005)
- ICALP Best Paper (2004)
Professor Bojańczyk has successfully supervised numerous PhD students to completion, including Rafał Stefański (2023), Janusz Schmude (2022), and others dating back to Paweł Parys (2011). He currently supervises four ongoing PhD projects with Kacper Lewandowski, Katzper Michno, Antoni Puch, and Omid Yaghoubi. His grant portfolio demonstrates sustained research leadership, including the current NCN Maestro grant "Polynomial finite-state computation" (2023-2028), previous ERC Consolidator Grant "Lipa" (2016-2021), and ERC Starting Grant "Sosna" (2009-2014). He has also been active in academic service, serving on prestigious committees including the Gödel Prize Committee (2024-2026) and the Presburger Award Committee (2021-2023).
Professor Bojańczyk has been instrumental in developing the "atoms" research program at the University of Warsaw, which has its own blog and book. This theoretical framework addresses computation with infinite alphabets through the lens of nominal sets and orbit-finite structures. He has also created educational resources including the "Automata Toolbox" lecture notes and the "Slajdomat" slide software for creating zooming presentations in Figma.
