Grant: Discovery Grants Program - Individual
University of Toronto
$56,000.00
Complexicity theory, algorithms and applications
EF 2011-12
Résumé
My current and future research covers a broad range of topics in Theoretical Computer Science as well as applications to Economics and Medicine. My primary area of theoretical research is complexity theory, which explores the amount of computational resources required to perform various tasks. Complexity theory complements algorithm design in mapping out the limitations of computational techniques. I have resolved several long-standing open problems in that area. I am also planning to continue my program on understanding the role computability plays in real-life physical systems by making further progress on the Computability in Dynamics program I have initiated during my PhD studies.
In conjunction with theoretical work, I am also pursuing several applied directions. For example, I am planning to continue my current work on algorithmic mechanism design. Algorithmic mechanism design studies how algorithms and other techniques from Computer Science can help us solve problems that are classically considered to lie within the realm of Economics, such as achieving better resource allocation in complex environments. I am also planning to continue my current work on applying algorithmic techniques to prediction and recommendation systems in medical settings.
Programme
Discovery Grants Program - Individual
Bénéficiaire
Emplacement
Ontario, Canada
Type de bénéficiaire
Academia
Type
Grant
Source
NSERC's Awards Data
Tel que publié
Application id
386548-2010
Name nom
Braverman, Mark
Department département
Computer Science
Organization id
31
Institution établissement
University of Toronto
Province en
Ontario
Province fr
Ontario
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2011
Competition year année de concours
2010
Award amount
56000
Program id
RGPIN
Program nane en
Discovery Grants Program - Individual
Program name fr
Programme de subventions à la découverte - individuelles
Group en
Discovery grants programs
Group fr
Programmes de subventions à la découverte
Committee code
1507
Committee name en
Computer Science
Committee name fr
Sciences informatiques
Area of application code
1200
Area of application group en
Advancement of knowledge
Area of application group fr
Avancement des connaissances
Area of application en
Advancement of knowledge
Area of application fr
Avancement des connaissances
Research subject code
2703
Research subject group en
Information technology
Research subject group fr
Technologie de l'information
Research subject en
Complexity
Research subject fr
Complexité
Partie
2
Nb partie
5
Application title
Complexicity theory, algorithms and applications
Keyword
NSERC
Application summary
My current and future research covers a broad range of topics in Theoretical Computer Science as well as applications to Economics and Medicine. My primary area of theoretical research is complexity theory, which explores the amount of computational resources required to perform various tasks. Complexity theory complements algorithm design in mapping out the limitations of computational techniques. I have resolved several long-standing open problems in that area. I am also planning to continue my program on understanding the role computability plays in real-life physical systems by making further progress on the Computability in Dynamics program I have initiated during my PhD studies.
In conjunction with theoretical work, I am also pursuing several applied directions. For example, I am planning to continue my current work on algorithmic mechanism design. Algorithmic mechanism design studies how algorithms and other techniques from Computer Science can help us solve problems that are classically considered to lie within the realm of Economics, such as achieving better resource allocation in complex environments. I am also planning to continue my current work on applying algorithmic techniques to prediction and recommendation systems in medical settings.