Prize for Achievement in InformationBased Complexity 

2016 Prize nomination deadline: March 31, 2016 

1999 PRIZE FOR ACHIEVEMENT IN INFORMATIONBASED COMPLEXITY 

The first winner of this Prize is Professor Erich Novak, University of ErlangenNuremberg. The award, consists of $3000 and a plaque, presented at an Award ceremony during the Foundations of Computational Mathematics Conference in Oxford, England, in July, 1999. 

2000 PRIZE FOR ACHIEVEMENT IN INFORMATIONBASED COMPLEXITY 

Professor Sergei Pereverzev, from the Ukrainian Academy of Science, is the second winner of the Prize. The awards committee consisted of Erich Novak, Joseph F. Traub and Henryk Wozniakowski. The award was presented at the Workshop on Algorithms and Complexity for Continuous problems at Schloss Dagstuhl in September 2000. 

2001 PRIZE FOR ACHIEVEMENT IN INFORMATIONBASED COMPLEXITY 

The recipient is Professor G. W. Wasilkowski, University of Kentucky. The prize consists of $3000 and a plaque. The awards committee consisted of Erich Novak, University of Jena; Sergei Pereverzev, Ukrainian Academy of Sciences; Joseph F. Traub, Columbia University; and Henryk Wozniakowski, Columbia University and University of Warsaw. 

2002 PRIZE FOR ACHIEVEMENT IN INFORMATIONBASED COMPLEXITY 

The recipient is Professor S. Heinrich, University of Kaiserslautern. The prize consists of $3000 and a plaque. The awards committee consisted of Erich Novak, University of Jena, Sergei Pereverzev, Ukrainian Academy of Sciences; Greg Wasilkowski, University of Kentucky; Joseph F. Traub, Columbia University; and Henryk Wozniakowski, Columbia University and University of Warsaw. 

2003 PRIZE FOR ACHIEVEMENT IN INFORMATIONBASED COMPLEXITY 

The recipient is Professor Arthur G. Werschulz, Fordham University. The prize consists of $3000 and a plaque. The award was presented at the Conference on Modern Computational Methods in Applied Mathematics, Stefan Banach International Mathematical Center, Bedlweo, Poland, June 2004. The Prize Committee consisted of Stefan Heinrich, University of Kaiserslautern, Sergei Pereverzev, Ukranian Academy of Science, Joseph F. Traub, Columbia University, G.W. Wasilkowski, University of Kentucky and Henryk Wozniakowski, Columbia University and University of Warsaw. 

2004 PRIZE FOR ACHIEVEMENT IN INFORMATIONBASED COMPLEXITY 

The recipient is Professor Peter Mathe, Weierstrass Institute for Applied Analysis and Stochastics. The prize consists of $3000 and a plaque. The award was presented at the Workshop on Algorithms and Complexity for Continuous problems at Schloss Dagstuhl in September 2004. The Prize Committee consisted of Stefan Heinrich, University of Kaiserslautern, Joseph F. Traub, Columbia University, G.W. Wasilkowski, University of Kentucky, Arthur G. Werschulz, Fordham University and Henryk Wozniakowski, Columbia University and University of Warsaw. 

2005 PRIZE FOR ACHIEVEMENT IN INFORMATIONBASED COMPLEXITY 

The recipient is Ian Sloan, Scientia Professor at the University of New South Wales, Sydney, Australia. The prize consists of $3000 and a plaque. The award was presented at the Foundations of Computational Mathematics (FoCM) Conference in Santander, Spain, in June 2005. The Prize Committee consisted of Stefan Heinrich, Universitat Kaiserslautern, Peter Mathe, Weierstrass Institute for Applied Analysis and Stochastics, Joseph F. Traub, Columbia University; Arthur G. Werschulz, Fordham University, and Henryk Wozniakowski, Columbia University and University of Warsaw. 

2006 PRIZE FOR ACHIEVEMENT IN INFORMATIONBASED COMPLEXITY 

The recipient is Leszek Plaskota, Department of Mathematics, Informatics and Mechanics, University of Warsaw, Poland. The prize consists of $3000 and a plaque. The award will be presented at the Workshop on Algorithms and Complexity for Continuous Problems at Schloss Dagstuhl,Germany, in September 2006. The prize committee consisted of Peter Mathe, Weierstrass Institute for Applied Analysis and Stochastics, Ian Sloan, University of New South Wales, Joseph F. Traub, Columbia University; Arthur G. Werschulz, Fordham University, and Henryk Wozniakowski, Columbia University and University of Warsaw. 

