Jump to content

Mikołaj Bojańczyk: Difference between revisions

From Wikipedia, the free encyclopedia
Browse history interactively
Content deleted Content added
VisualWikitext
←Created page with '{{Infobox scientist |name = Mikołaj Bojańczyk |birth_date = {{Birth date and age|1977|6|8}} |birth_place = |residence = {{flag|Poland}} |death_date = |deat...'
 
Modified infobox.
 
(26 intermediate revisions by 19 users not shown)
Line 1: Line 1:
{{Short description|Polish theoretical computer scientist and logician}}
{{Infobox scientist
{{Infobox scientist
⚫
|name = Mikołaj Bojańczyk
| honorific_prefix =
⚫
|birth_date = {{Birth date and age|1977|6|8}}
| name = Mikołaj Bojańczyk
⚫
|birth_place =
| honorific_suffix =
|residence = {{flag|Poland}}
| native_name =
|death_date =
| native_name_lang =
⚫
|death_place =
| image = <!--(filename only, i.e. without "File:" prefix)-->
⚫
|field = [[Automata theory]] <br> [[Logic in computer science]]
| image_size =
⚫
|work_institution = [[Warsaw University]]
| image_upright =
|alma_mater = [[Warsaw University]]
| alt =
⚫
|doctoral_advisor = [[Igor Walukiewicz]]
| caption =
⚫
|known_for = [[Tree walking automaton|tree walking automata]]
⚫
| birth_date = {{birth date and age|1977|6|8}}
|prizes = [[Presburger award]]
⚫
| birth_place =
|religion =
| death_date = <!--{{death date and age |YYYY|MM|DD |YYYY|MM|DD}} (death date then birth date)-->
⚫
|footnotes =
⚫
| death_place =
| death_cause =
| resting_place =
| resting_place_coordinates = <!--{{coord|LAT|LONG|type:landmark|display=inline,title}}-->
| other_names =
| citizenship =
| nationality =
⚫
| fields = {{unbulleted list|[[Automata theory]]|[[Logic in computer science]]}}
| workplaces = {{unbulleted list|[[Warsaw University]]}}
| patrons =
| education =
⚫
| alma_mater = [[Warsaw University]]
| thesis_title = <!--(or | thesis1_title = and | thesis2_title = )-->
| thesis_url = <!--(or | thesis1_url = and | thesis2_url = )-->
| thesis_year = <!--(or | thesis1_year = and | thesis2_year = )-->
⚫
| doctoral_advisor = [[Igor Walukiewicz]]
| academic_advisors =
| doctoral_students =
| notable_students =
⚫
| known_for = [[Tree walking automaton|Tree walking automata]]
| influences =
| influenced =
| awards = [[Presburger Award]] (2010)<br/>[[Kuratowski Prize]] (2007)
| author_abbrev_bot =
| author_abbrev_zoo =
| spouse = <!--(or | spouses = )-->
| partner = <!--(or | partners = )-->
| children =
| signature = <!--(filename only)-->
| signature_alt =
| website = {{URL|https://www.mimuw.edu.pl/~bojan/}}
⚫
| footnotes =
}}
}}
⚫
Mikołaj Bojańczyk (born 1977) is a [[Poland|Polish]] [[theoretical computer science|theoretical computer scientist]] and [[logic|logician]] known for settling major 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|volume=350|issue=2-3|year=2006|pages=164–173|issn=03043975|doi=10.1016/j.tcs.2005.10.031}}</ref><ref name="BojańczykColcombet2008">{{cite journal|last1=Bojańczyk|first1=MikoŁaj|last2=Colcombet|first2=Thomas|title=Tree-Walking Automata Do Not Recognize All Regular Languages|journal=SIAM Journal on Computing|volume=38|issue=2|year=2008|pages=658–701|issn=0097-5397|doi=10.1137/050645427}}</ref> jointly with [[Thomas Colcombet]], and for numerous contributions to logic in automata theory.<ref name="BojańczykParys2011">{{cite journal|last1=Bojańczyk|first1=Mikołaj|last2=Parys|first2=Paweł|title=XPath evaluation in linear time|journal=Journal of the ACM|volume=58|issue=4|year=2011|pages=1–33|issn=00045411|doi=10.1145/1989727.1989731}}</ref><ref name="BojańczykMuscholl2009">{{cite journal|last1=Bojańczyk|first1=Mikoaj|last2=Muscholl|first2=Anca|last3=Schwentick|first3=Thomas|last4=Segoufin|first4=Luc|title=Two-variable logic on data trees and XML reasoning|journal=Journal of the ACM|volume=56|issue=3|year=2009|pages=1–48|issn=00045411|doi=10.1145/1516512.1516515}}</ref> He is currently 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 in [[Paris Diderot University]]. He got his habilitation from [[Warsaw University]] in 2008 and is a full professor there since 2014.
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 became the first recepient of [[Presburger Award]] in 2010.<ref>https://www.eatcs.org/index.php/presburger</ref>



==References==
==References==
{{Reflist}}
{{reflist}}


==External links==
==External links==
* {{MathGenealogy|id=94494}}
* {{Official website}}
* {{Google Scholar id|name=Mikołaj Bojańczyk}}
* {{DBLP|id=Bojanczyk:Mikolaj}}
* {{DBLP|name=Mikolaj Bojanczyk}}
* [https://www.mimuw.edu.pl/~bojan/ Mikołaj Bojańczyk's home page]
⚫
* {{ACM Portal|name=Mikołaj Bojańczyk}}
* {{zbMATH|name=Bojańczyk, Mikołaj}}
* {{MathGenealogy|name=Mikolaj Bojanczyk}}


{{Presburger winners}}
{{Presburger winners}}

{{Authority control}}


{{DEFAULTSORT:Bojanczyk, Mikolaj}}
{{DEFAULTSORT:Bojanczyk, Mikolaj}}
[[Category:Polish computer scientists]]
[[Category:Polish computer scientists]]
[[Category:Warsaw university faculty]]
[[Category:Academic staff of the University of Warsaw]]
[[Category:Warsaw university alumni]]
[[Category:University of Warsaw alumni]]
[[Category:People from Warsaw]]
[[Category:1977 births]]
[[Category:1977 births]]
[[Category:Living people]]
[[Category:Living people]]

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"