Mikołaj Bojańczyk: Difference between revisions
Content deleted Content added
No edit summary |
Modified infobox. |
||
| Line 36: | Line 36: | ||
| influences = |
| influences = |
||
| influenced = |
| influenced = |
||
| awards = [[Presburger Award]] |
| awards = [[Presburger Award]] (2010)<br/>[[Kuratowski Prize]] (2007) |
||
| author_abbrev_bot = |
| author_abbrev_bot = |
||
| author_abbrev_zoo = |
| author_abbrev_zoo = |
||
Latest revision as of 17:21, 22 November 2024
Mikołaj Bojańczyk | |
|---|---|
| Born | June 8, 1977 |
| Alma mater | Warsaw University |
| Known for | Tree walking automata |
| Awards | Presburger Award (2010) Kuratowski Prize (2007) |
| Scientific career | |
| Fields | |
| Institutions | |
| Doctoral advisor | Igor Walukiewicz |
| Website | www |
Mikołaj Bojańczyk (born 1977) is a Polish theoretical computer scientist and logician known for settling open problems on tree walking automata[1][2] jointly with Thomas Colcombet, and for contributions to logic in automata theory.[3][4] He is a professor at Warsaw University.
Biography
[edit]Bojańczyk earned his doctorate from Warsaw University in 2004. In 2004–2005, he spent a year at Paris Diderot University. He got his habilitation from Warsaw University in 2008 and has been a full professor there since 2014. Bojańczyk became the first recipient of the Presburger Award in 2010.[5]
References
[edit]- ^ 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.
- ^ Bojańczyk, M.; Colcombet, T. (2008-01-01). "Tree-Walking Automata Do Not Recognize All Regular Languages". SIAM Journal on Computing. 38 (2): 658–701. CiteSeerX 10.1.1.100.7065. doi:10.1137/050645427. ISSN 0097-5397.
- ^ Bojańczyk, Mikołaj; Parys, Paweł (2011-07-01). "XPath Evaluation in Linear Time". Journal of the ACM. 58 (4): 17:1–17:33. CiteSeerX 10.1.1.217.4646. doi:10.1145/1989727.1989731. ISSN 0004-5411. S2CID 47301339.
- ^ Bojańczyk, Mikoaj; Muscholl, Anca; Schwentick, Thomas; Segoufin, Luc (2009-05-01). "Two-variable Logic on Data Trees and XML Reasoning". Journal of the ACM. 56 (3): 13:1–13:48. CiteSeerX 10.1.1.157.4510. doi:10.1145/1516512.1516515. ISSN 0004-5411. S2CID 52817406.
- ^ "Presburger Award". European Association for Theoretical Computer Science. Retrieved March 27, 2017.
External links
[edit]- Official website
- Mikołaj Bojańczyk publications indexed by Google Scholar
- Mikolaj Bojanczyk at DBLP Bibliography Server
- Mikołaj Bojańczyk author profile page at the ACM Digital Library
- Bojańczyk, Mikołaj at zbMATH
- Mikolaj Bojanczyk at the Mathematics Genealogy Project