2007 PRIZE FOR ACHIEVEMENT IN INFORMATIONBASED COMPLEXITY 

The recipient is Klaus Ritter, Fachbereich Mathematik, TU Darmstadt, Germany. The prize consists of $3000 and a plaque. The award will be presented at the Foundations of Computational Mathematics (FoCM) Conference in Hong Kong in June 2008. 

2008 PRIZE FOR ACHIEVEMENT IN INFORMATIONBASED COMPLEXITY 

The recipient is Anargyros Papageorgiou, Department of Computer Science, Columbia University, New York, NY, USA. The prize consists of $3000 and a plaque. The award will be presented at the Seminar on Algorithms and Complexity for Continuous Problems at Schloss Dagstuhl,Germany, in September 2009. 

2009 PRIZE FOR ACHIEVEMENT IN INFORMATIONBASED COMPLEXITY 

The recipient is Thomas MuellerGronbach, Fakultaet fuer Informatik und Mathematik, Universitaet Passau, Germany. The prize consists of $3000 and a plaque. The award will be presented at the Seminar on Algorithms and Complexity for Continuous Problems at Schloss Dagstuhl,Germany, in September 2009. 

2010 PRIZE FOR ACHIEVEMENT IN INFORMATIONBASED COMPLEXITY 

The recipient is Boleslaw Z. Kacewicz, Department of Mathematics, AGH University of Science and Technology, Cracow, Poland. The prize consists of $3000 and a plaque. The award will be presented at the MCQMC Conference in Warsaw, Poland, in August 2010. 

2011 PRIZE FOR ACHIEVEMENT IN INFORMATIONBASED COMPLEXITY 

The recipient is Aicke Hinrichs, Fakultät für Mathematik und Informatik, FSU Jena, Germany. The prize consists of $3000 and a plaque. The award will be presented at the FoCM conference in Budapest, Hungary, in July 2011. 

SPECIAL PRIZE FOR ACHIEVEMENT IN INFORMATIONBASED COMPLEXITY 

The recipient is Krzysztof Sikorski, Department of Computer Science, University of Utah. The prize was awarded for his outstanding research achievements on fixed point problems, and consists of $3000 and a plaque. The Special Prize Committe consisted of Stefan Heinrich, Erich Novak, Greg Wasilkowski, Henryk Wozniakowski, and Joseph F Traub. The award was presented in Utah, in November 2011. 

2012 PRIZE FOR ACHIEVEMENT IN INFORMATIONBASED COMPLEXITY 

The recipient is Michael Gnewuch, Department of Computer Science, ChristianAlbrechtsUniversitaet zu Kiel, Germany and School of Mathematics and Statistics, University of New South Wales, Sydney, Australia. The prize consists of $3000 and a plaque. The award will be presented at the Workshop on Algorithms and Complexity for Continuous problems at Schloss Dagstuhl in September 2012. 

2013 PRIZE FOR ACHIEVEMENT IN INFORMATIONBASED COMPLEXITY 

The recipients of the 2013 informationbased complexity prize are Josef Dick, University of New South Wales, Sydney, Australia and Friedrich Pillichshammer, Johannes Kepler University, Linz, Austria. The prize consists of $3000 and will be divided between the winners. Each winner will also receive a plaque which will be presented at the Workshop on quasiMonte Carlo methods in Linz, Austria in October, 2013. 

2014 PRIZE FOR ACHIEVEMENT IN INFORMATIONBASED COMPLEXITY 

The recipient is Frances Kuo, School of Mathematics, University of New South Wales, Sydney, AustraliaThe prize consists of $3000 and a plaque. 

2015 PRIZE FOR ACHIEVEMENT IN INFORMATIONBASED COMPLEXITY 

The recipient of the 2015 IBC Prize is Peter Kritzer, Department of Financial Mathematics, University of Linz, Austria. The prize consists of $3000 and a plaque, to be presented at the Seminar on Algorithms and Complexity for Continuous Problems, Schloss Dagstuhl, Germany, September 2015. 

2016 PRIZE FOR ACHIEVEMENT IN INFORMATIONBASED COMPLEXITY 

This annual prize is for outstanding achievement in informationbased complexity. The prize consists of $3000 and a plaque. Nominations may be sent to Joseph Traub at traub@cs.columbia.edu. However, a person does not have to be nominated to win the award. The deadline for nomination is March 31, 2016. The achievement can be based on work done in a single year, a number of years or over a lifetime. It can be published in any journal, number of journals, or monographs.
