Back to Results
First PageMeta Content
Computational complexity theory / Finite model theory / Circuit complexity / Clique problem / Clique / Wilhelm Ackermann / Logic / Switching lemma / Descriptive complexity theory / Theoretical computer science / Mathematics / Applied mathematics


The Ackermann Award 2011 Report of the Jury The seventh Ackermann Award will be presented at this CSL’11, held in Bergen, Norway. This is the fifth year the EACSL Ackermann Award is generously sponsored. Our sponsor f
Add to Reading List

Document Date: 2013-12-08 17:58:05

Open Document

File Size: 265,18 KB

Share Result on Facebook

City

Bergen / Barcelona / Warsaw / Paris / Oxford / Haifa / Cambridge / Beijing / Aachen / Lausanne / Vienna / /

Company

Dagstuhl Publishing / /

Continent

North America / Europe / South America / /

Country

Taiwan / Germany / Romania / Netherlands / Sweden / Poland / Norway / France / Russia / United States / Australia / United Kingdom / China / Israel / Spain / India / /

Facility

Tokyo Institute of Technology / Massachusetts Institute of Technology / University of Pennsylvania / /

IndustryTerm

combinatorial tools / travel support / analytical tool / /

Organization

National Science Foundation / the University of Pennsylvania / Massachusetts Institute of Technology / EACSL Board / European Association of Computer Science Logic / Tokyo Institute of Technology / Jury for the Ackermann / Kurt Gödel Society / /

Person

Benjamin Rossman / Dietmar Berwanger / Anuj Dawar / Wilhelm Ackermann / Damian Niwinski / Marc Bezem / Ting Zhang / Jakob Nordström / Johann A. Makowsky / Nathan Segerlind / Konstantin Korovin / Neil Immerman / Stefan Milius / Stéphane Lengrand / /

Position

non-voting coordinator / Editor / Vice-president / President / member of the LICS organizing committee / Secretary / president and the vice-president / officio / representative / /

ProvinceOrState

Pennsylvania / Massachusetts / /

PublishedMedium

the CSL proceedings / /

URL

http /

SocialTag