Presburger Award: Difference between revisions
Content deleted Content added
m Article has existed for over 30 days and has not been patrolled, marking as unreviewed. |
No edit summary |
||
| Line 1: | Line 1: | ||
{{New unreviewed article|bot=yes|date=June 2011}} |
|||
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 [[Mojzesz 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 |
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 [[Mojzesz 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 |
||
Revision as of 00:23, 18 October 2011
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 Mojzesz 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:
- Mikołaj Bojańczyk (2010)