Mikołaj Bojańczyk
Appearance
Mikołaj Bojańczyk | |
---|---|
Born | June 8, 1977 |
Alma mater | Warsaw University |
Known for | tree walking automata |
Awards | Presburger award |
Scientific career | |
Fields | Automata theory Logic in computer science |
Institutions | Warsaw University |
Doctoral advisor | Igor Walukiewicz |
Mikołaj Bojańczyk (born 1977) is a Polish theoretical computer scientist and logician known for settling major open problems on tree walking automata[1][2] jointly with Thomas Colcombet, and for numerous contributions to logic in automata theory.[3][4] He is currently a professor at Warsaw University.
Biography
Bojańczyk earned his doctorate from Warsaw University in 2004. In 2004-2005 he spent a year in Paris Diderot University. He got his habilitation from Warsaw University in 2008 and is a full professor there since 2014.
Bojańczyk became the first recepient of Presburger Award in 2010.[5]
References
- ^ Bojańczyk, Mikołaj; Colcombet, Thomas (2006). "Tree-walking automata cannot be determinized". Theoretical Computer Science. 350 (2–3): 164–173. doi:10.1016/j.tcs.2005.10.031. ISSN 0304-3975.
- ^ Bojańczyk, MikoŁaj; Colcombet, Thomas (2008). "Tree-Walking Automata Do Not Recognize All Regular Languages". SIAM Journal on Computing. 38 (2): 658–701. doi:10.1137/050645427. ISSN 0097-5397.
- ^ Bojańczyk, Mikołaj; Parys, Paweł (2011). "XPath evaluation in linear time". Journal of the ACM. 58 (4): 1–33. doi:10.1145/1989727.1989731. ISSN 0004-5411.
- ^ Bojańczyk, Mikoaj; Muscholl, Anca; Schwentick, Thomas; Segoufin, Luc (2009). "Two-variable logic on data trees and XML reasoning". Journal of the ACM. 56 (3): 1–48. doi:10.1145/1516512.1516515. ISSN 0004-5411.
- ^ https://www.eatcs.org/index.php/presburger
External links
- Mikołaj Bojańczyk at the Mathematics Genealogy Project
- Mikołaj Bojańczyk at DBLP Bibliography Server
- Mikołaj Bojańczyk's home page