Jump to content

Presburger Award: Difference between revisions

From Wikipedia, the free encyclopedia
Content deleted Content added
redlinks
added info to sources
 
(4 intermediate revisions by 4 users not shown)
Line 1: Line 1:
{{Short description|Annual award in theoretical computer science}}
{{Primary sources|date=August 2020}}
{{Primary sources|date=August 2020}}
The '''Presburger Award''', started in 2010, is awarded each year by the [[European Association for Theoretical Computer Science]] (EATCS) to "a young scientist for outstanding contributions in theoretical computer science, documented by a published paper or a series of published papers." The award is named after [[Mojżesz Presburger]] who accomplished his path-breaking work on [[decidability (logic)|decidability]] of the theory of addition (which today is called [[Presburger arithmetic]]) as a student in 1929.
The '''Presburger Award''', started in 2010, is awarded each year by the [[European Association for Theoretical Computer Science]] (EATCS) to "a young scientist for outstanding contributions in theoretical computer science, documented by a published paper or a series of published papers." The award is named after [[Mojżesz Presburger]], who accomplished his path-breaking work on [[decidability (logic)|decidability]] of the theory of addition (which today is called [[Presburger arithmetic]]) as a student in 1929.




Past recipients of the award are:
Past recipients of the award are:
Line 9: Line 8:
* [[Patricia Bouyer-Decitre]] (2011)<ref name="eatcs"/>
* [[Patricia Bouyer-Decitre]] (2011)<ref name="eatcs"/>
* [[Venkatesan Guruswami]] and [[Mihai Pătrașcu (computer scientist)|Mihai Pătraşcu]] (2012)<ref>{{cite web| url=http://eatcs.org/index.php/component/content/article/1-news/1243-presburger-award-2012| title=Presburger Award 2012, EATCS| accessdate=2012-04-23}}</ref>
* [[Venkatesan Guruswami]] and [[Mihai Pătrașcu (computer scientist)|Mihai Pătraşcu]] (2012)<ref>{{cite web| url=http://eatcs.org/index.php/component/content/article/1-news/1243-presburger-award-2012| title=Presburger Award 2012, EATCS| accessdate=2012-04-23}}</ref>
* [[Erik Demaine]] (2013) <ref>{{cite web| url=http://www.eatcs.org/index.php/component/content/article/1-news/1512-presburger-award-2013 | title=Presburger Award 2013, EATCS |accessdate=2013-02-15}}</ref>
* [[Erik Demaine]] (2013)<ref>{{cite web| url=http://www.eatcs.org/index.php/component/content/article/1-news/1512-presburger-award-2013 | title=Presburger Award 2013, EATCS |accessdate=2013-02-15}}</ref>
* [[David P. Woodruff (computer scientist)|David Woodruff]] (2014) <ref>{{cite web| url=http://www.eatcs.org/index.php/component/content/article/1-news/1866-presburger-award-2014 | title=Presburger Award 2014, EATCS |accessdate=2014-03-08}}</ref>
* [[David P. Woodruff (computer scientist)|David Woodruff]] (2014)<ref>{{cite web| url=http://www.eatcs.org/index.php/component/content/article/1-news/1866-presburger-award-2014 | title=Presburger Award 2014, EATCS |accessdate=2014-03-08}}</ref>
* [[Xi Chen]] (2015)
* [[Xi Chen]] (2015)
* [[Mark Braverman (mathematician)|Mark Braverman]] (2016)
* [[Mark Braverman (mathematician)|Mark Braverman]] (2016)
Line 21: Line 20:
* [[Dor Minzer]] (2022)<ref>{{cite web |url=https://eatcs.org/index.php/component/content/article/1-news/2914-presburger-award-2022-laudatio-for-dor-minzer|title=Presburger Award 2022 – Laudatio for Dor Minzer|publisher=European Association for Theoretical Computer Science|accessdate=2022-07-14
* [[Dor Minzer]] (2022)<ref>{{cite web |url=https://eatcs.org/index.php/component/content/article/1-news/2914-presburger-award-2022-laudatio-for-dor-minzer|title=Presburger Award 2022 – Laudatio for Dor Minzer|publisher=European Association for Theoretical Computer Science|accessdate=2022-07-14
}}</ref>
}}</ref>
* Aaron Bernstein and Thatchaphol Saranurak (2023)<ref>{{cite web |title=Presburger Award 2023 |url=https://www.eatcs.org/index.php/component/content/article/1-news/2946-2023-05-31-15-12-13 |accessdate=2024-07-01 |website=eatcs.org |publisher=European Association for Theoretical Computer Science}}</ref>

* [[Justin Hsu]] and [[Pravesh Kothari]] (2024)<ref>{{cite web |title=Presburger Award 2024 – Laudatio |url=https://eatcs.org/index.php/component/content/article/1-news/2983-presburger-award-2024-laudatio |accessdate=2024-07-01 |website=eatcs.org |publisher=European Association for Theoretical Computer Science}}</ref>

== See also ==
== See also ==



Latest revision as of 15:45, 13 October 2024

The Presburger Award, started in 2010, is awarded each year by the European Association for Theoretical Computer Science (EATCS) to "a young scientist for outstanding contributions in theoretical computer science, documented by a published paper or a series of published papers." The award is named after Mojżesz Presburger, who accomplished his path-breaking work on decidability of the theory of addition (which today is called Presburger arithmetic) as a student in 1929.

Past recipients of the award are:

See also

[edit]

References

[edit]
  1. ^ a b "Presburger Award, EATCS". Retrieved 2012-04-23.
  2. ^ "Presburger Award 2012, EATCS". Retrieved 2012-04-23.
  3. ^ "Presburger Award 2013, EATCS". Retrieved 2013-02-15.
  4. ^ "Presburger Award 2014, EATCS". Retrieved 2014-03-08.
  5. ^ "Presburger Award 2019 Laudatio, EATCS".
  6. ^ "The EATCS bestows the Presburger Award 2020 on Dmitriy Zhuk". European Association for Theoretical Computer Science. Retrieved 2020-06-26.
  7. ^ "Presburger Award 2021 – Laudatio for Shayan Oveis Gharan". European Association for Theoretical Computer Science. Retrieved 2021-05-18.
  8. ^ "Presburger Award 2022 – Laudatio for Dor Minzer". European Association for Theoretical Computer Science. Retrieved 2022-07-14.
  9. ^ "Presburger Award 2023". eatcs.org. European Association for Theoretical Computer Science. Retrieved 2024-07-01.
  10. ^ "Presburger Award 2024 – Laudatio". eatcs.org. European Association for Theoretical Computer Science. Retrieved 2024-07-01.