1. The Ackermann Award 2010 - Call for Nominations
2. The Ackermann Award 2009 - report of winner
================================================================
1. (from Johann Makowsky) The Ackermann Award 2010 - Call for Nominations
ACKERMANN AWARD 2010 - THE EACSL OUTSTANDING DISSERTATION AWARD FOR
LOGIC IN COMPUTER SCIENCE
CALL FOR NOMINATIONS
* Eligible for the 2010 Ackermann Award are PhD dissertations in topics
specified by the EACSL and LICS conferences, which were formally
accepted as PhD theses at a university or equivalent institution
between 1.1.2008 and 31.12. 2009.
* Submission details are available at
http://www.eacsl.org/submissionsAck.html
* The deadline for submission is
March 15, 2010
Nominations can be submitted from January 1, 2010 on and should be sent
to the chairman of the Jury by e-mail:
[email protected]
* The award consists of
- a diploma,
- an invitation to present the thesis at the CSL conference,
- the publication of the abstract of the thesis and the laudation
in the CSL proceedings,
- travel support to attend the conference.
* The 2010 Ackermann Award will be presented to the recipients at the
annual conference of the EACSL (CSL'10) in Brno (Czech Republic)
to be held 23-27 August 2010,
http://mfcsl2010.fi.muni.cz/
* The jury consists of 10 members:
- The member of the board of EACSL as chairman of the Jury,
J. Makowsky (Haifa)
- The president of EACSL, D. Niwinski (Warsaw)
- The vice-president of EACSL, A. Dawar (Cambridge)
- One member of the LICS organizing committee, G. Plotkin (Edinburgh)
- R. Alur (Philadelphia)
- A. Atserias (Barcelona)
- T. Coquand (Goeteborg)
- P.-L. Curien (Paris)
- A. Durand (Paris)
- J. van Benthem (Amsterdam and Stanford)
* The jury is entitled to give more than one award per year.
* The previous Ackermann Award recipients were:
2005: Mikolaj Bojanczyk, Konstantin Korovin, Nathan Segerlind;
2006: Stefan Milius and Balder ten Cate;
2007: Dietmar Berwanger, Stephane Lengrand and Ting Zhang.
2008: Krishnendu Chatterjee
2009: Jakob Nordstrom
* For the three years 2010-2012,
the Award is sponsored by the Kurt Goedel Society
================================================================
2. The Ackermann Award 2009 - report of winner
The fifth Ackermann Award, 2009 -------------------------------
The Ackermann Award 2009 was presented at CSL'09, held in Coimbra
(Portugal) in September 2009.
Jury report
-----------
Eligible for the 2009 Ackermann Award were PhD dissertations
in topics specified by the EACSL and LICS conferences,
which were formally accepted as PhD theses at a
university or equivalent institution between 1.1. 2007 and 31.12. 2008.
The Jury received 12 nominations for the Ackermann Award 2009.
The candidates came from 10
different nationalities from Europe, North America and Asia
and received their PhDs
in 9 different
countries in Europe and North America.
The topics covered the full range of Logic and Computer Science
as represented by the LICS and CSL Conferences.
All the submissions were of very high standard and contained
outstanding results in their particular domain.
In the past the Jury reached a consensus to give more than one award.
This time, in spite of the extreme high quality of the nominated theses,
the Jury decided finally, to give for the year 2009 only one award.
The 2009 Ackermann Award laureate is
Jakob Nordstrom
for his thesis
Short Proofs May Be Spacious:
Understanding Space in Resolution
issued by the Royal Institute of Technology, Stockholm, Sweden, May 2008,
supervised by Prof. Johan Hastad.
Citation
--------
Jakob Nordstrom receives the 2009 Ackermann Award
of the European Association of Computer Science Logic (EACSL)
for his thesis "Short Proofs May Be Spacious: Understanding Space in
Resolution". The thesis greatly advances our understanding of
space-related measures in proof complexity. It completely fills the
last remaining gap in the picture of most basic relations between
space and other fundamental complexity measures like length or width
for the system of propositional resolution. The result confirms that
space is indeed an inherently independent measure by exhibiting
natural contradictions possessing very short and narrow refutations
but no low-space refutation. This solution of a well-known open
problem complements and contrasts with
previously known simulations in the opposite direction.
Biographic Sketch
------------------
Karl Jakob Nordstrom was born April 11, 1972, in Sweden.
He currently is a postdoctoral fellow at the Massachusetts Institute
of Technology (MIT). He received his Master of Science in Computer
Science and Mathematics at Stockholm University in 2001, and his
PhD in Computer Science at the Royal Institute of Technology (KTH) in 2008,
while being a research assistant sponsored by the President of KTH.
In 2006 he received the best student paper award at
38th ACM Symposium on Theory of Computing (STOC'06).
1997-1998 he served as a military interpreter at the Swedish Armed
Forces Language Institute, where he graduated as the best student of
the 1998 class. He still works as an interpreter and translator
between Russian and Swedish/English, and was engaged as interpreter
for among others His Majesty the King of Sweden, the Prime Minister of
Sweden, the Speaker of the Swedish Parliament and the Supreme
Commander of the Swedish Armed Forces.
2001-2002 he was the Secretary of the Swedish Association of Military
Interpreters, and 2002-2005 served as its President.
In 1992 he received his Diploma in Choir Conducting with extended
Music Theory from
Tallinn Music Upper Secondary School, Estonia, and in 1994 he founded
the vocal ensemble Collegium Vocale Stockholm, which he led till 1999.
Throughout the 90s, the ensemble gave a number of concerts presenting mainly
Renaissance and Baroque music.
Previous Ackermann Laureates
----------------------------
2005: Mikolaj Bojanczyk, Konstantin Korovin, Nathan Segerlind;
2006: Stefan Milius and Balder ten Cate;
2007: Dietmar Berwanger, Stephane Lengrand and Ting Zhang.
2008: Krishnendu Chatterjee
More information is available at the EACSL websites
www.eacsl.org and www.eacsl.org/award.html
The Call for Nominations for the 2010 Ackermann award
can also be found there. The deadline is March, 15, 2010.
The 2009 Ackermann Award was sponsored by LOGITECH.
================================================================
_______________________________________________
Logica-l mailing list
[email protected]
http://www.dimap.ufrn.br/cgi-bin/mailman/listinfo/logica-l
