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
m Importing Wikidata short description: "Polish theoretical computer scientist and logician" (Shortdesc helper)
Modified infobox.
 
(5 intermediate revisions by 4 users not shown)
Line 1: Line 1:
{{Short description|Polish theoretical computer scientist and logician}}
{{Short description|Polish theoretical computer scientist and logician}}
{{Infobox scientist
{{Infobox scientist
| honorific_prefix =
| honorific_prefix =
| name = Mikołaj Bojańczyk
| name = Mikołaj Bojańczyk
| honorific_suffix =
| honorific_suffix =
| native_name =
| native_name =
| native_name_lang =
| native_name_lang =
| image = <!--(filename only, i.e. without "File:" prefix)-->
| image = <!--(filename only, i.e. without "File:" prefix)-->
| image_size =
| image_size =
| image_upright =
| image_upright =
| alt =
| alt =
| caption =
| caption =
| birth_date = {{birth date and age|1977|6|8}}
| birth_date = {{birth date and age|1977|6|8}}
| birth_place =
| birth_place =
| death_date = <!--{{death date and age |YYYY|MM|DD |YYYY|MM|DD}} (death date then birth date)-->
| death_date = <!--{{death date and age |YYYY|MM|DD |YYYY|MM|DD}} (death date then birth date)-->
| death_place =
| death_place =
| death_cause =
| death_cause =
| resting_place =
| resting_place =
| resting_place_coordinates = <!--{{coord|LAT|LONG|type:landmark|display=inline,title}}-->
| resting_place_coordinates = <!--{{coord|LAT|LONG|type:landmark|display=inline,title}}-->
| other_names =
| other_names =
| residence = [[Poland]]
| citizenship =
| citizenship =
| nationality =
| fields = {{unbulleted list|[[Automata theory]]|[[Logic in computer science]]}}
| nationality =
| fields = {{unbulleted list|[[Automata theory]]|[[Logic in computer science]]}}
| workplaces = {{unbulleted list|[[Warsaw University]]}}
| workplaces = {{unbulleted list|[[Warsaw University]]}}
| patrons =
| patrons =
| education =
| education =
| alma_mater = [[Warsaw University]]
⚫
| thesis_title = <!--(or | thesis1_title = and | thesis2_title = )-->
| alma_mater = [[Warsaw University]]
| thesis_title = <!--(or | thesis1_title = and | thesis2_title = )-->
| thesis_url = <!--(or | thesis1_url = and | thesis2_url = )-->
| thesis_url = <!--(or | thesis1_url = and | thesis2_url = )-->
| thesis_year = <!--(or | thesis1_year = and | thesis2_year = )-->
⚫
| doctoral_advisor = [[Igor Walukiewicz]]
⚫
| thesis_year = <!--(or | thesis1_year = and | thesis2_year = )-->
⚫
| academic_advisors =
⚫
| doctoral_advisor = [[Igor Walukiewicz]]
⚫
| doctoral_students =
⚫
| academic_advisors =
⚫
| notable_students =
⚫
| doctoral_students =
| known_for = [[Tree walking automaton|Tree walking automata]]
⚫
| notable_students =
| known_for = [[Tree walking automaton|Tree walking automata]]
| influences =
| influences =
| influenced =
| awards = [[Presburger Award]] (2010)<br/>[[Kuratowski Prize]] (2007)
| influenced =
| awards = [[Presburger Award]]
| author_abbrev_bot =
⚫
| author_abbrev_zoo =
| author_abbrev_bot =
| spouse = <!--(or | spouses = )-->
⚫
| author_abbrev_zoo =
| spouse = <!--(or | spouses = )-->
| partner = <!--(or | partners = )-->
| partner = <!--(or | partners = )-->
| children =
| children =
| signature = <!--(filename only)-->
| signature = <!--(filename only)-->
| signature_alt =
| website = {{URL|https://www.mimuw.edu.pl/~bojan/}}
| signature_alt =
| website = {{URL|https://www.mimuw.edu.pl/~bojan/}}
| footnotes =
| footnotes =
}}
}}


'''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|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=J. 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=J. 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==
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.<ref>{{Cite web|url=https://www.eatcs.org/index.php/presburger|title=Presburger Award|website=European Association for Theoretical Computer Science|access-date=March 27, 2017}}</ref>
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.<ref>{{Cite web|url=https://www.eatcs.org/index.php/presburger|title=Presburger Award|website=European Association for Theoretical Computer Science|access-date=March 27, 2017}}</ref>


==References==
==References==
Line 71: Line 70:
{{DEFAULTSORT:Bojanczyk, Mikolaj}}
{{DEFAULTSORT:Bojanczyk, Mikolaj}}
[[Category:Polish computer scientists]]
[[Category:Polish computer scientists]]
[[Category:University of Warsaw faculty]]
[[Category:Academic staff of the University of Warsaw]]
[[Category:University of Warsaw alumni]]
[[Category:University of Warsaw alumni]]
[[Category:1977 births]]
[[Category:1977 births]]

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"