Jump to content

Mikołaj Bojańczyk: Difference between revisions

From Wikipedia, the free encyclopedia
Browse history interactively
← Previous edit
Content deleted Content added
VisualWikitext
No edit summary
Modified infobox.
 
(One intermediate revision by one other user not shown)
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 =
Line 48: Line 48:
}}
}}


'''Mikołaj Bojańczyk''' (born 1977) is a Polish [[theoretical computer science|theoretical computer scientist]] and [[logic]]ian known for settling open problems on [[Tree walking automaton|tree walking automata]]<ref name="BojańczykColcombet2006">{{Cite journal|last1=Bojańczyk|first1=Mikołaj|last2=Colcombet|first2=Thomas|title=Tree-walking automata cannot be determinized|journal=[[Theoretical Computer Science (journal)|Theoretical Computer Science]]|language=en|volume=350|issue=2–3|pages=164–173|doi=10.1016/j.tcs.2005.10.031|year=2006|doi-access=free}}</ref><ref>{{Cite journal|last1=Bojańczyk|first1=M.|last2=Colcombet|first2=T.|date=2008-01-01|title=Tree-Walking Automata Do Not Recognize All Regular Languages|journal=[[SIAM Journal on Computing]]|volume=38|issue=2|pages=658–701|doi=10.1137/050645427|issn=0097-5397|citeseerx=10.1.1.100.7065}}</ref> jointly with [[Thomas Colcombet]], and for contributions to logic in automata theory.<ref name="BojańczykParys2011">{{Cite journal|last1=Bojańczyk|first1=Mikołaj|last2=Parys|first2=Paweł|date=2011-07-01|title=XPath Evaluation in Linear Time|journal=[[Journal of the ACM]]|volume=58|issue=4|pages=17:1–17:33|doi=10.1145/1989727.1989731|issn=0004-5411|citeseerx=10.1.1.217.4646|s2cid=47301339}}</ref><ref name="BojańczykMuscholl2009">{{Cite journal|last1=Bojańczyk|first1=Mikoaj|last2=Muscholl|first2=Anca|author2-link= Anca Muscholl |last3=Schwentick|first3=Thomas|last4=Segoufin|first4=Luc|date=2009-05-01|title=Two-variable Logic on Data Trees and XML Reasoning|journal=[[Journal of the ACM]]|volume=56|issue=3|pages=13:1–13:48|doi=10.1145/1516512.1516515|issn=0004-5411|citeseerx=10.1.1.157.4510|s2cid=52817406}}</ref> He is a professor at [[Warsaw University]].
'''Mikołaj Bojańczyk''' (born 1977) is a Polish [[theoretical computer science|theoretical computer scientist]] and [[logic]]ian known for settling open problems on [[Tree walking automaton|tree walking automata]]<ref name="BojańczykColcombet2006">{{Cite journal|last1=Bojańczyk|first1=Mikołaj|last2=Colcombet|first2=Thomas|title=Tree-walking automata cannot be determinized|journal=[[Theoretical Computer Science (journal)|Theoretical Computer Science]]|language=en|volume=350|issue=2–3|pages=164–173|doi=10.1016/j.tcs.2005.10.031|year=2006|doi-access=free}}</ref><ref>{{Cite journal|last1=Bojańczyk|first1=M.|last2=Colcombet|first2=T.|date=2008-01-01|title=Tree-Walking Automata Do Not Recognize All Regular Languages|journal=[[SIAM Journal on Computing]]|volume=38|issue=2|pages=658–701|doi=10.1137/050645427|issn=0097-5397|citeseerx=10.1.1.100.7065}}</ref> jointly with [[Thomas Colcombet]], and for contributions to logic in [[automata theory]].<ref name="BojańczykParys2011">{{Cite journal|last1=Bojańczyk|first1=Mikołaj|last2=Parys|first2=Paweł|date=2011-07-01|title=XPath Evaluation in Linear Time|journal=[[Journal of the ACM]]|volume=58|issue=4|pages=17:1–17:33|doi=10.1145/1989727.1989731|issn=0004-5411|citeseerx=10.1.1.217.4646|s2cid=47301339}}</ref><ref name="BojańczykMuscholl2009">{{Cite journal|last1=Bojańczyk|first1=Mikoaj|last2=Muscholl|first2=Anca|author2-link= Anca Muscholl |last3=Schwentick|first3=Thomas|last4=Segoufin|first4=Luc|date=2009-05-01|title=Two-variable Logic on Data Trees and XML Reasoning|journal=[[Journal of the ACM]]|volume=56|issue=3|pages=13:1–13:48|doi=10.1145/1516512.1516515|issn=0004-5411|citeseerx=10.1.1.157.4510|s2cid=52817406}}</ref> He is a professor at [[Warsaw University]].


==Biography==
==Biography==

Latest revision as of 17:21, 22 November 2024

Mikołaj Bojańczyk
Born (1977-06-08) June 8, 1977 (age 47)
Alma materWarsaw University
Known forTree walking automata
AwardsPresburger Award (2010)
Kuratowski Prize (2007)
Scientific career
Fields
Institutions
Doctoral advisorIgor Walukiewicz
Websitewww.mimuw.edu.pl/~bojan/

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]
  1. ^ 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.
  2. ^ 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.
  3. ^ 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.
  4. ^ 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.
  5. ^ "Presburger Award". European Association for Theoretical Computer Science. Retrieved March 27, 2017.
[edit]
Retrieved from "https://en.wikipedia.org/enwiki/w/index.php?title=Mikołaj_Bojańczyk&oldid=1258971147"